Efficient CSMA/CD-based protocols for multiple priority classes

Sharrock, S. M.; Du, David Hung-Chang

doi:10.1109/12.30847

Cited by 21 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, past work on incorporating fairness into distributed protocols has been limited in that these protocols attempt to provide equal share of bandwidth to different nodes (essentially, node weights are implicitly assumed to be equal). There has been work on distributed protocols that take priorities into account when performing medium access control [3,21]. However, these protocols do not perform fair allocation of bandwidth.…”

Section: F I G U R E 1: a N O D E W I T H S E V E R A L Flows S H A Rmentioning

confidence: 99%

Distributed fair scheduling in a wireless LAN

Vaidya¹,

Bahl

Gupta³

2000

Proceedings of the 6th Annual International Conference on Mobile Computing and Networking

441

161

View full text Add to dashboard Cite

Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weights of the packet flows sharing the channel. This paper presents a fully distributed algorithm for fair scheduling in a wireless LAN. The algorithm can be implemented without using a centralized coordinator to arbitrate medium access. The proposed protocol is derived from the Distributed Coordination Function in the IEEE 802.11 standard. Simulation results show that the proposed algorithm is able to schedule transmissions such that the bandwidth allocated to different flows is proportional to their weights. An attractive feature of the proposed approach is that it can be implemented with simple modifications to the IEEE 802.11 standard.

show abstract

Section: F I G U R E 1: a N O D E W I T H S E V E R A L Flows S H A Rmentioning

confidence: 99%

Distributed fair scheduling in a wireless LAN

Vaidya¹,

Bahl

Gupta³

2000

Proceedings of the 6th Annual International Conference on Mobile Computing and Networking

441

161

View full text Add to dashboard Cite

show abstract

“…Assuming Poisson packet arrival and general packet length distributions mean packet delays are computed using approximate techniques. Another priority-based scheme for CSMA is presented in [34]. Some other related work for distributed systems can be found in [31] and [32].…”

Section: Previous Workmentioning

confidence: 99%

Fair bandwidth sharing in distributed systems: a game-theoretic approach

Rakshit

Guha

2005

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-Fair sharing of bandwidth remains an unresolved issue for distributed systems. In this paper, the users of a distributed LAN are modeled as selfish users with independence to choose their individual strategies. With these selfish users, the contention-based distributed medium access scenario is modeled as a complete-information, noncooperative game, designated the "Access Game." A novel MAC strategy based on p-persistent CSMA is presented to achieve fairness in the "Access Game." It is proven that there are an infinite number of Nash Equilibria for the "Access Game," but they do not result in fairness. Therefore, it may be beneficial for the selfish users to adhere to a set of constraints that result in fairness in a noncooperative fashion. This leads to the formulation of a constrained "Access Game" with fairness represented as a set of algebraic constraints. It is proven that the solution of the constrained game, the Constrained Nash Equilibrium, is unique. Further, it is shown that, in addition to achieving fairness, this solution also optimizes the throughput. Finally, these results are extended to a more realistic incomplete-information scenario by approximating the incomplete-information scenario as a complete-information scenario through information gathering and dissemination.

show abstract

“…p-persistent random access scheme is effective to avoid collision [10], [11]. In this scheme, a station senses the channel and determine to transmit or not based on the sensing decision.…”

Section: Introductionmentioning

confidence: 99%

Random Access for Multiple Secondary Pairs in Cognitive Radio Networks with Imperfect Sensing

Hong

Lee

2015

2015 IEEE 81st Vehicular Technology Conference (VTC Spring)

View full text Add to dashboard Cite

In this paper, we investigate p-persistent random access used for a spectrum sensing cognitive radio network with multiple secondary users to avoid a collision. Effect of the imperfect sensing, false alarm and miss detection, is considered. We analyze the total throughput of the secondary network and propose throughput optimization algorithm. It is shown that simulation results well match with analysis results.

show abstract

Efficient CSMA/CD-based protocols for multiple priority classes

Cited by 21 publications

References 5 publications

Distributed fair scheduling in a wireless LAN

Distributed fair scheduling in a wireless LAN

Fair bandwidth sharing in distributed systems: a game-theoretic approach

Random Access for Multiple Secondary Pairs in Cognitive Radio Networks with Imperfect Sensing

Contact Info

Product

Resources

About