Randomized initialization protocols for packet radio networks
- 20 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 544-548
- https://doi.org/10.1109/ipps.1999.760530
Abstract
The main contribution of this work is to propose efficient randomized leader election and initialization protocols for Packet Radio Networks (PRN, for short). As a result of the initialization protocol, the n stations of a PRN are assigned distinct integer IDs from1 to n. The results include protocols to: (1) initialize the single-channel PRN with the collision detection (CD) capability in O(n) rounds with probability at least 1 - 1/2n ; (2) initialize the k-channel PRN with CD capability in O( n/k ) rounds with probability at least 1 - 1/n , whenever k = n/3 log n ; (3) elect a leader on the single-channel PRN with no CD in O((log n)2 ) broadcast rounds with probability at least 1 -1/n ; (4) initialize the single-channel PRN with no CD in O(n) rounds with probability at least 1 - 1/2vn ; (5) initialize the k-channel PRN with no CD in O( n/k ) broadcast rounds with probability at least 1 - 1/n , whenever k = n/4(log n)2.Keywords
This publication has 5 references indexed in Scilit:
- Randomized AlgorithmsPublished by Cambridge University Press (CUP) ,1995
- Optimal Initializing Algorithms for a Reconfigurable MeshJournal of Parallel and Distributed Computing, 1995
- Tree-Based Broadcasting in Multihop Radio NetworksIEEE Transactions on Computers, 1987
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access ChannelSIAM Journal on Computing, 1986
- Broadcast Communications and Distributed AlgorithmsIEEE Transactions on Computers, 1986