Research of Sensor Nodes Artificial Arranging and Round-Robin Scheduling Algorithm for Aggregated Surveillance Targets

Coverage problem is a fundamental problem and a NP hard problem in wireless sensor networks (WSN), which influencing directly the quality of service of network systems. Coverage problem can be divided into three types, such as point coverage, barrier coverage and area coverage problem. This paper focuses on analyzing the point coverage problem of artificial arrangement model, and puts forward a sensor nodes artificial arranging algorithm for aggregated surveillance targets and a round-robin scheduling algorithm under the circumstance of whole targets be covered entirely. The simulation calculation results show that both algorithms have lower time of computation than other similar algorithms, and schedule as less nodes as possible in each turn, thus both our algorithms can not only save the amount of sensor nodes at the stage of deployment but also prolong the life time of network systems.