基于博弈論能耗均衡的WSN分層路由算法研究
[Abstract]:Wireless sensor network (Wireless Sensor Networks,WSN) is composed of a large number of sensor nodes distributed in the detection area. Because of its self-organization and low energy consumption, people pay close attention to it and have been rated as one of the ten most influential technologies in the 21 ~ (st) century. Routing technology is one of the hottest technologies in wireless sensor networks. How to design an efficient, reliable and secure routing algorithm has become the goal of sensor routing design. In hierarchical routing, WSN is divided into multiple clusters. Cluster heads near convergent nodes consume more energy to transmit data from other clusters. The uneven energy consumption between nodes will result in "energy hole" phenomenon, which will affect network performance. To solve this problem, a non-uniform clustering routing algorithm (Game Theory based energy balance unequal clustering routing,GBUC) based on game theory energy balance is proposed in this paper. In the routing protocol, the nodes compete based on time mechanism to generate cluster heads, which can avoid the nodes with less energy remaining as cluster heads. Each cluster head determines its own communication radius according to its distance from the base station. At the end of the clustering phase, WSN is divided into clusters of different sizes. The closer the cluster is to the convergent node, the smaller the radius is, and the energy consumption of cluster head is equalized by controlling the energy consumption of intra-cluster communication. In order to share the energy consumption of cluster head, the node with high energy is selected as relay node at the overlap of cluster and cluster. The selection of relay node can not only reduce the energy consumption of cluster head, but also effectively bypass the "energy hole" in WSN. In the process of inter-cluster communication, we construct a routing game model, in which the benefit function and the communication distance, the reliability of the link and the residual energy of the communication node are correlated. Each rational node chooses the neighbor node with the highest profit (including relay node) as the next hop route. When Nash equilibrium is reached, the strategy set of nodes is the optimal path of joint energy balance and reliability. Through experimental comparison, the proposed GBUC algorithm is improved in the aspects of node energy balance and data transmission reliability.
【學(xué)位授予單位】:西華大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2015
【分類號】:TP212.9;TN929.5
【相似文獻(xiàn)】
相關(guān)期刊論文 前1條
1 陳進(jìn);論區(qū)域博弈分析的方法研究[J];軟科學(xué);1999年04期
相關(guān)會議論文 前2條
1 施建寧;蔣曉蕙;;方法突破:案例研究將博弈論與現(xiàn)實(shí)管理結(jié)合[A];提高全民科學(xué)素質(zhì)、建設(shè)創(chuàng)新型國家——2006中國科協(xié)年會論文集[C];2006年
2 王文舉;楊思磊;;第十五章 復(fù)雜適應(yīng)系統(tǒng)、博弈論及經(jīng)濟(jì)動(dòng)態(tài)模擬[A];21世紀(jì)數(shù)量經(jīng)濟(jì)學(xué)(第3卷)[C];2002年
相關(guān)重要報(bào)紙文章 前4條
1 常麗君;博弈論揭示癌細(xì)胞能量生產(chǎn)中弱點(diǎn)[N];科技日報(bào);2014年
2 柳宏珠 潘和平 唐小我 成都電子科技大學(xué)預(yù)測研究中心、經(jīng)濟(jì)與管理學(xué)院;博弈論在金融領(lǐng)域的應(yīng)用和發(fā)展[N];中國社會科學(xué)報(bào);2011年
3 史晨昱;博弈論:一根數(shù)學(xué)杠桿撬動(dòng)了社會經(jīng)濟(jì)[N];上海證券報(bào);2005年
4 盧子芳(系南京郵電學(xué)院副教授、系統(tǒng)工程專業(yè)工學(xué)博士) 顧立人;尋求次優(yōu)的市場均衡[N];人民郵電;2002年
相關(guān)碩士學(xué)位論文 前10條
1 謝劍;基于微分博弈論的多無人機(jī)追逃協(xié)同機(jī)動(dòng)技術(shù)研究[D];哈爾濱工業(yè)大學(xué);2015年
2 李艷琴;基于博弈論視角下的博物館營銷[D];河南大學(xué);2015年
3 孫慶中;基于博弈論能耗均衡的WSN分層路由算法研究[D];西華大學(xué);2015年
4 李娟利;基于博弈論的網(wǎng)絡(luò)誘騙系統(tǒng)研究[D];西安建筑科技大學(xué);2006年
5 孫姝;基于博弈論的知識傳播模型研究[D];大連理工大學(xué);2011年
6 余博;博弈論視角下的翻譯過程研究[D];北京交通大學(xué);2015年
7 馮慶華;基于博弈論和粗糙集的管理決策分析[D];西安建筑科技大學(xué);2005年
8 龍麗;博弈論在企業(yè)競爭中的應(yīng)用研究[D];廈門大學(xué);2001年
9 冉翠玲;博弈論在有不對稱需求信息的供應(yīng)鏈協(xié)調(diào)研究中的應(yīng)用[D];合肥工業(yè)大學(xué);2006年
10 白一鳴;基于信念推理的知識模型及其在博弈中的應(yīng)用研究[D];四川大學(xué);2006年
,本文編號:2343396
本文鏈接:http://sikaile.net/kejilunwen/wltx/2343396.html