Skip to Main Content
A sensor grid is an integration of two technologies: wireless sensor networks and the grid. The sensors deployed in a WSN monitor a phenomenon of interest. The information gained from the WSN is processed in the grid and is used by the users of applications. Multipurpose WSNs have become very popular where the deployed WSNs support more than one application. The research in this extended abstract focuses on WSNs supporting multiple applications. In this work, we focus on allocation, which is a process of determining the sensor nodes that will be selected for executing the requests corresponding to an application. Scheduling, which determines the order in which the application requests submitted to the WSN are executed is performed to improve the mean response time to the users of the applications. Our previous works propose various scheduling algorithms for WSNs hosting multiple applications. In this research, various static and dynamic allocation algorithms are proposed with an attempt to balance the energy consumption amongst the sensor nodes and hence improve the network lifetime of the WSN. Network lifetime is the time when the energy of any sensor node in the WSN falls below a predefined threshold. The proposed algorithms use varying degree of information about the energy consumption at the major energy consuming components of the sensor nodes: the CPU component and the radio component. Simulation experiments are performed to evaluate the performance of the proposed algorithms. This extended abstract presents the preliminary results obtained from the experimentation done so far. The simulation experiments demonstrate that by performing dynamic allocation and by using information about the total energy consumption at the sensor nodes, the lifetime of the WSN can be significantly improved.