Algorithmica

, Volume 54, Issue 2, pp 226–242 | Cite as

Faster Deterministic Communication in Radio Networks

Article
First Online:
Received:
Accepted:

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{\varDelta\log n}{\log{\varDelta}-\log{\log n}})\) time units in any radio network of size n, diameter D, and maximum degree Δ=Ω(log n). This is an almost optimal schedule in the sense that there exists a radio network topology, specifically a Δ-regular tree, in which the radio gossiping cannot be completed in less than \(\varOmega(D+\frac{\varDelta\log n}{\log{\varDelta}})\) 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 by Gąsieniec, Peleg, and Xin (Proceedings of the 24th Annual ACM SIGACT-SIGOPS PODC, pp. 129–137, 2005), i.e., a O(D+Δlog n) time schedule for gossiping and a D+O(log 3 n) time schedule for broadcast. Our broadcasting schedule also improves, for large D, a very recent O(D+log 2 n) time broadcasting schedule by Kowalski and Pelc.

Keywords

Centralized radio networks Broadcasting Gossiping 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 290–298 (1991) MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Chlamtac, I., Kutten, S.: On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. Commun. 33, 1240–1246 (1985) MATHCrossRefGoogle Scholar
  3. 3.
    Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Commun. 39, 426–433 (1991) CrossRefGoogle Scholar
  4. 4.
    Diks, K., Kranakis, E., Krizanc, D., Pelc, A.: The impact of information on broadcasting time in linear radio networks. Theor. Comput. Sci. 287, 449–471 (2002) MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 222–231 (2005) Google Scholar
  6. 6.
    Gaber, I., Mansour, Y.: Broadcast in radio networks. In: Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, pp. 577–585 (1995) Google Scholar
  7. 7.
    Gąsieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proceedings of the 24th Annual ACM SIGACT-SIGOPS PODC, pp. 129–137 (2005) Google Scholar
  8. 8.
    Gąsieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, pp. 193–205 (2002) Google Scholar
  9. 9.
    Gąsieniec, L., Potapov, I., Xin, Q.: Efficient gossiping in known radio networks. In: Proceedings of the 11th SIROCCO. Lecture Notes in Computer Science, vol. 3104, pp. 173–184. Springer, Berlin (2004) Google Scholar
  10. 10.
    Kowalski, D., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Comput. 19(3), 185–195 (2007) CrossRefGoogle Scholar
  11. 11.
    Manne, F., Wang, S., Xin, Q.: Faster radio broadcast in planar graphs. In: Proceedings of the 4th Conference on Wireless on Demand Network Systems and Services. pp. 9–13. IEEE Press (2007) Google Scholar
  12. 12.
    Manne, F., Xin, Q.: Optimal gossiping with unit size messages in known topology radio networks. In: Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking. Lecture Notes in Computer Science, vol. 4235, pp. 125–134. Springer, Berlin (2006) CrossRefGoogle Scholar
  13. 13.
    Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. In: Proceedings of the 15th Joint Conference of IEEE Computer and Communication Societies, pp. 1116–1124 (1996) Google Scholar
  14. 14.
    Strahler, A.N.: Hypsometric (area-altitude) analysis of erosional topology. Bull. Geol. Soc. Am. 63, 117–1142 (1952) Google Scholar
  15. 15.
    Viennot, X.G.: A Strahler bijection between Dyck paths and planar trees. Discrete Math. 246, 317–329 (2002) MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.AG Genominformatik, Technische FakultätUniversität BielefeldBielefeldGermany
  2. 2.Department of InformaticsThe University of BergenBergenNorway
  3. 3.Simula Research LaboratoryLysakerNorway

Personalised recommendations