The issue of providing Quality of Service (QoS) guarantees in an Ad hoc wireless network is a very challenging problem. In this paper, we make the following contributions: (i) analytically derive bounds for the end-to-end call acceptance rate using existing queueing theory methods, (ii) study the impact of the routing scheme on the end-to-end call acceptance rate, and (iii) propose a differentiated services scheme for deterministically providing QoS guarantees. Unlike the existing studies which analyze the transport capacity, we focus on the end-to-end call acceptance. The framework that we assume is that of a TDMA based Ad hoc wireless network. The routing scheme employed influences the end-to-end call acceptance of the network. The metrics that we consider are the call acceptance probability and the system saturation probability (i.e., the probability that the network is in a state in which every new call is rejected). We derive general bounds on the call acceptance and the system saturation for the case of differentiated-classes of users in the network. These bounds indicate the number of calls of the highest priority class that can be admitted into the network. Simulation studies were carried out to study the effect of load, hopcount, and the influence of the routing protocol on the call acceptance. The increase in the call acceptance rate with the introduction of load-balancing highlights the importance of load-balancing in enhancing the system performance. From these studies, we arrive at the following results: (i) load-balancing leads to significant improvement in the end-to-end call acceptance rate, and is an important factor in attaining the maximum end-to-end call acceptance rate in a given network and (ii) it is indeed possible to provide deterministic QoS guarantees for a designated set of nodes which are characterized by “deterministic guarantee limit”.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
In the most general case of a model corresponding to K classes of calls in a network having B slots, the Markov process has \(K+B \choose B\) states. This is not a problem for the current analysis since the transitions between the states are restricted: every state has at most 2K neighboring states, and the processes associated with any given regions are decoupled. Further, we are interested in only the steady state of the process and not in the paths traversed. The state-explosion needs to be tackled for an analysis that considers coupled processes or preemptive calls: the interested reader may refer  and .
For the case of preemption, the system can move between certain other states. Corresponding to the case of preemption of a class-2 call by a class-1 call, the system can move from the state (n 1, n 2,…, n K ) to (n 1 + 1, n 2 − 1,…, n K ), n 2 ≥ 1.
Gupta, P., & Kumar, P. R. (2000). The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2), 388–404.
Xie, L. L., & Kumar, P. R. (2004). A network information theory for wireless communication: Scaling laws and optimal operation. IEEE Transactions on Information Theory, 50(5), 748–767.
Grossglauser, M., & Tse, D. N. C. (2002). Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Transactions on Networking, 10(4), 477–486.
Tabet, T., & Knopp, R. (2004). Bounds on the throughput capacity of wireless ad hoc networks with non-uniform traffic. In Proceedings of IEEE SECON, pp. 210–217, October 2004.
Negi, R., & Rajeswaran, A. (2004). Capacity of power constrained ad-hoc networks. In Proceedings of IEEE INFOCOM, Vol. 1, pp. 443–453, March 2004.
Kumar, A., Altman, E., Miorandi, D., & Goyal, M. (2005). New insights from a fixed point analysis of single cell IEEE 802.11 wireless LANs. In Proceedings of IEEE INFOCOM Vol. 3, pp. 1550–1561, March 2005.
Sharma, G., Ganesh, A., & Key, P. (2006). Performance analysis of contention based medium access control protocols. In Proceedings of IEEE INFOCOM, April 2006.
Gao, Y., Chiu, D.-M., & Lui, J. C. S. (2006). Determining the end-to-end throughput capacity in multi-hop networks: Methodology and applications. ACM SIGMETRICS Performance Evaluation Review, 34(1), pp. 39–50.
Romer, K. (2001). Time synchronization in ad hoc networks. In Proceedings of ACM MOBIHOC, pp. 173–182, October 2001.
Zhong, X., Mei, S., Wang, Y., & Wang, J. (2004). Synchronization in TDMA ad hoc network. In Proceedings of IEEE VTC Vol. 7, pp. 5011–5014, September 2004.
Chen, L., & Leneutre, J. (2007). Toward secure and scalable time synchronization in ad hoc networks. Computer Communications, 30(11–12), 2453–2467.
Kemeny, J. G., & Snell, J. L. (1960). Finite Markov chains. New York, USA: Van Nostrand.
Buchholz, P., Ciardo, G., Kemper, P., & Donatelli, S. (2000). Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS Journal on Computing, 12(3), 203–222.
Bertsekas, D., & Gallager, R. (1992). Data networks, 2nd edn. New Jersey, USA: Prentice Hall.
Bhaya, G., Manoj, B. S., & Siva Ram Murthy, C. (2003). Ring-based routing schemes for load distribution and throughput improvement in multi-hop cellular, ad hoc, and mesh networks. In Proceedings of HiPC, LNCS 2913, pp. 152–161, December 2003.
Ma, Q., Steenkiste, P., & Zhang, H. (1996). Routing high-bandwidth traffic in max–min fair share networks. In Proceedings of ACM SIGCOMM, pp. 206–217, August 1996.
About this article
Cite this article
Sriram, S., Bheemarjuna Reddy, T. & Siva Ram Murthy, C. The influence of QoS routing on the achievable capacity in TDMA based Ad hoc wireless networks. Wireless Netw 16, 291–310 (2010). https://doi.org/10.1007/s11276-008-0130-5
- Ad hoc wireless networks
- QoS routing
- Call acceptance probability