Abstract
In this work, we consider an asymmetric two-user random access wireless network with interacting nodes, time-varying links and multipacket reception capabilities. The users are equipped with infinite capacity buffers where they store arriving packets that will be transmitted to a destination node. Moreover, each user employs a general transmission control protocol under which, it adapts its transmission probability based both on the state of the other user, and on the channel state information according to a Gilbert-Elliot model. We study a two-dimensional discrete time Markov chain, investigate its stability condition, and show that its steady state performance is expressed in terms of a solution of a Riemann-Hilbert boundary value problem. Moreover, for the symmetrical system, we provide closed form expressions for the average delay at each user node. Numerical results are obtained and show insights in the system performance.
Notes
- 1.
This model can capture the case where the wireless channel has strong interference by another external network or when the channel is in deep fading. In both cases we can assume that the channel is in the bad state. It is outside of the scope of this version of the paper to consider detailed physical layer considerations.
- 2.
We consider the general case for \(q_{ik}^{*}\), this can handle cases where the node cannot transmit with probability one even if it is transmitting alone. Such a scenario may occur when the nodes are subject to energy limitations. The study of energy harvesting in random access networks has been considered in [5, 20, 29, 30].
- 3.
We assume this mostly for simplicity, however, our work can be extended for the case that the success probability is not zero when the channel is in the bad state.
References
Alliance, N.: NGMN 5G white paper. Next generation mobile networks, White paper (2015)
Avrachenkov, K., Nain, P., Yechiali, U.: A retrial system with two input streams and two orbit queues. Queueing Syst. 77, 1–31 (2014)
Boxma, O.: Two symmetric queues with alternating service and switching times. In: Gelenbe, E. (ed.) Performance 1984, pp. 409–431. North-Holland, Amsterdam (1984)
Chatzikokolakis, K., Kaloxylos, A., Spapis, P., Alonistioti, N., Zhou, C., Eichinger, J., Bulakci, Ö.: On the way to massive access in 5G: challenges and solutions for massive machine communications. In: Weichold, M., Hamdi, M., Shakir, M.Z., Abdallah, M., Karagiannidis, G.K., Ismail, M. (eds.) CrownCom 2015. LNICSSITE, vol. 156, pp. 708–717. Springer, Cham (2015). doi:10.1007/978-3-319-24540-9_58
Chen, Z., Pappas, N., Kountouris, M.: Energy harvesting in delay-aware cognitive shared access networks. In: IEEE ICC Workshops, Paris, France (2017)
Chen, Z., Pappas, N., Kountouris, M., Angelakis, V.: Throughput analysis of smart objects with delay constraints. In: IEEE 17th WoWMoM, Coimbra, Portugal (2016)
Cidon, H.K.I., Sidi, M.: Erasure, capture and random power level selection in multiple access systems. IEEE Trans. Commum. 36, 263–271 (1988)
Cohen, J.W., Boxma, O.: Boundary Value Problems Queueing Systems Analysis. North Holland Publishing Company, Amsterdam (1983)
Dimitriou, I.: A two class retrial system with coupled orbit queues. Prob. Eng. Inf. Sci. 31(2), 139–179 (2017)
Dimitriou, I.: A queueing model with two types of retrial customers and paired services. Ann. Oper. Res. 238(1), 123–143 (2016)
Dimitriou, I.: A retrial queue to model a two-relay cooperative wireless system with simultaneous packet reception. In: Wittevrongel, S., Phung-Duc, T. (eds.) ASMTA 2016. LNCS, vol. 9845, pp. 123–139. Springer, Cham (2016). doi:10.1007/978-3-319-43904-4_9
Dimitriou, I.: A queueing system for modeling cooperative wireless networks with coupled relay nodes and synchronized packet arrivals. Perform. Eval. (2017). doi:10.1016/j.peva.2017.04.002
Dimitriou, I., Pappas, N.: Stable throughput and delay analysis of a random access network with queue-aware transmission. [cs.IT], pp. 1–30 (2017). arXiv:1704.02902
Ephremides, A., Hajek, B.: Information theory and communication networks: an unconsummated union. IEEE Trans. Inf. Theor. 44(6), 2416–2434 (1998)
Fanous, A., Ephremides, A.: Transmission control of two-user slotted ALOHA over Gilbert-Elliott channel: stability and delay analysis. In: Proceedings of the IEEE ISIT, St. Petersburg, Russia (2011)
Fayolle, G., Iasnogorodski, R., Malyshev, V.: Random walks in the quarter-plane, algebraic methods, boundary value problems and applications. Springer, Berlin (2017)
Fayolle, G., Iasnogorodski, R.: Two coupled processors: the reduction to a Riemann-Hilbert problem. Wahrscheinlichkeitstheorie 47, 325–351 (1979)
Fiems, D., Phung-Duc, T.: Light-traffic analysis of queues with limited heterogenous retrials. In: QTNA2016, ACM, Wellington (2016)
Gakhov, F.D.: Boundary Value Problems. Pergamon Press, Oxford (1966)
Jeon, J., Ephremides, A.: On the stability of random multiple access with stochastic energy harvesting. IEEE J. Sel. Areas Commun. 33(3), 571–584 (2015)
Jeon, J., Codreanu, M., Latva-aho, M., Ephremides, A.: The stability property of cognitive radio systems with imperfect sensing. IEEE J. Sel. Areas Commun. 32(3), 628–640 (2014)
Kompella, S., Ephremides, A.: Stable throughput regions in wireless networks. Found. Trends Netw. 7(4), 235–338 (2014)
Lau, C., Leung, C.: Capture models for mobile packet radio networks. IEEE Trans. Commun. 40, 917–925 (1992)
Luo, W., Ephremides, A.: Stability of N interacting queues in random-access systems. IEEE Trans. Inf. Theor. 45(5), 1579–1587 (1999)
Mahmoud, Q.: Cognitive Networks: Towards Self-Aware Networks. Wiley, Hoboken (2007)
Nain, P.: Analysis of a two-node Aloha network with infinite capacity buffers. In: Hasegawa, T., Takagi, H., Takahashi, Y. (eds.) Proceedings of the International Seminar on Computer Networking and Performance Evaluation, pp. 49–63, Tokyo (1985)
Naware, V., Mergen, G., Tong, L.: Stability and delay of finite-user slotted ALOHA with multipacket reception. IEEE Trans. Inf. Theor. 51(7), 2636–2656 (2005)
Osseiran, A., et al.: Scenarios for 5G mobile and wireless communications: the vision of the METIS project. IEEE Commun. Mag. 52(5), 26–35 (2014)
Pappas, N., Kountouris, M., Jeon, J., Ephremides, A., Traganitis, A.: Network-level cooperation in energy harvesting wireless networks. In: IEEE GlobalSIP, pp. 383–386, Austin, TX, USA (2013)
Pappas, N., Kountouris, M., Jeon, J., Ephremides, A., Traganitis, A.: Effect of energy harvesting on stable throughput in cooperative relay systems. J. Commun. Netw. 18(2), 261–269 (2016)
Resing, J.A.C., Ormeci, L.: A tandem queueing model with coupled processors. Oper. Res. Lett. 31, 383–389 (2003)
Rao, R., Ephremides, A.: On the stability of interacting queues in multiple access system. IEEE Trans. Inf. Theor. 34, 918–930 (1989)
Sidi, M., Segall, A.: Two interfering queues in packet-radio networks. IEEE Trans. Commun. 31(1), 123–129 (1983)
Szpankowski, W.: Stability Conditions for multidimensional queuing systems with applications. Oper. Res. 36(6), 944–957 (1988)
Tsybakov, B.S., Mikhailov, V.A.: Ergodicity of a slotted ALOHA system. Probl. Peredachi Inf. 15, 73–87 (1979)
Van Leeuwaarden, J.S.H., Resing, J.A.C.: A tandem queue with coupled processors: computational issues. Queueing Syst. 50, 29–52 (2005)
Zorzi, M., Rao, R.: Capture and retransmission control in mobile radio. IEEE J. Sel. Areas Commun. 12, 1289–1298 (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
A Appendix
Regarding the derivation of (2), the queue evolution in (1) implies,
where \(1_{\{A\}}\) denotes the indicator function of the event A. Note that
B Appendix
In the following, we proceed with the study of the location of the intersection points of \(R(x,y)=0\), \(A(x,y)=0\) (resp. B(x, y)). These points (if exist) are potential singularities for the functions H(x, 0), H(0, y), and thus, their investigation is crucial regarding the analytic continuation of H(x, 0), H(0, y) outside the unit disk. We only focus on the intersection points of \(R(x,y)=0\), \(A(x,y)=0\).
For and \(R(x,y) = 0\), \(y = Y_{\pm }(x)\), the resultant in y of the two polynomials R(x, y) and A(x, y) is \(Res_{y}(R,A;x)=x(x-1)s_{G}^{(2)}q_{G2}\widehat{q}_{21}Z(x)\), where
Note also that \(Z(0)>0\) since \(d_{1,2}<0\), and \(Z(1)>0\), due to the stability conditions (see Lemma 1). If \(q_{G1}^{*}\le min\{1,\frac{s_{G}^{(2)}q_{G2}\widehat{q}_{21}+(1+\widehat{\lambda }_{2})s_{G}^{(1)}q_{G1}\widehat{q}_{12}}{(1+\widehat{\lambda }_{2})s_{G}^{(1)}\tilde{f}_{G1/\{G1\}}}\}\), then \(\lim _{x\rightarrow \infty }Z(x)=-\infty \), and \(Z(x)=0\) has two roots of opposite sign, say \(x_{*}<0<1<x^{*}\). If \(\frac{s_{G}^{(2)}q_{G2}\widehat{q}_{21}+(1+\widehat{\lambda }_{2})s_{G}^{(1)}q_{G1}\widehat{q}_{12}}{(1+\widehat{\lambda }_{2})s_{G}^{(1)}\tilde{f}_{G1/\{G1\}}}<\alpha _{1}^{*}\le 1\), then \(\lim _{x\rightarrow \infty }Z(x)=+\infty \), and \(Z(x)=0\) has two positive roots, say \(1<\tilde{x}_{*}<x_{3}<x_{4}<\tilde{x}^{*}\) (due to the stability conditions). In the former case we have to check if \(x^{*}\in S_{x}\), while in the latter case if \(\tilde{x}_{*}\in S_{x}\). These zeros, if they lie in \(S_{x}\) such that \(|Y_{0}(x)|\le 1\), are poles of A(x, y). Denote from hereon \(\bar{x}=x^{*}\), if \(\alpha _{1}^{*}\le min\{1,\frac{s_{G}^{(2)}q_{G2}\widehat{q}_{21}+(1+\widehat{\lambda }_{2})s_{G}^{(1)}q_{G1}\widehat{q}_{12}}{(1+\widehat{\lambda }_{2})s_{G}^{(1)}\tilde{f}_{G1/\{G1\}}}\}\), and \(\bar{x}=\tilde{x}_{*}\), if \(\frac{s_{G}^{(2)}q_{G2}\widehat{q}_{21}+(1+\widehat{\lambda }_{2})s_{G}^{(1)}q_{G1}\widehat{q}_{12}}{(1+\widehat{\lambda }_{2})s_{G}^{(1)}\tilde{f}_{G1/\{G1\}}}<\alpha _{1}^{*}\le 1\).
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Dimitriou, I., Pappas, N. (2017). Stability and Delay Analysis of an Adaptive Channel-Aware Random Access Wireless Network. In: Thomas, N., Forshaw, M. (eds) Analytical and Stochastic Modelling Techniques and Applications. ASMTA 2017. Lecture Notes in Computer Science(), vol 10378. Springer, Cham. https://doi.org/10.1007/978-3-319-61428-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-61428-1_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61427-4
Online ISBN: 978-3-319-61428-1
eBook Packages: Computer ScienceComputer Science (R0)