Abstract
In this paper we address the problem of broadcasting in wireless networks, so that the power consumed by any node is as small as possible. This approach is motivated by the fact that nodes in such networks often use batteries and, hence, it is important to conserve energy individually, so that they remain operational for a long time. We formulate the problem as a lexicographic node power optimization one. The problem is in general NP-complete. We provide an optimal algorithm which runs in polynomial time in certain cases. We also provide a heuristic algorithm whose performance relative to the optimal one is fairly satisfactory. We next show that these algorithms can also be used to solve the problem of broadcasting so that the residual energy of any node after the broadcast process is as large as possible. Finally, we discuss the issues of implementing the above algorithms distributively, as well as their multicast extensions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.J. Goldsmith and S. B. Wicker, Design challenges for energy-constrained ad hoc wireless networks, IEEE Wireless Commun. 9(4) (August 2002) 8–27.
A. Kershenbaum, Telecommunications Network Design Algorithms, Computer Science Series (McGraw-Hill, 1993).
D. Bertsekas and R. Gallager, Data Networks (Prentice Hall, 1992).
J. E. Wieselthier, G. D. Nguyen and A. Ephremides, Energy-efficient broadcast and multicast trees in wireless networks, Mobile Networks Appl. 7(6) (December 2002) 481–492.
F. Li and I. Nikolaidis, On minimum-energy broadcasting in all-wireless networks, in: Proc. of IEEE Local Computer Networks (2001) pp. 193–202.
A. E. F. Clementi et al., On the complexity of computing minimum energy consumption broadcast subgraphs, in: Proc. of Symp. on Theor. Aspects of Comp. Science (2001) pp. 121–131.
A. Ahluwalia, E. Modiano and L. Shu, On the complexity and distributed construction of energy-efficient broadcast trees in static ad hoc wireless networks, in: Proc. of Conf. on Inform. Sciences and Systems (2002).
M. Čagalj, J.-P. Hubaux and C. Enz, Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues, in: Proc. of ACM MOBICOM (2002).
V. Ramasubramanian, R. Chandra and D. Mossé, Providing a bidirectional abstraction for unidirectional ad hoc networks, in: Proc. of IEEE INFOCOM (2002).
J. E. Wieselthier, G. D. Nguyen and A. Ephremides, Resource management in energy-limited, bandwidth-limited, transceiver-limited wireless networks for session-based multicasting, Computer Networks 39(2) (June 2002) 113–131.
C.-K. Toh, Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks, IEEE Commun. Mag. 39(6) (June 2001) 138–147.
J.-H. Chang and L. Tassiulas, Energy conserving routing in wireless ad-hoc networks, in: Proc. of IEEE INFOCOM (2000) pp. 22–31.
A. Qayyum, L. Viennot and A. Laouiti, Multipoint relaying for flooding broadcast messages in mobile wireless networks, in: Proc. of IEEE Hawaii Intern. Conf. on System Sciences (2002).
P. Jacquet et al., Optimized link state routing protocol, IETF Internet Draft, draft-ietf-manet-olsr-07.txt (December 2002) (work in progress).
Z. J. Haas, M.R. Pearlman and P. Samar, The zone routing protocol (ZRP) for ad hoc networks, IETF Internet Draft, draft-ietf-manet-zone-zrp-04.txt (July 2002) (work in progress).
R. K. Ahuja, T. L. Magnanti and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, 1993).
P. M. Camerini, The min-max spanning tree problem and some extensions, Inform. Process. Lett. 7(1) (January 1978) 10–14.
H. N. Gabow and R.E. Tarjan, Algorithms for two bottleneck optimization problems, J. Algorithms 9 (1988) 411–417.
L. Georgiadis, Arborescence optimization problems solvable by Edmond's algorithm, J. Theor. Comp. Science 301(1–3) (May 2003) 427–437.
J. Edmonds, Optimum branchings, J. Res. Nat. Bur. Stand. 71b (1967) 233–240.
P. A. Humblet, A distributed algorithm for minimum weight directed spanning trees, IEEE Trans. Commun. 31 (1983) 756–762.
C. W. Duin and A. Volgenant, The partial sum criterion for Steiner trees in graphs and shortest paths, Europ. J. Oper. Res. 97 (February 1997) 172–182.
J. E. Wieselthier, G. D. Nguyen and A. Ephremides, Energy-aware wireless networking with directional antennas: The case of session-based broadcasting and multicasting, IEEE Trans. Mobile Computing 1(3) (July–September 2002) 176–191.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Papadimitriou, I., Georgiadis, L. Energy-Aware Broadcast Trees in Wireless Networks. Mobile Networks and Applications 9, 567–581 (2004). https://doi.org/10.1023/B:MONE.0000042496.99241.53
Issue Date:
DOI: https://doi.org/10.1023/B:MONE.0000042496.99241.53