Study On The Adaptive Congestion Control Of Wireless Sensor Network

As an emerging scientific technology, wireless sensor network promotes thedevelopment of detection sensing technology, and gradually becomes the main trend of thedevelopment of sensor technology. Wireless sensor network is formed by a large number ofsensor nodes deployed in monitoring area by machine or artificial way. The resources of thesesensor nodes, such as computing capacity, energy, and storage space etc, are very limited.Therefore, in the process of data acquisition, processing and transmission, sensor nodes needto fully and effectively use these limited resources to meet the monitoring requirements andextend the network lifetime.The technologies of covering, congestion control and routing are closely related to theprocess of data acquisition, processing and transmission; they will directly influence thequality of service in wireless sensor network. In the data acquisition part, the networkcovering technology determines the characteristics of original data, such as accuracy,availability and redundancy etc. Combined with appropriate power control and sleepscheduling, the network covering technology can effectively enhance the efficiency oforiginal data acquisition and network energy saving. By adjusting rate mechanism, thetechnology of network congestion control can effectively avoid the loss of large amounts ofdata packets, thereby ensures the data integrity. In data transmission, routing mechanismcombined with congestion control technology, not only can effectively relieve congestion, butalso ensures rapid data transmission and the transmission efficiency of the network. Based onthe applications of WSN correlated with covering technology, congestion control and routingtechnology, in this paper, many problems of wireless sensor network, such as target coverage,congestion control and routing protocols, are deeply discussed and researched.Firstly, for the coverage monitoring differentiation problem of multi-target, we propose amulti-target coverage control algorithm based on weighted. The algorithm determines thescope of sensor node deployment by calibrating target weighted. In order to achieveoptimization deployment of sensor nodes, the overlapping domain with maximum degree isselected as deployment area of sensor node. Under the premise of meeting constructednetwork connectivity requirement, we compare the coverage effect of the proposed coveringalgorithm with and without weight through simulation experiments. Simulation results show that proposed algorithm can improve monitoring probability.Secondly, for the problem of sensor node congestion control under a certain flow model,a RED-based congestion control strategy is proposed. The algorithm controls the processingof congestion by setting congestion thresholds. Furthermore, we propose an adaptivecongestion control strategy; this new strategy combines the strategy of upstream nodeparticipated in congestion control and the algorithm of upstream and downstream nodeparticipated in congestion control. Simulation results show that network performance of thealgorithm of upstream and downstream node participated in congestion control is better thanthe algorithm of upstream node participated in congestion control.Finally, we discuss and study the routing problem under congestion control. For theshortcomings of the traditional routing algorithms in congestion control, an improved shortestpath algorithm is presented. The algorithm selects the next sensor node forwarding packets,by means of cache occupied and the number hopped. Through simulation experiments, thenetwork performance of Flooding, Gossiping, and the shortest path is compared. The causesof difference in network performance are also analyzed and studied in this paper. Thetraditional algorithms are changed to improve the quality of service of the network.Simulation results show that the new shortest path algorithm has better network performancethan the traditional shortest path algorithm.