The Research Of Hop-Constrained Relay Node Placement Problem In Wireless Sensor Networks

In most of wireless sensor network(WSN)applications,the initial deployed sensors are difficult to connect with each other to form a connected network,which is mainly caused by the poor comnunication eapacity of sensor node and the eomplexity of the external environment.Therefore,it's necessary to deploy relay nodes to build a connected backbone network,so that all nodes are able to make up a connected network system.The paper first studies the link performance in wireless sensor networks under forest environment.It is found that,in the forest environment,the wireless link is unstable and unreliable,and the network is stlrongly dynamic.In order to improve the reliability of the network and reduce the network delay,this paper proposes a hop-constrained relay node deployment algorithm,which limits the number of network hops for each sensor node to the sink node.Finally,a wide range of simulation experiments and performance analysis are carried out for the proposed algorithm.The experimental results show that compared with the STPMSP algorithm,our algorithm significantly reduces the average number of hops and maximum hops of the network.Although the number of relay nodes used is slightly larger than the STPMSP algorithm,but in all simulation experiments,the gap is not more than 2.2%.wireless sensor networks[J].Journal of Heuristics,2015,21(2):197-232.