Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
The worst-case capacity of wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
A measurement study of interference modeling and scheduling in low-power wireless networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
Wireless Communication Is in APX
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Connectivity problem 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
The topology of wireless communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The capacity of wireless networks
IEEE Transactions on Information Theory
Computing and communicating functions over sensor networks
IEEE Journal on Selected Areas in Communications
Wireless scheduling with power control
ACM Transactions on Algorithms (TALG)
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
Minimum latency aggregation scheduling for arbitrary tree topologies under the SINR model
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Minimum latency data aggregation in the physical interference model
Computer Communications
Connectivity and aggregation in multihop wireless networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
Given n wireless transceivers located in a plane, a fundamental problem in wireless communications is to construct a strongly connected digraph on them such that the constituent links can be scheduled in fewest possible time slots, assuming the SINR model of interference. In this paper, we provide an algorithm that connects an arbitrary point set in O(log n) slots, improving on the previous best bound of O(log2 n) due to Moscibroda. This is complemented with a super-constant lower bound on our approach to connectivity. An important feature is that the algorithms allow for bi-directional (half-duplex) communication. One implication of this result is an improved bound of Ω(1/log n) on the worst-case capacity of wireless networks, matching the best bound known for the extensively studied average-case. We explore the utility of oblivious power assignments, and show that essentially all such assignments result in a worst case bound of Ω(n) slots for connectivity. This rules out a recent claim of a O(log n) bound using oblivious power. On the other hand, using our result we show that O(min(log Δ, log n · (log n + log log Δ))) slots suffice, where Δ is the ratio between the largest and the smallest links in a minimum spanning tree of the points. Our results extend to the related problem of minimum latency aggregation scheduling, where we show that aggregation scheduling with O(log n) latency is possible, improving upon the previous best known latency of O(log3 n). We also initiate the study of network design problems in the SINR model beyond strong connectivity, obtaining similar bounds for biconnected and k-edge connected structures.