【摘要】：移動(dòng)自組織網(wǎng)絡(luò)通過節(jié)點(diǎn)間相互合作的方式來轉(zhuǎn)發(fā)數(shù)據(jù)包,提升網(wǎng)絡(luò)的性能和服務(wù)質(zhì)量。然而,受終端無線信號(hào)覆蓋范圍、設(shè)備儲(chǔ)電能力和節(jié)點(diǎn)移動(dòng)特性等因素限制,使得節(jié)點(diǎn)獲取數(shù)據(jù)時(shí)存在不確定性。將服務(wù)內(nèi)容部署在適當(dāng)?shù)墓?jié)點(diǎn)上會(huì)提高節(jié)點(diǎn)獲取數(shù)據(jù)的成功率。但在現(xiàn)實(shí)中,節(jié)點(diǎn)是理性的,在沒有利益的情形下,節(jié)點(diǎn)難以與其他節(jié)點(diǎn)合作部署服務(wù)內(nèi)容。為了提高網(wǎng)絡(luò)性能,需要設(shè)計(jì)一種有效的激勵(lì)方法,鼓勵(lì)自私節(jié)點(diǎn)部署服務(wù)內(nèi)容。如何設(shè)計(jì)激勵(lì)方法,減少部署服務(wù)內(nèi)容的成本,提升用戶獲取數(shù)據(jù)的效率是本文的研究重點(diǎn)。本文主要從以下兩方面對服務(wù)內(nèi)容部署激勵(lì)方法進(jìn)行研究:1.具有全局信息時(shí),針對節(jié)點(diǎn)自私的情形,為了鼓勵(lì)節(jié)點(diǎn)積極地參與到服務(wù)內(nèi)容部署中,本文設(shè)計(jì)了一種基于虛擬積分的激勵(lì)方法。該方法將節(jié)點(diǎn)分為忙碌和空閑兩種狀態(tài),采用激勵(lì)的形式讓節(jié)點(diǎn)從忙碌狀態(tài)轉(zhuǎn)換到空閑狀態(tài),參與到服務(wù)內(nèi)容部署過程中。通過解決UKM(uncapacitated k-median)和UFL(uncapacitated facility location)問題確定網(wǎng)絡(luò)中服務(wù)內(nèi)容的位置和數(shù)量。2.具有局部信息時(shí),利用局部網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)和節(jié)點(diǎn)需求,在r-跳內(nèi)迭代優(yōu)化解決本地UKM和UFL問題,確定了服務(wù)內(nèi)容數(shù)量及位置。本文根據(jù)節(jié)點(diǎn)具有自私性的特性,考慮到節(jié)點(diǎn)轉(zhuǎn)發(fā)服務(wù)內(nèi)容數(shù)據(jù)時(shí)產(chǎn)生的能耗問題,利用節(jié)點(diǎn)能耗給出了一種報(bào)酬函數(shù),鼓勵(lì)了節(jié)點(diǎn)間的合作,有效減少遷移部署服務(wù)內(nèi)容過程中的部署成本。最后,對具有全局信息的情形在E-R隨機(jī)圖網(wǎng)絡(luò)模型進(jìn)行了實(shí)驗(yàn)驗(yàn)證;對具有局部信息的情形分別在E-R隨機(jī)圖和B-A無標(biāo)度網(wǎng)絡(luò)兩種網(wǎng)絡(luò)模型中進(jìn)行實(shí)驗(yàn)驗(yàn)證。實(shí)驗(yàn)結(jié)果表明,無論是哪種情形,本文提出的激勵(lì)方法都可以降低部署服務(wù)內(nèi)容成本,促進(jìn)節(jié)點(diǎn)之間的相互合作,提升網(wǎng)絡(luò)的性能。
[Abstract]:Mobile ad hoc networks (Manets) forward packets through cooperation between nodes to improve network performance and quality of service (QoS). However, due to the limitation of wireless signal coverage, storage capacity and node mobility, there is uncertainty when the node acquires data. Deploying service content on the appropriate node improves the node's success rate in obtaining data. But in reality, nodes are rational, and it is difficult for nodes to cooperate with other nodes to deploy service content without benefit. In order to improve network performance, we need to design an effective incentive method to encourage selfish nodes to deploy service content. How to design incentive methods, reduce the cost of deploying service content and improve the efficiency of data acquisition by users is the focus of this paper. This paper mainly studies the incentive method of service content deployment from the following two aspects: 1. 1. In order to encourage nodes to participate in the deployment of service content actively, an incentive method based on virtual integration is designed for the selfish nodes with global information. In this method, nodes are divided into busy and idle states, and the nodes are converted from busy state to idle state in the form of excitation, and participate in the process of service content deployment. Determine the location and number of service content in the network by solving the UKM (uncapacitated k-median) and UFL (uncapacitated facility location) problems. When local information is available, the local UKM and UFL problems are optimized by using the local network topology and node requirements, and the number and location of service content are determined. In this paper, according to the selfish nature of nodes, considering the problem of energy consumption when nodes transmit service content data, a reward function is given by using node energy consumption, which encourages the cooperation between nodes. Effectively reduce deployment costs during migration of service content. Finally, the global information is verified in the E-R random graph network model, and the local information is verified in the E-R random graph and B-A scale-free network model. The experimental results show that in either case, the incentive method proposed in this paper can reduce the cost of deploying service content, promote the cooperation between nodes and improve the performance of the network.
【學(xué)位授予單位】：安徽工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN929.5

【參考文獻(xiàn)】

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

1 吳W，

本文編號(hào)：2225244