Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Social net: using patterns of physical proximity over time to infer shared interests
CHI '02 Extended Abstracts on Human Factors in Computing Systems
CarNet: a scalable ad hoc wireless network system
EW 9 Proceedings of the 9th workshop on ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Hierarchical location service for mobile ad-hoc networks
ACM SIGMOBILE Mobile Computing and Communications Review
Social Serendipity: Mobilizing Social Software
IEEE Pervasive Computing
Detecting the presence of nodes in MANETs
Proceedings of the second ACM workshop on Challenged networks
| Hi-index | 0.00 |
In this paper we propose a distributed algorithm to detect whether a given node is present or absent in an adhoc 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.