On Common Profile Matching among Multiparty Users in Mobile D2D Social Networks Student: Wan-Hsuan Lin Advisor: Prof. Yu-Chee Tseng Department of Computer Science National Chiao Tung University 1001 Ta

• Main Authors: Lin, Wan-Hsuan, 林宛萱
• Other Authors: 曾煜棋
• Format: Others
• Language: zh-TW
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/08005029254859436701

碩士 === 國立交通大學 === 資訊科學與工程研究所 === 102 === Recently, mobile social networks (MSNs) have been widely discussed due to the rapid growth of smart mobile devices. This work focuses on mobile D2D social networks (MDSNs), where users in an MSN are physical neighbors. An important social application of MDSNs is common profile matching (CPM), which refers to the scenario where a group of smartphone users meet in a small region (such as a ball room) and these users are interested in identifying the common attributes among them from their personal profiles efficiently via short-range (such as D2D) communications. For example, a group of strangers may want to find common hobbies, friends, or countries they visited before, and a group of students may want to know the common courses they have ever taken. Assuming that users in an MDSN form a fully connected network, we formulate three versions, namely all -common, β-common, and top-γ-popular, of the CPM problem. The first problem is an extension of an earlier work, while the latter two problems are newly defined. We present solutions based on the basic and the iterative Bloom filters. Evaluation results show that our mechanisms are quite communication-efficient.