Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
Wireless information networks
Power consumption in packet radio networks
Theoretical Computer Science
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
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks
Mobile Networks and Applications
The effects of synchronization on topology-transparent scheduling
Wireless Networks
Improving network lifetime using sensors with adjustable sensing ranges
International Journal of Sensor Networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The “real” approximation factor of the MST heuristic for the minimum energy broadcasting
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Hi-index | 0.01 |
We consider static ad-hoc wireless networks where nodes have the same initial battery charge and they may dynamically change their transmission range at every time slot. When a node v transmits with range r(v), its battery charge is decreased by β × r(v)2 where β 0 is a fixed constant. The goal is to provide a range assignment schedule that maximizes the number of broadcast operations from a given source (this number is denoted as the length of the schedule). This maximization problem, denoted as MAX LIFETIME, is known to be NP-hard and the best algorithm yields worst-case approximation ratio Θ(log n), where n is the number of nodes of the network [5]. We consider random geometric instances formed by selecting n points independently and uniformly at random from a square of side length √n in the Euclidean plane. We first present an efficient algorithm that constructs a range assignment schedule having length, with high probability, not smaller than 1/12 of the optimum. We then design an efficient distributed version of the above algorithm where nodes initially know n and their own position only. The resulting schedule guarantees the same approximation ratio achieved by the centralized version thus obtaining the first distributed algorithm having provably-good performance for this problem.