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
2 BME - Budapest University of Technology and Economics [Budapest]
3 MAORE - Methods, Algorithms for Operations REsearch

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.

Mots clés: WSN; Routing; Power; Fault tolerance; Sensor Networks; k-coverage; Protection

Domaines: Réseaux et télécommunications [cs.NI]

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⟩