Skip to main content

A Note on the Local Minimum Problem in Wireless Sensor Networks

  • Conference paper
Computer Networks (CN 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 370))

Included in the following conference series:

Abstract

The Local Minimum Problem occurs in geographic routing scenarios. In this paper two solutions to this problem for certain network topologies are proposed. By using the notion of virtual coordinates a theoretical and a practical constructions are presented. A distributed algorithm for the practical approach is proposed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kranakis, E., Singh, H., Urrutia, J.: Compass Routing on Geometric Networks. In: Proceedings 11th Canadian Conference on Computational Geometry, pp. 51–54 (1999)

    Google Scholar 

  2. Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: On the pitfalls of geographic face routing. In: Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC 2005, pp. 34–43. ACM, NY (2005)

    Chapter  Google Scholar 

  3. Takagi, H., Kleinrock, L.: Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals. IEEE Transactions on Communications COM-32(3), 246–257 (1984)

    Article  Google Scholar 

  4. Hou, T.C., Li, V.O.K.: Transmission Range Control in Multihop Packet Radio Networks. IEEE Transactions on Communications COM-34(1), 38–44 (1986)

    Google Scholar 

  5. Stojmenovic, I., Lin, X.: Power-Aware Localized Routing in Wireless Networks. IEEE Transactions on Parallel And Distributed Systems 12(10), 1122–1133 (2001)

    Article  Google Scholar 

  6. Stojmenovic, I., Lin, X.: Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks. IEEE Transactions on Parallel And Distributed Systems 12(10), 1023–1032 (2001)

    Article  Google Scholar 

  7. Finn, G.: Routing and addressing problems in large metropolitan-scale internetworks, University of Southern California. Information Sciences Institute, Marina del Rey (1987)

    Google Scholar 

  8. Kleinberg, R.: Geographic Routing Using Hyperbolic Space. In: INFOCOM, pp. 1902–1909 (2007)

    Google Scholar 

  9. Sarkar, R., Yin, X., Gao, J., Luo, F., Gu, X.D.: Greedy routing with guaranteed delivery using Ricci flows. In: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks, IPSN 2009, pp. 121–132. IEEE (2009)

    Google Scholar 

  10. Czubak, A., Wojtanowski, J.: On applications of wireless sensor networks. In: Tkacz, E., Kapczynski, A. (eds.) Internet – Technical Development and Applications. AISC, vol. 64, pp. 91–99. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czubak, A. (2013). A Note on the Local Minimum Problem in Wireless Sensor Networks. In: Kwiecień, A., Gaj, P., Stera, P. (eds) Computer Networks. CN 2013. Communications in Computer and Information Science, vol 370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38865-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38865-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38864-4

  • Online ISBN: 978-3-642-38865-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics