Energy-aware broadcast trees in wireless networks

Authors:
Ioannis Papadimitriou;Leonidas Georgiadis
Affiliations:
Division of Telecommunications, Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki 541 24, Greece;Division of Telecommunications, Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki 541 24, Greece
Venue:
Mobile Networks and Applications
Year:
2004

Citing 14
Cited 3

Data networks

Data networks
Algorithms for two bottleneck optimization problems

Journal of Algorithms
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Telecommunications network design algorithms

Telecommunications network design algorithms
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues

Proceedings of the 8th annual international conference on Mobile computing and networking
Energy-efficient broadcast and multicast trees in wireless networks

Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks

Mobile Networks and Applications
Resource management in energy-limited, bandwidth-limited, transceiver-limited wireless networks for session-based multicasting

Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-Aware Wireless Networking with Directional Antennas: The Case of Session-Based Broadcasting and Multicasting

IEEE Transactions on Mobile Computing
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Arborescence optimization problems solvable by Edmonds' algorithm

Theoretical Computer Science
On Minimum-Energy Broadcasting in All-Wireless Networks

LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Design challenges for energy-constrained ad hoc wireless networks

IEEE Wireless Communications
Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks

IEEE Communications Magazine

Topology control in wireless ad hoc and sensor networks

ACM Computing Surveys (CSUR)
The investigation of delay-constrained multicasting with minimum-energy consumption in static ad hoc wireless networks

International Journal of Ad Hoc and Ubiquitous Computing
A distributed algorithm for min-max tree and max-min cut problems in communication networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

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.