Skip to main content
SpringerLink
Log in

MobiStore: A system for efficient mobile P2P data sharing

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

MobiStore is a P2P data store for decentralized mobile computing, designed to achieve high availability and load balance. As P2P platforms, mobile devices connected to the Internet through WiFi or cellular networks are different from wired devices in two main aspects: (1) higher churn due to mobility, weak wireless signals, or battery constraints, and (2) significant variability in bandwidth and latency based on the point of attachment. These problems affect the stored content availability and skew the content serving load over the peers. MobiStore structures the mobile P2P network into clusters of redundant peers. The topology uses both algorithmically-defined and random edges among the peers of different clusters. The routing information is updated using a gossip-based protocol. Thus, MobiStore achieves, with high probability, O(1) lookup operations despite high churn and link variability. Inside the clusters, all peers replicate the content, which improves the content availability. Furthermore, based on the current load, MobiStore dynamically changes the number of peers inside the clusters and routes content request to randomly selected peers. These two dynamic techniques along with using consistent hashing to map content to peers balance the load over the peers. While some of these techniques are well known, the main contribution is on the novel ways of applying them to design and implement an efficient mobile P2P data store. Simulation results show MobiStore achieves an availability, i.e., lookup success rate, between 12–48 % higher than two baseline systems built over the MR-Chord and Chord P2P protocols; and it reduces the latency up to 9 times compared to these protocols. Finally, the results show MobiStore adapts to churn and workload to evenly distribute the requests across clusters and peers better than both baseline solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Notes

  1. MRChord is a very recent version of Chord that targets mobile peers.

References

  1. A mobility scenario generation and analysis tool (2016). http://sys.cs.uos.de/bonnmotion/

  2. Araujo F, Rodrigues L, Kaiser J, Liu C, Mitidieri C (2005) Chr: a distributed hash table for wireless ad hoc networks. In: 25th IEEE international conference on distributed computing systems workshops, 2005. IEEE, pp 407–413

  3. Binzenhofer A, Staehle D, Henjes R (2005) On the stability of chord-based p2p systems. In: Global telecommunications conference, 2005. GLOBECOM’05, vol 2. IEEE, pp 5–pp

  4. Caesar M, Castro M, Nightingale EB, O’Shea G, Rowstron A (2006) Virtual ring routing: network routing inspired by dhts. In: ACM SIGCOMM computer communication review, vol 36. ACM, pp 351–362

  5. Cao H, Wolfson O, Xu B, Yin H (2005) Mobi-dic: Mobile discovery of local resources in peer-to-peer wireless network. IEEE Data Eng Bull 28(3):11–18

    Google Scholar 

  6. Cao Q, Fujita S (2010) Load balancing schemes for a hierarchical peer-to-peer file search system. In: International conference on P2P, parallel, grid, cloud and internet computing (3PGCIC), 2010. IEEE, pp 63–70

  7. Chakravorty R, Agarwal S, Banerjee S, Pratt I (2005) Mob: a mobile bazaar for wide-area wireless services. In: Proceedings of the 11th annual international conference on mobile computing and networking. ACM, pp 228–242

  8. Druschel P, Rowstron A (2001) Past: a large-scale, persistent peer-to-peer storage utility. In: Proceedings of the 8th workshop on hot topics in operating systems, 2001. IEEE, pp 75– 80

  9. Erd6s P, Rényi A (1960) On the evolution of random graphs. Publ Math Inst Hungar Acad Sci 5:17–61

  10. Fitchard K (2012) Can cell phone data cure society’s ills? http://gigaom.com/2012/03/11/10-ways-big-data-is-changing-everything/8/

  11. Gupta I, Birman K, Linga P, Demers A, Van Renesse R (2003) Kelips: Building an efficient and stable p2p dht through increased memory and background overhead. In: Peer-to-peer systems II. Springer, pp 160–169

  12. Hofstatter Q, Zols S, Michel M, Despotovic Z, Kellerer W (2008) Chordella-a hierarchical peer-to-peer overlay implementation for heterogeneous, mobile environments. In: 8th international conference on peer-to-peer computing, 2008. P2P’08. IEEE, pp 75– 76

  13. Horozov T, Grama A, Vasudevan V, Landis S (2002) Moby-a mobile peer-to-peer service and data network. In: Proceedings of international conference on parallel processing, 2002. IEEE, pp 437–444

  14. Jiang W, Xu C, Huang M, Lai J, Xu S (2011) Improved chord algorithm in mobile peer-to-peer network

  15. Karthik BG, Lakshminarayanan K, Surana S, Karp R, Stoica I (2004) Load balancing in dynamic structured p2p systems. In: Proceedings of IEEE INFOCOM. Citeseer, Hong Kong

  16. Kubiatowicz J, Bindel D, Chen Y, Czerwinski S, Eaton P, Geels D, Gummadi R, Rhea S, Weatherspoon H, Weimer W, et al. (2000) Oceanstore: an architecture for global-scale persistent storage. ACM Sigplan Notices 35(11):190– 201

    Article  Google Scholar 

  17. Landsiedel O, Lehmann KA, Wehrle K (2005) T-dht: topology-based distributed hash tables. In: 5th IEEE international conference on peer-to-peer computing, 2005. P2P 2005. IEEE, pp 143–144

  18. Lee JW, Schulzrinne H, Kellerer W, Despotovic Z (2009) mdht: multicast-augmented dht architecture for high availability and immunity to churn. In: 6th IEEE consumer communications and networking conference, 2009. CCNC 2009 . IEEE, pp 1–5

  19. Lee U, Lee J, Park JS, Gerla M (2010) Fleanet: a virtual market place on vehicular networks. IEEE Trans Veh Technol 59(1):344–355

    Article  Google Scholar 

  20. Liquori L, Tedeschi C, Vanni L, Bongiovanni F, Ciancaglini V, Marinković B (2010) Synapse: a scalable protocol for interconnecting heterogeneous overlay networks. In: NETWORKING 2010. Springer, pp 67–82

  21. Liu CL, Wang CY, Wei HY (2010) Cross-layer mobile chord p2p protocol design for vanet. Int J Ad Hoc Ubiquitous Comput 6(3):150–163

    Article  Google Scholar 

  22. Montresor A, Jelasity M (2009) PeerSim: a scalable P2P simulator. In: Proceedings of the 9th international conference on peer-to-peer (P2P’09), Seattle, pp 99–100

  23. Mordacchini M, Ricci L, Ferrucci L, Albano M, Baraglia R (2010) Hivory: Range queries on hierarchical voronoi overlays. In: IEEE 10th international conference on peer-to-peer computing (P2P), 2010. IEEE, pp 1–10

  24. Orf D. (2014) So whatever happened to post-pc? http://www.gizmodo.in/gadgets/So-Whatever-Happened-to-Post-PC/articleshow/40069551.cms

  25. Pásztor B, Musolesi M, Mascolo C (2007) Opportunistic mobile sensor data collection with scar. In: IEEE international conference on mobile Adhoc and sensor systems, 2007. MASS 2007. IEEE, pp 1–12

  26. Rao A, Lakshminarayanan K, Surana S, Karp R, Stoica I (2003) Load balancing in structured p2p systems. In: Peer-to-peer systems II. Springer, pp 68–79

  27. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, SIGCOMM ’01. ACM, New YOrk, pp 161–172

  28. Ratnasamy S, Karp B, Yin L, Yu F, Estrin D, Govindan R, Shenker S (2002) Ght: a geographic hash table for data-centric storage. In: Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications. ACM, pp 78– 87

  29. Rhea S, Geels D, Roscoe T, Kubiatowicz J (2004) Handling churn in a dht, Boston, pp 127–140

  30. Rowstron A, Druschel P (2001) Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Middleware 2001. Springer, pp 329–350

  31. Rybicki J, Scheuermann B, Koegel M, Mauve M (2009) Peertis: a peer-to-peer traffic information system. In: Proceedings of the 6th ACM international workshop on vehiculAr InterNETworking. ACM, pp 23–32

  32. Shaker A, Reeves DS (2005) Self-stabilizing structured ring topology p2p systems. In: 5th IEEE international conference on peer-to-peer computing, 2005. P2P 2005. IEEE, pp 39– 46

  33. Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, Balakrishnan H (2003) Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans on Netw 11(1):17–32

    Article  Google Scholar 

  34. Waal M (2010) Mobile phones, social networks and location data: recognizing the nuances of privacy. http://www.themobilecity.nl/2010/06/10/mobile-phones-social-networks-and-location-data-recognizing-the-nuances-of-privacy/

  35. Woungang I, Tseng FH, Lin YH, Chou LD, Chao HC, Obaidat MS (2014) Mr-chord: Improved chord lookup performance in structured mobile p2p networks (99):1–9

  36. Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz JD (2004) Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Areas Commun 22(1):41– 53

    Article  Google Scholar 

  37. Zulhasnine M, Huang C, Srinivasan A (2012) Towards an effective integration of cellular users to the structured peer-to-peer network. Peer-to-Peer Netw Appl 5(2):178–192

    Article  Google Scholar 

Download references

Acknowledgments

This research was supported by the National Science Foundation (NSF) under Grants No. CNS 1409523 and DGE 1565478, and the National Security Agency (NSA) under Grant H98230-15-1-0274. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of NSF and NSA. The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notice herein.

Author information

Authors and Affiliations

  1. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ, USA

    Mohammad A Khan & Cristian Borcea

  2. Department of Computer Science, University of Versailles Saint-Quentin-en-Yvelines, Versailles, France

    Laurent Yeh & Karine Zeitouni

Authors
  1. Mohammad A Khan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laurent Yeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Karine Zeitouni
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Cristian Borcea
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammad A Khan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khan, M.A., Yeh, L., Zeitouni, K. et al. MobiStore: A system for efficient mobile P2P data sharing. Peer-to-Peer Netw. Appl. 10, 910–924 (2017). https://doi.org/10.1007/s12083-016-0450-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-016-0450-7

Keywords

Search

Navigation