Advertisement

Acknowledged Broadcasting and Gossiping in Ad Hoc Radio Networks

  • Jiro Uchida
  • Wei Chen
  • Koichi Wada
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3144)

Abstract

A radio network is a collection of transmitter-receiver devices (referred to as nodes). ARB (Acknowledged Radio Broadcasting) means transmitting a message from one special node called source to all the nodes and informing the source about its completion. In our model each node takes a synchronization per round and performs transmission or reception at one round. Each node does not have a collision detection capability and knows only own ID. In [1], it is proved that no ARB algorithm exists in the model without collision detection. In this paper, we show that if n≥ 2, where n is the number of nodes in the network, we can construct algorithms which solve ARB in O(n) rounds for bidirectional graphs and in O(n 3/2) rounds for strongly connected graphs and solve ARG (Acknowledged Radio Gossiping) in O(nlog3 n) rounds for bidirectional graphs and in O(n 3/2) rounds for strongly connected graphs without collision detection.

Keywords

broadcasting gossiping distributed deterministic radio network 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chlebus, B.S., Ga̧sieniec, L., Gibbons, A.M., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15, 27–38 (2002)CrossRefGoogle Scholar
  2. 2.
    Ga̧sieniec, L., Christersson, M., Lingas, A.: Gossiping with bounded size messages in ad hoc radio networks. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 377–389. Springer, Heidelberg (2002)Google Scholar
  3. 3.
    Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. Journal of Computer and System Sciences 43, 290–298 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Gaber, I., Mansour, Y.: Broadcast in Radio Networks. In: 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA 1995, pp. 577–585 (1995)Google Scholar
  5. 5.
    Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in radio networks: an exponential gap between determinism and randomization. In: 6th ACM Symposium on Principles of Distributed Computing, pp. 98–107 (1987)Google Scholar
  6. 6.
    Kushilevitz, E., Mansour, Y.: An Ω _Dlog n D_ lower bound for broadcast in radio networks. In: 12th Ann. ACM Symp. on Principles of Distributed Computing, pp. 65–73 (1993)Google Scholar
  7. 7.
    Okuwa, T., Chen, W., Wada, K.: An optimal algorithm of acknowledged broadcasting in ad hoc networks. In: Proc. of 2nd Int’l Symp. Parallel and Distributed Computing (2003) (to appear)Google Scholar
  8. 8.
    Chrobak, M., Ga̧sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: st IEEE Symp. on Found. of Computer Science (FOCS 2000), pp. 575–581 (2000)Google Scholar
  9. 9.
    Brusci, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing 10, 129–135 (1997)CrossRefGoogle Scholar
  10. 10.
    Xu, Y.: An O(n1.5) deterministic gossiping algorithm for radio networks. Algorithmica, 93–96 (May 2003)Google Scholar
  11. 11.
    Uchida, J., Chen, W., Wada, K.: Acknowledged Broadcasting and Gossiping in ad hoc radio networks. Nagoya Institute of Technology, Wada Lab, TR2004-01 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jiro Uchida
    • 1
  • Wei Chen
    • 2
  • Koichi Wada
    • 2
  1. 1.Nagoya Institute of TechnologyNagoyaJapan
  2. 2.Tennessee State UniversityNashvilleUSA

Personalised recommendations