Research On Multi-hop Routing In WSN Under The Relationship Model

Wireless Sensor Network(WSN)is composed of sensor nodes and convergence centers(Sink nodes)deployed in the monitoring area.As the core technology of the Internet of Things,WSN is widely used in information collection.However,its development has been subject to factors such as distance and energy consumption.To solve the above problems,this paper proposes an energy distance model and designs a multiple hop routing algorithm based on path optimization(MRPG)based on this model.The study is summarized as follows:1.This article reviews the shortcomings of the WSN nodes' distance model: 1)Increase the network construction cost;2)The satellite signal has a higher requirement for the deployment environment;3)The distance relationship can not accurately reflect the communication between nodes,so the node energy distance model was designed.This model uses radio power as a medium to describe the relationship between nodes,which can reduce deployment costs and improve the reliability of node communications.2.To complete the preparation work before entering the data collection state.This paper designs the network initialization algorithm and constructs a data structure called the energy distance table,which fully contains the information required for network routing such as the remaining energy of the node and the energy distance between the nodes.Before the formation of network topology,the network initialization is divided into three sub-processes according to the different state of nodes.Each subprocess requires collaboration between the nodes.3.In this paper,the WSN multi-hop routing method MRPG is proposed in the relationship model.The path to plan data transmission path for all sensor nodes in the network by calculating path survival time and node average data redundancy.Meanwhile,the MRPG relies on the centralized calculation of sink node,and two algorithms are designed for this paper.The algorithm USES to "violently" select the optimal path for each node.The algorithm of hierarchical node integration is to classify the sensor nodes in the network according to the hop number of the Sink node.Then the nodes are integrated step by step,which to constructed the routing topology of the whole network.Experimental results show that the Hierarchical node inclusion algorithm routing generation time is lower than exhaustive algorithm.This paper analyzes the four routing methods of MRPG,LEACH,UCDP and DEEC through simulation experiments.In order to test the performance of the routing method under multi-hop conditions,the MRPG routing method proposed in this paper forms MRPG-2 and MRPG-5 sub-methods by controlling the maximum number of hops.Simulation results show that the proposed MRPG routing method performs better than the other three algorithms in terms of network lifetime,average energy consumption per unit of data and energy consumption balance.