GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
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
An energy consumption model for performance analysis of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
When Peer-to-Peer comes Face-to-Face: Collaborative Peer-to-Peer Computing in Mobile Ad hoc Networks
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
PReCinCt: A Scheme for Cooperative Caching in Mobile Peer-to-Peer Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Efficient service cache management in mobile P2P networks
Future Generation Computer Systems
| Hi-index | 0.00 |
Mobile Peer-to-Peer (MP2P) networks consist of mobile devices that communicate with each other via short-range wireless transmissions to facilitate sharing of information among them. Such networks present a constrained communication environment due to fundamental limitations of battery power and wireless bandwidth, and usersý frequent mobility. These characteristics of MP2P networks make scalable data retrieval a challenging problem. In this paper, we propose a novel scheme, called Proximity Regions for Caching in Cooperative MP2P Networks (PReCinCt), to efficiently support scalable data retrieval in large-scale MP2P networks. In the PReCinCt scheme, the network topology is divided into geographical regions where each region is responsible for a set of keys representing the data. Each key is then mapped to a region location based on a geographical hash function. A geographic-aided routing protocol is used to route traffic of each data retrieval. In order to further save bandwidth for each data retrieval, PReCinCt incorporates a cooperative caching scheme that caches relevant data among a set of peers in a region. Simulation results show that the proposed scheme achieves significant improvements in average latency and energy consumption.