Tree Based Energy and Congestion Aware Routing Protocol for Wireless Sensor Networks
- 1
- 2
Abstract
Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc; of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.
- M. Tubaishat and S. Madria, “Sensor networks: an overview,” IEEE Potentials April/May, pp. 20–23, 2003.
- I. F. Akyildiz, W. Su, W. Sankarasubramaniam, and E. Cayirci, ”A survey on sensor networks,” IEEE Commun- ication magazine, pp. 102–114, 2002.
- H. Hassanein and L. Jing, “Reliable energy aware routing in wireless sensor networks,” Second IEEE Workshop on Dependability and Security in Sensor Networks and Systems, DSSNS’06, pp. 54–64, 24–28 April 2006.
- Q. F. Jiang and Manivannan, “Routing protocols for sensor networks,” 1st IEEE Consumer Communications and Networking Conference, pp. 93–98, 2004.
- S. G. Chen, and N. Yang, “Congestion avoidance based on lightweight buffer management in sensor networks,” IEEE Transactions on Parallel and Distributed Systems, Vol. 17, No. 9, pp. 934–946, September 2006.
- Z. Eskandari, M. H. Yaghmaee, and A. H. Mohajerzadeh, “Energy efficient spanning tree for data aggregation in wireless sensor networks,” SN’08 Workshop at ICC- CN, 2008.
- T. Niwat, T. Yoshito, and S. Kaoru, “Tree-based data dissemination in wireless ssnsor networks,” Proceed- ings of the IEICE General Conference (Institute of Electronics, Information and Communication Engineers), Vol. 2005, pp. S.41–S.42, 2005.
- K. Akkaya and M. Younis, “An energy aware QoS routing protocol for wireless sensor networks,” ICDCS Workshop’03, May 2003.
- R. Vidhyapriya and P. T. Vanathi, “Energy aware routing for wireless sensor networks,” Signal Processing, Commun- ications and Networking, ICSCN’07, International Confere- nce on 22–24 February 2007, pp. 545–550, 2007.
- Y. H. Wang, C. P. Hsu, Y. C. Lin, C. S. Kuo, and H. Y. Ho, “A routing method by reactive energy decision in wireless sensor networks,” 21st International Conference on Advanced Information Networking and Applications Workshops, AINAW’07, IEEE, 2007.
- C. Wan, S. B. Eisenman, and A. T. Campbell, “CODA: congestion detection and avoidance in sensor networks,” In Proceedings of the 1st international Conference on Embedded Networked Sensor Systems, Los Angeles,. SenSys’03. ACM Press, New York, pp. 266–279, 05–07 November, 2003.
- M. I. Khan, W. N. Gansterer, and G. Haring, “Congestion avoidance and energy efficient routing protocol for wireless sensor networks with a mobile sink,” Journal of Networks, Vol. 2, No. 6, pp. 42–49, 2007.
- R. Kumar, et al, “Mitigating performance degradation in congested sensor networks,” IEEE Transactions on Mobile Computing, Vol. 7, No. 6, pp. 682–697, 2008.