Date Added: May 2012
The paper concerns a Wireless Sensor Network (WSN) hosting multiple applications. The applications vary in terms of their resource requirements such as the number of sensors required by the applications and the location of the required sensors relative to a sink node. The requests for the various applications need to be scheduled in a manner so as to reduce the overall mean response time to the users of the applications. In this research, simulation experiments demonstrate that system performance is greatly improved by using knowledge of system and application characteristics in scheduling multiple applications in a WSN as compared to scheduling based on knowledge free First Come First Served algorithm.