An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
On the impact of noise on mobile ad hoc networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
Dynamic packet scheduling in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Distributed multiple-message broadcast in wireless ad-hoc networks under the SINR model
SIROCCO'12 Proceedings of the 19th 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 |
In this work we study broadcasting in ad hoc wireless networks with uniform transmission powers, deployed in two dimensional Euclidean space.We consider two models based on the Signal-to-Interference- and-Noise Ratio (SINR): with opportunistic links, and with randomly disturbed SINR. In the former model, we deliver and analyze two algorithms: one accomplishing broadcast in O(D logg) rounds under assumption that the granularity g of the network is known, and the other without such assumption working in O(D log2n) rounds, where n is the number of nodes and D is the diameter of the network. It is also shown how to accelerate broadcast in the model to O(D+log2n) rounds when stations can wake up spontaneously. Finally, we modify the main two algorithms to make them efficient in the latter model with randomly disturbed SINR, with only logarithmic growth of performance.