Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks
WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Performance analysis of mobility-assisted routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE Communications Surveys & Tutorials
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
IEEE Communications Magazine
| Hi-index | 0.00 |
Recently, popularity of multimedia content sharing among the Internet users and development of wireless mobile devices have promoted a trend of deploying Peer-to-Peer (P2P) networks over mobile ad hoc networks (MANETs) for mobile content distribution. However, due to limited radio transmission range, sporadic node densities and power limitations, MANETs may become intermittently connected thereby disrupting such mobile content distribution. Even though, various content delivery schemes have been proposed in the literature to resolve such underlying intermittent connectivity, another key issue for P2P content distribution networks i.e., how to search or lookup the interested contents in intermittently connected MANETs (ICMANs) context, is not investigated. With this in mind, this paper deploys a fully decentralized unstructured P2P network over ICMANs and accordingly introduces epidemic content search mechanism to discover the interested contents based on the related keywords. Note that the mobility and storage space of the mobile peers are exploited here to diffuse the content search requests. Moreover, to improve the efficiency under the restricted storage space conditions, a utility-based buffer management policy is presented. By evaluating each possible search request based on the relevant information such as mobility statistics, the requests with lower evaluated values are accordingly discarded when the buffer is full. Simulation results demonstrate the enhanced service performance offered by epidemic P2P content search scheme with utility-based buffer management policy.