PeopleNet: engineering a wireless virtual social network

People often seek information by asking other people even when they have access to vast reservoirs of information such as the Internet and libraries. This is because people are great sources of unique information, especially that which is location-specific, community-specific and time-specific. Social networking is effective because this type of information is often not easily available anywhere else. In this paper, we conceive a wireless virtual social network which mimics the way people seek information via social networking. PeopleNet is a simple, scalable and low-cost architecture for efficient information search in a distributed manner. It uses the infrastructure to propagate queries of a given type to users in specific geographic locations, called bazaars. Within each bazaar, the query is further propagated between neighboring nodes via peer-to-peer connectivity until it finds a matching query. The PeopleNet architecture can overlay easily on existing cellular infrastructure and entails minimal software installation. We identify three metrics for system performance: (i) probability of a match, (ii) time to find a match and (iii) number of matches found by a query. We describe two simple models, called the swap and spread models, for query propagation within a bazaar. We qualitatively argue that the swap model is better with respect to the performance metrics identified and demonstrate this via simulations. Next, we compute analytically the probability of match for the swap model. We show that the probability of match can be significantly improved if, prior to swapping queries, the nodes exchange some limited information about their buffer contents. We propose a simple greedy algorithm which uses this limited information to decide which queries to swap. We show via simulation that this algorithm achieves significantly better performance. Overall our results demonstrate that PeopleNet, with its bazaar concept and peer-to-peer query propagation, can provide a simple and efficient mechanism for seeking information.

[1]  W. Szpankowski,et al.  Yet Another Application of a Binomial Recurrence , 1988 .

[2]  Henning Schulzrinne,et al.  Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices , 2001, MobiHoc '01.

[3]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[4]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[5]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

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

[7]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[8]  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).

[9]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[10]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[11]  Sanjay Shakkottai,et al.  Asymptotics of query strategies over a sensor network , 2004, IEEE INFOCOM 2004.

[12]  Eyal de Lara,et al.  User mobility for opportunistic ad-hoc networking , 2004, Sixth IEEE Workshop on Mobile Computing Systems and Applications.

[13]  Hector Garcia-Molina,et al.  Efficient search in peer to peer networks , 2004 .

[14]  Eytan Modiano,et al.  Capacity and delay tradeoffs for ad hoc mobile networks , 2004, IEEE Transactions on Information Theory.

[15]  Wojciech Szpankowski,et al.  Yet another application of a binomial recurrence order statistics , 1990, Computing.