Broadcast-Efficient Protocols for Mobile Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Clustering algorithms for wireless ad hoc 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 radio networks
Handbook of wireless networks and mobile computing
Efficient algorithms for leader election in radio networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Doubly-Logarithmic Energy-Efficient Initialization Protocols for Single-Hop Radio Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Randomized Leader Election Protocols in Radio Networks with No Collision Detection
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
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 Initialization Protocols for Radio Networks with no Collision Detection
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms
IEEE Transactions on Computers
The Journal of Supercomputing
Journal of Parallel and Distributed Computing
TARP: A traffic-aware restructuring protocol for Bluetooth radio networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Leader Election Algorithms for Multi-channel Wireless Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Towards Fair Leader Election in Wireless Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Repelling Sybil-type attacks in wireless ad hoc systems
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
A fault-tolerant permutation routing algorithm in mobile ad-hoc networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Sentries and sleepers in sensor networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Randomized leader election protocols in noisy radio networks with a single transceiver
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Lower bounds for clear transmissions in radio networks
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Countermeasures against sybil attacks in WSN based on proofs-of-work
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
| Hi-index | 0.00 |
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.