SUN Xi-ce, CAO Feng, WANG Zhi. An Optimized Sensor Node Scheduling Algorithm for Multiple Target Associated Coverage in Wireless Sensor Networks[J]. INFORMATION AND CONTROL, 2009, 38(1): 29-36.
Citation: SUN Xi-ce, CAO Feng, WANG Zhi. An Optimized Sensor Node Scheduling Algorithm for Multiple Target Associated Coverage in Wireless Sensor Networks[J]. INFORMATION AND CONTROL, 2009, 38(1): 29-36.

An Optimized Sensor Node Scheduling Algorithm for Multiple Target Associated Coverage in Wireless Sensor Networks

  • An optimized sensor node scheduling algorithm,namely disked-multiple target associated coverage(D-MTAC), is proposed for multiple target associated coverage in wireless sensor networks(WSNs).Based on the idea from association rule of data mining and energy-efficient principle of WSN,the sets of intensely associated targets are given from associated relations between randomly deployed sensor nodes and targets.By optimizing the time division and dynamic self-adaptive selection mechanism,we provide the optimized scheduling and decision-making sets to realize optimal matching between working situation of responsible nodes and network lifetime.Simulation results show that the proposed approach improves the monitoring quality,effectively decreases the accumulative energy consumption,and prolongs the network lifetime.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return