Skip to main content
Springer Nature Link
Log in

Obstacle Avoidance Algorithms in Wireless Sensor Networks

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 180 Accesses

Years and Authors of Summarized Original Work

  • 2007; Powell, Nikoletseas

Problem Definition

Wireless sensor networks are composed of many small devices called sensor nodes with sensing, computing and radio frequency communication capabilities. Sensor nodes are typically deployed in an ad hoc manner and use their sensors to collect environmental data. The emerging network collectively processes, aggregates and propagates data to regions of interest, e.g., from a region where an event is being detected to a base station or a mobile user. This entry is concerned with the data propagation duty of the sensor network in the presence of obstacles.

For different reasons, including energy conservation and limited transmission range of sensor nodes, information propagation is achieved via multi-hop message transmission, as opposed to single-hop long range transmission. As a consequence, message routing becomes necessary. Routing algorithms are usually situated at the network layer of the protocol...

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Ahmed N, Kanhere SS, Jha S (2005) The holes problem in wireless sensor networks: a survey. SIGMOBILE Mob Comput Commun Rev 9:4–18

    Article  Google Scholar 

  2. Al-Karaki JN, Kamal AE (2004) Routing techniques in wireless sensor networks: a survey. Wirel Commun IEEE 11:6–28

    Article  Google Scholar 

  3. Bose P, Morin P, Stojmenovic I, Urrutia J (1999) Routing with guaranteed delivery in ad hoc wireless networks. In: Discrete algorithms and methods for mobile computing and communications

    Google Scholar 

  4. Chatzigiannakis I, Dimitriou T, Nikoletseas S, Spirakis P (2004) A probabilistic forwarding protocol for efficient data propagation in sensor networks. In: European wireless conference on mobility and wireless systems beyond 3G (EW2004), Barcelona, pp 344–350

    Google Scholar 

  5. Chatzigiannakis I, Mylonas G, Nikoletseas S (2006) Modeling and evaluation of the effect of obstacles on the performance of wireless sensor networks. In: 39th ACM/IEEE simulation symposium (ANSS), Los Alamitos. IEEE Computer Society, pp 50–60

    Google Scholar 

  6. Chatzigiannakis I, Nikoletseas S, Spirakis P (2005) Smart dust protocols for local detection and propagation. J Mob Netw (MONET) 10:621–635

    Google Scholar 

  7. Karl H, Willig A (2005) Protocols and architectures for wireless sensor networks. Wiley, West Sussex

    Book  Google Scholar 

  8. Karp B, Kung HT (2000) GPSR: greedy perimeter stateless routing for wireless networks. In: Mobile computing and networking. ACM, New York

    Google Scholar 

  9. Kim YJ, Govindan R, Karp B, Shenker S (2006) Lazy cross-link removal for geographic routing. In: Embedded networked sensor systems. ACM, New York

    Google Scholar 

  10. Kuhn F, Wattenhofer R, Zhang Y, Zollinger A (2003) Geometric ad-hoc routing: of theory and practice. In: Principles of distributed computing. ACM, New York

    Google Scholar 

  11. Lee S, Bhattacharjee B, Banerjee S (2005) Efficient geographic routing in multihop wireless networks. In: MobiHoc'05: proceedings of the 6th ACM international symposium on mobile ad hoc networking and computing. ACM, New York, pp 230–241

    Chapter  Google Scholar 

  12. Powell O, Nikolesteas S (2007) Simple and efficient geographic routing around obstacles for wireless sensor networks. In: WEA 6th workshop on experimental algorithms, Rome. Springer, Berlin

    Google Scholar 

  13. Stojmenovic I, Lin X (2001) Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Trans Parallel Distrib Syst 12:1023–1032

    Article  Google Scholar 

  14. Takagi H, Kleinrock L (1984) Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans Commun [legacy, pre-1988] 32:46–257

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering and Informatics Department, University of Patras, Patras, Greece

    Sotiris Nikoletseas

  2. Computer Technology Institute and Press “Diophantus”, Patras, Greece

    Sotiris Nikoletseas

  3. Informatics Department, University of Geneva, Geneva, Switzerland

    Olivier Powell

Authors
  1. Sotiris Nikoletseas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olivier Powell
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sotiris Nikoletseas .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Nikoletseas, S., Powell, O. (2016). Obstacle Avoidance Algorithms in Wireless Sensor Networks. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_262

Download citation

Publish with us

Policies and ethics