抽象的

Localized Scheduling For Dense Wireless Networks Using CSMA Algorithm

M. Rajeshwaran, M. Suguna, D. Sharmila

The network throughput will changed when network size modified and it will specified by capacity scaling property. It provide the essential performance in dense wireless networks. Existing result have been obtained based on the scheduling partition scheme and this methodology not feasible in dense wireless networks due to the scheduling complexity, packet loss, time delay. In this paper we implement the connection level scheduling in wireless networks using only MAC layer information and to improve the throughput optimal scheduling performance when files are arrival and dispatcher. The scheduler has access the total queue length at MAC layer then it will use max weight scheduling algorithm to achieve the throughput and concentrate the CSMA scheduling algorithm, it will implemented in decentralized way. CSMA indeed achieve throughput optimality without the timescale separation assumption. Finally connection level scheduling achieve throughput even use only MAC layer queue length information.