TY - GEN
T1 - A Multipath Routing Algorithm for Mobile Wireless Sensor Networks
AU - Segal, A.
N1 - Place of conference:Hungary
PY - 2010
Y1 - 2010
N2 - Providing reliable and yet energy efficient routing protocols is of an utmost importance in Wireless Sensor Networks. Wireless Sensor Networks imply multi-hop data forwarding over unreliable and moving nodes. When selecting the appropriate routing paradigm, the main challenge is to find the right equilibrium between the quality of data delivery and the energy invested. Insufficient quality of data delivery may fail the application deployed over the wireless sensor network, while an energy wasteful protocol may significantly shorten the lifetime of the network, thus making the deployment inefficient for its purpose. In this paper we propose a new routing algorithm for WSN's, named the Data Centric Braided Multipath (DCBM) algorithm. The algorithm is designed to achieve and maintain route resiliency through multiple interleaving routing paths, capable to cope with node mobility. Simulations show that the algorithm maintains a delivery ratio similar to the previously suggested protocols, but requires significantly lower control packet overhead. The algorithm has several additional desirable properties, like loop reduction and localized path repair.
AB - Providing reliable and yet energy efficient routing protocols is of an utmost importance in Wireless Sensor Networks. Wireless Sensor Networks imply multi-hop data forwarding over unreliable and moving nodes. When selecting the appropriate routing paradigm, the main challenge is to find the right equilibrium between the quality of data delivery and the energy invested. Insufficient quality of data delivery may fail the application deployed over the wireless sensor network, while an energy wasteful protocol may significantly shorten the lifetime of the network, thus making the deployment inefficient for its purpose. In this paper we propose a new routing algorithm for WSN's, named the Data Centric Braided Multipath (DCBM) algorithm. The algorithm is designed to achieve and maintain route resiliency through multiple interleaving routing paths, capable to cope with node mobility. Simulations show that the algorithm maintains a delivery ratio similar to the previously suggested protocols, but requires significantly lower control packet overhead. The algorithm has several additional desirable properties, like loop reduction and localized path repair.
UR - https://scholar.google.co.il/scholar?q=A+Multipath+Routing+Algorithm+for+Mobile+Wireless+Sensor+Networks&btnG=&hl=en&as_sdt=0%2C5
M3 - Conference contribution
BT - Wireless and Mobile Networking Conference (WMNC), 2010 Third Joint IFIP
PB - IEEE
ER -