Abstract
We study the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed based on full knowledge about the size and the topology of the network. We show that gossiping can be completed in \(O(D+\frac{\Delta\log n}{\log{\Delta}-\log{\log n}})\) time units in any radio network of size n, diameter D and maximum degree Δ= Ω(logn). This is an almost optimal schedule in the sense that there exists a radio network topology, such as: a Δ-regular tree in which the radio gossiping cannot be completed in less than \(\Omega(D+\frac{\Delta\log n}{\log{\Delta}})\) units of time. Moreover, we show a \(D+O(\frac{\log^3 n}{\log{\log n}})\) schedule for the broadcast task. Both our transmission schemes significantly improve upon the currently best known schedules in Gąsieniec, Peleg and Xin [PODC’05], i.e., a O(D+Δlogn) time schedule for gossiping and a D+O(log3 n) time schedule for broadcast. Our broadcasting schedule also improves, for large D, a very recent O(D+log2 n) time broadcasting schedule by Kowalski and Pelc.
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
Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Computer and System Sciences 43, 290–298 (1991)
Chlamtac, I., Kutten, S.: On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. on Communications 33, 1240–1246 (1985)
Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. on Communications 39, 426–433 (1991)
Diks, K., Kranakis, E., Krizanc, D., Pelc, A.: The impact of information on broadcasting time in linear radio networks. Theoretical Computer Science 287, 449–471 (2002)
Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In: Proc. 16th ACM-SIAM Symp. on Discrete Algorithms, pp. 222–231 (2005)
Gaber, I., Mansour, Y.: Broadcast in radio networks. In: Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, pp. 577–585 (1995)
Gąsieniec, L., Kranakis, E., Pelc, A., Xin, Q.: Deterministic M2M multicast in radio networks. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 670–682. Springer, Heidelberg (2004)
Gąsieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: Proc. 2nd IFIP Int. Conference on Theoretical Computer Science, pp. 193–205 (2002)
Gąsieniec, L., Potapov, I., Xin, Q.: Efficient gossiping in known radio networks. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 173–184. Springer, Heidelberg (2004)
Gąsieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. 24th Annual ACM SIGACT-SIGOPS PODC, pp. 129–137 (2005)
Gąsieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in ad-hoc radio networks. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 397–407. Springer, Heidelberg (2004)
Kowalski, D., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Computing (to appear, 2006)
Manne, F., Wang, S., Xin, Q.: Faster radio broadcast in planar graphs (manuscript, 2006)
Manne, F., Xin, Q.: Optimal gossiping with unit size messages in known radio networks. In: Proc. 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (to appear)
Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. In: Proc. 15th Joint Conf. of IEEE Computer and Communication Societies, pp. 1116–1124 (1996)
Strahler, A.N.: Hypsometric (area-altitude) analysis of erosional topology. Bull. Geol. Soc. Amer. 63, 117–1142 (1952)
Viennot, X.G.: A Strahler bijection between Dyck paths and planar trees. Discrete Mathematics 246, 317–329 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cicalese, F., Manne, F., Xin, Q. (2006). Faster Centralized Communication in Radio Networks. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_35
Download citation
DOI: https://doi.org/10.1007/11940128_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49694-6
Online ISBN: 978-3-540-49696-0
eBook Packages: Computer ScienceComputer Science (R0)