Adaptive initialization algorithm for ad hoc radio networks with carrier sensing

Authors:
Jacek Cichoń;Mirosław Kutyłowski;Marcin Zawada
Affiliations:
Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland;Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland;Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland
Venue:
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Year:
2006

Citing 7
Cited 1

Mellin transforms and asymptotics: finite differences and Rice's integrals

Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Randomized Initialization Protocols for Ad Hoc Networks

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
Distributed Initialization Algorithms for Single-Hop Ad Hoc Networks with Minislotted Carrier Sensing

IEEE Transactions on Parallel and Distributed Systems
Understanding the real-world performance of carrier sense

Proceedings of the 2005 ACM SIGCOMM workshop on Experimental approaches to wireless network design and analysis
Initialization for ad hoc radio networks with carrier sensing and collision detection

ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks

Analysis of the bounded-hops converge-cast distributed protocol in ad-hoc networks

ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an algorithm for coordinating access to a shared broadcast channel in an ad hoc network of unknown size n. We reduce the runtime necessary to self-organize access to the channel over the previous algorithm of Cai, Lu and Wang. The runtime of this algorithm is O(n), our work is to improve the constant factors involved. Apart from experimental evidence of algorithm quality, we provide a rigorous probabilistic analysis of its behavior.