Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks

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.

[1]  Noga Alon,et al.  A Lower Bound for Radio Broadcast , 1991, J. Comput. Syst. Sci..

[2]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2002, J. Algorithms.

[3]  Eyal Kushilevitz,et al.  An Ω(D log(N/D)) lower bound for broadcast in radio networks , 1993, PODC '93.

[4]  Andrzej Pelc,et al.  Optimal Deterministic Broadcasting in Known Topology Radio Networks , 2006, Distributed Computing.

[5]  Alan M. Frieze,et al.  Line-of-sight networks , 2007, SODA '07.

[6]  Andrzej Pelc,et al.  Broadcasting in geometric radio networks , 2007, J. Discrete Algorithms.

[7]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[8]  Robert Elsässer,et al.  Radio communication in random graphs , 2006, J. Comput. Syst. Sci..

[9]  Andrea E. F. Clementi,et al.  Distributed broadcast in radio networks of unknown topology , 2003, Theor. Comput. Sci..

[10]  Eyal Kushilevitz,et al.  An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks , 1998, SIAM J. Comput..

[11]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[12]  Dariusz R. Kowalski,et al.  Average-Time Complexity of Gossiping in Radio Networks , 2006, SIROCCO.

[13]  Andrzej Pelc,et al.  Deterministic broadcasting time in radio networks of unknown topology , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[14]  Ding Liu,et al.  On Randomized Broadcasting and Gossiping in Radio Networks , 2002, COCOON.

[15]  Xin Wang,et al.  Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks , 2007, ISAAC.

[16]  David Peleg,et al.  Faster communication in known topology radio networks , 2005, PODC '05.

[17]  Wojciech Rytter,et al.  Deterministic broadcasting in ad hoc radio networks , 2002, Distributed Computing.

[18]  Béla Bollobás,et al.  Random Graphs , 1985 .

[19]  Wojciech Rytter,et al.  Broadcasting algorithms in radio networks with unknown topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[20]  Leszek Gasieniec,et al.  Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks , 2004, SWAT.

[21]  Andrzej Pelc,et al.  Tradeoffs between knowledge and time of communication in geometric radio networks , 2001, SPAA '01.

[22]  Andrzej Pelc,et al.  Broadcasting in undirected ad hoc radio networks , 2005, Distributed Computing.