Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Efficient solutions to multicast routing in communication networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
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
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Mobile Networks and Applications
Approximation algorithms
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
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
Introduction to Algorithms
Multicast scheduling algorithms in mobile networks
Cluster Computing
Optimizing Sensor Networks in the Energy-Latency-Density Design Space
IEEE Transactions on Mobile Computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
On Minimum-Energy Broadcasting in All-Wireless Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
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
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
Journal of Parallel and Distributed Computing
Information Processing Letters
International Journal of Ad Hoc and Ubiquitous Computing
Minimum-energy all-to-all multicasting in wireless ad hoc networks
IEEE Transactions on Wireless Communications
Secure clustering and symmetric key establishment in heterogeneous wireless sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
Enhancing the broadcast process in mobile ad hoc networks using community knowledge
Proceedings of the first ACM international symposium on Design and analysis of intelligent vehicular networks and applications
A fast local search method for minimum energy broadcast in wireless ad hoc networks
Operations Research Letters
On the improvement of the enhanced distance-based broadcasting algorithm
International Journal of Communication Networks and Distributed Systems
Hi-index | 0.00 |
In all-wireless networks, minimizing energy consumption is crucial as in most cases the nodes are battery-operated. We focus on the problem of power-optimal broadcast, for which it is well known that the broadcast nature of radio transmissions can be exploited to optimize energy consumption. This problem appears to be difficult to solve [30]. We provide a formal proof of NP-completeness for the general case and give an NP-completeness result for the geometric case; in the former, the network topology is represented by a generic graph with arbitrary weights, whereas in the latter a Euclidean distance is considered. For the general case, we show that it cannot be approximated better than O(log N), where N is the total number of nodes. We then describe an approximation algorithm that achieves the O(log N) approximation ratio. We also describe a new heuristic, Embedded Wireless Multicast Advantage. We show that it compares well with other proposals and we explain how it can be distributed.