A Fair Energy Conserving Routing Algorithm for Wireless Sensor Networks

  • Lei Zhang
  • Xuehui Wang
  • Heying Zhang
  • Wenhua Dou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3295)


Energy conservation is a critical issue in wireless sensor networks. We formulate the energy conserving routing problem as a nonlinear program, whose objective is to maximize the network lifetime until the first node battery drains out. We prove the nonlinear program can be converted to an equivalent maximum multi-commodity concurrent flow problem and develop an iterative approximation algorithm based on a revised shortest path scheme. Then we discuss the feasibility, precision and computation complexity of the algorithm through theoretic analysis, some optimization methods are also provided to reduce the algorithm running time. Performance simulation and comparison show the effectiveness of the algorithm.


Sensor Node Wireless Sensor Network Network Lifetime Sink Node Fairness Index 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Garg, N., Konemann, J.: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. In: FOCS (1998)Google Scholar
  2. 2.
    Sadagopan, N., Krishnamachari, B.: Maximizing Data Extraction in Energy- Limited Sensor Networks. In: IEEE INFOCOM 2004 (2004)Google Scholar
  3. 3.
    Lindsey, S., Raghavendra, C., Sivalingam, K.: Data Gathering Algorithms in Sensor Networks Using the Energy*Delay Metric. In: Proceedings of the IPDPS Workshop on Issues in Wireless Networks and Mobile Computing (2001)Google Scholar
  4. 4.
    Kalpakis, K., Dasgupta, K., Namjoshi, P.: Efficient Algorithms for Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks. To appear in the Computer Networks Journal. Also available as UMBC CS TR-02-13 (2002)Google Scholar
  5. 5.
    Heinzelman, W., Kulik, J., Balakrishnan, H.: Adaptive Protocols for Information Dissemination in Wireless Sensor Networks. In: Proceedings of 5th ACM/IEEE Mobicom Conference, Seattle, WA (August 1999)Google Scholar
  6. 6.
    Singh, S., Woo, M., Raghavendra, C.S.: Power-Aware Routing in Mobile Ad Hoc Networks. Mobile Computing and Networking, 181–190 (1998)Google Scholar
  7. 7.
    Toh, C.: Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks. IEEE Communications Magazine (June 2001)Google Scholar
  8. 8.
    Chang, J., Tassiulas, L.: Energy Conserving Routing in Wireless Ad Hoc Networks. In: IEEE Infocom 2000, pp. 22–31 (2000)Google Scholar
  9. 9.
    Kar, K., Lakshman, T.V., Kodialam, M., Tassiulas, L.: Online Routing in Energy Constrained Ad Hoc Networks. In: IEEE Infocom 2003 (2003)Google Scholar
  10. 10.
    Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: Energy-Efficient Communication Protocol for Wireless Microsensor Networks. In: Proceedings of the Hawaii Conference on System Sciences (January 2000)Google Scholar
  11. 11.
    Lindsey, S., Raghavendra, C.S.: PEGASIS: Power Efficient GAthering in Sensor Information Systems. In: ICC 2001 (2001)Google Scholar
  12. 12.
    Bhardwaj, M., Chandrakasan, A.P.: Bounding the Lifetime of Sensor Networks Via Optimal Role Assignments. In: Infocom 2002 (2002)Google Scholar
  13. 13.
    Meng, T.H., Rodoplu, V.: Distributed network protocols for wireless communication. In: Proceedings of the 1998 IEEE International Symposium on Circuits and Systems, ISCAS 1998, Monterey, CA, June 1998, vol. 4, pp. 600–603 (1998)Google Scholar
  14. 14.
    Rodoplu, V., Meng, T.H.: Minimum energy mobile wireless networks. In: Proceedings of the 1998 IEEE International Conference on Communications, ICC 1998, Atlanta, GA, June 1998, vol. 3, pp. 1633–1639 (1998)Google Scholar
  15. 15.
    Shepard, T.: Decentralized channel management in scalable multihop spread spectrum packet radio networks, Tech. Rep. MIT/LCS/TR-670, Massachusetts Institute of Technology Laboratory for Computer Science (July 1995)Google Scholar
  16. 16.
    Zussman, G., Segall, A.: Energy Efficient Routing in Ad Hoc Disaster Recovery Networks. In: IEEE INFOCOM 2003 (2003)Google Scholar
  17. 17.
    Plotkin, S., Shmoys, D., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20, 257–301 (1995)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Lei Zhang
    • 1
  • Xuehui Wang
    • 2
  • Heying Zhang
    • 1
  • Wenhua Dou
    • 1
  1. 1.School of ComputerNational University of Defense TechnologyChangshaChina
  2. 2.School of Mechatronics Engineering and AutomationNational University of Defense TechnologyChangshaChina

Personalised recommendations