Single round simulation on radio networks
Journal of Algorithms
Randomized algorithms
Optimal initializing algorithms for a reconfigurable mesh
Journal of Parallel and Distributed Computing
A routing protocol for packet radio networks
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Broadcast-Efficient Protocols for Mobile Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Randomized Initialization Protocols for Packet Radio Networks
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Broadcast Communications and Distributed Algorithms
IEEE Transactions on Computers
Doubly-Logarithmic Energy-Efficient Initialization Protocols for Single-Hop Radio Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Weak Communication in Radio Networks
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Energy-Efficient Deterministic Routing Protocols in Radio Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Energy-Efficient Initialization Protocols for Radio Networks with no Collision Detection
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
| Hi-index | 0.00 |
The main contribution of this work is to propose energy-efficient randomized initialization protocols for ad-hoc radio networks (ARN, for short). First, we show that if the number n of stations is known beforehand, the single-channel ARN can be initialized by a protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. We then go on to address the case where the number n of stations in the ARN is not known beforehand. We begin by discussing, an elegant protocol that provides a tight approximation of n. Interestingly, this protocol terminates, with high probability, in O((log n)2) time slots and no station has to be awake for more than O(log n) time slots. We use this protocol to design an energy-efficient initialization protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. Finally, we design an energy-efficient initialization protocol for the k-channel ARN that terminates, with high probability, in O(n/k + log n) time slots, with no station being awake for more than O(log n) time slots.