STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
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
Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks
WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
From Pastry to CrossROAD: CROSS-Layer Ring Overlay for AD Hoc Networks
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
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
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Mobile Service Discovery Protocol (MSDP) for Mobile Ad-Hoc Networks
ISADS '07 Proceedings of the Eighth International Symposium on Autonomous Decentralized Systems
On Using Peer-to-Peer Communication in Cellular Wireless Data Networks
IEEE Transactions on Mobile Computing
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper we propose a Distributed Hash Table (DHT)-based peer-to-peer resource discovery protocol designed for large-scale Mobile Ad-hoc NETwork (MANET). The proposed Mobile Resource Discovery Protocol (MRDP) uses a distributed dynamic clustering algorithm to adaptively and rapidly group nodes in a MANET for resource discovery purpose, and utilizes DHTs to efficiently cache resource information in a peer-to-peer manner. We provide a probabilistic lower bound on the performance of the MRDP. We also present simulation results under different scenarios to show that MRDP has low message overheads and its performance is highly insensitive to the size of the MANET. These characteristics make MRDP suitable for large-scale MANETs.