Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 785305, 14 pages
Research Article

An Energy Efficient Simultaneous-Node Repositioning Algorithm for Mobile Sensor Networks

1Department of Computer and Information Sciences, Universiti Teknologi Petronas, 31750 Tronoh, Perak, Malaysia
2Department of Electrical Engineering, COMSATS Institute of Information Technology, University Road, Tobe Campus, Abbottabad 22060, Pakistan
3Computer Science Department, COMSATS Institute of Information Technology, University Road, Tobe Campus, Abbottabad 22060, Pakistan

Received 27 December 2013; Accepted 19 February 2014; Published 23 July 2014

Academic Editors: H. R. Karimi, X. Yang, Z. Yu, and W. Zhang

Copyright © 2014 Muhammad Amir Khan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Recently, wireless sensor network (WSN) applications have seen an increase in interest. In search and rescue, battlefield reconnaissance, and some other such applications, so that a survey of the area of interest can be made collectively, a set of mobile nodes is deployed. Keeping the network nodes connected is vital for WSNs to be effective. The provision of connectivity can be made at the time of startup and can be maintained by carefully coordinating the nodes when they move. However, if a node suddenly fails, the network could be partitioned to cause communication problems. Recently, several methods that use the relocation of nodes for connectivity restoration have been proposed. However, these methods have the tendency to not consider the potential coverage loss in some locations. This paper addresses the concerns of both connectivity and coverage in an integrated way so that this gap can be filled. A novel algorithm for simultaneous-node repositioning is introduced. In this approach, each neighbour of the failed node, one by one, moves in for a certain amount of time to take the place of the failed node, after which it returns to its original location in the network. The effectiveness of this algorithm has been verified by the simulation results.