An Average Distance Based Self-Relocation and Self-Healing Algorithm for Mobile Sensor Networks

Abstract

The sensing coverage of a wireless sensor network is an important measure of the quality of service. It is desirable to develop energy efficient methods for relocating mobile sensors in order to achieve optimum sensing coverage. This paper introduces an average distance based self-relocation and self-healing algorithm for randomly deployed mobile sensor networks. No geo-location or relative location information is needed by this algorithm thereby no hardware such as GPS is required. The tradeoff is that sensors need to move longer distance in order to achieve certain coverage. Simulations are conducted in order to evaluate the proposed relocation and self-healing algorithms. An average of 94% coverage is achieved in the cases that we are examined with or without obstacles

Lattice percolation approach to numerical modelling of tissue aging

“…However, such information is of interest, since the description of the time-dependence of various properties of regions and systems much larger than a few cells will help us understand how to control the system's complex processes to achieve desired properties (such as accelerated healing, or resistance to damage). Within such an approach, concepts of programmed active local healing and damaging have been of interest not only in the studies of materials, but also in designs of sensor networks' functionality [54][55][56], especially when active response is desired: Self-damaging concepts can be useful, for example, in the designs aimed at abruptly shutting a whole sensor network down if enough interconnected nodes have become compromised.…”

“…Senescent cells are still alive, but they permanently withdraw from the cell cycling. Senescence of the cell can be triggered by either exhaustion of its division potential or by damage [55,56]. The latter process can be modeled by assigning small probabilities (small rates as compared to the MC time step unit) for regular sites to undergo damage-related events: see the next rule.…”

Coverage Enhancement Of Average Distance Based Self-Relocation Algorithm Using Augmented Lagrange Optimization

“…As shown in Figure 1, assume that each sensor has an effective area of coverage, E as in [14]. Let the total number of sensors deployed in the field be N. Effective coverage of each sensor is given as:…”

“…It saves energy and increases the lifetime of sensors. The average distance based relocation process does not use any GPS system and hence cuts the energy consumption and cost as well [14]. But since there is no GPS used, the sensors consume extra energy to find their best final position which also increases the number of iterations to find the final coverage.…”

Optimization of Average Distance Based Self-Relocation Algorithm Using Augmented Lagrangian Method

“…Let the total area of the sensor field be A. As shown in Figure 1, assume that each sensor has an effective area of coverage, E as in [14]. Let the total number of sensors deployed in the field be N. Effective coverage of each sensor is given as:…”