Adapting dynamically neighbourhood table entry lifetime in wireless sensor networks
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.
Ahmad Ahmad-Kassem Nathalie Mitton
Universit′e de Lyon, INRIA, INSA-Lyon, CITI INRIA Lille-Nord Europe, Univ.Lille 1, CNRS INRIA Lille-Nord Europe, Univ.Lille 1, CNRS
国际会议
上海
英文
1-6
2010-10-20（万方平台首次上网日期，不代表论文的发表时间）