Abstract
We propose a new low-interference topology for wireless ad hoc networks modeled by Quasi Unit Disk Graphs. 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: (i) 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 Δ) of the weight of a minimum spanning tree for V, where Δ is the aspect ratio of G, and (v) it can be implemented efficiently in O(log Δ + log* n) rounds of communication.
Similar content being viewed by others
References
Meyer auf de Heide, F., Schindelhauer, C., Volbert, K., Grünewald, M.: Energy, congestion and dilation in radio networks. In: SPAA ’02: Proceedings of the Fourteenth Annual ACM symposium on Parallel Algorithms and Architectures, pp. 230–237. ACM, New York (2002)
Burkhart, M.: Analysis of interference in ad-hoc networks. Diploma Thesis, 2003. Swiss Federal Institute of Technology Zurich
Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does topology control reduce interference? In: MobiHoc ’04: 5th ACM International Symposium of Mobile Ad Hoc Networking and Computing, pp. 9–19, 2004
Czumaj A., Zhao H.: Fault-tolerant geometric spanners. Discrete Comput. Geom. 32(2), 207–230 (2004)
Damian, M., Pandit, S., Pemmaraju, S.V.: Local approximation schemes for topology control. In: PODC’06: Proceedings of the 25th ACM Symposium on the Principles of Distributed Computing, pp. 208–218, July 2006. An extended version of the PODC paper with a few typos fixed is available at http://arXiv.org/abs/0803.2174
Das G., Narasimhan G.: A fast algorithm for constructing sparse Euclidean spanners. Int. J. Comput. Geom. Appl. 7(4), 297–315 (1997)
Eppstein D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J.(eds) Handbook of Computational Geometry, pp. 425–461. Elsevier, Amsterdam (2000)
Gudmundsson J., Knauer C.: Dilation and detours in geometric networks. In: Gonzalez, T.F.(eds) Handbook on Approximation Algorithms and Metaheuristics, Chapman & Hall/CRC, Boca Raton (2006)
Hassin Y., Peleg D.: Sparse communication networks and efficient routing in the plane. Distrib. Comput. 14(4), 205–215 (2001)
Johansson, T., Carr-Motyčková, L.: Reducing interference in ad hoc networks through topology control. In: DIALM-POMC ’05: Proceedings of the Joint Workshop on Foundations of Mobile Computing, pp. 17–23 (2005)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: PODC ’05: Proceedings of the 24th ACM Symposium on the Principles of Distributed Computing, pp. 60–68 (2005)
Salamatian, K., Iannone, L., Khalili, R., Fdida, S.: Cross-layer routing in wireless mesh networks. In: 1st International Symposium on Wireless Communication Systems, pp. 319–323 (2004)
Li, X.-Y., Nejad, K.M., Song, W.-Z., Wang, W.-Z.: Interference-aware topology control for wireless sensor networks. In: SECON’05: Sensor and Ad Hoc Communications and Networks, pp. 263–274 (2005)
Moscibroda, T., Wattenhofer, R.: Minimizing interference in ad hoc and sensor networks. In: DIALM-POMC’05: Proceedings of the 3rd ACM Joint Workshop on Foundations of Mobile Computing, September 2005
Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol design beyond graph-based models. In: 5th Workshop on Hot Topics in Networks (HotNets), pp. 25–30, November 2006
Peleg D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)
Rajaraman R.: Topology control and routing in ad hoc networks: a survey. SIGACT News 33(2), 60–73 (2002)
Smid M.: Closest-point problems in computational geometry. In: Sack, J.-R., Urrutia, J.(eds) Handbook of Computational Geometry, pp. 877–935. Elsevier, Amsterdam (2000)
von Rickenbach, P., Schmid, S., Wattenhofer, R., Zollinger, A.: A robust interference model for wireless ad-hoc networks. In: IPDPS ’05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium-Workshop 12, pp. 239.1, 2005
Wan, P.-J., Calinescu, G., Li, X.-Y., Frieder, O.: Minimum energy broadcast routing in static ad hoc wireless networks. ACM Wireless Networking (WINET), vol. 8(6), pp. 607–617, November 2002
Wang, Y., Li, X.-Y.: Distributed spanner with bounded degree for wireless ad hoc networks. In: IPDPS ’02: Proceedings of the 16th IEEE International Parallel and Distributed Processing Symposium, pp. 194–201, 2002
Yao A. C.-C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11(4), 721–736 (1982)
Zuniga, M., Krishnamachari, B.: An analysis of unreliability and asymmetry in low-power wireless links. ACM Trans. Sens. Netw 3(2), 2007
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by NSF grant CCF-0728909. A preliminary version of this paper, titled “Distributed construction of bounded-degree low-interference spanners of low weight”, appeared in MobiHoc’08.
Rights and permissions
About this article
Cite this article
Damian, M., Javali, N. Distributed construction of low-interference spanners. Distrib. Comput. 22, 15–28 (2009). https://doi.org/10.1007/s00446-009-0083-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-009-0083-7