Research On Key Techniques Of QoS Support In Wireless Sensor Networks

As one of the key techniques of the information collection in the Internet ofThings (IOT), Wireless Sensor Network (WSN) has changed the method ofinteractive communication between the human and nature, pushes forward thedevelopment of science and technology and advances of society, which is applied inmilitary, environmental, medical and other related fields.Wireless sensor network faces many challenges because of its limited noderesources and harsh deployment environment. How to prolong the network lifetimeby improving node energy efficiency as well as meeting the user’s requirements is aurgent issue of the QoS support technique in wireless sensor networks. To wirelesssensor networks which are data-centric, the performance of QoS support fromnetworks will influence the result of user’s monitoring data directly.For the purpose of improving energy efficiency and satisfying requirements ofQoS support, this paper studies and improves coverage and transmission controltechnique, which belong to QoS support technique provided by wireless sensornetworks, and verifies the performance of new algorithm by relevant experiments.The main contributions of this paper are described as fellow.1) Node scheduling scheme in coverage control technique is an effectiveapproach to solve problems of limited energy constraints and high coverageredundancy in wireless sensor networks. However, it should satisfy requirements ofcoverage rate as well as energy saving. To solve the problems of unbalanced andinefficient energy consumption of nodes in random node scheduling schemes, a nodescheduling scheme based on spatial resolution was proposed in this paper. Thisscheme maintained coverage rate by controlling the number of active nodes in adeployed area, and balanced remaining energy of every node. Meanwhile, a neighbornodes protection mechanism was adopted to ensure that dormant nodes closedreal-time listening in order to reduce energy consumption and the demand ofcoverage rate was fulfilled effectively owe to relieving the situation of coverage holeswhich may occur when nodes take turns to rest. Simulation results showed the performance of this scheme was superior to other similar schemes in coverage rate,lifetime and balance of energy consumption among nodes.2) Node scheduling schemes reduce nodes and data redundancy, and relieve thesituation of channel congestion and data conflict effectively, but weaken reliability ofdata transmission as well. In addition, transmission demands of need to be meeturgently, which come from tremendous data of real-time audios, videos and images orcatastrophic emergency forecast. To solve these problems, a reliable data transportmechanism was proposed in this paper. This mechanism transmitted emergency orlong-distance transmission data preferentially which was according to the idea ofdifferentiated services, maintained fairness of channel bandwidth allocation, andsolved the problem of congestion and packet loss as well. As a result, it protected thereliability and integrity of transmission data effectively. Simulation results indicatedthe performance of this mechanism was superior to other similar algorithm inthroughput, packet loss rate and delay.