Node presence detection with reduced overhead

In this paper we propose a distributed algorithm to detect whether a given node is present or absent in an ad-hoc network. This information is valuable since many proposed protocols and applications for MANETs exhibit worst-case behavior when an intended communication partner is currently not presen...

Full description

Saved in:
Bibliographic Details
Published in2009 Sixth International Conference on Wireless On-Demand Network Systems and Services pp. 37 - 44
Main Authors Tran, T.M.C., Scheuermann, B., Mauve, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.02.2009
Subjects
Ad hoc networks
Algorithm design and analysis
Analytical models
Costs
Data structures
Distributed algorithms
Mobile ad hoc networks
Mobile communication
Routing protocols
Yield estimation
Online AccessGet full text

Cover

More Information
Summary:In this paper we propose a distributed algorithm to detect whether a given node is present or absent in an ad-hoc network. This information is valuable since many proposed protocols and applications for MANETs exhibit worst-case behavior when an intended communication partner is currently not present. Our distributed algorithm improves upon existing approaches to presence detection by significantly reducing the overhead that is required to decide whether a node is present: a reduction by 70-80% is well possible. We describe the proposed algorithm and assess its properties both analytically and through simulation.
DOI:10.1109/WONS.2009.4801831