Sparse communication networks and efficient routing in the plane
Distributed Computing
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Energy, congestion and dilation in radio networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Fault-Tolerant Geometric Spanners
Discrete & Computational Geometry
A Robust Interference Model for Wireless Ad-Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Reducing interference in ad hoc networks through topology control
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Minimizing interference in ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Local approximation schemes for topology control
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Minimizing interference for the highway model in wireless ad-hoc and sensor networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
A topology control algorithm for interference and energy efficiency in wireless sensor networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Exact algorithms to minimize interference in wireless sensor networks
Theoretical Computer Science
| Hi-index | 0.00 |
We propose a new low-interference topology for wireless ad hoc networks modeled by Quasi Unit Disk Graphs (qUDGs). Our topology combines two existing structures, the relaxed Greedy structure developed by Damian, Pandit and Pemmaraju, and the low-interference structure developed by Burkhart, von Rickenbach, Wattenhofer and Zollinger. Our main contribution is showing that, when applied on a qUDG G = (V, E), this new structure inherits most properties of the two underlying structures: (a) it is a t(1+ε) spanner of G, for any t 1 and ε 0, (ii) it has optimal interference among all t-spanners for G, (iii) it has O(1) maximum degree, (iv) its total weight is within a factor of O(log n) of the weight of a minimum spanning tree for V, and (v) it can be implemented efficiently in O(log n) rounds of communication.