本文選題：無線傳感器網(wǎng)絡(luò) + 地理位置路由算法�。� 參考：《蘇州大學(xué)》2015年碩士論文

【摘要】：在無線傳感器網(wǎng)絡(luò)中,路由協(xié)議是主要的核心技術(shù)。其中地理位置路由算法是無線傳感網(wǎng)絡(luò)中非常重要的一類路由算法,該算法運(yùn)行簡(jiǎn)單高效并具有低負(fù)載的特點(diǎn)。其中,貪婪地理路由被廣泛用于各種無線傳感器網(wǎng)絡(luò)。然而對(duì)于隨機(jī)部署的網(wǎng)絡(luò)而言,路由空洞可能會(huì)導(dǎo)致路由協(xié)議失效。在地理位置路由算法中采用何種更有效的路由空洞恢復(fù)機(jī)制和如何降低節(jié)點(diǎn)成為空洞節(jié)點(diǎn)的概率具有重要的意義。本文主要研究地理位置路由算法,具體研究和實(shí)現(xiàn)工作如下:(1)本文理論分析在隨機(jī)部署的情況下路由空洞存在的概率,并在貪婪周界無狀態(tài)GPSR路由算法的基礎(chǔ)上,提出基于距離和概率的PDRP路由算法。該算法分別計(jì)算節(jié)點(diǎn)成為路由空洞的概率P和節(jié)點(diǎn)與目的節(jié)點(diǎn)的距離L,選擇L和P比值最小的鄰居節(jié)點(diǎn)作為路由的下一跳,實(shí)現(xiàn)避免路由空洞的目的。仿真結(jié)果說明,在不同節(jié)點(diǎn)密度下,PDRP算法在丟包率、封包延遲時(shí)間、平均吞吐量和平均路徑長(zhǎng)度等方面都優(yōu)于GPSR算法。(2)由于傳感器節(jié)點(diǎn)只攜帶能量十分有限的電池,網(wǎng)絡(luò)生命周期是必須考慮的重要因素。本文提出基于能量的EPDRP路由算法,在選擇下一跳時(shí)該算法綜合考慮節(jié)點(diǎn)的位置信息和剩余能量這兩個(gè)方面。文中使用NS2分別對(duì)GPSR和EPDRP算法進(jìn)行仿真實(shí)驗(yàn),仿真結(jié)果表明EPDRP算法獲得了更短的路徑長(zhǎng)度和更少的路由負(fù)載,并有效增加網(wǎng)絡(luò)的壽命。
[Abstract]:In wireless sensor networks, routing protocol is the main core technology. The geographical location routing algorithm is a very important routing algorithm in wireless sensor networks. It is simple and efficient and has the characteristics of low load. Among them, greedy geographic routing is widely used in various wireless sensor networks. However, for randomly deployed networks, routing holes may lead to the failure of routing protocols. It is of great significance to adopt a more effective mechanism of routing cavity recovery and how to reduce the probability of nodes becoming hollow nodes in the geographical location routing algorithm. This paper mainly studies the geographical location routing algorithm, the specific research and implementation work is as follows: 1) this paper theoretically analyzes the probability of routing holes in the case of random deployment, and on the basis of greedy perimeter stateless GPSR routing algorithm. A PDRP routing algorithm based on distance and probability is proposed. The algorithm calculates the probability of node becoming a routing hole and the distance between the node and the destination node, and selects the neighbor node with the lowest ratio of L and P as the next hop of the route to avoid the routing hole. The simulation results show that the proposed algorithm is superior to GPSR algorithm in packet loss rate, packet delay time, average throughput and average path length at different node densities. Network life cycle is an important factor that must be considered. In this paper, an energy-based EPDRP routing algorithm is proposed, which considers both the location information and the residual energy of the node when the next hop is selected. In this paper, NS2 is used to simulate the GPSR and EPDRP algorithms respectively. The simulation results show that the EPDRP algorithm achieves shorter path length and less routing load, and effectively increases the lifetime of the network.
【學(xué)位授予單位】：蘇州大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：TN929.5;TP212.9

【參考文獻(xiàn)】

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

1 李素葉;陳曙;;基于最優(yōu)簇首分布的傳感器網(wǎng)絡(luò)跨層設(shè)計(jì)[J];計(jì)算機(jī)工程與應(yīng)用;2010年11期

，

本文編號(hào)：1803820