earticle

영어

Wireless sensor networks (WSNs) have gained worldwide attention in recent years. These are of great significance in resolving many real-world problems, and have attracted increasing research interests in recent years. In this paper, we consider a hybrid sensor network with fifty sensor nodes, where a subset of the nodes has movement capability, possibly at high energy expense. A static sensor node can check its energy status and seek for replacement when its current energy falls below a certain threshold. If a redundant static sensor is located close to a dying sensor and can fulfill the coverage requirement, it can be used for substitution. One way to repair the fault is to find redundant nodes to replace faulty nodes. Redundant nodes are placed in the position where the average distance to each sensor node is the shortest. Simulation results show that our algorithm can find the proper redundant node in the minimum time and reduce the relocation time with low message complexity. We investigate the dynamics on random geometric networks. Fixed threshold policy is considered that enables the sensor node to vary and continue its service so that data loss can be minimized. This policy is also considered for energy measure of the node. Work has been carried out for faulty node among intermediate nodes. The rectification is done by replacing the faulty node and to continue the network data transfer.