Rapid data collection in wireless sensor networks

Abstract

Wireless sensor network is a collection of sensor nodes that collectively sense the environment data and forwards it to the base station. In many WSN applications there is a constraint that the data collected has to be delivered as soon as possible. The time required for collecting the data depends on certain constraints. First, sensor node is equipped with a half-duplex transceiver, which can send and receive data simultaneously. Secondly, due to interference, some collisions may happen among sensors transmissions. In this proposed method a new algorithm of rapid data collection in linear duty-cycled WSN is introduced. Then, based on the concept of non-duty-cycled case, a greedy algorithm and a distributed algorithm are introduced. The algorithm is implemented with technique such that, each sensor only works at one slot in a cycle in duty-cycled mode. The algorithms with cycle length equal to 3 have been implemented in our proposed method. Our proposed algorithm is compared with the existing algorithm. The simulation results illustrates that the proposed algorithm with duty cycle have bounded performance gap to the benchmark algorithm in the non-duty-cycled case. Simulation results of our proposed algorithm are used to demonstrate the effectiveness of the proposed algorithms.