An architecture for a secure service discovery service
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The design and implementation of an intentional naming system
Proceedings of the seventeenth ACM symposium on Operating systems principles
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
The effect of mobility on local service discovery in the ahoy ad-hoc network system
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
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
| Hi-index | 0.03 |
A protocol for service discovery using attenuated Bloom filters has been proposed for ad-hoc networks. Based on our study, it can well save network bandwidth compared to conventional approaches. We have built both an analytical model and a simulation model to evaluate the performance of our novel discovery mechanism. A comparison of these two models shows that the analytical model yields very accurate results. Further, an extension to the discovery protocol is introduced, and shown to yield significant performance gains. Finally, the impact of node mobility on the performance of our discovery mechanism is evaluated, and shown to be moderate.