Achieving Maximum Throughput and Low Delay in Wireless Multi-Hop Networks Using Q-CSMA/CA Algorithm

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.