Adaptive Neighbor Selection for Service Discovery in Mobile Ad Hoc Networks

摘要

Service discovery to search for an available service in a mobile ad-hoc network is an important issue. Although mobile computing technologies grow ever more powerful and accessible, MANET, consisting of mobile devices without any fixed infrastructure, has such features as high mobility and resource constraints. Given these features, the costs of service discovery in mobile ad-hoc networks must be lower than those of service discovery in conventional fixed networks. In this paper, we design and evaluate a service discovery scheme to effectively discover services by using only local information in a mobile ad hoc network. Our service discovery protocol is based on the concept of peer-to-peer caching of service advertisement and node ID-based forwarding of service requests to solve these problems. Our protocol is that physical hop counts and the number of messages exchanged have been significantly reduced, since it does not require a central lookup server and does not rely on multicasting and flooding. The simulation results show that, in the proposed scheme, physical hop counts and the number of messages exchanged have been significantly reduced, compared with the other protocol.