基于区域划分的传感器网络可靠地理路由算法研究计算机科学与技术专业论文.docxVIP

哈尔滨工业大学工学硕士学位论文 哈尔滨工业大学工学硕士学位论文 II II Abstract Geographical routing algorithms in Wireless sensor networks (WSN) usually use only the geographical position of neighboring sensor nodes to forward packets to the destination. This is very energy efficient, because information exchange in geographical routing is much more less than other routing algorithms. There are many geographical algorithms until now, but they all face a difficulty in making a network planar. This paper introduces a planar method that divide the whole network into many regular region. A planar routing algorithm called PGR is also proposed. When the greedy routing fails, PGR treats a region as a node and finds a way to continue routing. Planar algorithm in this paper is very simple, transmission between regions can be achieved by using reliable routing algorithms and PGR is very suitable for large scale sensor network. PGR can also reduce the path length in many cases. Transsimmision between regions easily get failed because of the unstable link quality and nodes failures. In order to achieve robustness in networks, we develop a inter-region routing mechanism where nodes could send data to neighbor region through node-disjoint paths in this paper. Each region has a center node from which a BFS tree will be constructed. Every node could reach the center node in neighbor region through multiple node-disjoint paths. The number of routing table entries at each node is |K|, where |K| denotes the number of multi-path. The running time complexity of our algorithm is O( L ), where |L| denotes the number of links in the network. IEEE 802.15.4 protocol works very well in light traffic load application s. Large transsimmision occurs when the application wants to monitor the environment on real time. In such situation, sending collision increases, packets lose and the routing reliable reduces. Thus IEEE 802.15.4 protocol is not suitable for large transsimmion networks. In this paper we also propose a m