An Optimization Coverage Mechanism in Sensor Networks based on ACO

In the paper, an energy-efficient Optimization Coverage Mechanism in sensor networks is proposed based on ACO. It can guarantee that each target should be covered by at least one active sensor at the minimum cost, meanwhile, meet the requirement of different coverage accuracy to different levels of targets. To achieve the above mechanism, the novel heuristic factor and global pheromone updating rule are designed, which endow the artificial ants with the ability of coverage-awareness towards the monitored field and energy-awareness towards the sensor area, and finally the optimal robust solution is obtained.

[1]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[2]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[3]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[4]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[5]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[6]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

[7]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).