Wireless Communication

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

A Distributed CSMA Algorithm for Maximizing Throughput in Wireless Networks


Affiliations
1 Computer Science and Engineering, Jawaharlal Nehru Technological University-JNTU University, Kakinada, India
2 Electronics and Communications Engineering, University of Madras, Chennai, India
3 Information Technology, Acharya Nagarjuna University, Guntur, India
4 Computer Science and Engineering, University of Pune, India
     

   Subscribe/Renew Journal


In multihop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. Traditional maximal-weight scheduling (MWS), although throughput-optimal, is difficult to implement in distributed networks. On the other hand, a distributed greedy protocol similar to IEEE 802.11 does not guarantee the maximal throughput. In this paper, we introduce an adaptive carrier sense multiple access (CSMA) scheduling algorithm that can achieve the maximal throughput distributively. Some of the major advantages of the algorithm are that it applies to a very general interference model and that it is simple, distributed, and asynchronous. Furthermore, the algorithm is combined with congestion control to achieve the optimal utility and fairness of competing flows. Simulations verify the effectiveness of the algorithm. Also, the adaptive CSMA scheduling is a modular MAC-layer algorithm that can be combined with various protocols in the transport layer and network layer. Finally, the paper explores some implementation issues in the setting of 802.11 networks.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 379

PDF Views: 3




  • A Distributed CSMA Algorithm for Maximizing Throughput in Wireless Networks

Abstract Views: 379  |  PDF Views: 3

Authors

K. K. S. Harika
Computer Science and Engineering, Jawaharlal Nehru Technological University-JNTU University, Kakinada, India
P. Harini
Electronics and Communications Engineering, University of Madras, Chennai, India
M. Kiran Kumar
Information Technology, Acharya Nagarjuna University, Guntur, India
K. Kondaiah
Computer Science and Engineering, University of Pune, India

Abstract


In multihop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. Traditional maximal-weight scheduling (MWS), although throughput-optimal, is difficult to implement in distributed networks. On the other hand, a distributed greedy protocol similar to IEEE 802.11 does not guarantee the maximal throughput. In this paper, we introduce an adaptive carrier sense multiple access (CSMA) scheduling algorithm that can achieve the maximal throughput distributively. Some of the major advantages of the algorithm are that it applies to a very general interference model and that it is simple, distributed, and asynchronous. Furthermore, the algorithm is combined with congestion control to achieve the optimal utility and fairness of competing flows. Simulations verify the effectiveness of the algorithm. Also, the adaptive CSMA scheduling is a modular MAC-layer algorithm that can be combined with various protocols in the transport layer and network layer. Finally, the paper explores some implementation issues in the setting of 802.11 networks.