A lower bound for radio broadcast
Journal of Computer and System Sciences
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
Introduction to Algorithms
Centralized broadcast in multihop radio networks
Journal of Algorithms
Improved schedule for radio broadcast
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Energy efficient randomised communication in unknown AdHoc networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
The capacity of wireless networks
IEEE Transactions on Information Theory
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Distributed backbone structure for algorithms in the SINR model of wireless networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
We study broadcasting (one-to-all communication) in known topology radio networks modeled by graphs, where the interference range of a node is likely to exceed its transmission range. In this model, if two nodes are connected by a transmission edge they can communicate directly. On the other hand, if two nodes are connected by an interference edge their transmissions disable recipience of one another. For a network G, we term the smallest integer d, s.t., for any interference edge e there exists a simple path formed of at most d transmission edges connecting the endpoints of e as its interference distance dI. In this model the schedule of transmissions is precomputed in advance based on full knowledge about the size and the topology (including location of transmission and interference edges) of the network. We are interested in the design of fast broadcasting schedules that are energy efficient, i.e., based on limited number of transmissions at each node. In what follows we assume that n stands for the number of nodes, DT is the diameter of the subnetwork induced by the transmission edges, and Δ refers to the maximum combined degree formed of transmission and interference edges) of the network. We contribute the following new results: (1) We prove that even for networks with the interference distance dI = 2 any broadcasting schedule requires at least DT + Ω(Δ ∙ log n/log Δ) rounds. (2) We also provide for networks modeled by bipartite graphs an algorithm that computes 1-shot (each node is allowed to transmit at most once) broadcasting schedules of length O(Δ ∙ log n). Note that in this case the length of the broadcasting schedule is independent of the interference distance of the network. (3) The main result of the paper is an algorithm that computes a 1-shot broadcasting schedule of length at most 4 ∙ DT + O(Δ ∙ dI ∙ log4 n) for networks with arbitrary topology. Note that in view of the lower bound from (1) the broadcast schedule is almost optimal for dI polylogarithmic in n. Note also that by applying our algorithm to radio networks with no interference edges the time of the broadcasting schedule from [10] is improved in graphs with Δ = o(√n/log4 n). The 1-shot broadcasting algorithm proposed in [10] relies heavily on the concept of internal ranks that impose currently an Ω(√n)-time bottleneck in the broadcasting schedule.