Wi-friend: Identifying potential real life friends nearby

Nowadays, with the help of various on-line social networking applications, one can freely interact with any person in their friends list. However, in most conditions, people in your friends list are those you know a priori, either via face-to-face talking or introducing by a common friend. This way of establishing ones friends list can miss many potential friends nearby. These ‘potential real life friends nearby are those who are invisible to you (you do not know before), physically close to you (e.g. taking the same subway for commuting, doing exercises at the same time slot), and share the same interest with you. Correspondingly, we developed Wi-friend. Wi-friend, once installed in your mobile phone, can help to find these ‘potential friends nearby’. Using Wi-friend, one only needs to briefly specify his/her interest. Then the smartphone starts to look for nearby people with the same interest and add each other into ones friends list automatically. One special feature of Wi-friend is that it does not rely on Internet connection. We leverage the Wi-Fi tethering technique, and let ones smartphone to switch between Wi-Fi hot-spot mode and Wi-Fi client mode to exchange information with nearby people. In addition, Wi-friend can dynamically determine how long to stay in each mode to maximize the number of people who can exchange information. Extensive experiments and simulations demonstrated the technical feasibility and the effectiveness of our Wi-friend system.

[1]  Karin Anna Hummel,et al.  WLAN-Opp: Ad-hoc-less opportunistic networking on smartphones , 2015, Ad Hoc Networks.

[2]  Young-Bae Ko,et al.  Designing content-centric multi-hop networking over Wi-Fi Direct on smartphones , 2014, 2014 IEEE Wireless Communications and Networking Conference (WCNC).

[3]  Paul J. M. Havinga,et al.  BLESSED with Opportunistic Beacons: A Lightweight Data Dissemination Model for Smart Mobile Ad-Hoc Networks , 2015, CHANTS@MobiCom.

[4]  Kun-Chan Lan,et al.  A Survey of Opportunistic Networks , 2008, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008).

[5]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[6]  Yu Zheng,et al.  Location-Based Social Networks: Users , 2011, Computing with Spatial Trajectories.

[7]  Paul J. M. Havinga,et al.  Friend-to-friend short message service with opportunistic Wi-Fi beacons , 2016, 2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops).

[8]  Stanley B. Zdonik,et al.  A framework for scalable dissemination-based systems , 1997, OOPSLA '97.

[9]  Sheng Chen,et al.  Social-aware D2D communications: qualitative insights and quantitative analysis , 2014, IEEE Communications Magazine.

[10]  Fabian Kuhn,et al.  Ad-hoc networks beyond unit disk graphs , 2003, DIALM-POMC '03.

[11]  Marco Conti,et al.  Opportunistic networking: data forwarding in disconnected mobile ad hoc networks , 2006, IEEE Communications Magazine.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Roger Wattenhofer,et al.  Constant-time distributed dominating set approximation , 2003, PODC '03.

[14]  Paul Gardner-Stephen,et al.  The serval mesh: A platform for resilient communications in disaster & crisis , 2013, 2013 IEEE Global Humanitarian Technology Conference (GHTC).