MANET adaptive structured P2P overlay

Authors: Nadir Shah Depei Qian Rui Wang

Publish Date: 2011/11/17

Volume: 5, Issue: 2, Pages: 143-160

PDF Link

Abstract

This paper presents an efficient structured P2P overlay over MANET which better matches to the physical network in term of routing This feature is achieved by locally building up the minimumspanning tree MST at each peer using the information of the peer’s logical neighbors which are either directly connected 1hop or 2hops away Using this interconnection structure among the peers we design a new algorithm to distribute the contents information in the overlay by partitioning the identifier ID space among the peers In this algorithm each peer maintains a disjoint portion of the ID space The ID space at a peer may be noncontiguous and each contiguous part is consecutive to the ID space of its directly connected neighbor peers To route the filelookup query each peer builds up a binary search tree BST using the knowledge of the ID space of itself and of its directly connected neighbor peers Simulation results show that our approach outperforms the existing approaches in term of routing overhead average filediscovery delay falsenegative ratio and average pathstretch value

Keywords: