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 : The paper talk about a suitable and dependable routing protocol for Wireless Sensor Networks (WSN). The specificity of the proposition is that the WSN is scheduled to ensure the k-coverage of a given area and the routing protocol must be based on the momentary available sensors.
Keywords : WSN Routing Power
Document type :
Conference papers
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00652453
Contributor : <>
Submitted on : Thursday, December 15, 2011 - 4:15:46 PM
Last modification on : Wednesday, March 27, 2019 - 11:20:08 AM

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

382