Program length based estimated facts assembly with minimal information loss in Wireless sensor networks

Abstract

In Wireless sensor networks (WSN), how to collect the major amount of data and reduce the data size is a delinquent issue. The existing methods concentrated on the data similarities based on the threshold limit. Those approaches may reduce the number of wireless communications but may not guarantee the bandwidth requirements. To ensure the communication and bandwidth requirements, clusters are framed based on the relationship of data and information gathering is done at the global level, in the sink node. A tree based routing topology known as convergecast is applied to transfer the collected information among sensors. The main aim of the time scheduling on a single frequency channel is to minimize the number of time slots required (schedule length) to complete convergecast. To reduce the effect of interference, multiple frequency transmission scheduling is implemented. The results predict that the communication and information gathering is greatly reduced without compromising the bandwidth requirements due to this global data collection approach.