Home // ICNS 2011, The Seventh International Conference on Networking and Services // View article

Dependable Routing Protocol Considering the k-Coverage Problem forWireless Sensor Networks

Authors:
Hamza Drid
Laszlo Gonczy
Samer Lahoud
Gabor Bergmann
Miklos Molnar

Keywords: Fault tolerance; Sensor Networks; k-coverage; Routing; Protection;

Abstract:
Fault tolerance and periodical changes of the network topology are two important attributes that should be carefully designed in Wireless Sensor Networks (WSN). In this paper we propose a new routing protocol for improving fault tolerance of WSN which takes into consideration the measurement accuracy requirements (expressed as a lower limit on k-coverage) and network performance. The main idea of the k-coverage problem is to schedule the sleeping time of sensors in order to preserve their energy and maximize network lifetime. The proposed routing protocol offers a protection against link and node failures by computing k disjoint paths. It also takes into account the changes of the network topology caused by the scheduling of sensor sleeping.

Pages: 223 to 227

Copyright: Copyright (c) IARIA, 2011

Publication date: May 22, 2011

Published in: conference

ISSN: 2308-4006

ISBN: 978-1-61208-133-5

Location: Venice/Mestre, Italy

Dates: from May 22, 2011 to May 27, 2011