Email this article 
Open Access
Subscription or Fee Access
Achieving Maximum Throughput and Low Delay in Wireless Multi-hop Networks using Q-CSMA/CA Algorithm
Abstract
One of the challenges in multi hop wireless networks is to maximize throughput over a communication channel. The greatest challenge is to attain optimal throughput, in a distributed manner. It has been shown that Queue length based Carrier Sense Multiple Access (Q-CSMA)-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. In general, single channel communication network is considered. In this kind of network, if more than one links are active in a certain neighborhood or more than one entity try to access a certain link, it’s have a collision. When a collision occurs, packets are not successfully transmitted over the medium. Its define a hybrid algorithm to use for improve the efficiency of collision avoided communication to improve throughput and reduce latency. This algorithm based on hybrid Q-CSMA and AODV and Preemptive scheduling. In finally combining CSMA with AODV leads to very good delay performance. Believe that it should be straightforward to extend this algorithms to be applicable to networks with multi-hop traffic and congestion-controlled sources.
Keywords
References
J. Ni, B. R. Tan, and R. Srikant, “Q-CSMA: Queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks,” IEEE/ACM Transactions on Networking,vol.20,no.3,June .2012 .
U. Akyol, M. Andrews, P. Gupta, J. Hobby, I. Saniee, and A. Stolyar, “Joint scheduling and congestion control in mobile ad-hoc networks,” in Proc. IEEE INFOCOM, April 2008, pp. 619–627.
R. R. Boorstyn, A. Kershenbaum, B. Maglaris, and V. Sahin, “Throughput analysis in multihop CSMA packet radio networks,”IEEE Trans. Commun., vol. COM-35, no. 3, pp. 267–274, Mar. 1987.
C. Bordenave, D. McDonald, and A. Proutiere, “Performance of random medium access algorithms, an asymptotic approach,” in Proc.ACM SIGMETRICS, Jun. 2008, pp. 1–12.
P. Chaporkar, K. Kar, and S. Sarkar, Throughput guarantees through maximal scheduling in wireless networks,” in Proc. 43rd Annu. Allerton Conf. Commun., Control, Comput., Sep. 2005, pp. 28–30.
A. Dimakis and J. Walrand, “Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits,” Adv. Appl. Probab., vol. 38, no. 2, pp. 505–521, 2006.
M. Durvy and P. Thiran, “A packing approach to compare slotted and non-slotted medium access control,” in Proc. IEEE INFOCOM, Apr.2006, pp. 1–12.
L. Jiang and J.Walrand, “Convergence analysis of a distributed CSMA algorithm for maximal throughput in a general class of networks,” UC Berkeley, Berkeley, CA, Tech. Rep., Dec. 2008.
L. Jiang and J. Walrand, “A distributed CSMA algorithm for throughput and utility maximization in wireless networks,” in Proc. 46th Annu. Allerton Conf. Commun., Control, Comput., Sep. 2008, pp. 1511–1519.
L. Jiang and J. Walrand, “Approaching throughput-optimality in a distributed CSMA algorithm with contention resolution,” UC Berkeley, Berkeley, CA, Tech. Rep., March 2009.
C. Joo, X. Lin, and N. B. Shroff, “Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks,” IEEE/ACM Trans. Netw., vol. 17, no. 4, pp. 1132–1145, Aug.2009.
M. Leconte, J. Ni, and R. Srikant, “Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks,” IEEE/ACM Trans. Netw., vol. 19, no. 3, pp. 709–720, Jun. 2011.
S. C. Liew, C. Kai, J. Leung, and B. Wong, “Back-of-the-envelope computation of throughput distributions in CSMA wireless networks,”IEEE Trans. Mobile Comput., vol. 9, no. 9, pp. 1319–1331, Sep. 2010.
J. Liu, Y. Yi, A. Proutiere, M. Chiang, and H. V. Poor, “Maximizing utility via random access without message passing,” Microsoft Research, Tech. Rep., Sep. 2008.
P. Marbach, A. Eryilmaz, and A. Ozdaglar, “Achievable rate region of CSMA schedulers in wireless networks with primary interference constraints,” in Proc. IEEE CDC, Dec. 2007, pp. 1156–1161.
A. Proutiere, Y. Yi, and M. Chiang, “Throughput of random access without message passing,” in Proc. CISS, Mar. 2008, pp. 509–514.
S. Rajagopalan and D. Shah, “Distributed algorithm and reversible network,” in Proc. CISS, Mar. 2008, pp. 498–502.
S. Rajagopalan, D. Shah, and J. Shin, “Network adiabatic theorem: An efficient randomized protocol for contention resolution,” in Proc. ACM SIGMETRICS, Jun. 2009, pp. 133–144.
L. Tassiulas and A. Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximal throughput in multihop radio networks,” IEEE Trans. Autom. Control, vol. 37, no.12, pp. 1936–1948, Dec. 1992.
X. Wang and K. Kar, “Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks,” in Proc. IEEE INFOCOM, Mar. 2005, vol. 1, pp. 23–34.
A. Warrier, S. Janakiraman, and I. Rhee, “DiffQ: Practical differential backlog congestion control for wireless networks,” in Proc. IEEE INFOCOM, Apr. 2009, pp. 262–270.
X. Wu, R. Srikant, and J. R. Perkins, “Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks,” IEEE Trans. Mobile Comput., vol. 6, no. 6, pp. 595–605, Jun. 2007.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.