Performance Evaluation of Routing Protocols in WSNs Arranged in Linear Topologies

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.