需要金幣： 1000 個(gè)金幣 |
資料包括：完整論文 |  |
 |
| 轉(zhuǎn)換比率：金額 X 10=金幣數(shù)量， 例100元=1000金幣 | 論文字?jǐn)?shù)：16717 |  | |
| 折扣與優(yōu)惠：團(tuán)購(gòu)最低可5折優(yōu)惠 - 了解詳情 | 論文格式：Word格式(*.doc) |  |
摘要：無(wú)線傳感器網(wǎng)絡(luò)具有很高的研究?jī)r(jià)值和十分廣闊的應(yīng)用前景，已經(jīng)引起了學(xué)術(shù)界和工業(yè)界的高度重視，被稱(chēng)為是21世紀(jì)最有發(fā)展前景的技術(shù)之一。 無(wú)線傳感器網(wǎng)絡(luò)通常由大量密集的傳感器節(jié)點(diǎn)構(gòu)成，節(jié)點(diǎn)的能源、計(jì)算能力和帶寬都非常有限，傳統(tǒng)的無(wú)線路由協(xié)議不適合無(wú)線傳感器網(wǎng)絡(luò)。因此，設(shè)計(jì)能夠有效節(jié)約能源、延長(zhǎng)網(wǎng)絡(luò)生命周期的路由協(xié)議成為了無(wú)線傳感器網(wǎng)絡(luò)研究的一個(gè)重要內(nèi)容。本文針對(duì)典型的分簇式路由協(xié)議——LEACH協(xié)議的不足，提出了考慮節(jié)點(diǎn)的剩余能量和分布位置的改進(jìn)算法。通過(guò)在OMNeT++仿真平臺(tái)上實(shí)驗(yàn)和與原算法的比較，發(fā)現(xiàn)本文提出的算法有效地延長(zhǎng)了網(wǎng)絡(luò)生命周期，提高了數(shù)據(jù)通信的效率。 關(guān)鍵詞：無(wú)線傳感器網(wǎng)絡(luò);成簇算法;LEACH;路由協(xié)議
Abstract：Wireless Sensor Networks (WSN) is being widely used in commercial and military fields .Both academia and industries have shown great interests in Wireless Sensor Networks .Wireless Sensor Network has been intituled one of the best perspective technology in the 21st century. The number of sensor nodes in WSN is numerous and a single node is extraordinarily limited in resources ,so the important aim of designing routing protocol of WSN is to reduce the overall energy-dissipated in the networks and to maximize the lifetime of networks . We select LEACH to be the research target as the representative of the cluster-based routing protocols .We bring forward some improvements to the LEACH protocol based on analyzing the shortages of it .The improved LEACH periodically selects cluster heads according to their residual energy and the distance between one cluster head and another cluster head .The simulation of the improved LEACH is carried out on OMNeT++.By analyzing and comparing the simulation results ,it is shown that it can increase the lifetime of network effectively. Key words: wireless sensor networks; routing protocol; clustering algorithm; LEACH
在本論文中，首先介紹了一些無(wú)線傳感器的基本概念以及研究無(wú)線傳感器網(wǎng)絡(luò)的意義。接著對(duì)現(xiàn)有的無(wú)線傳感網(wǎng)絡(luò)的路由協(xié)議進(jìn)行了有針對(duì)性的研究，分析和對(duì)比了現(xiàn)有的無(wú)線傳感網(wǎng)絡(luò)的路由協(xié)議的優(yōu)劣;然后針對(duì)一種典型的基于拓?fù)涞穆酚蓞f(xié)議算法LEACH進(jìn)行了著重分析和研究，通過(guò)網(wǎng)絡(luò)仿真工具OMNeT++進(jìn)行建模，并在分析研究前人成果的基礎(chǔ)上，就這種算法提出了自己的改進(jìn)思路。重點(diǎn)研究了在選擇簇首時(shí)，分別從能量的角度和簇首的間距的角度來(lái)選擇簇首。并通過(guò)網(wǎng)絡(luò)仿真工具OMNeT++對(duì)自己的想法進(jìn)行了仿真驗(yàn)證。結(jié)果證明對(duì)這種算法的改進(jìn)思路是有效的，是正確的，在網(wǎng)絡(luò)路由的低功耗和低開(kāi)銷(xiāo)性能方面得到了改善。
|
