Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ai, C., Guo, L., Cai, Z., Li, Y.: Processing area queries in wireless sensor networks. In: 5th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2009, pp. 1–8. IEEE (2009)
Basagni, S.: Finding a maximal weighted independent set in wireless networks. Telecommunication Systems 18(1-3), 155–168 (2001)
Cai, Z., Chen, Z., Lin, G.: A 3.4713-approximation algorithm for capacitated multicast tree routing problem. Theoretical Computer Science 410(52), 5415–5424 (2009)
Cai, Z., Lin, G., Xue, G.: Improved approximation algorithms for the capacitated multicast routing problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 136–145. Springer, Heidelberg (2005)
Cheng, S., Li, J., Cai, Z.: o (ε)-approximation to physical world by sensor networks. In: 2013 Proceedings IEEE INFOCOM, pp. 3084–3092. IEEE (2013)
Hoepman: Simple distributed weighted matchings. arXiv cs/0410047 (2004)
Hou, I.H., Kumar, P.: Scheduling heterogeneous real-time traffic over fading wireless channels. In: 2010 Proceedings IEEE INFOCOM, pp. 1–9. IEEE (2010)
Jaramillo, J.J., Srikant, R., Ying, L.: Scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints. IEEE Journal on Selected Areas in Communications 29(5), 979–987 (2011)
Kang, X., Wang, W., Jaramillo, J.J., Ying, L.: On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks. In: 2013 Proceedings MobiHoc, pp. 99–108. ACM (2013)
Li, B., Li, R., Ery, A.: Heavy-traffic-optimal scheduling with regular service guarantees in wireless networks. In: 2013 Proceedings MobiHoc, pp. 79–88 (2013)
Li, J., Cheng, S., Gao, H., Cai, Z.: Approximate physical world reconstruction algorithms in sensor networks. IEEE Transactions on Parallel and Distributed Systems, http://doi.ieeecomputersociety.org/10.1109/TPDS.2013.2297121
Li, R., Eryilmaz, A., Li, B.: Throughput-optimal wireless scheduling with regulated inter-service times. In: 2013 Proceedings IEEE INFOCOM, pp. 2616–2624 (2013)
Sakai, S., Togasaki, M., Yamazaki, K.: A note on greedy algorithms for the maximum weighted independent set problem. Discrete Applied Mathematics 126(2), 313–322 (2003)
Tassiulas, L., Ephremides, A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control 37(12), 1936–1948 (1992)
Wan, P.J., Frieder, O., Jia, X., Yao, F., Xu, X., Tang, S.: Wireless link scheduling under physical interference model. In: 2011 Proceedings IEEE INFOCOM, pp. 838–845. IEEE (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Zheng, X., Li, J., Gao, H. (2014). Inter-service Time Guaranteed Scheduling in Wireless Networks. In: Cai, Z., Wang, C., Cheng, S., Wang, H., Gao, H. (eds) Wireless Algorithms, Systems, and Applications. WASA 2014. Lecture Notes in Computer Science, vol 8491. Springer, Cham. https://doi.org/10.1007/978-3-319-07782-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-07782-6_1
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07781-9
Online ISBN: 978-3-319-07782-6
eBook Packages: Computer ScienceComputer Science (R0)