A novel time orient visit maximization for sink node conformation and scheduling based data collection in war field sensor network

Abstract

The growing networking technology has a greater impact on the information society, and the wireless sensor networks have been identified as a key entity in solving different issues. The flexibility of wireless sensor networks allows many organizations to deploy their own dynamic network. This property of WSN supports the Defense sectors to perform emergency operations in the Warfield. However, the WSN has been deployed to perform data collection from different geographic areas of the world. Consider a Warfield, which requires collecting different informations like the location of troops, their requirement in medicines, weapons, and causalities should be collected inefficient manner. To perform this, different techniques have been proposed earlier, but suffer to achieve high performance in data collection in the Warfield. newlineThe existing adaptive clustering system is suitable for Warfield communication that alleviates the unexpected node death in the network. But number of packets lost during the CH selection process at each round, which may contain more sensible information in the Warfield. The data collection is identified as the major issue which supports decision making in the Warfield. To improve the performance of data collection in WSN, a time orient sink scheduling algorithm is presented. As the sensor nodes have bounded energy, it is necessary to utilize their energy effectively. With this motivation, a time orient sink scheduling algorithm is discussed as the initial solution. The data would be available in a number of data sensors of the network, but choosing a specific data sensor for data collection is most important. The proposed time orient sink scheduling and data estimation algorithm first identify the list of sensors with data availability. For each data sensor, the method estimates the data availability measure using the previous traces newline