Combining Sensor Selection with Routing and Scheduling in Wireless Sensor Networks
Conor Muldoon‚ Niki Trigoni and Gregory M. P. O' Hare
In wireless sensor networks, determining the set of locations to activate sensors, such that the amount of information received is maximised, is an important task. With the model driven approach to sensor networks, a considerable amount of research has been conducted into the sensor selection problem, whereby informative locations to activate sensors are determined through the use of Gaussian Processes. Current approaches to sensor selection, however, do not take bandwidth constraints into consideration. When bandwidth is limited, the amount of time required to realise a given set of communication requests, in terms of routing and scheduling, must be accounted for. Traditionally, in wireless sensor networks, sensor selection, routing, and scheduling are considered separately. These three processes, however, are highly coupled and the overall utility of the data collection process, in terms of the amount of information it produces, can be improved by integrating them. In this paper, we present two approaches to combining routing, scheduling, and sensor selection such that they inform each other so as to improve the performance of the network in the bandwidth limited case.