Crowdsourcing: Dynamic Data Management in Mobile P2P Networks

For realizing such crowdsourcing-related M-P2P applications, dynamic data management becomes a necessity to improve data availability, given the mobility and fragile wireless connections that connect resource-constrained mobile devices. Moreover, unlike in the case of traditional environments such as clusters, free-riding is a major issue for M-P2P environments, thereby implying that economic models may play a better role in incentivizing peers to collaborate for data discovery and management. Furthermore, traditional methods of data management in mobile environments generally consider only single-hop client-server communication. On the other hand,in M-P2P networks, the network communication is multihop and mobile devices can collect real-time data. Finally, privacy issues need to be addressed effectively to prevent location-based service providers from misusing users' location information.

[1]  Anirban Mondal,et al.  An economic incentive model for encouraging peer collaboration in mobile-P2P networks with support for constraint queries , 2009, Peer-to-Peer Netw. Appl..

[2]  Takahiro Hara,et al.  A Data Reception Method to Reduce Interruption Time in P2P Streaming Environments , 2010, 2010 13th International Conference on Network-Based Information Systems.

[3]  A. Prasad Sistla,et al.  An economic model for resource exchange in mobile peer to peer networks , 2004, Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004..

[4]  Philip S. Yu,et al.  Transportation mode detection using mobile phones and GIS information , 2011, GIS.

[5]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[6]  Guohong Cao,et al.  Distributed Maintenance of Cache Freshness in Opportunistic Mobile Networks , 2012, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

[7]  David V. Keyson,et al.  The human side of sharing in peer-to-peer networks , 2004, EUSAI '04.

[8]  Marco Gruteser,et al.  USENIX Association , 1992 .

[9]  Narottam Chand,et al.  Supporting cooperative caching in mobile ad hoc networks using clusters , 2006, Int. J. Ad Hoc Ubiquitous Comput..

[10]  Anirban Mondal,et al.  EcoTop: An Economic Model for Dynamic Processing of Top-k Queries in Mobile-P2P Networks , 2011, DASFAA.

[11]  Naphtali Rishe,et al.  Qualitative Analysis of Commercial Social Network Profiles , 2010, Handbook of Social Network Technologies.

[12]  Chi-Yin Chow,et al.  Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks , 2010, 2010 Eleventh International Conference on Mobile Data Management.

[13]  Naphtali Rishe,et al.  Benefit and Pricing of Spatio-Temporal Information in Mobile Peer-to-Peer Networks , 2006, Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06).

[14]  Minho Shin,et al.  Anonysense: privacy-aware people-centric sensing , 2008, MobiSys '08.

[15]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[16]  Jon Crowcroft,et al.  Modelling incentives for collaboration in mobile ad hoc networks , 2004, Perform. Evaluation.

[17]  Klara Nahrstedt,et al.  iPass: an incentive compatible auction scheme to enable packet forwarding service in MANET , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[18]  Wang-Chien Lee,et al.  Collaborative caching for spatial queries in Mobile P2P Networks , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[19]  Thomas F. La Porta,et al.  Data replication in mobile tactical networks , 2011, 2011 - MILCOM 2011 Military Communications Conference.

[20]  Guohong Cao,et al.  Supporting Cooperative Caching in Disruption Tolerant Networks , 2011, 2011 31st International Conference on Distributed Computing Systems.

[21]  Liang Hu.  Optimal Distributed Caching for Mobile Peer-to-Peer Content Distribution , 2011, 2011 IEEE Vehicular Technology Conference (VTC Fall).

[22]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[23]  Tim Kraska,et al.  CrowdDB: answering queries with crowdsourcing , 2011, SIGMOD '11.

[24]  Jie Lin,et al.  Parking slot assignment games , 2011, GIS.

[25]  Chi-Yin Chow,et al.  Privacy in location-based services: a system architecture perspective , 2009, SIGSPACIAL.

[26]  Anirban Mondal,et al.  E-ARL: An Economic incentive scheme for Adaptive Revenue-Load-based dynamic replication of data in Mobile-P2P networks , 2010, Distributed and Parallel Databases.

[27]  Vikram Srinivasan,et al.  Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[28]  Guohong Cao,et al.  Supporting cooperative caching in ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[29]  Alec Wolman,et al.  Enabling new mobile applications with location proofs , 2009, HotMobile '09.

[30]  Bruno Richard,et al.  Clique: A Transparent, Peer-to-Peer Replicated File System , 2003, Mobile Data Management.

[31]  Walid G. Aref,et al.  Casper*: Query processing for location services without compromising privacy , 2006, TODS.

[32]  John Krumm,et al.  Inference Attacks on Location Tracks , 2007, Pervasive.