Skip to main content

Advertisement

SpringerLink
Log in

Separability and topology control of quasi unit disk graphs

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protocols for wireless networks—routing, topology control, information storage/retrieval and numerous other applications—have been based on the idealized unit-disk graph (UDG) network model. The significant deviation of the UDG model from many real wireless networks is substantially limiting the applicability of such protocols. A more general network model, the quasi unit-disk graph (quasi-UDG) model, captures much better the characteristics of wireless networks. However, the understanding of the properties of general quasi-UDGs has been very limited, which is impeding the designs of key network protocols and algorithms. In this paper, we present results on two important properties of quasi-UDGs: separability and the existence of power efficient spanners. Network separability is a fundamental property leading to efficient network algorithms and fast parallel computation. We prove that every quasi-UDG has a corresponding grid graph with small balanced separators that captures its connectivity properties. We also study the problem of constructing an energy-efficient backbone for a quasi-UDG. We present a distributed local algorithm that, given a quasi-UDG, constructs a nearly planar backbone with a constant stretch factor and a bounded degree. We demonstrate the excellent performance of these auxiliary graphs through simulations and show their applications in efficient routing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Alzoubi, K., Li, X., Wang, Y., Wan, P., & Frieder, O. (2003). Geometric spanners for wireless ad hoc networks. IEEE Transactions on Parallel and Distributed Systems, 14(4), 408–421.

    Article  Google Scholar 

  2. Barrière, L., Fraigniaud, P., & Narayanan, L. (2001). Robust position-based routing in wireless ad hoc networks with unstable transmission ranges. In Proceedings of the 5th international workshop on discrete algorithms and methods for mobile computing and communications (DialM ’01) (pp. 19–27).

  3. Bose, P., Morin, P., Stojmenovic, I., & Urrutia, J. (1999). Routing with guaranteed delivery in ad hoc wireless networks. In Proceedings of the 3rd international workshop on discrete algorithms and methods for mobile computing and communications (DialM ’99) (pp. 48–55).

  4. Damian, M., Pandit, S., & Pemmaraju, S. (2006). Local approximation schemes for topology control. In Proceedings of PODC (pp. 208–217).

  5. Fang, Q., Gao, J., & Guibas, L. J. (2006). Landmark-based information storage and retrieval in sensor networks. Proceedings of INFOCOM’06.

  6. Gabriel, K., & Sokal, R. (1969). A new statistical approach to geographic variation analysis. Systematic Zoology, 18, 259–278.

    Article  Google Scholar 

  7. Ganesan, D., Krishnamachari, B., Woo, A., Culler, D., Estrin, D., & Wicker, S. (2002). Complex behavior at scale: an experimental study of low-power wireless sensor networks. Technical Report UCLA/CSD-TR 02-0013, UCLA.

  8. Gavoille, C., Peleg, D., Pèrennes, S., & Raz, R. (2004). Distance labeling in graphs. Journal of Algorithms, 53(1), 85–112.

    Article  MATH  MathSciNet  Google Scholar 

  9. Kanj, I. A., & Perkovic, L. Improved stretch factor for bounded-degree planar power spanners of wireless ad-hoc networks. In To appear in the proceedings of ALGOSENSOR’06.

  10. Karp, B., & Kung, H. T. (2000). GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th annual international conference on mobile computing and networking (pp. 243–254).

  11. Kim, Y., Govindan, R., Karp, B., & Shenker, S. (2005, May). Geographic routing made practical. In Proceedings of the 2nd USENIX/ACM Symposium on Networked System Design and Implementation (NSDI 2005), Boston, MA.

  12. Lillis, K. M., Pemmaraju, S. V., & Pirwani, I. A. (2007). Topology control and geographic routing in realistic wireless networks. In ADHOC-NOW (pp. 15–31).

  13. Lipton, R. J., & Tarjan, R. E. (1979). A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36(2), 177–189.

    Article  MATH  MathSciNet  Google Scholar 

  14. Kuhn, F., & Zollinger, A. (2003). Ad-hoc networks beyond unit disk graphs. In Proceedings of 2003 joint workshop on foundations of mobile computing (pp. 69–78).

  15. Kuhn, F., Watternhofer, R., Zhang, Y., & Zollinger, A. (2003). Geometric ad-hoc routing: Of theory and practice. In Proceedings of PODC (pp. 63–72).

  16. Sohrabi, K., Manriquez, B., & Pottie, G. (1999). Near ground wideband channel measurement. IEEE Vehicular Technology Conference, 1, 571–574.

    Google Scholar 

  17. Wattenhofer, R. (2006). Sensor networks: Distributed algorithms reloaded—or revolutions?. In Proceedings of SIROCCO (pp. 24–28).

  18. Yao, A. C.-C. (1982). On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4), 721–736.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Texas A&M University, College Station, TX, 77843, USA

    Jianer Chen & Anxiao (Andrew) Jiang

  2. School of CTI, DePaul University, 243 S. Wabash Avenue, Chicago, IL, 60604, USA

    Iyad A. Kanj

  3. Department of Computer Science, Lafayette College, Easton, PA, 18042, USA

    Ge Xia

  4. Google Kirkland, 747 6th Street South, Kirkland, WA, 98033, USA

    Fenghui Zhang

Authors
  1. Jianer Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anxiao (Andrew) Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Iyad A. Kanj
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ge Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Fenghui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ge Xia.

Additional information

A preliminary version of this paper appeared at INFOCOM 2007.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, J., (Andrew) Jiang, A., Kanj, I.A. et al. Separability and topology control of quasi unit disk graphs. Wireless Netw 17, 53–67 (2011). https://doi.org/10.1007/s11276-010-0264-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-010-0264-0

Keywords

Search

Navigation