Efficient Query Processing for Opportunistic Sensor Networks

Opportunistic sensor networks are formed by sensors embedded in hand held devices like cell phones. Opportunistic networks are a type of intermittently connected network where there is intermittent connection between Sensor Access points (SAP) such as Wi-Fi hotspots and cell phones. An end user injects query in to the network specifying certain sensing modality of a particular location. These queries are tasked by SAP to the cell phones. Mobility of cell phones generates opportunities to resolving these queries. Selection of scheduling algorithm at SAP decides rate of query completion. This book presents a novel human mobility based efficient query processing algorithm for opportunistic sensor networks. Characteristics of human mobility are leveraged to achieve this. Performance evaluation of the presented algorithm is compared with existing one. A discrete time simulation of the query processing algorithm is done using MATLAB software. Simulation results indicates superiority of the proposed human mobility based scheduling algorithm compared to mobility based shortest job first scheduling algorithm. MATLAB code of the simulation is also presented in appendix of the text.

Autorentext

Dr. M.B.Shah received PhD from IIT Bombay India in 2014. He is working as a Associate Professor in G.H.Patel college of Engineering and Technology, Vallabh Vidhyanagar, India. He received S.K.Mitra Memorial award for best research paper from IETE India in 2013. His research area includes D2D Communication, Internet of Things, M2M communication etc.