publication . Preprint . 2015

Index Policies for Optimal Mean-Variance Trade-Off of Inter-delivery Times in Real-Time Sensor Networks

Singh, Rahul; Guo, Xueying; Kumar, P. R.;
Open Access English
  • Published: 26 Jan 2015
A problem of much current practical interest is the replacement of the wiring infrastructure connecting approximately 200 sensor and actuator nodes in automobiles by an access point. This is motivated by the considerable savings in automobile weight, simplification of manufacturability, and future upgradability. A key issue is how to schedule the nodes on the shared access point so as to provide regular packet delivery. In this and other similar applications, the mean of the inter-delivery times of packets, i.e., throughput, is not sufficient to guarantee service-regularity. The time-averaged variance of the inter-delivery times of packets is also an important m...
arXiv: Computer Science::Networking and Internet Architecture
free text keywords: Computer Science - Networking and Internet Architecture
Related Organizations
Funded by
NSF| Emerging Frontiers of Science of Information
  • Funder: National Science Foundation (NSF)
  • Project Code: 0939370
  • Funding stream: Directorate for Computer & Information Science & Engineering | Division of Computing and Communication Foundations
NSF| NeTS: Medium: Collaborative Research: Leveraging Physical Layer Advances for the Next Generation Distributed Wireless Channel Access Protocols
  • Funder: National Science Foundation (NSF)
  • Project Code: 1302182
  • Funding stream: Directorate for Computer & Information Science & Engineering | Division of Computer and Network Systems
Download from
22 references, page 1 of 2

[1] L. Bui, R. Srikant, and A. Stolyar, “Novel architectures and algorithms for delay reduction in back-pressure scheduling and routing,” in INFOCOM 2009, IEEE, April 2009, pp. 2936-2940. [OpenAIRE]

[2] Haozhi Xiong, Ruogu Li, A. Eryilmaz and E. Ekici, “Delay-aware cross-layer design for network utility maximization in multi-hop networks,” Selected Areas in Communications, IEEE Journal on, vol. 29, no. 5, pp. 951-959, May 2011.

[3] A. Eryilmaz and R. Srikant, “Asymptotically tight steady-state queue length bounds implied by drift conditions,” Queueing Syst. Theory Appl., vol. 72, no. 3-4, pp. 311-359, Dec. 2012. [OpenAIRE]

[4] Xiaojun Lin and Ness B. Shroff, “Joint rate control and scheduling in multihop wireless networks,” in in Proceedings of IEEE Conference on Decision and Control, 2004, pp. 1484-1489.

[5] A. L. Stolyar, “Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic,” The Annals of Applied Probability.

[6] M.J. Neely, E. Modiano and Chih-ping Li, “Fairness and optimal stochastic control for heterogeneous networks,” IEEE/ACM Transactions on Networking, vol. 16, no. 2, pp. 396-409, April 2008.

[7] Xueying Guo, Sheng Zhou, Zhisheng Niu and P.R. Kumar, “Optimal wake-up mechanism for single base station with sleep mode,” in International Teletraffic Congress (ITC), Sept 2013. [OpenAIRE]

[8] R. Li, A. Eryilmaz, and B. Li, “Throughput-optimal wireless scheduling with regulated inter-service times,” in INFOCOM, 2013 Proceedings IEEE, April 2013, pp. 2616-2624. [OpenAIRE]

[9] P. Whittle, “Multi-armed bandits and the Gittins index,” J. R. Statist. Soc. B, vol. 42, pp. 143-149, 1980.

[10] B. Li, R. Li, and A. Eryilmaz, “Heavy-traffic-optimal scheduling with regular service guarantees in wireless networks,” in Proceedings of the Fourteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, ser. MobiHoc '13. New York, NY, USA: ACM, 2013, pp. 79-88.

[11] Rahul Singh, I-Hong Hou and P.R. Kumar, “Fluctuation analysis of debt based policies for wireless networks with hard delay constraints,” in INFOCOM, 2014 Proceedings IEEE, April 2014, pp. 2400-2408.

[12] --, “Pathwise performance of debt based policies for wireless networks with hard delay constraints,” in Decision and Control (CDC), 2013 IEEE 52nd Annual Conference on, Dec 2013, pp. 7838- 7843.

[13] K. G. J.C. Gittins and R. Weber, Multi-armed Bandit Allocation Indices. John Wiley & Sons, 2011. [OpenAIRE]

[14] K. Liu and Q. Zhao, “Indexability of restless bandit problems and optimality of whittle index for dynamic multichannel access,” IEEE Transactions on Information Theory, vol. 56, no. 11, pp. 5547- 5567, Nov 2010.

[15] P. S. Ansell, K. D. Glazebrook, J. Nio-Mora, and M. O'Keeffe, “Whittle's index policy for a multi-class queueing system with convex holding costs,” Mathematical Methods of Operations Research, vol. 57, no. 1, pp. 21-39, 2003. [Online]. Available:

22 references, page 1 of 2
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue