Improved Dynamic K-Coverage Algorithms in Mobile Sensor Networks
- 1
- 2
- 3
Abstract
In this paper, four PSO based distributed algorithms are presented to attain k-coverage in the target filed. In the first algorithm named K-Coverage Particle Swarm Optimization (KPSO), each static sensor which discovers an event in its sensing range, implements Particle Swarm Optimization (PSO) algorithm in a distributed manner on its mobile sensors. The calculation time is considered as a big bottleneck in PSO, so a second algorithm named K-Coverage Virtual Force directed Particle Swarm Optimization (KVFPSO) is presented, comprised of Virtual Force and KPSO algorithms. In the first and second proposed algorithms, the best experiences of the particles were used to determine their speed. It is possible that these responses might not be the final result and cause extra movements. Another algorithm named KVFPSO-Learning Automata (KVFPSO-LA) is introduced based on which the speed of particles is corrected by using the existing knowledge and the feedback from the actual implementation of the algorithm. To improve performance of the algorithm, Improved KVFPSO-LA is introduced, in which static sensors are equipped with learning automata. Simulation results show that the proposed protocols perform well with respect to balanced energy consumption among nodes, thus maximizing network life-time.
- J. P. Sheu, G. Y. Chang and Y. T. Chen, “A Novel Approach for K-Coverage Rate Evaluation and Re-Deploy- ment in Wireless Sensor Networks,” IEEE Global Telecommunications Conference, New Orleans, 2008, pp. 1-5.
- A. Yahyavi, L. Roostapour, R. Aslanzadeh and N. Yazdani, “DyKCo: Dynamic K-Coverage in Wireless Sensor Networks,” IEEE International Conference on Systems, Man and Cybernetics, Singapore, 2008, pp. 2804-2809.
- Y. S. Li and S. Gao, “Designing K-Coverage Schedules in Wireless Sensor Networks,” Journal of Combinatorial Op- timization, Vol. 15, No. 2, 2008, pp. 127-146.
- F. Ye, G. Zhong, S. Lu and L. Zhang, “PEAS: A Robust Energy Conserving Protocol for Long-Lived Sensor Net- works,” Proceeding of the 10th IEEE International Con- ference on Network Protocols, Paris, 2002, pp. 200-201.
- W. Ye, J. Heidemann and D. Estrin, “Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks,” IEEE/ACM Transactions on Network- ing, Vol. 12, No. 3, 2004, pp. 493-506.
- T. V. Dam and K. Langendoen, “An Adaptive Energy- Efficient MAC Protocol for Wireless Sensor Networks,” Proceedings of the 1st International Conference on Em- bedded Networked Sensor Systems, Los Angeles, 2003, pp. 171-180.
- Y. C. Wang, W. C. Peng, M. H. Chang and Y. C. Tseng, “Exploring Load-Balance to Dispatch Mobile Sensors in Wireless Sensor Networks,” Proceedings of 16th Inter- national Conference on Computer Communications and Networks, Honolulu, 2007, pp. 669-674.
- S. Kumar, T. H. Lai and J. Balogh, “On K-Coverage in a Mostly Sleeping Sensor Network,” Wireless Networks, Vol. 14, No. 3, 2006, pp. 277-294.
- N. Bulusu, J. Heidemann and D. Estrin, “GPS-Less Low- Cost Outdoor Localization for Very Small Devices,” IEEE Personal Communications, Vol. 7, No. 5, 2000, pp. 28-34.
- J. Xiao, L. L. Sun and S. Zhang, “Distance Optimization Based Coverage Control Algorithm in Mobile Sensor Network,” IEEE International Conference on Systems, Man and Cybernetics, Singapore, 2008, pp. 3321-3325.
- X. Wang, S. Wang and J. J. Ma, “An Improved Co-Evolu- tionary Particle Swarm Optimization for Wireless Sensor Networks with Dynamic Deployment,” Sensors, Vol. 7, No. 3, 2007, pp. 354-370.
- M. Sheybani and M. R. Meybodi, “PSO-LA: A New Mo- del for Optimization,” Proceedings of 12th Annual CSI Computer Conference of Iran, Shahid Beheshti University, Iran, 2007, pp. 1162-1169.