A d-Tree Based P2P-Like Routing Algorithm for Mobile Ad-Hoc Networks

Peer-To-Peer (P2P) and Mobile Ad hoc Networks (MANETs) share the same key concepts of self-organization and decentralization, and both aim to provide connectivity in a completely decentralized manner. Routing algorithms for MANETs can potentially benefit from the combination with P2P overlay routing algorithms. Some efforts have been made to integrate P2P overlay into MANETs, but all work is based on symmetric topology. In this paper, we propose the d-tree based source routing algorithm for MANETs, which organizes mobile nodes into an asymmetric topology, and employs DHT-based route discovery and maintenance to improve routing efficiency. Simulation results show that our proposal achieves better packet delivery ratios with significantly lower routing overhead.