Improved Minimum Hop Routing Protocol in WSN

Wireless Sensor Network (WSN) is a real-time monitor network ^[1]. It can sense and collect environmental information within the network or monitor objects. These data are processed to obtain detailed and accurate information. Research focusing on Wireless Sensor Network is routing, positioning technology, energy control and security guarantees. Routing technology is the basis for other research directions, and now a lot of routing algorithms have been proposed. This paper is based on the needs of the small transmission delay. The Minimum Hop Routing (MHR) algorithm is studied. MHR algorithm is mainly based on the node updating the routing table, so as to build each routing table, so as to build a path from source node to destination node. MHR has the advantage of network delay is small, but MHR also has shortcomings-with the data transmission, some path will soon run out of energy, the death of some nodes will depart the network into several parts, reduce network connecting. In order to solve the problem, this paper presents an improved minimum hop routing algorithm. First, sensor nodes are randomly distributed by region, Second, selecting the maximum energy node as the target node for transmission. Through analysis and experiment the approach has effectively reduced the transmission hops, and compared with the Flooding, the node energy consumption has increased.