A localized algorithm for minimum-energy broadcasting problem in MANET

Authors:
Chao Peng;Hong Shen
Affiliations:
Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Ishikwa, Japan;Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Ishikwa, Japan
Venue:
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Year:
2005

Citing 5
Cited 0

A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Energy Efficient Broadcasting for Situation Awareness in Ad Hoc Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Minimum energy mobile wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In Mobile Ad Hoc Networks the energy conservation problem is a very critical issue since in most cases the nodes are battery-operated. While the energy efficiency can be achieved by routing along the path that requires the lowest total energy consumption and can be solved in polynomial time for unicast communication, it was proved to be NP-complete for the construction of a Minimum-Energy Spanning Tree if the antenna is not unidirectional. Some heuristic solutions have been proposed for this problem, in this paper we present a novel distributed algorithm which effectively exploits the wireless multicast advantage. The analysis results also show that our scheme is economic for energy consumption, and efficient for time and communication complexity.