Single round simulation on radio networks
Journal of Algorithms
Journal of Computer and System Sciences
Randomized algorithms
Optimal initializing algorithms for a reconfigurable mesh
Journal of Parallel and Distributed Computing
Mobile and wireless networks
Mobile power management for wireless communication networks
Wireless Networks
Multicluster, mobile, multimedia radio network
Wireless Networks
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
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
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Randomized initialization protocols for radio networks
Handbook of wireless networks and mobile computing
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
IEEE Transactions on Parallel and Distributed Systems
A Hybrid Randomized Initialization Protcol for TDMA in Single-Hop Wireless Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Doubly-Logarithmic Energy-Efficient Initialization Protocols for Single-Hop Radio Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Wireless Sensor Network
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Optimal Initialization and Gossiping Algorithms for Random Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Quasi-optimal energy-efficient leader election algorithms in radio networks
Information and Computation
Accelerating initialization for sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Time-optimal information exchange on multiple channels
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Monitoring churn in wireless networks
Theoretical Computer Science
Hi-index | 0.00 |
A radio network ($RN$, for short) is a distributed system consisting of $n$ radio stations. We assume that the stations are small, bulk-produced, hand-held devices running on batteries and cannot be distinguished by serial or manufacturing number. Since recharging batteries may not be possible while on mission, we are interested in designing protocols that are highly energy-efficient. The initialization problem is to assign each of the $n$ stations in the RN a unique ID. The initialization problem is nontrivial since the stations are assumed to be indistinguishable. The problem is fundamental, since practically all communication protocols for $RN$s proceed under the assumption that the RN has been initialized in advance. The main contribution of this work is to propose energy-efficient randomized initialization protocols for single-hop $RN$s lacking collision detection capabilities. First, we show that if the number $n$ of stations is known beforehand, the single-channel $RN$ can be initialized by a protocol that terminates, with probability exceeding $1 - {\frac{1}{n}}$, in $O(n)$ time slots, with no station being awake for more than $O(\log \log n)$ time slots. We then go on to address the multichannel case and show that if $k$, $(k \geq 1)$, channels are available, an n-station $RN$ can be initialized, with probability exceeding $1 - {\frac{1}{n}}$, in $O({n\over k}+\log n)$ time slots, with no station being awake for more than $O(\log\log n)$ time slots.