Scheduling under Location and Time Constraints for Data Collection in Sensor Networks ( Work in Progress paper )
暂无分享,去创建一个
[1] Michael Sipser,et al. On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals , 1984, Oper. Res..
[2] Sanjoy K. Baruah,et al. Feasibility Problems for Recurring Tasks on one Processor , 1993, Theor. Comput. Sci..
[3] Ashutosh Sabharwal,et al. Using Predictable Observer Mobility for Power Efficient Design of Sensor Networks , 2003, IPSN.
[4] Waylon Brunette,et al. Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.
[5] Chi-Sheng Shih,et al. Scheduling Jobs with Multiple Feasible Intervals , 2003, RTCSA.
[6] Mani B. Srivastava,et al. Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines , 2004, 25th IEEE International Real-Time Systems Symposium.
[7] Deborah Estrin,et al. Intelligent fluid infrastructure for embedded networks , 2004, MobiSys '04.
[8] Mani B. Srivastava,et al. Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks , 2005, DCOSS.
[9] Tei-Wei Kuo,et al. Approximation algorithms for scheduling multiple feasible interval jobs , 2005, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05).
[10] Rajesh Gupta,et al. Data Mule Scheduling in Sensor Networks: Scheduling under Location and Time Constraints , 2007 .
[11] Yuanyuan Yang,et al. SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.
[12] Jane W.-S. Liu. Real-Time Systems , 2000, Encyclopedia of Algorithms.