Single round simulation on radio networks
Journal of Algorithms
Optimal initializing algorithms for a reconfigurable mesh
Journal of Parallel and Distributed Computing
Broadcast-Efficient Protocols for Mobile Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-efficient randomized routing in radio networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection
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
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Immune size approximation algorithms in ad hoc radio network
EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
| Hi-index | 0.00 |
A radio network is a distributed system with no central shared resource, consisting of n stations each equipped with a radio transceiver. One of the most important parameters to evaluate protocols in the radio networks is the number of awake time slots in which each individual station sends/receives a data packet. We are interested in devising energy-efficient initialization protocols in the single-hop radio network (RN, for short) that assign unique IDs in the range [1, n] to the n stations using few awake time slots. It is known that the RN can be initialized in O(log log n) awake time slots, with high probability, if every station knows the number n of stations in the RN. Also, it has been shown that the RN can be initialized in O(log n) awake time slots even if no station knows n. However, it has been open whether the initialization can be performed in O(log log n) awake time slots when no station knows n.Our main contribution is to provide the breakthrough: we show that even if no station knows n, the RN can be initialized by our protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log log n) time slots. We then go on to design an initialization protocol for the k-channel RN that terminates, with high probability, in O(n/k+(log n)2) time slots with no station being awake for more than O(log log n) time slots.