Abstract
We examine a canonical scenario where several wireless data sources generate sporadic delay-sensitive messages that need to be transmitted to a common access point. The access point operates in a time-slotted fashion, and can instruct the various sources in each slot with what probability to transmit a message, if they have any. When several sources transmit simultaneously, the access point can detect a collision, but is unable to infer the identities of the sources involved. While the access point can use the channel activity observations to obtain estimates of the queue states at the various sources, it does not have any explicit queue length information otherwise.
We explore the achievable delay performance in a regime where the number of sources n grows large while the relative load remains fixed. This scaling is particularly pertinent in Internet of Things (IoT) scenarios, where a key challenge is to achieve low delay when the overall traffic activity is dispersed across massive numbers of highly intermittent sources.
We establish that, under any medium access algorithm without queue state information, the average delay must be at least of the order of n slots when the load exceeds some threshold λ* < 1$. This demonstrates that bounded delay can only be achieved if a positive fraction of the system capacity is sacrificed. Furthermore, we introduce a scalable Two-Phase algorithm for low-delay IoT applications which achieves a delay upper bounded uniformly in n when the load is below e-1, and a delay of the order of n slots when the load is between e-1 and 1. Additionally, this algorithm provides robustness against correlated source activity, which is also prevalent in IoT scenarios.
- 3GPP (2012). Service requirements for machine-type communication. TS 22.368 V11.2.00.Google Scholar
- The FocalPoint Group (2003). M2M white paper: The growth of device connectivity.W hite paper, London ON, Canada.Google Scholar
- NSF (2017). Workshop on Low-Latency Wireless Random Access.https://iot2017.mit.edu, MIT LIDS, November 2--3.Google Scholar
- Vodafone (2010). Global machine to machine communication. White paper, Berkshire, UK.Google Scholar
- I.J.B.F. Adan, J.A.C. Resing (2001). Queueing Theory. Eindhoven University of Technology. Department of Mathematics and Computer Science.Google Scholar
- T.P.C. de Andrade, C.A. Astudillo, N.L.S. da Fonseca (2016). Allocation of control resources for machine-to-machineand human-to-human communications over LTE/LTE-A networks. IEEE Internet of Things J. 3 (3),366--377.Google Scholar
Cross Ref
- N. Bouman, S.C. Borst, J.S.H. van Leeuwaarden (2013). Delays and mixing times in random-access networks. ACM SIGMETRICS Perf. Eval. Rev. 41 (1),117--128. Google Scholar
Digital Library
- R.-G. Cheng, J. Chen, D.-W. Chen, C.-H. Wei (2015). Modeling and analysis of an extended access barring algorithmfor machine-type communications in LTE-A networks. IEEE Trans. Wireless Commun. 14 (6),2956--2968.Google Scholar
Cross Ref
- J. Dai (1995). On positive Harris recurrence of multiclass queueing networks:a unified approach via fluid limit models. Ann. Appl. Prob. 2 (1),49--77.Google Scholar
Cross Ref
- H.S. Dhillon, H. Huang, H. Viswanathan, R.A. Valenzuela (2013). Power-efficient system design for cellular-based machine-to-machinecommunications. IEEE Trans. Wireless Commun. 12 (11),5740--5753.Google Scholar
Cross Ref
- H.S. Dhillon, H. Huang, H. Viswanathan, R.A. Valenzuela (2014). Fundamentals of throughput maximization with random arrivalsfor M2M communications. IEEE Trans. Commun. 62 (11),4094--4109.Google Scholar
Cross Ref
- D. Gamarnik, J.N. Tsitsiklis, M. Zubeldia (2017). Delay, memory and messaging tradeoffs in distributed service systems. Stochastic Systems 7 (1),1--54.Google Scholar
- L. Georgiadis, M.J. Neely, L. Tassiulas (2006). Resource allocation and cross-layer control in wireless networks. Found. Trends Netw. 1(1),1--144. Google Scholar
Digital Library
- L. A. Goldberg, M. Jerrum, S. Kannan, M. Paterson (2004). A bound on the capacity of backoff and acknowledgement-based protocols. SIAM 33 (2),313--331. Google Scholar
Digital Library
- L. A. Goldberg, P. D. MacKenzie (1997). Contention resolution with guaranteed constant expected delayIn: Proc. FOCS 1997, Miami Beach FL213--222. Google Scholar
Digital Library
- B. Hajek (1982). Hitting time and occupation time bounds implied by drift analysiswith applications. Adv. Appl. Prob. 14,502--525.Google Scholar
Cross Ref
- I-H. Hou, P.R. Kumar (2010). Scheduling heterogeneous real-time traffic over fading wireless channels.In: Proc. IEEE Infocom 2010, San Diego CA. Google Scholar
Digital Library
- I-H. Hou, P.R. Kumar (2010). Utility maximization for delay constrained QoS in wireless.In: Proc. IEEE Infocom 2010, San Diego CA. Google Scholar
Digital Library
- T. Kurtz (1981). Approximation of Population Processes.In: Society for Industrial and Applied Mathematics.Google Scholar
- A. Laya, L. Alonso, J. Alonso-Zarate (2014). Is the random access channel of LTE and LTE-A suitable for M2Mcommunications: A survey of alternatives. IEEE Commun. Surv. & Tut. 16 (1),4--16.Google Scholar
Cross Ref
- B. Li, A. Eryilmaz (2013). A fast-CSMA algorithm for deadline-constrained schedulingover wireless fading channels.In: Proc. RAWNET 2011 Workshop.Google Scholar
- B. Li, A. Eryilmaz (2013). Optimal distributed scheduling under time-varying conditions:A fast-CSMA algorithm with applicationsIEEE Trans. Wireless Commun. 12 (7),3278--3288.Google Scholar
Cross Ref
- S.-Y. Lien, K.-C. Chen, Y. Lin (2011). Toward ubiquitous massive accesses in 3GPP machine-to-machinecommunications IEEE Commun. Mag. 49 (4),66--74.Google Scholar
Cross Ref
- T.-M. Lin, C.-H. Lee, J.-P. Cheng, W.-T. Chen (2014). PRADA: Prioritized random access with dynamic access barringfor MTC in 3GPP LTE-A networks IEEE Trans. Veh. Techn. 63 (5),2467--2472.Google Scholar
Cross Ref
- U. Loher (1998). Efficiency of first-come first-served algorithms.In: Proc. of IEEE ISIT.Google Scholar
- S.T. Maguluri, R. Srikant (2016). Heavy traffic queue length behavior in a switch under the MaxWeightalgorithm. Stoch. Syst. 6 (1),211--250.Google Scholar
Cross Ref
- M.L. Molle (1982). On the capacity of infinite population multiple access protocols. IEEE Trans. Inf. Th. 28 (3),396--401. Google Scholar
Digital Library
- M.L. Molle (1990). On the cutoff point for pairwise enabling in multiple access systems. IEEE Trans. Inf. Th. 36 (5),1127--1133. Google Scholar
Digital Library
- J. Mosley, P.A. Humblet (1985)A class of efficient contention resolution algorithms for multipleaccess channels. IEEE Trans. Commun. 33 (2),145--151.Google Scholar
Cross Ref
- M.J. Neely, E. Modiano, Y.-S. Cheng (2007). Logarithmic delay for $n times n$ packet switches under the crossbarconstraint. IEEE/ACM Trans. Netw. 15 (3),657--668. Google Scholar
Digital Library
- M. Paterson, A. Srinivasan (1995). Contention resolution with bounded delay.In: Proc. FOCS 1995, Milwaukee WI104--113. Google Scholar
Digital Library
- N. Pippenger (1981). Bounds on the performance of protocols for a multiple access broadcastchannel. IEEE Trans. Inf. Th. 27 (2),145--151 Google Scholar
Digital Library
- P. Raghavan, E. Upfal (1998). Stochastic contention resolution with short delays. SIAM 28 (2),709--719. Google Scholar
Digital Library
- A. Rajandekar, B. Sikdar (2015). A survey of MAC layer issues and protocols for machine-to-machinecommunications. IEEE Internet of Things J. 2 (2),175--186.Google Scholar
Cross Ref
- S. Rajagopalan, D. Shah, J. Shin (2009). Network adiabatic theorem: an efficient randomized protocol forcontention resolution. ACM SIGMETRICS Perf. Eval. Rev. 37 (1),133--144. Google Scholar
Digital Library
- D. Shah, J. Shin (2010). Delay-optimal queue-based CSMA. ACM SIGMETRICS Perf. Eval. Rev. 38 (1),373--374. Google Scholar
Digital Library
- D. Shah, J. Shin (2012). Randomized scheduling algorithm for queueing networks (2012). Ann. Appl. Prob. 22 (1),128--171.Google Scholar
Cross Ref
- D. Shah, J. Shin, P. Tetali (2011). Medium access using queues.In: IEEE FOCS 2011,698--707. Google Scholar
Digital Library
- D. Shah, J. Tsitsiklis, Y. Zhong (2016). On queue-size scaling for input-queued switches. Stoch. Syst. 6 (1),1--25.Google Scholar
Cross Ref
- D. Shah, N.S. Walton, Y. Zhong (2014). Optimal queue-size scaling in switched networks. Ann. Appl. Prob. 24 (6),2207--2245.Google Scholar
Cross Ref
- J.N. Tsitsiklis (1987). Analysis of a multiaccess control scheme. IEEE Trans. Aut. Contr. 32 (11),1017--1020.Google Scholar
Cross Ref
- J. N. Tsitsiklis, K. Xu (2012). The power of (even a little) resource pooling Stochastic Systems 2 (1),1--66.Google Scholar
- B. Tsybakov, N. Likhanov (1987). Upper bound on the capacity of a random multiple-access system.In: Problemy Peredachi Informatsii 23 (3),64--78.Google Scholar
- H. Wu, C. Zhu, R.J. La, X. Liu, Y. Zhang (2012). Fast adaptive S-ALOHA scheme for event-driven machine-to-machinecommunications.In: Proc. IEEE VTC Fall Conf., Quebec City QC, Canada.Google Scholar
- H. Wu, C. Zhu, R.J. La, X. Liu, Y. Zhang (2013). FASA: Accelerated S-ALOHA using access history for event-driven M2Mcommunications.In: IEEE/ACM Trans. Netw. 21 (6),1904--1917. Google Scholar
Digital Library
- K. Zheng, S. Ou, J. Alonso-Zarate, M. Dohler, F. Liu, H. Zhu (2014). Challenges of massive access in highly dense LTE-advanced networkswith machine-to-machine communications. IEEE Wireless Commun. 21 (3),12--18.Google Scholar
Cross Ref
- M. Zubair Shafiq, L. Ji, A.X. Liu, J. Pang, J. Wang (2012). A first look at cellular machine-to-machine traffic -- Large scalemeasurement and characterization.In: Proc. ACM SIGMETRICS 2012 / Performance 2012,London, England, June 11--15. Google Scholar
Digital Library
Index Terms
Delay Scaling in Many-Sources Wireless Networks without Queue State Information
Recommendations
Delay Scaling in Many-Sources Wireless Networks without Queue State Information
SIGMETRICS '18We examine a canonical scenario where several wireless data sources generate sporadic delay-sensitive messages that need to be transmitted to a common access point. The access point operates in a time-slotted fashion, and can instruct the various ...
Delay Scaling in Many-Sources Wireless Networks without Queue State Information
SIGMETRICS '18: Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer SystemsWe examine a canonical scenario where several wireless data sources generate sporadic delay-sensitive messages that need to be transmitted to a common access point. The access point operates in a time-slotted fashion, and can instruct the various ...
Traffic-adaptive, flow-specific medium access control for wireless networks
WCNC'09: Proceedings of the 2009 IEEE conference on Wireless Communications & Networking ConferenceIn this paper, we formally introduce the novel concept of traffic-adaptive, flow-specific medium access control and show that it outperforms contention, non-contention and hybrid medium access schemes. A traffic-adaptive, flow-specific mechanism is ...






Comments