Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks

ABSTRACT

Cooperative cell-based strategies have been recently proposed as a technique for extending the lifetime of wireless ad hoc networks, while only slightly impacting network performance. The effectiveness of this approach depends heavily on the node density: the higher it is, the more consistent energy savings can potentially be achieved. However, no general analyses of network lifetime have been done either for a base network (one without any energy conservation technique) or for one using cooperative energy conservation strategies. In this paper, we investigate the lifetime/density tradeoff under the hypothesis that nodes are distributed uniformly at random in a given region, and that the traffic is evenly distributed across the network. We also analyze the case where the node density is just sufficient to ensure that the network is connected with high probability. This analysis, which is supported by the results of extensive simulations, shows that even in this low density scenario, cell-based strategies can significantly extend network lifetime.

REFERENCES

• 1: M. Bhardwaj, T. Garnett, and A. Chandrakasan. Upper bounds on the lifetime of sensor networks. In Proc. IEEE International Conference on Communications pages 785--790, 2001.
• 2: D. Blough and P. Santi. The random point graph model for ad hoc networks and its application to the range assignment problem. Tech. Rep. IMC B4-01-05 Istituto di Matematica Computazionale, Pisa, 2001.
• 3: Timthoy X. Brown , Harold N. Gabow , Qi Zhang, Maximum flow-life curve for a wireless ad hoc network, Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, October 04-05, 2001, Long Beach, CA, USA [doi>10.1145/501431.501434]
• 4: J. Chang and L. Tassiulas. Routing for maximum system lifetime in wireless ad hoc networks. In Proc. 37th Annual Allerton Conference on Communication, Control and Computing 1999.
• 5: J. Chang and L. Tassiulas. Energy conserving routing in wireless ad hoc networks. In Proc. IEEE INFOCOM 2000 pages 22--31, 2000.
• 6: Benjie Chen , Kyle Jamieson , Hari Balakrishnan , Robert Morris, Span: An energy-efficient coordination algorithm for topology maintenance in Ad Hoc wireless networks, Proceedings of the 7th annual international conference on Mobile computing and networking, p.85-96, July 2001, Rome, Italy [doi>10.1145/381677.381686]
• 7: András Faragó , Violet R. Syrotiuk, Merit: A unified framework for routing protocol assessment in mobile AD Hoc networks, Proceedings of the 7th annual international conference on Mobile computing and networking, p.53-60, July 2001, Rome, Italy [doi>10.1145/381677.381683]
• 8: L. Feeney and M. Nilson. Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In Proc. IEEE INFOCOM 2001 pages 1548--1557, 2001.
• 9: M. Grossglauser and D. Tse. Mobility increases the capacity of ad hoc wireless networks. In Proc. IEEE INFOCOM 2001 pages 1360--1369, 2001.
• 10: P. Gupta and P. Kumar. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications Birkhauser Boston: 547--566, 1998.
• 11: P. Gupta and P. Kumar. The capacity of wireless networks. IEEE Trans. Information Theory 46(2):388--404, 2000.
• 12: Wendi Rabiner Heinzelman , Anantha Chandrakasan , Hari Balakrishnan, Energy-Efficient Communication Protocol for Wireless Microsensor Networks, Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8, p.8020, January 04-07, 2000
• 13: V. Kolchin, B. Sevast'yanov, and V. Chistyakov. Random Allocations V. H. Winston and Sons, Washington D. C. , 1978.
• 14: R. Kravets and P. Krishnan. Power management techniques for mo ile communication. In Proc. ACM Mobicom 99 pages 24--35, 1999.
• 15: E. Palmer. Graphical Evolution John Wiley and Sons, New York, 1985.
• 16: P. Panchapakesan and D. Manjunath. On the transmission range in dense ad hoc radio networks. In Proc. IEEE SPCOM 2001, 2001.
• 17: T. Philips, S. Panwar, and A. Tantawi. Connectivity properties of a packet radio network model. IEEE Trans. Information Theory 35(5):1044--1047, 1989.
• 18: P. Piret. On the connectivity of radio networks. IEEE Trans. Information Theory 37(5):1490--1492, 1991.
• 19: Paolo Santi , Douglas M. Blough, An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks, Proceedings of the 2002 International Conference on Dependable Systems and Networks, p.89-102, June 23-26, 2002
• 20: Paolo Santi , Douglas M. Blough , Feodor Vainstein, A probabilistic analysis for the range assignment problem in ad hoc networks, Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, October 04-05, 2001, Long Beach, CA, USA [doi>10.1145/501445.501446]
• 21: Suresh Singh , Mike Woo , C. S. Raghavendra, Power-aware routing in mobile ad hoc networks, Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, p.181-190, October 25-30, 1998, Dallas, Texas, United States [doi>10.1145/288235.288286]
• 22: Ya Xu , John Heidemann , Deborah Estrin, Geography-informed energy conservation for Ad Hoc routing, Proceedings of the 7th annual international conference on Mobile computing and networking, p.70-84, July 2001, Rome, Italy [doi>10.1145/381677.381685]

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design

General Terms:
Performance, Theory

Keywords:
cooperative strategies, energy conservation, network lifetime, occupancy theory, wireless ad hoc networks