Reliable broadcasting without collision detection

Authors:
Jarosław Kutyłowski;Filip Zagórski
Affiliations:
International Graduate School of Dynamic Intelligent Systems, University of Paderborn;Institute of Mathematics and Computer Science, Wrocław University of Technology
Venue:
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Year:
2006

Citing 6
Cited 2

A survey of routing techniques for mobile communications networks

Mobile Networks and Applications - Special issue: routing in mobile communications networks
Leader election algorithms for mobile ad hoc networks

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Comparison of broadcasting techniques for mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Efficient algorithms for leader election in radio networks

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A survey, classification and comparative analysis of medium access control protocols for ad hoc networks

IEEE Communications Surveys & Tutorials

Adversary immune size approximation of single-hop radio networks

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Immune size approximation algorithms in ad hoc radio network

EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a dynamic, ad-hoc communication network consisting of mobile units that can warn about traffic jams on motorways. Our goal is to provide a practical, low cost solution. Therefore we consider very simple wireless communication hardware, without collision detection, with very small bandwidth and a probabilistic model of link failure. We provide a complete system architecture. For this purpose we design and analyze solutions for size approximation, leader election and broadcasting. Our algorithms are fine-tuned for fast operation in a practical setting. We provide both a theoretical and experimental evaluation of our solutions. Our contribution is much different from the previous work, where either pure theoretical models with a pure theoretical analysis are provided or algorithms working in practical models are evaluated only through simulations.