Introduction to algorithms
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Wireless integrated network sensors
Communications of the ACM
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Online power-aware routing in wireless Ad-hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
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
Optimizing Sensor Networks in the Energy-Latency-Density Design Space
IEEE Transactions on Mobile Computing
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Theoretical Computer Science
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Toward self-organized mobile ad hoc networks: the terminodes project
IEEE Communications Magazine
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Minimizing energy consumption in communication is a crucial problem in wireless ad hoc networks, as in most cases the nodes are powered by battery only. The minimum-energy broadcast problem is studied in this paper, for which it is well known that the broadcast nature of the radio transmission can be exploited to optimize energy consumption. This problem has been studied in a lot of literature on different models. In this paper a symmetric network is considered. First we propose an approximation algorithm, which takes O(mnα(mn)) a time, where m is the number of links, n is the number of nodes and α is the inverse of Ackerman's function. The algorithm delivers a broadcast tree with energy consumption being at most 2Hn-1 times of the optimal solution, where Hn-1 is the (n-1)st harmonic number. Since it has been proved that the minimum energy broadcast problem in general graph case (including symmetric case) cannot be approximated within a sub-logarithmic factor (unless P=NP), so the algorithm is almost optimal. For a special case where each node is equipped with the same type of battery it improves the known O(log3 n)-approximation algorithm. Moreover for some asymmetric but nearly symmetric network, the algorithm can also be applied with O(ln n) performance guarantee. Finally a special case is studied, where the degree of network is bounded by a constant Δ and the ratio of the maximum transmission energy to the minimum transmission energy is bounded by another constant C. For the case we devise a 2(C+HΔ-1) -approximation algorithm.