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
CHR: A Distributed Hash Table for Wireless Ad Hoc Networks
ICDCSW '05 Proceedings of the Fourth International Workshop on Distributed Event-Based Systems (DEBS) (ICDCSW'05) - Volume 04
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
Middleware for pervasive computing: A survey
Pervasive and Mobile Computing
Benchmarking Peer-to-Peer Systems
GeoVanet: A routing protocol for query processing in vehicular networks
Mobile Information Systems
Hi-index | 0.00 |
Service discovery to search for a service available 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. In this paper, we propose an effective service discovery protocol which is based on the concept of peer-to-peer caching of service information and DHT-based forwarding of service requests to solve these problems. Neighboring information, such as services and power is shared not only through logical neighbors but also through physically nearby neighboring nodes. 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 results of the simulation show that our proposed scheme works very well on dynamic MANET.