PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A lower bound for radio broadcast
Journal of Computer and System Sciences
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
SIAM Journal on Computing
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
A measurement study of interference modeling and scheduling in low-power wireless networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Distributed ($#916;+1)-coloring in the physical model
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
The capacity of wireless networks
IEEE Transactions on Information Theory
DCOSS '12 Proceedings of the 2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems
Distributed connectivity of wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We consider the local broadcasting problem in the SINR model, which is a basic primitive for gathering initial information among n wireless nodes. Assuming that nodes can measure received power, we achieve an essentially optimal constant approximate algorithm (with a log2 n additive term). This improves upon the previous best O(log n)-approximate algorithm. Without power measurement, our algorithm achieves O(log n)-approximation, matching the previous best result, but with a simpler approach that works under harsher conditions, such as arbitrary node failures. We give complementary lower bounds under reasonable assumptions.