Share This Article:

BEAR: A Balanced Energy-Aware Routing Protocol for Wireless Sensor Networks

Abstract Full-Text HTML Download Download as PDF (Size:284KB) PP. 793-800
DOI: 10.4236/wsn.2010.210095    6,739 Downloads   11,802 Views   Citations

ABSTRACT

Energy aware routing protocols can be classified into energy saver and energy manager. Energy saver protocols decrease energy consumption totally. Most of them try to find the shortest path between source and destination to reduce energy consumption. But energy manager protocols balance energy consumption in network to avoid network partitioning. Finding best route only based on energy balancing consideration may lead to long path with high delay and decreases network lifetime. On the other hand, finding best route only with the shortest distance consideration may lead to network partitioning. This paper improves SEER [1] routing protocol. Traditional SEER is only energy saver and has poor idea about energy balancing. Our proposed protocol, named BEAR, considers energy balancing and optimal distance both. It finds a fair tradeoff between energy balancing and optimal distance by learning automata concept. We simulate and evaluate routing protocols by Glomosim [2] simulator.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

E. Ahvar and M. Fathy, "BEAR: A Balanced Energy-Aware Routing Protocol for Wireless Sensor Networks," Wireless Sensor Network, Vol. 2 No. 10, 2010, pp. 793-800. doi: 10.4236/wsn.2010.210095.

References

[1] G. P. Hancke and C. J. Leuschner, “SEER: A Simple Energy Efficient Routing Protocol for Wireless Sensor Net- works,” South African Computer Journal, Vol. 39, 2007, pp. 17-24.
[2] X. Zeng, R. Bagrodia and M. Geria, “Glomosim: A Library for Parallel Simulation of Large Scale Wireless Net- works,” Proceedings of the 12th Workshop on Parallel and Distributed Simulations, Banff, 1998, pp. 154-161.
[3] M. Youssef, M. Younis and K. Arisha, “A Constrained Shortest-Path Energy-Aware Routing Algorithm for Wire- less Sensor Networks,” Proceedings of IEEE Wireless Communications and Networking Conference, Orlando, Vol. 2, 2002, pp. 794-799.
[4] D. Braginsky and D. Estrin, “Rumor Routing Algorithm for Sensor Networks,” Proceeding of 1st ACM Workshop on Sensor Networks and Applications, Atlanta, 2002, pp. 22- 31.
[5] T. Banka, G. Tandon and A. P. Jayasumana, “Zonal Rumor Routing for Wireless Sensor Networks,” Proceedings of IEEE Conference on Information Technology: Coding and Computing, Las Vegas, Vol. 2, 2005, pp. 562-567.
[6] T. Hou, Y. Shi and J. Pan, “A Lifetime-Aware Single- Session Flow Routing Algorithm for Energy-Constrained Wireless Sensor Networks,” Proceedings of IEEE Military Communications Conference, Boston, Vol. 1, 2003, pp. 603-608.
[7] F. Block and C. Baum, “An Energy-Efficient Routing Pro- tocol for Wireless Sensor Networks with Battery Level Un- certainty,” Proceedings of IEEE Military Communications Conference, Anaheim, Vol. 1, 2002, pp. 489-494.
[8] A. Manjeshwar and D. P. Agrawal, “APTEEN: A Hybrid Protocol for Efficient Routing and Comprehensive Information Retrieval in Wireless Sensor Networks,” Proceedings of the 16th International Parallel and Distributed Processing Symposium, Fort Lauderdale, 2002, pp. 195-202.
[9] R. Manohar and A. Scaglione, “Power Optimal Routing in Wireless Networks,” Proceedings of IEEE International Conference on Communications, Seattle, Vol. 4, 2003, pp. 2979-2984.
[10] Z. W. Zheng, Z. H. Wu and H. Z. Lin, “Clustering Routing Algorithm Using Game-Theoretic Techniques for WSNs,” Proceedings of the International Symposium on Circuits and Systems, Vancouver, Vol. 4, 2004, pp. IV-904-7.
[11] D. Petrovic, R. C. Shah, K. Ramchandran and J. Rabaey, “Data Funneling: Routing with Aggregation and Compression for Wireless Sensor Networks,” Proceedings of the 1st IEEE International Workshop on Sensor Network Protocols and Applications, Anchorage, 2003, pp. 156-162.
[12] C. Intanagonwiwat, R. Govindan and D. Estrin, “Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks,” Mobile Networks and Applications, Vol. 1, No. 4, 2000, pp. 56-67.
[13] C. Chen, “Energy Efficient Routing for Clustered Wireless Sensors Network,” Proceedings of the 29th Annual Conference of the IEEE Industrial Electronics Society, Roanoke, Vol. 2, 2003, pp. 1437-1440.
[14] C. Schurgers and M. Srivastava, “Energy Efficient Routing in Wireless Sensor Networks,” Proceedings of IEEE Military Communications Conference, Washington, Vol. 1, 2001, pp. 357-361.
[15] M. Senouci and G. Pujolle, “Energy Efficient Routing in Wireless Ad Hoc Networks,” Proceedings of IEEE International Conference on Communications, Orlando, Vol. 7, 2004, pp. 4057-4061.
[16] D. Tian and N. Georganas, “Energy Efficient Routing with Guaranteed Delivery in Wireless Sensor Networks,” Proceedings of IEEE Wireless Communications and Networking Conference, New Orleans, Vol. 3, 2003, pp. 1923- 1929.
[17] J. Zhang and H. Shi, “Energy-Efficient Routing for 2D Grid Wireless Sensor Networks,” Proceedings of the International Conference on Information Technology: Research and Education, Newark, 2003, pp. 311-315.
[18] A. Datta, “Fault-Tolerant and Energy-Efficient Permutation Routing Protocol for Wireless Networks,” Proceedings of the International Parallel and Distributed Processing Symposium, Nice, 2003, pp. 22-26.
[19] M. gholipour and M. R. Meybodi, “LA-Mobicast: A Learn- ing Automata Based Distributed Protocol for Mobicast in Sensor Networks,” Proceeding of 12th Annual International CSI Computer Conference, Tehran, 2007, pp. 1154- 1161.
[20] S. M. Abolhasani, M. R. Meybodi and M. Esnaashari, “LA- BER: A Learning Automata Based Energy-Aware Routing Protocol for Sensor Networks,” Proceedings of the 3rd Information and Knowledge Technology, Ferdowsi University of Mashad, Mashad, 2007.
[21] Y. B. Ko and N. H. Vaidya, “Location-Aided Routing (LAR) in Mobile Ad Hoc Networks,” Proceedings of the IEEE International Conference on Mobile Computing and Networking, Dallas, 1998, pp. 66-75.
[22] J. Broch, D. Johnson and D. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,” IETF Internet Draft, 1999, work in progress. http://www.ietf.org/ internet-drafts/draft-ietfmanet-dsr-03.txt
[23] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, Kluwer Academic Publishers, Vol. 353, 1996, pp. 153-181.
[24] C. E. Perkins and E. M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proceeding of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, 1999, pp. 90-100.
[25] T. He, J. Stankovic, C. Lu and T. Abdelzaher, “A Spatiotemporal Communication Protocol for Wireless Sensor Networks,” IEEE Transactions on Parallel and Distributed Systems, Vol. 16, No. 10, 2005, pp. 995-1006.
[26] Z. J. Haas and M. R. Pearlman, “The Zone Routing Pro- tocol (ZRP) for Ad Hoc Networks,” IETF, MANET Inter- net Draft, 1998.
[27] K. S. Narendra and M. A. L. Thathachar, “Learning Auto- mata: An Introduction,” Prentice Hall, 1989.

  
comments powered by Disqus

Copyright © 2019 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.