Efficient Routing in Mobile Ad-Hoc Social Networks

Abstract

Efficient routing in large-scale P2P applications over mobile networks is a challenge. Such networks are formed by clusters of nodes, representing a community of interest, joining with other clusters, establishing a two-tiered hierarchical network. An example application in such a network would be P2PSIP to enable P2P Voice-over-Internet Protocol (VoIP) or other media services. Mobile Ad-hoc Networks (MANETs) are a logical choice to model such a network as a MANET is also inherently a P2P network where each node moves from one place to another independently, joins and leaves the network as it wishes. In this paper, we present our design to enable efficient routing in such a two-tiered network. Each cluster is represented by a single MANET, connected through a backbone. Nodes can join and leave MANETs, and whole clusters can join and leave the network or split and merge, so our design needs to address both node and network mobility. Unlike previous solutions, our approach is based on the use of a distributed hash table (DHT) to support routing in the network backbone, while individual MANETs may employ any MANET routing protocol of their choice, such as OLSR or ADOV. Efficiently providing the functionality of a DHT in a highly mobile network such as a MANET is challenging. We review some of the issues that arise in this context and identify potential candidate protocols. Through extensive simulations, using OMNeT++, we show that one of the protocols in particular, OneHopOverlay4MANET, is a promising choice to support backbone routing in our architecture. Compared to alternative choices, it maintains good performance at low overhead costs even under highly dynamic network topologies.