本文關(guān)鍵詞：基于Slepian-Wolf理論的無(wú)線傳感器網(wǎng)絡(luò)分簇算法及改進(jìn)　出處：《大連理工大學(xué)》2015年碩士論文　論文類(lèi)型：學(xué)位論文

  更多相關(guān)文章： 分簇算法 無(wú)線傳感器網(wǎng)絡(luò) 數(shù)據(jù)相關(guān)性 平均熵 隨機(jī)更新

【摘要】：無(wú)線傳感器網(wǎng)絡(luò)利用微型傳感器與網(wǎng)絡(luò)技術(shù)相結(jié)合,打破了人們對(duì)物理世界信息獲取方式的傳統(tǒng)觀念,成為21世紀(jì)的一種新興技術(shù)。無(wú)線傳感器網(wǎng)絡(luò)不僅在各項(xiàng)科研工作中產(chǎn)生了很大的影響,而且在社會(huì)實(shí)踐中也有著廣泛的應(yīng)用。通常,在無(wú)線傳感器網(wǎng)絡(luò)中,節(jié)點(diǎn)的資源是十分有限的,特別是能量資源。地理位置靠近的節(jié)點(diǎn)通常具有一定的相似特性,稱(chēng)為時(shí)空相關(guān)性,這樣就導(dǎo)致了冗余數(shù)據(jù)的產(chǎn)生。傳輸這些冗余數(shù)據(jù)不僅消耗了大量資源,而且降低了對(duì)有效數(shù)據(jù)的感知。在這種條件下,如何合理分配資源,提高網(wǎng)絡(luò)的能量效率,從而延長(zhǎng)網(wǎng)絡(luò)的壽命,已經(jīng)成為研究人員關(guān)注的熱點(diǎn)。為了解決上述問(wèn)題,本文對(duì)分簇式路由協(xié)議(即分簇算法)進(jìn)行研究與設(shè)計(jì),主要工作如下：首先,本文對(duì)無(wú)線傳感器網(wǎng)絡(luò)中的路由技術(shù)和分簇算法進(jìn)行了概述,給出了一些經(jīng)典分簇算法的描述,同時(shí),介紹了本文中涉及的相關(guān)理論基礎(chǔ)。為了解決無(wú)線傳感器網(wǎng)絡(luò)中存在的數(shù)據(jù)相關(guān)性問(wèn)題,本文提出了一種基于Slepian-Wolf理論的局部數(shù)據(jù)相關(guān)性感知分簇算法LDCA。該算法綜合考慮了數(shù)據(jù)的時(shí)空相關(guān)性、通信距離、剩余能量等重要因素,定義了平均熵和節(jié)點(diǎn)連接度作為選擇簇首的決定條件,并且設(shè)計(jì)了有效的分布式算法來(lái)獲得更好的網(wǎng)絡(luò)性能和能量效率。仿真結(jié)果表明,LDCA分簇算法不僅能夠獲得較好的分簇結(jié)果,而且有效的降低了通信數(shù)據(jù)量。此外,在能量均衡方面也優(yōu)于其它算法。其次,為了避免分簇算法在更新過(guò)程中額外的能量開(kāi)銷(xiāo)和時(shí)間開(kāi)銷(xiāo),并且提高網(wǎng)絡(luò)數(shù)據(jù)傳輸?shù)目煽啃?本文針對(duì)LDCA算法中的不足,進(jìn)行了相應(yīng)的改進(jìn),并提出了一種使用隨機(jī)更新策略的能量高效分簇算法EECRU。在簇的更新算法中,本文使用了隨機(jī)更新策略和簇首輪轉(zhuǎn)機(jī)制相結(jié)合,解決了傳統(tǒng)算法中存在的不足；在數(shù)據(jù)傳輸過(guò)程中,采用節(jié)點(diǎn)采樣率控制方法,使傳感節(jié)點(diǎn)對(duì)數(shù)據(jù)的感知更加智能,提高海量信息處理效率。同時(shí),提出了分簇更新理論,來(lái)說(shuō)明隨機(jī)更新算法的高效性,并給出了數(shù)學(xué)證明。本文在相同的網(wǎng)絡(luò)條件下,對(duì)EECRU、LEACH、DDCD三種算法分別進(jìn)行了仿真實(shí)驗(yàn)。對(duì)比結(jié)果表明,EECRU提高了網(wǎng)絡(luò)能量效率,能夠保證網(wǎng)絡(luò)數(shù)據(jù)可靠傳輸。最后,對(duì)全文進(jìn)行了總結(jié),并提出了下一步工作的重點(diǎn)以及對(duì)未來(lái)的展望。
[Abstract]:Wireless sensor network using micro sensor and network technology, breaking the traditional concept of people to obtain information of the physical world, become a kind of new technology in twenty-first Century. Wireless sensor networks not only have great influence on the research work, but also in social practice has been widely used. Usually, in wireless in Sensor Networks, the node resources are very limited, especially energy resources. The node location near usually has the same characteristics, known as spatial and temporal correlation, this leads to redundant data generation. These redundant data transmission not only consumes a lot of resources, but also reduces the data in perception. Under this condition, how rational allocation of resources, improve the energy efficiency of the network, so as to prolong the lifetime of the network, has become the focus of attention of researchers to understand. To solve these problems, this paper on the cluster based routing protocol (i.e. clustering algorithm) for research and design, the main work is as follows: firstly, this paper summarizes the routing technology in wireless sensor networks and clustering algorithm, some classical clustering algorithms are described, meanwhile, introduces the related theories of this article. In order to solve the problem of data correlation in wireless sensor networks, this paper proposes a local data based on Slepian-Wolf theory related to the perception of clustering algorithm LDCA. the algorithm considering the temporal correlation, data communication distance, residual energy and other important factors, the definition of average entropy and node connectivity as cluster head selection the decision condition, and the design of the distributed algorithm is effective to obtain network performance and energy efficiency better. The simulation results show that the LDCA algorithm can not only get a Good clustering results, and reduce the amount of communication data. In addition, the energy balance is better than the other algorithms. Secondly, in order to avoid the overhead of clustering algorithm for energy cost and additional time during the update process, and improve the reliability of data transmission network, aiming at the shortage of LDCA algorithm, the corresponding the improvement, and proposes a random update strategy of energy efficient clustering algorithm in EECRU. cluster update algorithm, this paper uses random update strategy and cluster head transfer system of combining, solves the problems existing in the traditional algorithm; in the data transmission process, methods used to control the sampling rate of the node. On the perception of data more intelligent sensor node, improve the efficiency of massive information processing. At the same time, put forward the cluster renewal theory to illustrate the efficiency of the random update algorithm, and gives the mathematical proof in this paper. The same network conditions of EECRU, LEACH, DDCD three kinds of algorithms are simulated. The comparison results show that EECRU improves the energy efficiency of the network, can guarantee the reliable transmission of network data. Finally, a summary of the full text, and put forward the focus of the next step and the outlook for the future.

【學(xué)位授予單位】：大連理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類(lèi)號(hào)】：TN929.5;TP212.9

【參考文獻(xiàn)】

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

1 任豐原,黃海寧,林闖;無(wú)線傳感器網(wǎng)絡(luò)[J];軟件學(xué)報(bào);2003年07期

，

本文編號(hào)：1421272