Font Size: a A A

Research On Routing Protocols Based On Virtual Coordinate For Wireless Sensor Networks

Posted on:2016-05-30Degree:DoctorType:Dissertation
Country:ChinaCandidate:D J ZhangFull Text:PDF
GTID:1108330461984429Subject:Communication and Information System
Abstract/Summary:Request the full-text of this thesis
As the progress of wireless communication, sensor technology and Micro-electromechanical systems technology, the research and application of wireless sensor networks (WSNs) have been continuously developed. Wireless sensor network is a kind of self-organization, low power consumption, the distributed wireless communication network. In WSNs, sensor nodes usually use batteries, energy is limited. And due to the complexity of application environment, a lot of external factors will affect the network, thus, topological structure in WSNs is complicated. WSNs are data-centric, ensuring data transmission and improvig the reliability of energy efficiency in the process of transmissions is an important content in WSNs.Routing protocol in WSNs is one of the core components, it plays a key role in the data transmission. Users not only care about the information contained in the data, location information is also crucial. By utilizing the node location information and its neighbors’, the design of routing protocols can be simplified, and, the efficiency of routing can be improved as well. Therefore, the research of routing algorithm based on geographical information has important consequences. In this paper, geographic routing algorithm and the methods of solving the problem of routing void are analyzed, routing protocols based on virtual coordinates are studied, and a series of routing protocols that can bypass the void are proposed.The main works and innovations can be summarized as follows:(1) The structure and features of WSNs are introduced; the characteristics and classification of routing protocols are mentioned; the research method, status and significance are analyzed emphatically.(2) In order to avoid routing void, basic issues of routing void in location-based routing protocols are analyzed. Based on that, based on that, some methods of determineing whether there is void problem are proposed. Starting with the edge node network size and scale, the new methods provide with convenience in the actual application deployment to avoid routing void problem. The network structure without routing void edge are analyzed, new method composing of this structure and virtual coordinate to bypassing void is proposed.(3) Routing void problem in WSNs are analyzed. To solve routing void problem, solation, flooding and face forwarding are provoed, they can help packet bypassing the routing void. However, energy consumption, control overhead and path optimization problems remain to be improved. Furthermore, some algorithms, such as isolation, can not guarantee that all nodes in the network data transmission, which undermines the integrity of network. Furthermore, the mechanisms such as face routing have no route optimization methods. To solve the problem of high control overhead and transmission delay when dealing with routing voids, a bypassing void routing protocol based on virtual coordinate mapping (BVR-VCM) are proposed. The basic idea of the protocol is to transform random structure of void edge into regular one by mapping coordinates on a virtual circle for edge nodes. During routing, some strategies are carried out in different regions and delay node is selected by using virtual coordinates in order to bypass routing void efficiently. The regular edge structure established by mapping can reduce the average length of routing paths, and result in decreasing transmission delay. Meanwhile, virtual coordinates are not affected by practical location of nodes, thus control packet overhead can be reduced. Simulations show the proposed protocol has higher delivery ratio, shorter path length, less control packet overhead and energy consumption.(4) Based on BVR-VCM, by using different methods of surrounding area dividing and the mapping algorithm, BVR-VRC and R-GVI based on virtual coordinate are proposed. BVR-VRC adopts different methods of surrounding area dividing, the selection of relay nodes are simplified, complexity of routing is reduced. R-GVI adopts different mapping algorithm, the virtual coordinate after mapping can reflect the actual construction of the void edges. Simulations show the average energy consumption reduces as the simulation time goes on.(5) Based on the virtual coordinate of voids, a multi-level virtual coordinate system around routing void are established. The multi-level virtual coordinates can let date get routing void information before reaching the void edge. According to different purposes, Two routing protocols BMVC-E-n and BMVC-P-n based on multi-level virtual coordinates are proposed. BMVC-E-n aims for energy balance by redistribution the packets between the multi-level virtual coordinate system; BMVC-P-n aims for the shortest path by a temporary destination node on the lowest level virtual coordinate, and it has shorter path and less time delay.
Keywords/Search Tags:Wireless Sensor Networks, Geographic Routing Protocol, Routing Void, Virtual Coordinate Mapping
Request the full-text of this thesis
Related items