Journal of Computer and System Sciences
SIAM Journal on Computing
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
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
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
Efficient broadcasting in known topology radio networks with long-range interference
Proceedings of the 28th ACM symposium on Principles of distributed computing
A Note on Uniform Power Connectivity in the SINR Model
Algorithmic Aspects of Wireless Sensor Networks
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Distributed Broadcast in Unknown Radio Networks
SIAM Journal on Computing
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
Structuring unreliable radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Optimal regional consecutive leader election in mobile ad-hoc networks
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Towards jamming-resistant and competitive medium access in the SINR model
S3 '11 Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Deterministic distributed data aggregation under the SINR model
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
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
Distributed backbone structure for algorithms in the SINR model of wireless networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Distributed deterministic broadcasting in wireless networks of weak devices
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Distributed deterministic broadcasting in uniform-power ad hoc wireless networks
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
The Signal-to-Interference-and-Noise-Ratio (SINR) physical model is one of the most popular models of wireless networks. Despite of the vast amount of study done in design and analysis of centralized algorithms supporting wireless communication under the SINR physical model, little is known about distributed algorithms in this model, especially deterministic ones. In this work we construct, in a deterministic distributed way, a backbone structure on the top of a given wireless network, which can be used for efficient transformation of many algorithms designed in a simpler model of ad hoc broadcast networks without interference into the SINR physical model with uniform power of stations. The time cost of the backbone data structure construction is only $O(\Delta \text{ \!polylog\! } N)$ rounds, where Δ is roughly the network density and {1,…,N} is the range of identifiers (IDs) and thus N is an upper bound on the number of nodes in the whole network. The core of the construction is a novel combinatorial structure called SINR-selector, which is introduced in this paper. We demonstrate the power of the backbone data structure by using it for obtaining efficient $O(D+\Delta \text{ \!polylog\! } N)$ round and $O(D+k+\Delta \text{ \!polylog\! } N)$ round deterministic distributed solutions for leader election and multi-broadcast, respectively, where D is the network diameter and k is the number of messages to be disseminated.