Efficient scheduling algorithm for query processing in Opportunistic Sensor Network under human mobility model

In an Opportunistic Sensor Network (OSN), mobile nodes equipped with sensor are tasked by Sensor Access Points (SAPs) in aid of applications running distantly on the Internet. Mobile sensor nodes upload sensed data back to the SAP once its tasked queries are sensed. In an OSN, node mobility is uncontrolled and the performance of scheduling algorithms relies on opportunistic meeting between human-attached sensors and SAPs. In this paper we are proposing and evaluating the performance of a novel Human Mobility based Shortest Job First (HMB-SJF) Scheduling algorithm for efficient query processing under the human mobility models such as Truncated Levy Walk (TLW). HMB-SJF performs better compared to naïve instantaneous mobility based MB-SJF scheduling algorithm. Number of uploading of sensed queries are improved by almost 15% for HMB-SJF compared to MB-SJF.