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 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.

[1]  Lars Erik Holmquist,et al.  Supporting group collaboration with interpersonal awareness devices , 1999, Personal Technologies.

[2]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Darren Leigh,et al.  Social net: using patterns of physical proximity over time to infer shared interests , 2002, CHI Extended Abstracts.

[4]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[5]  Alex Pentland,et al.  Social serendipity: mobilizing social software , 2005, IEEE Pervasive Computing.

[6]  Martin Mauve,et al.  Detecting the presence of nodes in MANETs , 2007, CHANTS '07.

[7]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[8]  Oliver P. Waldhorst,et al.  Effective Dissemination of Presence Information in Highly Partitioned Mobile Ad Hoc Networks , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[9]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[10]  Jörg Widmer,et al.  Hierarchical location service for mobile ad-hoc networks , 2004, MOCO.

[11]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[12]  Robert Tappan Morris,et al.  CarNet: a scalable ad hoc wireless network system , 2000, ACM SIGOPS European Workshop.