A lower bound for radio broadcast
Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Constant density spanners for wireless ad-hoc networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Broadcasting in udg radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
On the effect of the deployment setting on broadcasting in Euclidean radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Minimizing broadcast latency and redundancy in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this paper, we study the Interference-Aware Broadcast Scheduling problem, where all nodes in the Euclidean plane have a transmission range and an interference range equal to r and @a r for @a=1, respectively. Minimizing latency is known to be NP-Hard even when @a=1. The network radius D, the maximum graph distance from the source to any node, is also known to be a lower bound. We formulate the problem as integer programs (IP) and optimally solve moderate-size instances. We also propose six variations of heuristics, which require no pre-processing of inputs, based on the number of receivers gained by each additional simultaneous transmitting node. The experimental results show that the best heuristics give solutions that exceed the optimal solutions by only 13-20%. Further, an O(@aD) schedule is proven to exist yielding an O(@a) approximation algorithm.