Efficient communication based Q-CSMA/CA algorithms wireless multihop networks

Carrier sense multiple access type algorithms results the maximum possible throughput in ad hoc networks. Even though the algorithm shows poor results in the delay performance also it shows some heuristic scheduling in the delay performance for the larger arrival rates. To overcome all these drawbacks we propose a time based CSMA algorithm which has the advantages of the followings, through this process multiple links are allowed to update their status in a single time period. Due to our proposed approach can achieve collision free transmission schedules during the control phase of the protocol. This algorithm shows the very good result in the delay performance for the throughput optimality property.