Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Ad Hoc Wireless Networks: Protocols and Systems
Ad Hoc Wireless Networks: Protocols and Systems
Proactive Power-Aware Cache Management for Mobile Computing Systems
IEEE Transactions on Computers
Allia: alliance-based service discovery for ad-hoc environments
WMC '02 Proceedings of the 2nd international workshop on Mobile commerce
Service Location Protocol: Automatic Discovery of IP Network Services
IEEE Internet Computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Supporting Cooperative Caching in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Toward Distributed Service Discovery in Pervasive Computing Environments
IEEE Transactions on Mobile Computing
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
| Hi-index | 0.00 |
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.