Home // ICSNC 2012, The Seventh International Conference on Systems and Networks Communications // View article

Finding Diverse Shortest Paths for the Routing Task in Wireless Sensor Networks

Authors:
Wilton Armando Henao Mazo
Ángel María Bravo Santos

Keywords: WSNs; Wireless Sensor Networks; K Shortest Paths; Diverse Paths.

Abstract:
Wireless Sensor Networks are deployed with the idea of collecting field information of different variables like temperature, position, humidity, etc., from several resource constrained sensor nodes, and then relay those data to a sink node or base station. Therefore, the path finding for routing must be carried out with strategies that make it possible to manage efficiently the network limited resources, whilst at the same time the network throughput is kept within appreciable levels. Many routing schemes search for one path, with low power dissipation that may not be convenient to increase the network lifetime and long-term connectivity. In an attempt to overcome such eventualities, we proposed a scenario for relaying that uses multiple diverse paths obtained considering the links among network nodes, that could provide reliable data transmission. When data is transmitted across various diverse paths in the network that offer low retransmission rates, the battery demand can be decreased and network lifetime is extended. We show, by using simulations, that the reliability in packets reception and the power dissipation that our scheme offers compare favourably with similar literature implementations.

Pages: 53 to 58

Copyright: Copyright (c) IARIA, 2012

Publication date: November 18, 2012

Published in: conference

ISSN: 2163-9027

ISBN: 978-1-61208-231-8

Location: Lisbon, Portugal

Dates: from November 18, 2012 to November 23, 2012