Profile-Based Ad Hoc Social Networking Using Wi-Fi Direct on the Top of Android

Ad-hoc Social Networks have become popular to support novel applications related to location-based mobile services that are of great importance to users and businesses. Unlike traditional social services using a centralized server to fetch location, ad-hoc social network services support infrastructure less real-time social networking. It allows users to collaborate and share views anytime anywhere. However, current ad-hoc social network applications are either not available without rooting the mobile phones or don't filter the nearby users based on common interests without a centralized server. This paper presents an architecture and implementation of social networks on commercially available mobile devices that allow broadcasting name and a limited number of keywords representing users' interests without any connection in a nearby region to facilitate matching of interests. The broadcasting region creates a digital aura and is limited by WiFi region that is around 200 meters. The application connects users to form a group based on their profile or interests using peer-to-peer communication mode without using any centralized networking or profile matching infrastructure. The peer-to-peer group can be used for private communication when the network is not available

Interest-aware content discovery in peer-to-peer social networks.

With the increasing popularity and rapid development of Online Social Networks (OSNs), OSNs not only bring fundamental changes to information and communication technologies, but also make extensive and profound impact on all aspects of our social life. Efficient content discovery is a fundamental challenge for large-scale distributed OSNs. However, the similarity between social networks and online social networks leads us to believe that the existing social theories are useful for improving the performance of social content discovery in online social networks. In this paper, we propose an interest-aware social-like peer-to-peer (IASLP) model for social content discovery in OSNs by mimicking ten different social theories and strategies. In the IASLP network, network nodes with similar interests can meet, help each other and co-operate autonomously to identify useful contents. The presented model has been evaluated and simulated in a dynamic environment with an evolving network. The experimental results show that the recall of IASLP is 20% higher than the existing method SESD while the overhead is 10% lower. The IASLP can generate higher flexibility and adaptability and achieve better performance than the existing methods.UK-China Knowledge Economy Education Partnershi

P2P architectures for distributed online social networks

Online Social Networks (OSNs) tipically exploit logically centralized infrastructure. The centralized nature of OSNs has several drawbacks including scalability, privacy, and dependence on a provider. Specifically, OSN privacy has become a major concern, particularly privacy and protection from massive data-mining and big-brotherly treatment of the users by the social networking service providers. In contrast to centralized OSNs, a distributed online social network helps to lower the cost of the provider drastically, and allows better control of user privacy. This has several consequences: in terms of privacy, no central data collection, nor any central entity that decides or changes the terms of service. In this paper we focus on the definition of P2P Distributed Online Social Network (DOSN) paradigm and propose a new approach to P2P DOSN based on Dunbar's number, which bounds the number of people one knows and keeps social contacts with