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.
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.
Similar content being viewed by others
References
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)
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)
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)
Gaber, I., Mansour, Y.: Broadcast in Radio Networks. In: 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA 1995, pp. 577–585 (1995)
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)
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)
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)
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)
Brusci, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing 10, 129–135 (1997)
Xu, Y.: An O(n1.5) deterministic gossiping algorithm for radio networks. Algorithmica, 93–96 (May 2003)
Uchida, J., Chen, W., Wada, K.: Acknowledged Broadcasting and Gossiping in ad hoc radio networks. Nagoya Institute of Technology, Wada Lab, TR2004-01 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uchida, J., Chen, W., Wada, K. (2004). Acknowledged Broadcasting and Gossiping in Ad Hoc Radio Networks. In: Papatriantafilou, M., Hunel, P. (eds) Principles of Distributed Systems. OPODIS 2003. Lecture Notes in Computer Science, vol 3144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27860-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-27860-3_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22667-3
Online ISBN: 978-3-540-27860-3
eBook Packages: Springer Book Archive