Journal of Computer and System Sciences
Power consumption in packet radio networks
Theoretical Computer Science
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fault-tolerant broadcasting in radio networks
Journal of Algorithms
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Geometrically aware communication in random wireless networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Coverage Issue in Sensor Networks with Adjustable Ranges
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
Tighter Bounds for the Minimum Energy Broadcasting Problem
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
Improving network lifetime using sensors with adjustable sensing ranges
International Journal of Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Maximizing the number of broadcast operations in static random geometric ad-hoc networks
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Minimum energy broadcast and disk cover in grid wireless networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Managing random sensor networks by means of grid emulation
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
The Min Energy Broadcast problem consists in assigning transmission ranges to the nodes of an ad-hoc network in order to guarantee a directed spanning tree from a given source node and, at the same time, to minimize the energy consumption (i.e. the energy cost) yielded by the range assignment. Min Energy Broadcast is known to be NP-hard. We consider random-grid networks where nodes are chosen independently at random from the n points of a √n x √n square grid in the plane. The probability of the existence of a node at a given point of the grid does depend on that point, that is, the probability distribution can be non-uniform. By using information-theoretic arguments, we prove a lower bound (1 -- µ) n/À on the energy cost of any feasible solution for this problem. Then, we provide an efficient solution of energy cost not larger than 1.1204n/À. Finally, we present a fully-distributed protocol that constructs a broadcast range assignment of energy cost not larger than 8n, thus still yielding constant approximation. The energy load is well balanced and, at the same time, the work complexity (i.e. the energy due to all message transmissions of the protocol) is asymptotically optimal. The completion time of the protocol is only a O(log n) factor slower than the optimum. The approximation quality of our distributed solution is also experimentally evaluated. All bounds hold with probability at least 1 -- 1/n¸(1).