3D P2P overlay over MANETs
We study the challenging problems of the mismatch between the overlay and the physical network and the resilience of the overlay structure in peer-to-peer (P2P) protocols over a mobile ad hoc network (MANET). Existing P2P protocols have used inflexible overlay structures to arrange peers and do not consider intra-neighbor relationships of peers when assigning logical identifiers. The intra-neighbor relationships of peers are crucial to exactly interpret the physical proximity of peers in an overlay and to avoid the mismatch between the overlay and the physical network that causes extensive routing overhead, larger average file discovery delay, increased false-negative ratio, and high average path-stretch. In this paper, we present a novel P2P overlay over MANETs that exploits a 3-dimensional overlay and 3D space that takes into account the physical intra-neighbor relationship of a peer and exploits a 3D-overlay to interpret that relationship. In the proposed protocol, each peer runs a distributed algorithm that exploits a 3D-overlay to calculate a consecutive logical identifier to a peer. Moreover, the protocol utilizes the 3D-overlay to maintain multi-paths to a destination peer that provides resilience against a node/link failure. Simulation results show that the proposed 3D-overlay outperforms the existing P2P overlay protocol in terms of routing overhead, average file-discovery delay, false-negative ratio, and average path-stretch.
3d p2p overlays manets distributed hash tables distributed systems content sharing