Inter-service Time Guaranteed Scheduling in Wireless Networks

The regularity of inter-service time is essential for processing real-time traffic in wireless networks. Bounding the size of inter-service time for every single user is a precondition to support the normal operating of the network. Motivated by this, we design a framework for inter-service time guaranteed scheduling. We first define a new capacity region of networks with a strict inter-service time constraint. Then we propose a novel scheduling policy that is throughput-optimal and guarantees a bounded inter-service time for every user. Simulation results shows the policy performs well on inter-service time and throughput.

[1]  Panganamala Ramana Kumar,et al.  Scheduling Heterogeneous Real-Time Traffic Over Fading Wireless Channels , 2014, IEEE/ACM Transactions on Networking.

[2]  Valentine Kabanets,et al.  Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits , 2015, COCOON.

[3]  Lei Ying,et al.  On the Performance of Largest-Deficit-First for Scheduling Real-Time Traffic in Wireless Networks , 2016, IEEE/ACM Transactions on Networking.

[4]  Yingshu Li,et al.  Processing Area Queries in Wireless Sensor Networks , 2009, 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks.

[5]  Jianzhong Li,et al.  O(ε)-Approximation to physical world by sensor networks , 2013, 2013 Proceedings IEEE INFOCOM.

[6]  Zhi-Zhong Chen,et al.  A 3.4713-approximation algorithm for the capacitated multicast tree routing problem , 2009, Theor. Comput. Sci..

[7]  Atilla Eryilmaz,et al.  Heavy-traffic-optimal scheduling with regular service guarantees in wireless networks , 2013, MobiHoc '13.

[8]  R. Srikant,et al.  Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints , 2011, IEEE Journal on Selected Areas in Communications.

[9]  Jianzhong Li,et al.  Approximate Physical World Reconstruction Algorithms in Sensor Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[10]  Stefano Basagni,et al.  Finding a Maximal Weighted Independent Set in Wireless Networks , 2001, Telecommun. Syst..

[11]  Atilla Eryilmaz,et al.  Throughput-optimal wireless scheduling with regulated inter-service times , 2013, 2013 Proceedings IEEE INFOCOM.

[12]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[13]  Shaojie Tang,et al.  Wireless link scheduling under physical interference model , 2011, 2011 Proceedings IEEE INFOCOM.

[14]  Guohui Lin,et al.  Improved Approximation Algorithms for the Capacitated Multicast Routing Problem , 2005, COCOON.

[15]  Koichi Yamazaki,et al.  A note on greedy algorithms for the maximum weighted independent set problem , 2003, Discret. Appl. Math..