Stephan Holzer
ABSTRACT
This paper presents an efficient algorithm for detecting and disseminating information in a single-hop multi-channel network: k arbitrary nodes have information they want to share with the entire network. Neither the nodes that have information nor the number k of these nodes are known initially. This communication primitive lies between the two other fundamental primitives regarding information dissemination, broadcasting (one-to-all communication) and gossiping (total information exchange). The time complexity of the information exchange algorithm we present in this paper is linear in the number of information items and thus asymptotically optimal with respect to time. The algorithm does not require collision detection and thanks to using several channels the lower bound of Ω(k+log n) established for single-channel communication can be broken.
- Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, and Dariusz R. Kowalski. Dynamic Sharing of a Multiple Access Channel. In 27th Int. Symposium on Theoretical Aspects of Computer Science (STACS), pages 83--940, 2010.Google Scholar
- I. Caragiannis, C. Galdi, and C. Kaklamanis. Basic computations in wireless networks. In ISAAC 05, volume 3827, page 533--542, 2005. Google ScholarDigital Library
- B. Chlebus and L. Gasieniec. On the Wake-Up Problem in Radio Networks. In Automata, languages and programming: 32nd international colloquium, ICALP, page 347, 2005. Google ScholarDigital Library
- B. Chlebus, D. Kowalski, and T. Radzik. Many-to-Many Communication in Radio Networks. In Algorithmica, volume 54:1, pages 118--139, 2009. Google ScholarDigital Library
- B. Chlebus, D. Kowalski, and M. Rokicki. Average-time complexity of gossiping in radio networks. In Structural Information and Communication Complexity, pages 253--267, 2006. Google ScholarDigital Library
- A. Clementi, A. Monti, and R. Silvestri. Distributed broadcast in radio networks of unknown topology. In Theoretical Computer Science, 302(1--3):337--364, 2003. Google ScholarDigital Library
- J. Czyzowicz, L. Gasieniec, D. R. Kowalski, and A. Pelc. Consensus and mutual exclusion in a multiple access channel. In Distributed Computing, pages 512--526, 2009. Google ScholarDigital Library
- L. Gasieniec, A. Pelc, and D. Peleg. The wakeup problem in synchronous broadcast systems (extended abstract). In Proceedings of the ACM symposium on Principles of distributed computing (PODC), pages 113--121, 2000. Google ScholarDigital Library
- S. Gilbert and D. Kowalski. Trusted Computing for Fault-Prone Wireless Networks. In Distributed Computing, pages 359--373, 2010. Google ScholarDigital Library
- S. Holzer, Y. Pignolet, J. Smula, and R. Wattenhofer. Monitoring Churn in Wireless Networks. In Algorithms for Sensor Systems, pages 118--133, 2010. Google ScholarDigital Library
- T. Jurdzinski, M. Kutylowski, and J. Zatopianski. Energy-efficient size approximation of radio networks with no collision detection. In 8th Annual International Conference on Computing and Combinatorics (COCOON), pages 279--289, 2002. Google ScholarDigital Library
- J. Kabarowski, M. Kutylowski, and W. Rutkowski. Adversary immune size approximation of single-hop radio networks. In Theory and Applications of Models of Computation (TAMC), 3959:148--158, 2006. Google ScholarDigital Library
- M. Kik. Merging and Merge-Sort in a Single Hop Radio Network. In Theory and Practice of Computer Science (SOFSEM), pages 341--349, 2006. Google ScholarDigital Library
- M. Klonowski, M. Kutylowski, and J. Zatopianski. Energy Efficient Alert in Single-Hop Networks of Extremely Weak Devices. In Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS), pages 139--150, 2009. Google ScholarDigital Library
- J. Komlos and A. Greenberg. An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. In Information Theory, IEEE Transactions on, 31(2):302--306, 1985.Google ScholarDigital Library
- D. Kowalski. On selection problem in radio networks. In Proceedings of the ACM symposium on Principles of distributed computing (PODC), pages 158--166, 2005. Google ScholarDigital Library
- D. Kowalski and A. Pelc. Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. In International Conference on Automata, Languages and Programming (ICALP), page 521--533, 2009. Google ScholarDigital Library
- E. Kushilevitz and Y. Mansour. An Ω(D log(N/D)) Lower Bound for Broadcast in Radio Networks. In SIAM Journal on Computing, 27:702, 1998. Google ScholarDigital Library
- M. Kutyłowski and D. Letkiewicz. Computing Average Value in Ad Hoc Networks. In Mathematical Foundations of Computer Science (MFCS), 2747:511--520, 2003.Google Scholar
- M. Kutyłowski and W. Rutkowski. Adversary Immune Leader Election in Ad Hoc Radio Networks? In European Symposium on Algorithms (ESA), pages 397--408, 2003.Google ScholarCross Ref
- C. Lavault, J. Marckert, and V. Ravelomanana. Quasi-optimal energy-efficient leader election algorithms in radio networks. In Information and Computation, 205(5):679--693, 2007. Google ScholarDigital Library
- K. Nakano and S. Olariu. Energy-efficient initialization protocols for radio networks with no collision detection. In IEEE Transactions on Parallel and Distributed Systems, 11(851--863):4, 2000. Google ScholarDigital Library
- M. Singh and V. K. Prasanna. Energy-optimal and energy-balanced sorting in a single-hop wireless sensor network. In IEEE International Conference on Pervasive Computing and Communications (PERCOM), pages 50--59, 2003. Google ScholarDigital Library
Index Terms
- Time-optimal information exchange on multiple channels
Recommendations
Deterministic multi-channel information exchange
SPAA '12: Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architecturesIn this paper, we study the information exchange problem on a set of multiple access channels: k arbitrary nodes have information they want to distribute to the entire network via a shared medium partitioned into channels. We present algorithms and ...
Information dissemination on multiple channels
PODC '11: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computingThis article presents an algorithm for detecting and disseminating information in a single-hop multi-channel wireless network: k arbitrary nodes have information they want to share with the entire network. Neither the nodes that have information nor the ...
Goodput and throughput comparison of single-hop and multi-hop routing for IEEE 802.11 DCF-based wireless networks under hidden terminal existence
We investigate how multi-hop routing affects the goodput and throughput performances of IEEE 802.11 distributed coordination function-based wireless networks compared with direct transmission single hopping, when medium access control dynamics such as ...
Comments