Snapshot and Continuous Data Collection in Probabilistic Wireless Sensor Networks

Abstract

Data collection is a common operation of Wireless Sensor Networks (WSNs), of which the performance can be measured by its achievable network capacity. Most existing works studying the network capacity issue are based on the unpractical model called deterministic network model. In this paper, a more reasonable model, probabilistic network model, is considered. For snapshot data collection, we propose a novel Cell-based Path Scheduling (CPS) algorithm that achieves capacity of $(\Omega ({1/ 5\omega \ln n} \cdot W))$ in the sense of the worst case and order-optimal capacity in the sense of expectation, where $(n)$ is the number of sensor nodes, $(\omega)$ is a constant, and $(W)$ is the data transmitting rate. For continuous data collection, we propose a Zone-based Pipeline Scheduling (ZPS) algorithm. ZPS significantly speeds up the continuous data collection process by forming a data transmission pipeline, and achieves a capacity gain of $(N \sqrt{n}/ \sqrt{\log n} \ln n)$ or $(n/ \log n \ln n)$ times better than the optimal capacity of the snapshot data collection scenario in order in the sense of the worst case, where $(N)$ is the number of snapshots in a continuous data collection task. The simulation results also validate that the proposed algorithms significantly improve network capacity compared with the existing works.