本文關鍵詞：近鄰移動社交網絡中鄰居發(fā)現(xiàn)和好友匹配研究　出處：《燕山大學》2015年博士論文　論文類型：學位論文

  更多相關文章： 近鄰移動社交網絡 近鄰發(fā)現(xiàn) 好友匹配 占空比 帕耶加密

【摘要】：隨著移動網絡技術和移動終端設備的迅速發(fā)展,越來越多的人們開始使用各種移動社交網絡服務,位置鄰近的移動用戶無需接入互聯(lián)網絡就可以直接通過安裝在智能終端上的藍牙或者Wi Fi接口進行用戶交互,從而構建近鄰移動社交網絡,這種新型的社交網絡模式便于人們結交新朋友并可以進行面對面地交流,受到越來越廣泛的關注。近鄰發(fā)現(xiàn)和好友匹配是近鄰移動社交網絡工作的基礎,研究高效的解決方法對于推動這種社交網絡的理論研究和實際應用都具有重要意義。首先,提出基于Bi-direction的近鄰發(fā)現(xiàn)方法。該方法使用一個靜態(tài)活躍時間槽和兩個動態(tài)活躍時間槽,在每個周期內動態(tài)活躍時間槽分別從左右兩個方向相對移動。針對非對齊模式,Bi-direction中采用了條紋探測原理,只需要增加一個信標,即可減少一半的活躍時間槽,極大地降低了近鄰發(fā)現(xiàn)所需占空比,同時為了使條紋探測也能服務于對齊模式,設計了溢出條紋探測方法,提出隨機選擇動態(tài)活躍時間槽的首次開啟位置可以進一步提高發(fā)現(xiàn)效率。其次,提出基于鄰居加速的近鄰發(fā)現(xiàn)方法。該方法利用間接鄰居發(fā)現(xiàn)的思想,將已經發(fā)現(xiàn)的鄰居節(jié)點的鄰居加入到自身鄰居列表,通過活躍時間槽調度算法和節(jié)點自身的電能存量選擇額外開啟活躍時間槽的位置和個數(shù),進一步提高間接鄰居發(fā)現(xiàn)效率。該方法可以與任何基礎方法結合使用,實現(xiàn)了性能的提升,更有利于應用在移動環(huán)境中。再次,提出基于分布式計算的動態(tài)好友匹配方法。定義了兩個隱私保護級別,用戶屬性優(yōu)先級可以按照用戶需求動態(tài)調整,采用帕耶加密方法對用戶屬性優(yōu)先級信息進行加密,利用其同態(tài)性和自我屏蔽性實現(xiàn)用戶信息不被泄露,設計提前過濾協(xié)議首先淘汰掉不滿足閾值條件的候選用戶,通過相關系數(shù)法好友匹配協(xié)議實現(xiàn)隱私保護級別Ⅰ下的好友匹配,設計廣義Jaccard系數(shù)法匹配協(xié)議實現(xiàn)隱私保護級別Ⅱ下的匹配過程。最后,提出基于雙服務器的第三方好友匹配方法。該方法中同時使用匿名服務器和計算服務器進行好友匹配。用戶信息被分為用戶ID信息和用戶屬性優(yōu)先級信息兩部分,分別用匿名服務器公鑰和計算服務器公鑰對其加密傳輸,匿名服務器實現(xiàn)用戶ID信息的置換和反置換處理,實現(xiàn)了用戶ID信息和用戶屬性優(yōu)先級信息對應關系的破壞和還原的目標,計算服務器使用改進的廣義Jaccard系數(shù)法計算用戶相似度,其不能獲取用戶屬性優(yōu)先級對應的真實用戶ID信息,彌補了傳統(tǒng)第三方計算方法的缺陷,實現(xiàn)了隱私保護級別Ⅲ下的好友匹配過程。實驗結果表明,本文提出的近鄰發(fā)現(xiàn)方法提高了近鄰發(fā)現(xiàn)的效率,可以更好地滿足移動環(huán)境下的需求,分布式和第三方計算兩種好友匹配方法不僅大幅降低了移動終端的計算和通信開銷,而且可以應用于不同的應用場景,有利于近鄰移動社交網絡的應用推廣。
[Abstract]:With the rapid development of mobile network technology and mobile terminal devices, more and more people begin to use various mobile social network services. Adjacent mobile users can interact with each other directly through Bluetooth or Wi Fi interfaces installed on intelligent terminals without access to the Internet, so as to build a neighboring mobile social network. This new model of social network makes it easy for people to make new friends and can communicate face to face, which has attracted more and more attention. The discovery of close neighbors and the matching of friends are the basis of the work of mobile social networks. The study of efficient solutions is of great significance to promote the theoretical research and practical application of this kind of social networks. First of all. A method of neighbor discovery based on Bi-direction is proposed, which uses a static active time slot and two dynamic active time slots. The dynamic active time slot moves relatively from the left and right directions in each cycle. The fringes detection principle is used in the non-aligned mode Bi-direction, and only one beacon is added. The active time slot can be reduced by half, which greatly reduces the duty cycle required by the nearest neighbor detection. In order to make the fringe detection also serve the alignment mode, a method for detecting overflow fringes is designed. It is proposed that random selection of the first opening position of the dynamic active time slot can further improve the discovery efficiency. Secondly, a neighbor accelerated neighbor discovery method is proposed, which utilizes the idea of indirect neighbor discovery. The neighbor of the neighbor node is added to the neighbor list, and the location and number of the additional active time slot are selected by the active time slot scheduling algorithm and the power storage of the node itself. Further improve the efficiency of indirect neighbor discovery. This method can be combined with any basic method to achieve improved performance, more conducive to the application in mobile environment. Again. A dynamic friend matching method based on distributed computing is proposed. Two levels of privacy protection are defined, and the priority of user attributes can be dynamically adjusted according to the needs of users. The user attribute priority information is encrypted by using Paya encryption method, and the user information is not leaked by its homomorphism and self-shielding. First, the filter protocol is designed to eliminate the candidate users who do not meet the threshold condition, and then realize the friend matching under the privacy protection level I through the correlation coefficient method friend matching protocol. A generalized Jaccard coefficient matching protocol is designed to implement the matching process under the privacy protection level 鈪，

本文編號：1426079