Comparison study on mobile sensor node redeployment algorithms

• Published in: 2017 IEEE 13th Malaysia International Conference on Communications, MICC 2017
• Main Author: Akbar N.K.; Isa F.N.M.M.; Abidin H.Z.; Yassin A.I.
• Format: Conference paper
• Language: English
• Published: Institute of Electrical and Electronics Engineers Inc. 2017
• Online Access: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050617170&doi=10.1109%2fMICC.2017.8311726&partnerID=40&md5=5c1f190a31337d3ff27c486848d5e006

This paper focuses on Wireless Sensor Network (WSN) redeployment. A critical problem in WSN is handling the coverage hole because these nodes are normally spread randomly into a terrain area. The objective of this paper is to repair the coverage hole with a less movement from mobile sensor node that it can save energy. Initially, sensor nodes are deployed randomly. Static sensor nodes will be added to enhance the coverage of the network. This paper compares the performance of two WSN mobile node redeployment methods known as Hybrid Particle Swarm Algorithm (IHPSA) and Energy Balanced Redeployment Algorithm (EBRA). IHPSA choose the nodes from redundant to move to the holes location while EBRA use repulsive and attractive forces in order to maximize the coverage. Consequently it will maximize the coverage and all nodes can communicate with each other as well as sending all the data to the base station. The movements of the mobile sensor nodes are minimized to reduce the energy consumption due to mobility. Based on the simulation done, it is found that IHPSA outperforms EBRA in terms of coverage and connectivity. IHPSA algorithm not only solve the coverage hole problem but also solve the energy depletion that always occurs in sensor nodes movement and full connectivity can be guaranteed. © 2017 IEEE.