Optimizing the Data Collection in Wireless Sensor Network

In Wireless Sensor Network (WSN), data collection is an important task. How to efficiently collect sensing data from all sensor nodes is important to the performance of WSN. Sensor nodes will send the sensed data to sink for further processing. Sink node will be at root level and the Sensor nodes will act as intermediate and leaf nodes (forms a Tree). The study of data collection had done with Breadth First Search (BFS) and has been proved that BFS data collection have achieved a maximum data collection. In BFS, nodes will send the packets (its own and its child nodes) one after the other to its parent node. This takes more time to transfer the packets. If Parallel data collection algorithm in Breadth First Search (PDC-BFS) is incorporated, the sink can collect the data parallely from its child nodes. Besides, nodes can aggregate the packets (its own and its child nodes) and send to its parent node. This takes less time to transfer the packets.