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 this paper, we investigate throughput capacity theories of Hierarchical Wireless Sensor Networks (H-WSN). Firstly, we introduce the structural protocol model, node mobility tracking model and conflict graph model of H-WSN. Secondly, we give some fundamental definitions about conflict graph and conflict event. Thirdly, a fundamental theorem about graph theory is given, and then the throughput capacity is turned to the problem that can be translated into linear constraints system, and can be gotten by finding the feasible solution of linear system. Finally, we propose and prove a critical inequality of throughput capacity of H-WSN. We also propose and prove a gradual probabilistic quality and the specific expression of expectant availability of throughput capacity of H-WSN. The results enrich the theory of some famous conclusions about throughput capacity and the information theory of wireless networks. [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]

Wireless sensor network is a scenario where a base station collects all the sensor data from sensor nodes distributed in the field. A topological connectivity is essential for the better performance of wireless sensor networks. The proposed Multivariate Gaussian Mean Distribution (MGMD) topology consider node distribution around the centralized base station, hence density of sensor nodes are higher near base station. This type of distribution is suitable for application where the frequent monitoring is needed for particular region. The proposed Multivariate Gaussian Mean Distributed (MGMD) network topology for extending the life time of wireless sensors network also increasing the residual energy of nodes. The LEACH algorithm is taken in account to analyze the effect of proposed MGMD topology which gives better performance than random distribution of sensor nodes. [ABSTRACT FROM AUTHOR]

In order to achieve continuous surveillance on the sea environment, it is necessary for Ocean Sensor Networks (OSNs) to be deployed in the widely offshore sea. This paper considers the problem of finding positions to deploy sensors and the relays in a sparse manner so that the sensing and transmission energy consumption can be minimized. We formulated the deployment problem in OSNs as a joint optimization problem on sensor node placement and relay assignment for sparse wireless networks. The first is that of selecting the locations for the sensors to collect data from the points where they are sent to the relays. The second consists in designing the access relay network connecting the existing sensors. Simulation results indicate that the heuristic approach can find better solutions than other heuristic algorithms and greatly outperform the other algorithms in the percentage of successfully save the energy consumption of networks [ABSTRACT FROM AUTHOR]