On the impact of network dynamics on a discovery protocol for ad-hoc networks

A very promising approach to discovering services and context information in ad-hoc networks is based on the use of Attenuated Bloom filters. In this paper we analyze the impact of changes in the connectivity of an ad-hoc network on this approach. We evaluate the performance of the discovery protocol while nodes appear, disappear, and move, through analytical and simulative analysis. The analytical results are shown to be accurate when node density is high. We show that an almost linear relation exists between the density of the network and the number of update messages to be exchanged. Further, in case of nodes moving, the number of messages exchanged does not increase with the speed of movement.