摘要
Information collection from remote location is very important for several tasks such as temperate monitoring, air quality investigation, and wartime surveillance. Wireless sensor network is the first choice to complete these types of tasks. Basically, information prediction scheme is an important feature in any sensor nodes. The efficiency of the sensor network can be improved to large extent with a suitable information prediction scheme. Previously, there were several efforts to resolve this problem, but their accuracy is decreased as the prediction threshold reduces to a small value. Our proposed Adams-Bashforth-Moulton algorithm to overcome this drawback was compared with the Milne Simpson scheme. The proposed algorithm is simulated on distributed sensor nodes where information is gathered from the Intel Berkeley Research Laboratory. To maximize the power saving in wireless sensor network, our adopted method achieves the accuracy of 60.28 and 59.2238 for prediction threshold of 0.01 for Milne Simpson and Adams-Bashforth-Moulton algorithms, respectively.
Information collection from remote location is very important for several tasks such as temperate monitoring, air quality investigation, and wartime surveillance. Wireless sensor network is the first choice to complete these types of tasks. Basically, information prediction scheme is an important feature in any sensor nodes. The efficiency of the sensor network can be improved to large extent with a suitable information prediction scheme. Previously, there were several efforts to resolve this problem, but their accuracy is decreased as the prediction threshold reduces to a small value. Our proposed Adams-Bashforth-Moulton algorithm to overcome this drawback was compared with the Milne Simpson scheme. The proposed algorithm is simulated on distributed sensor nodes where information is gathered from the Intel Berkeley Research Laboratory. To maximize the power saving in wireless sensor network, our adopted method achieves the accuracy of 60.28 and 59.2238 for prediction threshold of 0.01 for Milne Simpson and Adams-Bashforth-Moulton algorithms, respectively.
