无线传感器网络中地理位置路由算法研究

发布时间：2018-04-26 01:15

本文选题：无线传感器网络 + 地理位置路由算法　；参考：《苏州大学》2015年硕士论文

【摘要】：在无线传感器网络中,路由协议是主要的核心技术。其中地理位置路由算法是无线传感网络中非常重要的一类路由算法,该算法运行简单高效并具有低负载的特点。其中,贪婪地理路由被广泛用于各种无线传感器网络。然而对于随机部署的网络而言,路由空洞可能会导致路由协议失效。在地理位置路由算法中采用何种更有效的路由空洞恢复机制和如何降低节点成为空洞节点的概率具有重要的意义。本文主要研究地理位置路由算法,具体研究和实现工作如下:(1)本文理论分析在随机部署的情况下路由空洞存在的概率,并在贪婪周界无状态GPSR路由算法的基础上,提出基于距离和概率的PDRP路由算法。该算法分别计算节点成为路由空洞的概率P和节点与目的节点的距离L,选择L和P比值最小的邻居节点作为路由的下一跳,实现避免路由空洞的目的。仿真结果说明,在不同节点密度下,PDRP算法在丢包率、封包延迟时间、平均吞吐量和平均路径长度等方面都优于GPSR算法。(2)由于传感器节点只携带能量十分有限的电池,网络生命周期是必须考虑的重要因素。本文提出基于能量的EPDRP路由算法,在选择下一跳时该算法综合考虑节点的位置信息和剩余能量这两个方面。文中使用NS2分别对GPSR和EPDRP算法进行仿真实验,仿真结果表明EPDRP算法获得了更短的路径长度和更少的路由负载,并有效增加网络的寿命。
[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.
【学位授予单位】：苏州大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TN929.5;TP212.9

【参考文献】