Skip to Main content Skip to Navigation
Conference papers

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

Hamza Drid 1 Laszlo Gonczy 2 Samer Lahoud 1 Gabor Bergmann 2 Miklós Molnár 3
1 ATNET - Advanced Technolgy in Networking
IRISA-D2 - RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES
3 MAORE - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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.
Document type :
Conference papers
Complete list of metadata

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00652453
Contributor : Miklos Molnar <>
Submitted on : Wednesday, April 14, 2021 - 10:17:05 AM
Last modification on : Tuesday, June 15, 2021 - 4:16:49 PM
Long-term archiving on: : Thursday, July 15, 2021 - 6:13:33 PM

File

icns_2011_11_40_10160.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00652453, version 1

Citation

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⟩

Share

Metrics

Record views

491

Files downloads

16