Skip to main content
SpringerLink
Log in
Book cover

Progress in Systems Engineering pp 443–447Cite as

Identification of Redundant Node-Clusters for Improved Face Routing

  • Conference paper

  • 3072 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 366))

Abstract

For message delivery in sensor network, greedy forwarding, face routing, and hybrid greedy-face routing have been used extensively. In this paper we present a method for improved face routing by introducing the notion of ‘floating chains’ and ‘external clusters’. The proposed technique removes unnecessary nodes and node clusters from the Gabriel graph extracted from the unit disk graph induced by sensor nodes. We present efficient algorithms for identifying solo-faced chains and external clusters in the network. Removal of such nodes leads to improved performance of face routing methods.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   329.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Bibliography

  1. de Berg Mark, Van Kreveld Mark, Overmars Mark, and Schwarzkopf Otfried (1997) Computational Geometry: Algorithms and Applications, Springer. New York.

    Google Scholar 

  2. Bose P, Morin P, Stojmenovic I, Urrutia J (2001) Routing with guaranteed delivery in ad hoc network. Wireless networks. 609-616.

    Google Scholar 

  3. Cormen T, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT Press. Massachusetts.

    MATH  Google Scholar 

  4. Fortune S (1986) A sweep line algorithm for Voronoi diagram, Algorithmica. 2:153-174.

    Article  MathSciNet  Google Scholar 

  5. Gabriel KR, Sokal RR (1969) A new statistical approach to geographic variation analysis. Systematic zoology 18(3): 259-270.

    Article  Google Scholar 

  6. Gao J, Guibas LJ, Hershberger L, Zhang L, Zhu (2001) A geometric spanner for routing in mobile networks. IEEE journal on selected areas in communications. 23:174-185.

    Google Scholar 

  7. Gewali L, Hada U (2013) Node filtering and face routing in sensor network. Proceedings of ITNG 2013: 686-691.

    Google Scholar 

  8. Matula DW, Sokal R (1980) Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane. Geographical analysis 12(3): 205-222

    Article  Google Scholar 

  9. O’Rourke J (1994) Computational geometry in C. Cambridge University Press, New York.

    MATH  Google Scholar 

  10. Toussaint G (1980). The relative neighborhood graph of a finite planar set. Pattern recognition 12: 261-268.

    Article  MathSciNet  MATH  Google Scholar 

  11. Zhao F, Guibas L (2004) Wireless sensor network. Morgan Kaufmann. New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Nevada, Las Vegas, USA

    Laxmi Gewali & Umang Amatya

Authors
  1. Laxmi Gewali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Umang Amatya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Laxmi Gewali .

Editor information

Editors and Affiliations

  1. University of Nevada at Las Vegas, Las Vegas, Nevada, USA

    Henry Selvaraj

  2. Department of Electrical Engineering, Idaho State University, Pocatello, Idaho, USA

    Dawid Zydek

  3. University of Nevada at Las Vegas, Las Vegas, Nevada, USA

    Grzegorz Chmaj

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Gewali, L., Amatya, U. (2015). Identification of Redundant Node-Clusters for Improved Face Routing. In: Selvaraj, H., Zydek, D., Chmaj, G. (eds) Progress in Systems Engineering. Advances in Intelligent Systems and Computing, vol 366. Springer, Cham. https://doi.org/10.1007/978-3-319-08422-0_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08422-0_65

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08421-3

  • Online ISBN: 978-3-319-08422-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation