Efficient Resource Discovery in Mobile Ad Hoc Networks

The highly dynamic nature of infrastructureless ad- hoc networks poses new challenges during resource discovery. In this paper, we propose a novel algorithm for resource discovery in mobile ad hoc networks called Efficient Resource-Discovery (ERD). When proposing this novel algorithm, our primary goal is to spread the most relevant resources and queries to the nodes in the network. The proposed algorithm ERD is very efficient in dynamically ranking resources and queries based on their priority, selecting the transmission time, and determining how many resources and queries are to be transmitted. ERD utilizes the network bandwidth in an optimal manner avoiding the spread of redundant data in the network, which otherwise can significantly overload the network with duplicate copies. We compare ERD with periodic flooding and rank based broadcast (RBB) algorithms for mobile ad hoc networks. Results show that ERD outperforms both these algorithms significantly.