透過您的圖書館登入
IP:3.136.233.222
  • 期刊
  • OpenAccess

Scheduling of Multiple Applications in Wireless Sensor Networks Using Knowledge of Applications and Network

摘要


This paper presents a simulation based investigation of scheduling on wireless sensor networks 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. This paper proposes scheduling algorithms that combine the knowledge of the characteristics of applications and the system in order to make a scheduling decision. Simulation experiments demonstrate that such algorithms provide a better performance than the knowledge free First Come First Served (FCFS) algorithm. Simulation results show that communication delays play a significant role in determining the overall mean response time in a WSN; and a scheduling algorithm that allocates a higher weight to higher hop distances of sensors from the cluster head provides the best performance.

延伸閱讀