Pseudo Three-dimensional Environment Based On The Geographical Location Of Wireless Sensor Network Routing Algorithm Research

Wireless Sensor Network (WSN) is a new kind of infrastructure, it can be used for real-time monitoring, sensing and collecting information within the network coverage in anytime, and then sending the processed information to the monitor. About the architecture of wireless sensor network, the routing technology on the network layer has become a hot issue. Many routing algorithms on WSN have been proposed in recent years, we can generally classify them into three categories:Hierarchical Routing, Flat Routing, and Geographic Routing. Among them, Geographic Routing has aroused wide concern for its characteristics of simple, effective, and free of storing complex and huge routing information. However, current geographic routing algorithms of WSN usually have the deficiency of routing inefficiently when the WSN is deployed in some complex environment.As routing selection of WSN is not so accurate when the WSN is deployed on the up and down ground during routing, we bring in terrain information, which is used to deploy WSN, and propose a pseudo three-dimensional wireless sensor network geographic routing algorithm, based on Geographic Routing algorithm. This algorithm is applicable to the WSN which is deployed on the up and down ground. During routing, nodes use terrain information to choose next hops. Additionally, they use the shortest path of the current node and neighbors to the target node on the up and down ground instead of the Euclidean distance in the space. The pseudo three-dimensional wireless sensor network geographic routing algorithm can put the information of terrain where the wireless sensor network is distributed into the decision when the data packet is forwarded to the next hop. This behavior can help nodes select a more reasonable route. From the simulation results, we can see this algorithm can reduce the number of hops during routing effectively.As existing solutions to the problems of hole tend to make "detours", this paper proposes a pseudo three-dimensional geographic orthopedic algorithm of hole, based on the GPSR of Geographic Routing algorithm. This algorithm changes original concave holes into a new convex polygon with the smallest size and marks nodes with different identification in the hollow area of the hole. If the target node is not in the area of the hollow hole, these marked nodes are regarded as part of the hole and won’t join in data sending, in order to avoid unnecessary routing. If the target node is in the area of the hollow hole, data packet will be sent to this area. Then we take the orthopedic algorithm of hole to the environment of pseudo three-dimensional, based on the geographic orthopedic algorithm of hole which applied on two dimensions. Compared with traditional ways, this algorithm can not only be applicable to any hole encountered during routing between the source node and the target node, but also needs less hops and therefore declining delays when meeting holes. However, traditional solution can only solve the problem of hole on the single link. From the simulation results, we can see the pseudo three-dimensional geographic orthopedic algorithm of hole can deal with the problems of hole on wireless sensor network effectively.