Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Universal classes of hash functions (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Efficient Service Discovery forWireless Mobile Ad Hoc Networks
AICCSA '06 Proceedings of the IEEE International Conference on Computer Systems and Applications
Proximity-based service discovery in mobile ad hoc networks
DAIS'05 Proceedings of the 5th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
Analysis of decentralized resource and service discovery mechanisms in wireless multi-hop networks
WWIC'05 Proceedings of the Third international conference on Wired/Wireless Internet Communications
Modeling service discovery in ad-hoc networks
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
Hi-index | 0.00 |
Ahoy, a protocol to perform local service discovery in ad-hoc networks is described in this paper. The protocol has been implemented in a discrete-event simulator to study its performance in case of a multihop mobile adhoc network. Especially the effect of mobility on the network load and the probability of finding services is investigated. Experiments show that the load caused by advertisement messages is very low, even when the mobility is increasing. For low speeds the percentage of found services is close to the maximum possible, while even at high speeds the probability of finding a service is still reasonable.