Journal of Computer and System Sciences
Deterministic Broadcasting Time in Radio Networks of Unknown Topology
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Radio communication in random graphs
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Average-Time complexity of gossiping in radio networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Fast message dissemination in random geometric ad-hoc radio networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
| Hi-index | 0.00 |
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.