Skip to main content
SpringerLink
Log in
Book cover

Wireless Sensor Networks pp 23–36Cite as

Topology, Routing, and Modeling Tools

  • Chapter
  • First Online:

Abstract

The development of microcontrollers, communication technology, micro-electromechanical systems (MEMS) and nanotechnology allowed for research and development of new systems for sensing and communication called wireless sensor networks (WSNs). Such networks are characterized as ad hoc (no previous setup or supporting infrastructure is required), utilize novel communication protocols, cooperatively monitor phenomena of interest, and communicate recorded data to the central processing station, usually called the base station. As the word wireless indicates, such networks of sensors communicate using wireless communication channels, allowing for easy deployment, control, maintenance, and possible sensors replacements.

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   64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   84.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

References

  1. K. Akkaya and M. Younis, “A survey on routing protocols for wireless sensor networks,” Ad Hoc Networks, vol. 3, pp. 325–349, 2005.

    Google Scholar 

  2. J.N. Al-Karaki and A.E. Kamal, “Routing techniques in wireless sensor networks: a Survey,” IEEE Wireless Communications, vol. 11, pp. 6–28, 2004.

    Google Scholar 

  3. F. Aurenhammer and R. Klein, “Voronoi diagrams,” in J. Sack and G. Urrutia, editors, Handbook of Computational Geometry, Elsevier Science Publishing, 2000.

    Google Scholar 

  4. F. Aurenhammer, “Voronoi diagrams: A survey of a fundamental geometric data structure,” ACM Computing Surveys, vol. 23, pp. 345–405, 1991.

    Google Scholar 

  5. A. Boukerche, H. Oliveira, E. Nakamura, and A. Loureiro, “Dv-loc: a scalable localization protocol using Voronoi diagrams for wireless sensor networks,” IEEE Wireless Communications, vol. 16, no. 2, pp. 50–55, April 2009.

    Google Scholar 

  6. P. Cignoni, C. Montani, and R. Scopigno, “DeWall: A fast divide & conquer Delaunay triangulation algorithm in E d,” Computer-Aided Design, vol. 30, no. 5, April 1998, pp. 333–341.

    Google Scholar 

  7. W.P. Chen, J. Hou, and L. Sha, “Dynamic clustering for acoustic target tracking in wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 3, no. 3, pp. 258–271, July-August 2004.

    Google Scholar 

  8. B. Delaunay, “Sur la sphère vide,” Otdelenie Matematicheskikh i Estestvennykh Nauk, vol. 7, pp. 793–800, 1934.

    Google Scholar 

  9. R. Descartes, “Principia Philosophiae,” Ludovicus Elzevirius, Amsterdam, 1644.

    Google Scholar 

  10. S. Fortune, “A sweepline algorithm for Voronoi diagrams,” Proc. the 2nd Annual Symposium on Computational Geometry, pp. 313–322, 1986.

    Google Scholar 

  11. M. Held, “On the computational geometry of pocket machining,” Lecture Notes in Computer Science, Springer-Verlag, 1991.

    Google Scholar 

  12. J.S. Li, H.C. Kao, and J.D. Ke, “Voronoi-based relay placement scheme for wireless sensor networks,” IET Communications, vol. 3, no. 4, pp. 530–538, April 2009.

    Google Scholar 

  13. X.-Y. Li, P.-J. Wan, and O. Frieder, “Coverage in wireless ad hoc sensor networks,” IEEE Transaction on Computers, vol. 52, no. 6, June 2003.

    Google Scholar 

  14. S. Megerian, F. Koushanfar, M. Potkonjak, and M. Srivastava, “Worst and best-case coverage in sensor networks,” IEEE Transactions on Mobile Computing, vol. 4, no. 1, pp. 84–92, January–February 2005.

    Google Scholar 

  15. S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, “Coverage problems in wireless ad-hoc sensor networks,” Proc. 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), vol. 3, pp. 1380–1387, 2001.

    Google Scholar 

  16. T. Melodia, D. Pompili, and I. Akyildiz, “A communication architecture for mobile wireless sensor and actor networks,” 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks, vol. 1, pp. 109–118, September 2006.

    Google Scholar 

  17. T. Melodia, D. Pompili, and I. Akyldiz, “Handling mobility in wireless sensor and actor networks,” IEEE Transactions on Mobile Computing, vol. 9, no. 2, pp. 160–173, February 2010.

    Google Scholar 

  18. A. Okabe, B. Boots, K. Sugihara, and S. N. Chiu, Spatial Tessellations-Concepts and Applications of Voronoi Diagrams, John Wiley, Second Edition, 2000.

    Google Scholar 

  19. M.I. Shamos and D. Hoey, “Closest-point problems,” Proc. of the 16th IEEE Symposium on Foundations of Computer Science, pp. 151–162, 1975.

    Google Scholar 

  20. M.I. Shamos, Computational Geometry, Ph.D. Dissertation, Yale University, 1978.

    Google Scholar 

  21. G.M. Voronoi, “Nouvelles applications des paramètres continus à la théorie des formes quadratiques,” Journal für die Reine und Angewandte Mathematik, vol. 133, pp. 97–178, 1908.

    Google Scholar 

  22. G. Wang, G. Cao, and T. La Porta, “Movement-assisted sensor deployment,” Proc. 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 4, pp. 2469–2479, March 2004.

    Google Scholar 

  23. E.W. Weisstein, “Dual graph,” From MathWorld—A Wolfram Web Resource, http://mathworld.wolfram.com/DualGraph.html.

  24. A. Yazici, G. Kirlik, O. Parlaktuna, and A. Sipahioglu, “A dynamic path planning approach for multi-robot sensor-based coverage considering energy constraints,” International Conference on Intelligent Robots and Systems, October 2009.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Louisiana Tech University, Ruston, LA, USA

    Rastko R. Selmic

  2. Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY, USA

    Vir V. Phoha

  3. Department of Computer Science, Texas Tech University, Lubbock, TX, USA

    Abdul Serwadda

Authors
  1. Rastko R. Selmic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vir V. Phoha
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abdul Serwadda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rastko R. Selmic .

Questions and Exercises

Questions and Exercises

  1. 1.

    Briefly describe the concept of data aggregation as used in wireless sensor networks. What are its advantages? You may use a drawing and (or) an example of a WSN application of your choice for illustration purposes.

  2. 2.

    One of the categories of routing protocols for WSNs is a group of QoS-aware protocols. How do you understand the term “QoS” as used in WSNs? How do the QoS demands of WSNs differ from those of regular computer networking applications?

  3. 3.

    Describe in detail the mechanism of operation of one QoS-aware routing protocol in WSNs. Can a QoS-aware routing protocol be hierarchical at the same time? Please explain.

  4. 4.

    What is the SPIN protocol’s major weakness? For what kinds of applications would SPIN be unsuitable? With the aid of diagrams if possible, briefly describe the weaknesses and strengths of the flooding and gossiping protocols for WSNs.

  5. 5.

    Given a set of points \(A = \{ ( - 2,2),(2,2),( - 2,2),( - 3, - 3)\}\), draw the Voronoi diagrams and Delaunay triangulations. Repeat the same task for the set \(B = \{ ( - 2,2),(2,2),( - 2,2),( - 2, - 2)\}\).

  6. 6.

    Explain why Voronoi diagrams and Delaunay triangulations are dual? How is such duality related to their geometrical interpretation?

  7. 7.

    Given N homes in a region, where within the region to place a nuclear power plant such that it is as far away from any home as possible?

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this chapter

Cite this chapter

Selmic, R.R., Phoha, V.V., Serwadda, A. (2016). Topology, Routing, and Modeling Tools. In: Wireless Sensor Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-46769-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46769-6_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46767-2

  • Online ISBN: 978-3-319-46769-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation