Research On The Optimized Protocol Based On GEAR In Wireless Sensor Network

Wireless Sensor Networks was a new network technology in recent years and ithad been widely used in many fields such as environmental protection, militarysurveillance, intelligent transportation, etc. Routing technology was an importantresearch direction in Wireless Sensor Networks. Good routing protocol couldeffectively increase the lifetime of the network, reduce the energy consumption of thenetwork. Location-based routing protocol used the information of the interest area orthe location of the node itself to guide the design of the path so that it could limit thediffusion of messages and reduce the control overhead when establishing the path.GEAR protocol was a typical representative of routing protocol which was based onlocation information. It balanced the energy consumption of nodes because it fullyconsidered the residual energy and costs to the target area. The long path which wassetup by the GEAR protocol was not conducive to save energy consumption. At thesame time in the process of setting up the path it didn’t considered the distribution ofthe surrounding nodes. In order to solve the problems of the above, in this paper itproposed an optimization protocol GLGEAR which had selection strategy ofcandidate node and path optimization algorithm.Firstly, this paper introduced the basic concepts of Wireless Sensor Networks,including the aspects of architecture, field of research and application challenges. Itconcisely introduced some routing technology in Wireless Sensor Networks and somecommonly used routing protocols; it summarized the protocols which based ongeographic information.Secondly, when GLGEAR protocol selecting the next node, it proposed theselection strategy of candidate node. The node determined itself whether it waslocated in the forward position of the candidate region according to the self-positioninformation and the target area information. In the process of establishing a path, italways advanced towards the target area after limiting the forward region so that theselected node had a general direction and shorted the length of the path of the last built. The strategy defined the forward region and in this region every node countedthe number of neighbor nodes and decided whether it could join the candidate set.The selection strategy of Candidate nodes made energy consumption more balancedin the network. At the same time GLGEAR protocol proposed an path optimizationalgorithm. Focus on greedy algorithm for local optimization problems， the algorithmimproved the formula of estimate cost to make routing more optimized and to reducethe time of data transmission. In addition because of giving a strategy which couldsolve the problems of routing void and the failure of data transmission, so datatransfer had better reliability.Finally, we performed simulations in NS2environment. Simulation resultsshowed that it had a better performance in lifetime, energy consumption than GEARprotocol.