Abstract
We model end-to-end flows in an ad-hoc wireless network using a tandem of finite-size, discrete-time queues, located at the nodes along the routes used by the flows, with appropriate restrictions that capture the first- and second-order interference constraints. In addition, we assume there are no capture effects, that is, there is at most one arrival into a queue at any discrete-time instant. The half-duplex nature of communication also supposes there cannot be a simultaneous arrival and departure from a discrete-time queue. These queues are characterized by the channel access probabilities of the node. If the objective is to bound the buffer overflow probability at each queue along a flow, we show that is not necessary to maintain separate queues for each flow that is routed through a node. We present simulation results to support our conclusions. This observation significantly eases the implementation of the distributed algorithm that enforces end-to-end proportional fairness subject to constraints on the buffer overflow probabilities (Singh N, Sreenivas R, Shanbhag U (2008) Enforcing end-to-end proportional fairness with bounded buffer overflow probabilities. Technical Report UILU-ENG-08-2211, Aug 2008, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana).
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
Similar content being viewed by others
Notes
- 1.
This can be changed with impunity following the justification in Sect. 6.2.
References
M. Gast, 802.11 Wireless Networks: The Definitive Guide (O’Reilly, Sebastapol, 2002)
J. Liu, A. Stolyar, Distributed queue length based algorithms for optimal end-to-end throughput allocation and stability in multi-hop random access networks, in Proceedings of the 45th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Sept 2007
N. Singh, R. Sreenivas, U. Shanbhag, Enforcing end-to-end proportional fairness with bounded buffer overflow probabilities. Technical Report UILU-ENG-08-2211, Aug 2008, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana
C.E. Perkins, E.M. Royer, Ad-hoc on-demand distance vector routing, in Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, 1999, pp. 90–100
J. Hsu, P. Burke, Behavior of tandem buffers with geometric input and markovian output. IEEE Trans. Commun. 24(3), 358–361 (1979)
R. Jackson, Queueing systems with phase type service. Oper. Res. 5, 109–120 (1954)
K. Bharath-Kumar, Discrete-time queueing systems and their networks. IEEE Trans. Commun. 28(2), 260–263 (1980)
N. Singh, R.S. Sreenivas, On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks, in Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, Limassol, 2007
The VINT Project, The Network Simulator – NS2, Report, 2004
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Singh, N., Sreenivas, R.S. (2014). Wireless Networks: An Instance of Tandem Discrete-Time Queues. In: Meghanathan, N., Nagamalai, D., Rajasekaran, S. (eds) Networks and Communications (NetCom2013). Lecture Notes in Electrical Engineering, vol 284. Springer, Cham. https://doi.org/10.1007/978-3-319-03692-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-03692-2_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03691-5
Online ISBN: 978-3-319-03692-2
eBook Packages: EngineeringEngineering (R0)