On the construction of energy-efficient maximum residual battery capacity broadcast trees in static ad hoc wireless networks

Authors:
Chor Ping Low;Lai Woen Goh
Affiliations:
Blk S2, School of Electrical and Electronic Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore;Blk S2, School of Electrical and Electronic Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore
Venue:
Computer Communications
Year:
2005

Citing 7
Cited 3

Algorithms for energy-efficient multicasting in static ad hoc wireless networks

Mobile Networks and Applications
Constructing minimum-energy broadcast trees in wireless ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues

Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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-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

An analysis of the lifetime of OLSR networks

Ad Hoc Networks
Maximum-residual multicasting and aggregating in wireless ad hoc networks

Wireless Networks
Energy efficient networking via dynamic relay node selection in wireless networks

Ad Hoc Networks

Quantified Score

Hi-index	0.24

Visualization

Abstract

This work considers the problem of broadcast routing in a wireless ad hoc network from the viewpoint of energy efficiency. Each node in a wireless ad hoc network runs on a local energy source which has a limited energy life span. Thus, energy conservation is a critical issue in such networks. In this paper, we address the problem of finding a broadcast tree for a given network that maximizes the minimum residual battery capacity available among all nodes in the network. We call this problem the Maximum Residual Battery Capacity Broadcast Routing Problem (RBBP). We propose a new algorithm for RBBP and prove that RBBP is optimally solvable in polynomial time using the proposed algorithm. In addition, we show that the problem of finding a maximum residual battery capacity broadcast tree with minimum total energy consumption is NP-complete and we propose a new heuristic algorithm for this problem.