An adaptive low-overhead resource discovery protocol for mobile ad-hoc networks
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.
mobile ad-hoc network (manet) service discovery peer-to-peer networks