Adapting dynamically neighbourhood table entry lifetime in wireless sensor networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Adapting dynamically neighbourhood table entry lifetime in wireless sensor networks

Résumé

Neighbour discovery and maintenance of neighbourhood tables have importance in wireless sensor networks. Almost every upper layer application such as routing or self-organizing relies on neighbourhood tables. Imprecise tables may lead to failures that may be costly in terms of resources which are very limited in such networks. Neighbourhood tables are achieved thanks to the Hello protocol. Several studies propose smart schemes to dynamically adapt the frequency of Hello messages but none of them investigates the way the refreshment period of entries in table should be adapted. In this paper, we introduce the Neighbourhood Lifetime Algorithm (NLA), the very first algorithm that adapts dynamically the refreshment period of entries in neighbourhood tables, based on the speed of node and the frequency of the Hello message. Our simulation results show and demonstrate the efficiency of NLA and its high performance to keep neighbourhood tables consistent
Fichier principal
Vignette du fichier
NLA.pdf (362.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00553264 , version 1 (06-01-2011)

Identifiants

  • HAL Id : hal-00553264 , version 1

Citer

Ahmad Ahmad Kassem, Nathalie Mitton. Adapting dynamically neighbourhood table entry lifetime in wireless sensor networks. Proc. 10th International Conference on Wireless Communications and Signal Processing, Oct 2010, China. pp.000. ⟨hal-00553264⟩
213 Consultations
164 Téléchargements

Partager

Gmail Facebook X LinkedIn More