Tree-based modelling of redundancy and paths in wireless sensor networks

摘要

Wireless sensor networks (WSNs) consist of a large number of autonomous nodes randomly deployed in the monitoring area. Nodes, having a short distance from each other, gather information and transmit it to the base station. They are used to monitor a given field of interest. They are widely used for military, environmental, and scientific applications, etc. The performance of wireless sensor networks is greatly influenced by their network topology. Node deployment is a fundamental issue to be solved in wireless sensor networks. In spite of their random deployment, nodes have to organise themselves to avoid redundancy and transceiver tasks. The network has to guarantee complete coverage and connectivity as long as possible. In this paper, we address the problem of network coverage and connectivity and propose an hierarchical model for the wireless sensor networks deployment which consists of dividing sensors in sets of equivalent nodes in order to maintain the connectivity of the network. We study the effectiveness of the model under different deployment strategies: random, circular and Poisson point process distributions. We investigate the impact of deployment strategies on: 1) coverage; 2) connectivity ratio; 3) the shortest path to sink.