Advertisement

Wireless Networks: An Instance of Tandem Discrete-Time Queues

  • Nikhil Singh
  • Ramavarapu S. Sreenivas
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 284)

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).

References

  1. 1.
    M. Gast, 802.11 Wireless Networks: The Definitive Guide (O’Reilly, Sebastapol, 2002)Google Scholar
  2. 2.
    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 2007Google Scholar
  3. 3.
    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, UrbanaGoogle Scholar
  4. 4.
    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–100Google Scholar
  5. 5.
    J. Hsu, P. Burke, Behavior of tandem buffers with geometric input and markovian output. IEEE Trans. Commun. 24(3), 358–361 (1979)Google Scholar
  6. 6.
    R. Jackson, Queueing systems with phase type service. Oper. Res. 5, 109–120 (1954)CrossRefGoogle Scholar
  7. 7.
    K. Bharath-Kumar, Discrete-time queueing systems and their networks. IEEE Trans. Commun. 28(2), 260–263 (1980)CrossRefMATHGoogle Scholar
  8. 8.
    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, 2007Google Scholar
  9. 9.
    The VINT Project, The Network Simulator – NS2, Report, 2004Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Yahoo! LabsChampaignUSA
  2. 2.Coordinated Science Laboratory (CSL) & Industrial and Enterprise Systems EngineeringUniversity of Illinois at Urbana-ChampaignChampaignUSA

Personalised recommendations