In this paper, we have a tendency to introduce an adaptive carrier sense multiple access (CSMA) scheduling algorithm which will achieve the maximal throughput distributive. Some of the key blessings of the algorithm are that it applies to a terribly general interference model and that it is easy, distributed, and asynchronous. Furthermore, the algorithm is combined with congestion control to realize the optimal utility and fairness of competing flows. Simulations verify the effectiveness of the algorithm. Also, the adaptive CSMA scheduling could be a modular MAC-layer algorithm that can be combined with numerous protocols in the transport layer and network layer. Finally, the paper explores some implementation issues within the setting of 802.11 networks.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here