Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On the Planarization of Wireless Sensor Networks

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Network planarization has been an important technique in numerous sensornet protocols—such as Greedy Perimeter Stateless Routing (GPSR), topology discovery, data-centric storage, etc.—however the planarization process itself has been difficult. Known efficient planarization algorithms exist only for restrictive wireless network models: unit-disk graphs with accurately known location information. In this paper, we study efficient planarization of wireless sensor networks, and present a novel planarization method for a more general network model, where sensors can have non-uniform transmission ranges and no location information is needed. Our planarization algorithms also include a (2+ε)-approximation algorithm and an FPT algorithm for the bipartite planarization problem.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abello, J., Resende, M., Sudarsky, S.: Massive quasi_clique detection. In: Rajabaum, S. (ed.) Lecture Notes in Computer Science, vol. 2286, pp. 598–612 (2002)

    Google Scholar 

  2. Barrière, L., Fraigniaud, P., Narayanan, L.: Robust position-based routing in wireless ad hoc networks with unstable transmission ranges. In: Proc. 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, DIALM 2001, pp. 19–27 (2001)

    Chapter  Google Scholar 

  3. Bruck, J., Gao, J., Jiang, A.: Localization and routing in sensor networks by local angle information. In: Proc. 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc, pp. 181–192 (2005)

    Chapter  Google Scholar 

  4. Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. J. Algorithms 41, 280–301 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Trans. Graph. 15, 301–331 (1996)

    Article  Google Scholar 

  6. Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)

    Google Scholar 

  7. Dujmovic, V., Fellows, M., Hallett, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Suderman, M.: A fixed-parameter approach to two-layer planarization. In: Proc. 9th International Symposium on Graph Drawing, GD 2001. Lecture Notes in Computer Science, vol. 2265, pp. 1–15 (2002)

    Google Scholar 

  8. Eades, P., Whitesides, S.: Drawing graphs in two layers. Theor. Comput. Sci. 131, 361–374 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Funke, S., Klein, C.: Hole detection or: “How much geometry hides in connectivity?”. In: Proc. 22nd ACM Symposium on Computational Geometry, SoCG, pp. 377–385 (2006)

    Google Scholar 

  10. Funke, S., Milosavljevic, N.: Network sketching or: “How much geometry hides in connectivity?—Part II”. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 958–967 (2007)

    Google Scholar 

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

  12. Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proc. 6th Annual International Conference on Mobile Computing and Networking, MobiCom, pp. 243–254 (2000)

    Chapter  Google Scholar 

  13. Kim, Y., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: Proc. 2nd Symposium on Networked System Design and Implementation, NSDI, pp. 217–230 (2005)

    Google Scholar 

  14. Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. 11th Canadian Conference on Computational Geometry, pp. 51–54 (1999)

    Google Scholar 

  15. Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: Proc. 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc, pp. 267–278 (2003)

    Chapter  Google Scholar 

  16. Moore, D., Leonard, J., Rus, D., Teller, S.: Robust distributed network localization with noisy range measurements. In: Proc. 2nd International Conference on Embedded Networked Sensor Systems, SenSys, pp. 50–61 (2004)

    Chapter  Google Scholar 

  17. Nakano, S.: Planar drawings of plane graphs. IEICE Trans. Inf. Syst. 3, 384–391 (2000)

    Google Scholar 

  18. Ratnasamy, S., Karp, B., Yin, L., Yu, F., Estrin, D., Govindan, R., Shenker, S.: GHT: a geographic hash table for data-centric storage. In: Proc. 1st ACM International Workshop on Wireless Sensor Networks and Applications, WSNA, pp. 78–87 (2002)

    Chapter  Google Scholar 

  19. Wang, Y., Gao, J., Mitchell, J.S.: Boundary recognition in sensor networks by topological methods. In: Proc. 12th Annual International Conference on Mobile Computing and Networking, MobiCom, pp. 122–133 (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Fenghui Zhang, Anxiao (Andrew) Jiang & Jianer Chen

Authors
  1. Fenghui Zhang
    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. Jianer Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fenghui Zhang.

Additional information

The work by F. Zhang was supported in part by the Texas Advanced Research Program under Grant No. 003581-0006-2006, the work by A. Jiang was supported in part by the National Science Foundation under the Grant CCF-0747415, and the work by J. Chen was supported in part by the National Science Foundation under the Grant CCF-0917288 and by the Texas Advanced Research Program under Grant No. 003581-0006-2006. A preliminary version of the paper (under the title Robust Planarization of Unlocalized Wireless Sensor Networks) has appeared in Proc. 27th IEEE INFOCOM, Phoenix, AZ, April 2008.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, F., Jiang, A.(. & Chen, J. On the Planarization of Wireless Sensor Networks. Algorithmica 60, 593–608 (2011). https://doi.org/10.1007/s00453-010-9476-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-010-9476-z

Keywords

Search

Navigation