Scheduling on wireless sensor networks hosting multiple applications
Wireless Sensor Networks (WSN) consist of sensors that may serve a single application or multiple applications. Effective resource management is important when multiple applications share a WSN. In this research, a number of scheduling algorithms that use varying degrees of knowledge about system and application characteristics are proposed. Simulation results show how scheduling can be made more effective by making use of knowledge about the characteristics of an application, and the network topology. Results of simulation experiments demonstrate that deployment of scheduling algorithms at a proxy that leads to energy savings at the sensors can still give rise to a performance comparable to a system on which scheduling is performed at the individual sensors.
|Keywords||resource management, scheduling, sensor grids, wireless sensor network|
|Conference||2011 IEEE International Conference on Communications, ICC 2011|
Kapoor, N.K. (Navdeep Kaur), Majumdar, S, & Nandy, B. (Biswajit). (2011). Scheduling on wireless sensor networks hosting multiple applications. Presented at the 2011 IEEE International Conference on Communications, ICC 2011. doi:10.1109/icc.2011.5963195