Advertisement

Performance Evaluation of Routing Protocols in WSNs Arranged in Linear Topologies

  • Luca Bergesio
  • Mirko Franceschinis
  • Maurizio Spirito
  • Riccardo Tomasi
Conference paper

Abstract

This chapter presents a multihop routing solution, called Hopefully Longest Jump First, specifically proposed for WSNs arranged in a linear topology and compares it to two simple approaches, named Single Hop and Limited Flooder. At the application level, we suppose that a Master Node, deployed at one side of the WSN, progressively queries each of the N Slave Nodes. On its turn, when queried, a Slave Node replies to the Master Node. The performance of the proposed routing schemes is evaluated and compared on the basis of experimental results involving a real indoor WSN composed of 11 Telos motes, representing 1 Master Node and 10 Slave Nodes. The WSN has been deployed inside ISMB Lab. The analysis is based on performance metrics such as end-to-end delay and end-to-end packet delivery success rate, also considering the impact of the distance between two adjacent nodes and thus the expected number of neighbors within a node radio coverage.

Keywords

Sensor Node Wireless Sensor Network Sink Node Master Node Slave Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgments

The research leading to the results presented in this paper has been carried out within the SAFESPOT Project [9], funded by the European Community’s Sixth Framework Programme FP6.

References

  1. 1.
    Franceschinis M, Gioanola L, Messere M, Tomasi R, Spirito MA, Civera P (2009) Wireless sensor networks for intelligent transportation systems. 2009 IEEE 69th vehicular technology conference: VTC2009-Spring, Barcelona, Spain, 26–29 Apr 2009Google Scholar
  2. 2.
    Haridas H (2006) BriMon: design and implementation of railway bridge monitoring application. Master Thesis, Indian Institute of Technology, KanpurGoogle Scholar
  3. 3.
    Barboni L, Valle M (2008) Wireless sensor networks power aware deployment. Sensor technologies and applications, 2008. SENSORCOMM ’08. Second international conference on, 25–31 Aug 2008, pp 252–257Google Scholar
  4. 4.
    Hellman K, Colagrosso M (2006) Investigating a wireless sensor network optimal lifetime solution for linear topologies. J Interconn Netw 7:91–99CrossRefGoogle Scholar
  5. 5.
    Gibson J, Xie GG, Xiao Y. (2007) Performance limits of fair-access in sensor networks with linear and selected grid topologies. Global telecommunications conference, 2007. IEEE GLOBECOM ’07, 26–30 Nov 2007, pp 688–693Google Scholar
  6. 6.
    Karveli T, Voulgaris K, Ghavami M, Aghvami AH (2008) A collision-free scheduling scheme for sensor networks arranged in linear topologies and using directional antennas. Sensor technologies and applications, 2008. SENSORCOMM ’08. Second international conference on, 25–31 Aug 2008, pp 18–22Google Scholar
  7. 7.
    Wang H, Yang Y, Ma M, Wu D (2007) Network lifetime optimization by duality approach for single-source and single-sink topology in wireless sensor networks. Wireless and optical communications networks, 2007. WOCN ’07. IFIP international conference on, 2–4 July 2007, pp 1–7Google Scholar
  8. 8.
    Koutsakis P, Papadakis H (2006) Efficient medium access control for wireless sensor networks. Wireless pervasive computing, 2006 1st international symposium on, 16–18 Jan 2006Google Scholar
  9. 9.
    SAFESPOT Integrated Project. http://www.safespot-eu.org/
  10. 10.
    Maroti M (2004) Directed flood-routing framework for wireless sensor networks. Proceedings of the 5th ACM/IFIP/USENIX international conference on middleware, Toronto, Canada, 2004, pp 99–114Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Luca Bergesio
    • 1
    • 2
  • Mirko Franceschinis
    • 1
  • Maurizio Spirito
    • 1
  • Riccardo Tomasi
    • 1
  1. 1.Pervasive Radio Technologies LabIstituto Superiore Mario Boella (ISMB)TorinoItaly
  2. 2.Dipartimento di Automatica e Informatica (DAUIN)Politecnico di TorinoTorinoItaly

Personalised recommendations