Proof-of-Concept Implementation of the Ahoy Discovery Protocol for Ad-hoc Networks

The context discovery protocol Ahoy has been proposed ear- lier for resource-limited fully-distributed ad-hoc networks. Ahoy has been proven as an efficient context discovery pro- tocol, which generates only little network traffic, in both static and dynamic ad-hoc networks. In this report, we im- plement the prototype of Ahoy and test it on UNIX-like platforms. We show the possibility to implement Ahoy in the real world

Dynamic connectivity analysis of ABF-based ad-hoc networks

This paper evaluates the performance of a context discovery protocol using attenuated Bloom filters while nodes appear, disappear, and are temporary unreachable in ad-hoc networks through analytical analysis. Further we verified obtained results with simulation analysis. The analytical results are most accurate when node density is high. Further, we discover that adding a node generates less traffic than removing a node in our protocol. Some proposals are given to reduce the traffic generated by propagating updates due to removing a node