ABSTRACT
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energy-constrained (e.g. battery-operated) nodes, by choosing ideal transmission power levels for the nodes relaying the connection. We distinguish between two basic operating modes: In a static assignment, the power levels of the nodes are set at the beginning and remain unchanged until the nodes are depleted of energy. In a dynamic assignment, the powers can be adjusted during operation.We show that lifetime-maximizing static power assignments can be found in polynomial time, whereas for dynamic assignments, a quantized-time version of the problem is NP-hard. We then study the approximability of the quantized dynamic case and conclude that no polynomial time approximation scheme (PTAS) exists for the problem unless Ptime = NP. Finally, by considering two approximation heuristics for the dynamic case, we show experimentally that the lifetime of a dynamically maintained multicast connection can be made several times longer than what can be achieved by the best possible static assignment.
- M. Adler and C. Scheideler, "Efficient communication strategies for ad hoc wireless networks." Theory Comput. Systems 33 (2000), 337--391.]]Google ScholarCross Ref
- G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag, Berlin, 1999.]] Google ScholarDigital Library
- D. Bienstock and A. Bley, Capacitated Network Design with Multicast Commodities. Technical Report ZIB-Report 00-14, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 2000.]]Google Scholar
- B. Bollobás, Modern Graph Theory. Springer-Verlag, New York NY, 1998.]]Google Scholar
- M. Cagalj, J.-P. Hubaux and C. Enz, "Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues." Proc. MOBICOM'02, 172--182.]] Google ScholarDigital Library
- I. Caragiannis, C. Kaklamanis and P. Kanellopoulos, "A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem." Information Processing Letters 86 (2003), 149--154.]] Google ScholarDigital Library
- J.-H. Chang and L. Tassiulas, "Energy conserving routing in wireless ad-hoc networks." Proc. INFOCOM'00, 22--31. IEEE, New York NY, 2000.]]Google Scholar
- A. E. F. Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca, "On the complexity of computing minimum energy consumption broadcast subgraphs." Proc. 18th Symp. on Theoretical Aspects of Computer Science (STACS'01), 121--131. Lecture Notes in Computer Science 2010. Springer-Verlag, Berlin, 2001.]] Google ScholarDigital Library
- A. K. Das, R. J. Marks, M. El-Sharkawi, P. Arabshahi and A. Gray, "Minimum power broadcast trees for wireless networks: integer programming formulations." Proc. INFOCOM'03. IEEE, New York NY, 2003.]]Google ScholarCross Ref
- A. Ephremides, "Energy concerns in wireless networks." IEEE Wireless Communications, August 2002, 48--59.]]Google ScholarDigital Library
- M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York NY, 1979.]] Google ScholarDigital Library
- IEEE Wireless Communications, Special issue on energy-aware ad hoc wireless networks, August 2002.]]Google Scholar
- K. Jain, M. Mahdian and M. R. Salavatipour, "Packing Steiner Trees." Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 266--274. ACM, New York NY, 2003.]] Google ScholarDigital Library
- L. M. Kirousis, E. Kranakis, D. Krizanc and A. Pelc, "Power consumption in packet radio networks." Theoretical Computer Science 243 (2000), 289--305.]] Google ScholarDigital Library
- Q. Li, J. Aslam and D. Rus, "Online power-aware routing in wireless ad-hoc networks." Proc. MOBICOM'01, 97--107. ACM, New York NY, 2001.]] Google ScholarDigital Library
- W. Liang, "Constructing minimum-energy broadcast trees in wireless ad hoc networks." Proc. MOBIHOC'02, 112--122. ACM, New York NY, 2002.]] Google ScholarDigital Library
- E. L. Lloyd, R. Liu, M. V. Marathe, R. Ramanathan and S. S. Ravi, "Algorithmic aspects of topology control problems for ad hoc networks." Proc. MOBIHOC'02, 123--134. ACM, New York NY, 2002.]] Google ScholarDigital Library
- R. J. Marks II, A. K. Das, M. El-Sharkawi, P. Arabshahi and A. Gray, "Maximizing lifetime in an energy constrained wireless sensor array using team optimization of cooperating systems." Proc. IEEE World Conference on Computational Intelligence 2002. IEEE, New York NY, 2002.]]Google Scholar
- R. J. Marks II, A. K. Das, M. El-Sharkawi, P. Arabshahi and A. Gray, "Minimum power broadcast trees for wireless networks: optimizing using the viability lemma." Proc. IEEE Int. Symp. in Circuits and Systems 2002, I:273--276. IEEE, New York NY, 2002.]]Google Scholar
- I. Papadimitriou and L. Georgiadis, "Energy-aware broadcasting in wireless networks." Proc. WiOPT'03, 267--277. INRIA Sophia-Antipolis, 2003.]]Google Scholar
- C. E. Perkins, Ad Hoc Networking. Addison-Wesley, Boston MA, 2001.]] Google ScholarDigital Library
- H. J. Prömel and A. Steger, The Steiner Tree Problem. Vieweg, Braunschweig, 2002.]]Google ScholarCross Ref
- R. Rajaraman, "Topology control and routing in ad hoc networks: A survey." ACM SIGACT News 33:2 (June 2002), 60--73.]] Google ScholarDigital Library
- R. Ramanathan and R. Rosales-Hain, "Topology control of multihop wireless networks using transmit power adjustment." Proc. INFOCOM'00, 404--413.IEEE, New York NY, 2000.]]Google ScholarCross Ref
- T. S. Rappaport, Wireless Communications: Principles & Practice. Prentice Hall, Upper Saddle River NJ, 1996.]] Google ScholarDigital Library
- V. Rodoplu and T. H. Meng, "Minimum energy mobile wireless networks." IEEE J. Selected Areas in Communications 17 (1999), 1333--1344.]]Google ScholarDigital Library
- S. Singh, M. Woo and C. S. Raghavendra, "Power-aware routing in mobile ad hoc networks." Proc. MOBICOM'98, 181--190. IEEE, New York NY, 1998.]] Google ScholarDigital Library
- P.-J. Wan, G. Calinescu, X.-Y. Li and O. Frieder, "Minimum-energy broadcasting in static ad hoc wireless networks." Wireless Networks 8 (2002), 607--617.]] Google ScholarDigital Library
- J. E. Wieselthier, G. D. Nguyen and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks." Proc. INFOCOM'00, 585--594. IEEE, New York NY, 2000.]]Google ScholarCross Ref
- J. E. Wieselthier, G. D. Nguyen and A. Ephremides, "Algorithms for energy-efficient multicasting in static ad hoc wireless networks." Mobile Networks and Applications 6 (2001), 251--263.]] Google ScholarDigital Library
Index Terms
Multicast time maximization in energy constrained wireless networks
Recommendations
Lifetime maximization for multicasting in energy-constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energy-constrained (e.g., battery-operated) nodes, by choosing ideal transmission power levels for the nodes relaying the connection. We ...
Maximising α-lifetime for wireless sensor networks
In energy constrained wireless sensor networks, it is very important to conserve energy and prolong network lifetime while ensuring proper operations of the network. In this paper, we investigate how to maximise the α-lifetime of wireless sensor networks, ...
Algorithms for balancing energy consumption in wireless sensor networks
FOWANC '08: Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computingProlonging the lifetime of network is one of the most important designing objectives in wireless sensor networks (WSNs). Keeping up the uniform energy consumption of various sensor nodes is an efficient approach to prolong the lifetime of WSNs. This ...
Comments