Abstract
The line-of-sight networks is a network model introduced recently by Frieze et al. It considers wireless networks in which the underlying environment has a large number of obstacles and the communication can only take place between objects that are close in space and are in the line of sight to one another. To capture the main properties of this model, Frieze et al. proposed a new random networks model in which nodes are randomly placed on an n ×n grid and a node can communicate with all the nodes that are in at most a certain fixed distance r and which are in the same row or column.
Frieze et al. concentrated their study on basic structural properties of the random line-of-sight networks and in this paper we focus on their communication aspects in the scenario of ad-hoc radio communication networks. We present efficient algorithms for two fundamental communication problems of broadcasting and gossiping in the classical ad-hoc radio communication model adjusted to random line-of-sight networks.
Research supported in part by the Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, EPSRC grant EP/D063191/1.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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. JCSS 45(1), 104–126 (1992)
Bollobás, B.: Random Graphs, 2nd edn. Academic Press, London (1985)
Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. TCS, 302, 337–364 (2003)
Chlebus, B.S., Ga̧sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distrib. Comput. 15(1), 27–38 (2002)
Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Average-time coplexity of gossiping in radio networks. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 253–267. Springer, Heidelberg (2006)
Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. 44th FOCS, pp. 492–501 (2003)
Czumaj, A., Wang, X.: Gossiping in random geometric ad-hoc radio networks. Manuscript (2007)
Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. In: Proc.13th SPAA, pp. 59–66 (2001)
Elsässer, R., Ga̧sieniec, L.: Radio communication in random graphs. JCSS 72, 490–506 (2006)
Frieze, A., Kleinberg, J., Ravi, R., Debany, W.: Line-of-sight networks. In: Proc. 18th SODA, pp. 968–977 (2007)
Ga̧sieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. 24th PODC, pp. 129–137 (2005)
Ga̧sieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in directed ad-hoc radio networks. In: Proc. 9th SWAT, pp. 397–407 (2004)
Kowalski, D., Pelc, A.: Deterministic broadcasting time in radio networks of unknown topology. In: Proc. 43rd FOCS, pp. 63–72 (2002)
Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18, 43–57 (2005)
Kowalski, D., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distrib. Comput. 19(3), 185–195 (2007)
Penrose, M.D.: Random Geometric Graphs. Oxford University Press, Uk (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czumaj, A., Wang, X. (2007). Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks. In: Hromkovič, J., Královič, R., Nunkesser, M., Widmayer, P. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2007. Lecture Notes in Computer Science, vol 4665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74871-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-74871-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74870-0
Online ISBN: 978-3-540-74871-7
eBook Packages: Computer ScienceComputer Science (R0)