Dependable Routing Protocol Considering the k-Coverage Problem for Wireless Sensor Networks - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Conference Papers Year : 2011

Dependable Routing Protocol Considering the k-Coverage Problem for Wireless Sensor Networks

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.
Fichier principal
Vignette du fichier
icns_2011_11_40_10160.pdf (676.72 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-00652453 , version 1 (14-04-2021)

Identifiers

  • HAL Id : lirmm-00652453 , version 1

Cite

Hamza Drid, Laszlo Gonczy, Samer Lahoud, Gabor Bergmann, Miklós Molnár. Dependable Routing Protocol Considering the k-Coverage Problem for Wireless Sensor Networks. ICNS: International Conference on Networking and Services, May 2011, Venezia, Italy. ⟨lirmm-00652453⟩
287 View
32 Download

Share

More