A P2P Approach to Routing in Hierarchical MANETs

Abstract

We present an effective routing solution for the backbone of hierarchical MANETs. Our solution leverages the storage and retrieval mechanisms of a Distributed Hash Table (DHT) common to many (structured) P2P overlays. Th e DHT provides routing information in a decentralized fash ion, while supporting different forms of node and network mobility. We split a flat network into clusters, each having a gateway who participates in a DHT overlay. These g ateways interconnect the clusters in a backbone network. Two routing approaches for the backbone are explore d: floodi ng and a new solution exploit ing the storage and retrieval capabilities of a P2P overlay based on a DHT. We implement both approaches in a net work simulator and thoroughly evaluate th e performance of the proposed scheme using a range of stati c and mobile scenarios. We also compare our solution against flooding. The simulation results show that our solution, even in the presence of mobility, achieved well abo ve 90% success rates and maintained very low and constant round tr ip times, unlike the flooding approach. In fact, the performance of the proposed inter-cluster routing solution, in many cases, is comparable to the perfo rma nce of the intra-cluster routing case. The advantage of our proposed ap proach compared to flooding increases as the number of clusters increases, demonstrating the superior scalability of our proposed approach.