Abstract
This paper studies the information exchange problem in single-hop multi-channel radio networks, which is to disseminate k messages stored in k arbitrary nodes to the entire network (with n nodes) with the fewest timeslots. By using \(\Theta(\sqrt n)\) channels, the previous best result [9] showed that this problem can be solved in Θ(k) time slots with high probability even if k is unknown and no bounds on k are given. Under the same assumptions but by using Θ(n) channels, this paper presents a novel randomized distributed algorithm called Detect-and-Drop that can solve the information exchange problem in O(logkloglogk) time slots with high probability. Thus by allowing using more channels, our proposed algorithm contributes an exponential improvement in running time compared to that in [9]. The simulation results corroborate the analysis result.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization. J. Comput. Syst. Sci. 45(1), 104–126 (1992)
Chlebus, B.S., Kowalski, D.R., Radzik, T.: Many-to-Many Communication in Radio Networks. Algorithmica 54(1), 118–139 (2009)
Dolev, S., Gilbert, S., Khabbazian, M., Newport, C.: Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 252–267. Springer, Heidelberg (2011)
Anta, A.F., Mosteiro, M.A.: Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 378–388. Springer, Heidelberg (2010)
Fernández Anta, A., Mosteiro, M.A., Ramón Muñoz, J.: Unbounded Contention Resolution in Multiple-Access Channels. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 225–236. Springer, Heidelberg (2011)
Gilbert, S., Kowalski, D.R.: Trusted Computing for Fault-Prone Wireless Networks. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 359–373. Springer, Heidelberg (2010)
Goldberg, L.A.: Design and analysis of contention-resolution protocols, EPSRC Research Grant GR/L60982, http://www.csc.liv.ac.uk/~leslie/contention.html (last modified October 2006)
Haeupler, B., Karger, D.R.: Faster information dissemination in dynamic networks via network coding. In: PODC, pp. 381–390 (2011)
Holzer, S., Pignolet, Y.A., Smula, J., Wattenhofer, R.: Time-optimal information exchange on multiple channels. In: FOMC, pp. 69–76 (2011)
Jurdziński, T., Stachowiak, G.: Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 535–549. Springer, Heidelberg (2002)
Khabbazian, M., Kowalski, D.R.: Time-efficient randomized multiple-message broadcast in radio networks. In: PODC, pp. 373–380 (2011)
Khabbazian, M., Kuhn, F., Kowalski, D.R., Lynch, N.A.: Decomposing broadcast algorithms using abstract MAC layers. In: DIALM-PODC, pp. 13–22 (2010)
Kodialam, M.S., Nandagopal, T.: Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. In: MOBICOM, pp. 73–87 (2005)
Kowalski, D.R.: On selection problem in radio networks. In: PODC, pp. 158–166 (2005)
Martel, C.U.: Maximum Finding on a Multiple Access Broadcast Network. Inf. Process. Lett. 52(1), 7–15 (1994)
Schneider, J., Wattenhofer, R.: What Is the Use of Collision Detection (in Wireless Networks)? In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 133–147. Springer, Heidelberg (2010)
Willard, D.E.: Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel. SIAM J. Comput. 15(2), 468–477 (1986)
Yu, D., Hua, Q.-S., Dai, W., Wang, Y., Lau, F.C.M.: Dynamic Contention Resolution in Multiple-Access Channels. In: Koucheryavy, Y., Mamatas, L., Matta, I., Tsaoussidis, V. (eds.) WWIC 2012. LNCS, vol. 7277, pp. 232–243. Springer, Heidelberg (2012)
Yu, D., Wang, Y., Hua, Q.-S., Lau, F.C.M.: Distributed local broadcasting algorithms in the physical interference model. In: DCOSS, pp. 1–8 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shi, W., Hua, QS., Yu, D., Wang, Y., Lau, F.C.M. (2012). Efficient Information Exchange in Single-Hop Multi-Channel Radio Networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2012. Lecture Notes in Computer Science, vol 7405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31869-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-31869-6_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31868-9
Online ISBN: 978-3-642-31869-6
eBook Packages: Computer ScienceComputer Science (R0)