{"title":"无线传感器网络的抢占式实时调度策略研究","authors":"Zhao Zhibin, Gao Fuxiang","doi":"10.3745/JIPS.2009.5.3.135","DOIUrl":null,"url":null,"abstract":"Most of the tasks in wireless sensor networks (WSN) are requested to run in a real-time way. Neither EDF nor FIFO can ensure real-time scheduling in WSN. A real-time scheduling strategy (RTS) is proposed in this paper. All tasks are divided into two layers and endued diverse priorities. RTS utilizes a preemptive way to ensure hard real-time scheduling. The experimental results indicate that RTS has a good performance both in communication throughput and over-load.","PeriodicalId":46825,"journal":{"name":"Journal of Information Processing Systems","volume":"5 1","pages":"135-144"},"PeriodicalIF":0.8000,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Study on Preemptive Real-Time Scheduling Strategy for Wireless Sensor Networks\",\"authors\":\"Zhao Zhibin, Gao Fuxiang\",\"doi\":\"10.3745/JIPS.2009.5.3.135\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most of the tasks in wireless sensor networks (WSN) are requested to run in a real-time way. Neither EDF nor FIFO can ensure real-time scheduling in WSN. A real-time scheduling strategy (RTS) is proposed in this paper. All tasks are divided into two layers and endued diverse priorities. RTS utilizes a preemptive way to ensure hard real-time scheduling. The experimental results indicate that RTS has a good performance both in communication throughput and over-load.\",\"PeriodicalId\":46825,\"journal\":{\"name\":\"Journal of Information Processing Systems\",\"volume\":\"5 1\",\"pages\":\"135-144\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2009-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information Processing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3745/JIPS.2009.5.3.135\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Processing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3745/JIPS.2009.5.3.135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Study on Preemptive Real-Time Scheduling Strategy for Wireless Sensor Networks
Most of the tasks in wireless sensor networks (WSN) are requested to run in a real-time way. Neither EDF nor FIFO can ensure real-time scheduling in WSN. A real-time scheduling strategy (RTS) is proposed in this paper. All tasks are divided into two layers and endued diverse priorities. RTS utilizes a preemptive way to ensure hard real-time scheduling. The experimental results indicate that RTS has a good performance both in communication throughput and over-load.