Please use this identifier to cite or link to this item: https://doi.org/10.1145/1080829.1080855
Title: PeopleNet: Engineering a wireless virtual social network
Authors: Motani, M. 
Srinivasan, V. 
Nuggehalli, P.S.
Keywords: Social Networking
Wireless Networks
Issue Date: 2005
Source: Motani, M.,Srinivasan, V.,Nuggehalli, P.S. (2005). PeopleNet: Engineering a wireless virtual social network. Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM : 243-257. ScholarBank@NUS Repository. https://doi.org/10.1145/1080829.1080855
Abstract: 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, sceilnble 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. Copyright 2005 ACM.
Source Title: Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM
URI: http://scholarbank.nus.edu.sg/handle/10635/71385
DOI: 10.1145/1080829.1080855
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

190
checked on Dec 13, 2017

Page view(s)

22
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.