Simultaneously Node Relocation Algorithm for Mobile Sensor Network

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For collecting valuable data in Mobile sensor network, the inter-sensor connectivity plays a vital role. Nodes in these networks monitor different regions of an area of interest. In which failure of a sensor node can leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches that pursue node relocation to restore connectivity have recently been proposed. However, these approaches tend to ignore the possible loss of coverage in some areas, either due to the failure itself or due to the connectivity-limited focus of the recovery. This paper fills this gap by addressing the connectivity and coverage concerns in an integrated manner. A novel simultaneously node repositioning algorithm is presented. Each neighbor temporarily relocates to substitute the failed node, one at a time, and then returns back to its original location. The algorithm is validated using the performance parameter, distance moved and it is worth noting that our algorithm handles well the increase in network connectivity. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Khan, M. A., Hasbullah, H., Nazir, B., Qureshi, I. A., & Pirzada, N. (2013). Simultaneously Node Relocation Algorithm for Mobile Sensor Network. In Communications in Computer and Information Science (Vol. 366 CCIS, pp. 85–95). Springer Verlag. https://doi.org/10.1007/978-3-642-41054-3_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free