Search

In this paper, we aim at the point which the sensing coverage for target monitor tracking and the connectivity coverage for information transmitting of WSN claim to robust, anti-fragility. We firstly present and prove a profound sensing radius of nodes; this radius can make each objective point of monitor area fall under the sensing range of at least one sensor node by the probability of tending to 1 at any time. Secondly, we analyze the problem of connectivity coverage of WSN, also present and prove a probability inequality of active nodes, which can be of the judgment scale and the critical threshold that the connectivity of WSN not to be destroyed. Thirdly, under the premise which the necessity of connectivity of WSN is satisfied, we present an algorithm that provided with robust connectivity of big probability, and doing the simulation analysis. [ABSTRACT FROM AUTHOR]

In wireless sensor network (WSN) the sensors are spread in a particular area for monitoring the certain events like environmental monitoring, medical monitoring, surveillance, security applications and many others. But the main concern is related to the lifetime of network that depends on the battery or energy unit of sensor nodes. Many algorithms are being developed to overcome this problem. One of fundamental and efficient method is clustering among those. The work reported herein investigates energy efficient algorithms for WSN. This paper proposed modified Harmony Search Algorithm (HAS) for cluster head selection in WSN, which is seen to provide better performance than direct transmission, fundamental clustering protocol Low Energy Adaptive Clustering Hierarchy (LEACH), and Harmony Search Algorithm (HSA). The performance metrics like network lifetime, throughput and total energy consumption have been analysed and compared for the above mentioned algorithms. [ABSTRACT FROM AUTHOR]