Abstract

Wireless Sensor Network (WSN) had become almost an indispensible especially the demand for data acquisition from national security to disaster mitigation management, weather data to environmental changes and from many more agencies. The effectiveness and efficacy of WSN dependent on the strength and weakness of the deployment of the sensor nodes which collect and transmit the data. The success of data acquisition in any network depended upon the adequacy of coverage by the sensor nodes; which in turn depended on the method of deployment and redeployment. Since deterministic deployment of nodes could not always be done, random deployment was adopted as a compulsion rather than an option. The random deployment of sensors by nature provided poor network coverage and leading to unsatisfactory data acquisition. Therefore, a better method was sought-after to redeploy the sensors that were deployed earlier at random. Hence, the compelling need had resulted in the development of numerous algorithms for suitably moving the sensors for maximum coverage. Such algorithms were of standalone ones or hybrid/combination in nature. One such combination algorithm termed as Voronoi-Genetic Algorithm (V-GA) a combination/tandom application of Voronoi Vertex Averaging Algorithm (VVAA) and Genetic Algorithm (GA) was analyzed in this study. The displacement and coverage performance were studied, analyzed and compared with that of random deployment and redeployment by the earlier proposed algorithms namely VVAA and GA by the same researcher.

Keywords:

Genetic algorithm, maximum coverage, movement assisted deployment, random deployment , voronoi diagram, wireless sensor networks,

References

1. Al-Omari, S. and S. Weisong, 2010. Incremental sensor node deployment for low cost and highly available WSNs. Proceeding of the 6th International Conference on Mobile Ad-hoc and Sensor Networks, pp: 91-96.
   CrossRef    
2. Babu, S.P.K., M.F.M. Salleh and F. Ghani, 2009. Reduced complexity optimum detector for block data transmission systems. IEICE Electron. Expr., 6(23): 1649-1655.
   CrossRef    
3. Clouqueur, T., V. Phipatanasuphorn, P. Ramanathan and K. Saluja, 2002. Sensor deployment strategy for target detection. WSNA 2002, pp: 42-48.
   CrossRef    
4. Guangming, S., Z. Wei and S. Aiguo, 2006. Self-deployment of mobile sensor networks in complex indoor environments. Proceeding of the 6th World Congress on Intelligent Control and Automation, pp: 4543-4546.
   CrossRef    
5. Guiling, W., C. Guohong and L.P. Tom, 2006. Movement-assisted sensor deployment. IEEE T. Mobile Comput., 5(6): 640-652.
   CrossRef    
6. Howard, A., M.J. Mataric and G.S. Sukhatme, 2002. An incremental deployment algorithm for mobile robot teams. Proceeding of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 3: 2849-2854.
   CrossRef    
7. Juli, V.V. and J. Raja, 2012a. A comparative study on algorithms for mobility in wireless sensor network. J. Theor. Appl. Inform. Technol., 41(1): 51-59.
   
8. Juli, V.V. and J. Raja, 2012b. Mobility assisted optimization algorithms for sensor node deployment. EJSR, 78(1): 156-167.
   
9. Juli, V.V. and J. Raja, 2013. Mobility assisted sensor node self-deployment for maximizing the coverage of wireless sensor networks using a genetic algorithm. TJER, 10(2): 33-45.
   
10. Li, W. and C.G. Cassandras, 2005. A minimum-power wireless sensor network self-deployment scheme. Proceeding of the IEEE Wireless Communications and Networking Conference, pp: 1897-1902.
    PMid:15730317    
11. Mahboubi, H., K. Moezzi, A.G. Aghdam, K. Sayrafian-Pour and V. Marbukh, 2010. Self-deployment algorithms for coverage problem in a network of mobile sensors with unidentical sensing ranges. Proceeding of the IEEE Global Telecommunications Conference (GLOBECOM, 2010), pp: 1-6.
    CrossRef    
12. Maleki, M. and M. Pedram, 2005. QoM and lifetime-constrained random deployment of sensor networks for minimum energy consumption. Proceeding of the 4th International Symposium on Information Processing in Sensor Networks, pp: 293-300.
    CrossRef    
13. Minghua, Y., C. Yuanda, T. Li and Y. Jiong, 2008a. An enhanced self-deployment algorithm in mobile sensor network. Proceeding of the International Seminar on Future Information Technology and Management Engineering, pp: 573-576.
    CrossRef    
14. Minghua, Y., C. Yuanda, T. Li and Y. Jiong, 2008c. A new self-deployment algorithms in hybrid sensor network. Proceeding of the 2nd International Symposium on Intelligent Information Technology Application, pp: 786-789.
    
15. Minghua, Y., C. Yuanda, T. Li, Y. Jiong and Y. Minghua, 2008b. An enhanced precise self-deployment algorithms in mobile sensor networks. Proceeding of the International Symposium on Information Science and Engineering, pp: 268-272.
    CrossRef    
16. Pillwon, P., M. Sung-Gi and H. Youn-Hee, 2010. A grid-based self-deployment schemes in mobile sensor networks. Proceeding of the 5th International Conference on Ubiquitous Information Technologies and Applications (CUTE, 2010), pp: 1-18.
    
17. Poduri, S. and G. Sukhatme, 2004. Constrained coverage for mobile sensor networks. Proceeding of the IEEE International Conference on Robotics and Automation, pp: 165-171.
    CrossRef    
18. Rauy-Shiung, C. and W. Shuo-Hung, 2008. Self-deployment by density control in sensor networks. IEEE T. Veh. Technol., 57(3): 1745-1755.
    CrossRef    
19. Tariq, M., Z. Zhenyu, P. Yong-Jin and T. Sato, 2010. Diffusion based self-deployment algorithm for mobile sensor networks. Proceeding of the IEEE 72nd Vehicular Technology Conference Fall (VTC, 2010-Fall), pp: 1-9.
    CrossRef    
20. Younis, M. and K. Akkaya, 2008. Strategies and techniques for node placement in wireless sensor networks: A survey. Ad Hoc Netw., 6(4): 621-655.
    CrossRef    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.