本文選題：車載社交網(wǎng)絡(luò) + 隱私關(guān)心��； 參考：《南京郵電大學(xué)》2017年碩士論文

【摘要】：車載社交網(wǎng)絡(luò)(Vehicular Social Networks-VSNs)是指車輛之間利用人們之間的社會交互通過V2V(Vehicle-to-Vehicle)和V2I(Vehicle-to-Infrastructure)的方式進(jìn)行通信,以提高車輛的通信范圍以及周圍環(huán)境的感知能力,它作為未來智能交通系統(tǒng)的重要組成部分,引起了學(xué)術(shù)界和工業(yè)節(jié)的廣泛關(guān)注。近年來隨著VSNs應(yīng)用的層出不窮,一類新的應(yīng)用出現(xiàn)在人們的視野中—車載網(wǎng)絡(luò)中商業(yè)廣告的轉(zhuǎn)發(fā)。當(dāng)移動的車經(jīng)過商家時,商家借助路邊放置的RSUs(Roadside Units),將自己的服務(wù)信息廣播給途經(jīng)的車,之后車在移動過程中通過V2V通信的方式,將先前收到的廣告發(fā)送給其他車輛,實現(xiàn)廣告的傳遞。但是,這樣一個商業(yè)廣告轉(zhuǎn)發(fā)模型在實踐中存在諸如隱私,激勵以及消息轉(zhuǎn)發(fā)時廣播風(fēng)暴的挑戰(zhàn)。本論文的主要貢獻(xiàn)有:1、商業(yè)廣告轉(zhuǎn)發(fā)涉及了用戶的參與,因此必不可免的會給用戶的隱私帶來威脅。本文針對用戶隱私問題,利用公鑰基礎(chǔ)設(shè)施(PKI)設(shè)計了一種保護(hù)用戶隱私信息的廣告轉(zhuǎn)發(fā)鏈,該轉(zhuǎn)發(fā)鏈在記錄用戶參與情況的同時通過權(quán)威的公鑰對用戶信息進(jìn)行加密,使用戶信息對外界保密。理論分析表明該隱私保護(hù)鏈能夠抵御隱私、陷害、共謀等攻擊,仿真結(jié)果表明該隱私保護(hù)鏈的性能超過了SSD算法。2、商業(yè)廣告的轉(zhuǎn)發(fā)需要用戶的參與,如果用戶沒有從轉(zhuǎn)發(fā)過程中獲利他們將不愿意繼續(xù)進(jìn)行轉(zhuǎn)發(fā)這稱為用戶自私行為。本文針對用戶自私行為提出一種基于拓?fù)涞莫剟顧C(jī)制ETDRM(Enhanced-Topology Dependent Reward Mechanisms)對參與廣告轉(zhuǎn)發(fā)的用戶進(jìn)行獎勵,E-TDRM在能夠滿足商家預(yù)算要求的同時也能夠抵御多身份攻擊。理論和仿真結(jié)果分析表明E-TDRM算法確實能夠抵御不端用戶的多身份攻擊,而且相比FRAME算法就用戶平均獎勵和對用戶的吸引力方面性能更加優(yōu)秀。3、商業(yè)廣告轉(zhuǎn)發(fā)在通信環(huán)境惡劣、車密度較大的情況下存在嚴(yán)重的廣播風(fēng)暴的問題。本文針對轉(zhuǎn)發(fā)過程中存在的廣播風(fēng)暴問題提出了自適應(yīng)商業(yè)廣告轉(zhuǎn)發(fā)模型。我們根據(jù)廣告商提供的獎勵幅度的大小對商業(yè)廣告劃分等級;依據(jù)固定時間內(nèi)接收到信標(biāo)數(shù)目計算潛在的周邊車密度,根據(jù)車密度的大小對不同等級的廣告進(jìn)行抑制轉(zhuǎn)發(fā),仿真結(jié)果表明我們提出的自適應(yīng)方案在某種程度上能夠減緩廣播風(fēng)暴,促進(jìn)商業(yè)廣告的轉(zhuǎn)發(fā)。
[Abstract]:Vehicular Social Networks (VSNs) refers to the use of social interaction between vehicles to communicate with each other via V2VV Vehicle-to-Vehicle-to-Infrastructure), in order to improve the communication range of vehicles and the perception of the surrounding environment. As an important part of intelligent transportation system in the future, it has attracted extensive attention of academia and industry festival. In recent years, with the emergence of VSNs applications, a new class of applications appear in the field of vision-the forwarding of commercial advertisements in vehicular networks. When the mobile car passes the merchant, the merchant broadcasts his service information to the passing car with the help of the RSUs(Roadside unit, which is placed by the roadside, and then sends the previously received advertisement to other vehicles through V2V communication during the mobile process. To achieve the transmission of advertising. However, such a commercial advertising forwarding model has challenges in practice such as privacy, incentives, and broadcast storms when forwarding messages. The main contribution of this paper is 1: 1, commercial advertisement forwarding involves the user's participation, so it will inevitably bring threat to the user's privacy. Aiming at the problem of user privacy, this paper designs an advertisement forwarding chain to protect the user's privacy information by using the public key infrastructure (PKI). The chain encrypts the user's information through the authoritative public key while recording the user's participation. Keep user information confidential to the outside world. Theoretical analysis shows that the privacy protection chain can resist attacks such as privacy, frame, conspiracy, etc. The simulation results show that the performance of the privacy protection chain exceeds that of SSD algorithm. 2. The forwarding of commercial advertisements requires the participation of users. If users do not profit from the forwarding process, they will not be willing to continue forwarding, which is called user selfishness. In this paper, we propose a topology-based reward mechanism for user selfishness, named ETDRM(Enhanced-Topology Dependent Reward Mechanisms), which can reward users participating in advertising forwarding. E-TDRM can not only meet the requirements of merchant budget but also resist multi-identity attacks. The theoretical and simulation results show that the E-TDRM algorithm can resist the multiple identity attacks of the wrong users, and the performance of the FRAME algorithm is better than that of the FRAME algorithm in terms of average reward and attractiveness to the users, and the commercial advertisement forwarding is bad in the communication environment. There is a serious broadcasting storm problem when the car density is high. In this paper, an adaptive commercial advertising forwarding model is proposed to solve the problem of broadcast storm in the process of forwarding. We rank the commercial ads according to the size of the incentive range provided by the advertisers, calculate the potential peripheral car density based on the number of siphons received within a fixed period of time, and suppress the forwarding of advertisements of different levels according to the size of the vehicle density. The simulation results show that the proposed adaptive scheme can reduce the broadcast storm to some extent and promote the forwarding of commercial advertisements.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：F713.8;TN915.08

【參考文獻(xiàn)】

相關(guān)期刊論文 前2條

1 楊瓊;沈連豐;;車載自組織網(wǎng)絡(luò)的體系結(jié)構(gòu)和通信協(xié)議研究[J];中興通訊技術(shù);2011年03期

2 祝婧;李琪;;車載Ad hoc網(wǎng)絡(luò)中新型廣告發(fā)布模型設(shè)計[J];微計算機(jī)信息;2010年33期

相關(guān)碩士學(xué)位論文 前1條

1 楊金;無線傳感器網(wǎng)絡(luò)安全密鑰管理方案的研究[D];湖南大學(xué);2008年

，

本文編號：1883790