Introduction to algorithms
Power consumption in packet radio networks
Theoretical Computer Science
Online power-aware routing in wireless Ad-hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Constructing minimum energy mobile wireless networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
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
Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics
IEEE Transactions on Mobile Computing
Optimal topology control for balanced energy consumption in wireless networks
Journal of Parallel and Distributed Computing
Energy-aware topology control for wireless sensor networks using memetic algorithms
Computer Communications
Power conservation for strongly connected topology control in wireless sensor network
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Energy-optimal distributed algorithms for minimum spanning trees
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Adjustable convergecast tree protocol for wireless sensor networks
Computer Communications
Minimum energy strong bidirectional topology for ad hoc wireless sensor networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
An incremental power greedy heuristic for strong minimum energy topology in wireless sensor networks
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
A routing protocol for throughput enhancement and energy saving in mobile ad hoc networks
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
A Novel Robust Routing Scheme Against Rushing Attacks in Wireless Ad Hoc Networks
Wireless Personal Communications: An International Journal
Hi-index | 14.98 |
In ad hoc wireless networks, to compute the transmission power of each wireless node such that the resulting network is connected and the total energy consumption is minimized is defined as a Minimum Energy Network Connectivity (MENC) problem, which is an NP-complete problem. In this paper, we consider the approximated solutions for the MENC problem in ad hoc wireless networks. We present a theorem that reveals the relation between the energy consumption of an optimal solution and that of a spanning tree and propose an optimization algorithm that can improve the result of any spanning tree-based topology. Two polynomial time approximation heuristics are provided in the paper that can be used to compute the power assignment of wireless nodes in both static and low mobility ad hoc wireless networks. The two heuristics are implemented and the numerical results verify the theoretical analysis.