Research On Routing Hole Algorithms In Wireless Sensor Networks

Wireless sensor networks (WSN) are multi-hop self-organized network systems in which massive sensor nodes are randomly deployed to communicate with each other. Its purpose is to cooperation to perceive, collection and processing network coverage area by cognitive object in the information, and sending the observer. However, in some wireless sensor networks practical environments, the terrain, and the environment factors, sensor node energy limited and usually do not be added which lead to "routing holes" phenomenon. Thus, how to successfully resolved "routing hole" problem, extend WSN’s lifetime and ensure the quality of service (QoS) in WSN is the research focus of wireless sensor network.In this paper, we through to the wireless sensor network routing protocol to classification, research and contrast, especially focusing on the analysis of the geographical location information routing protocol. On this basis, aim at addressing the problems caused by "routing holes" and "quality of service", we proposed three routing algorithms, which are listed as follows:(1) The reliability assurance of the QoS in wireless sensor network routing protocol is some concrete applications of the prerequisite, Based on this, a based on Mobile-Agent distributed QoS multicast routing algorithm in WAN (AQRA-W) was proposed. AQRA-W make use of two types of Mobile-Agent communication between collaboration, Thus seek to satisfied the reliability of the QoS routing, Through the routing node flexible updates strategy get the best path, effectively avoid the generation of circuit, guarantee the success of the routing established.(2) Geographic routing (Georouting) with greedy forwarding is attractive for WSN, but "routing holes" in networks often cause routing failures. Aiming at this situation, we propose a Greedy Georouting Algorithm with Conducted Void-bypass Paths (Conby). For most routing hole algorithms adopt same strategy after encounter routing hole node, Different with them, Conby reaches a routing hole node in the first time, it conducts one or two shortest paths which could get out of the hole. The subsequent packet forwardings will be aware of the void before reaching its "routing holes" node, consequently reduce the number of hop count, saving a lot of unnecessary energy consumption. To prevent the exhausting of nodes’energy in the network, at the same time we introduce a threshold of the remaining energy. This will encourage more nodes to participate with routing activity, make balanced energy usage in the network and extend the network lifetime.(3) Analysis the geographic information routing algorithm with greedy forwarding encounter "routing holes" phenomenon, we propose a new Avoid "routing holes" problem algorithm—Hole Avoiding with Mobile-Agent in Wireless Sensor Networks (HAMA). To take greed forward strategy encounter "routing hole" problem, HAMA through the local search algorithms positioning out of the current node properties, Namely the judgment of the network routing node is the "hole related node" or " hole unrelated node", Using the information you have routing node to guide routing, Try to avoid "routing holes". Introduce a method of sensor node remaining energy in HAMA, balance network load and reduce the network energy.