Packet output processes of CSMA and CSMA/CD protocols

Tan, Hua; Tsai, Kuang

doi:10.1109/26.489093

Cited by 15 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With the size variation of different types of slots being ignored, the virtual-slot system behaves stochastically similar to a slotted ALOHA [14] protocol. Therefore, the well-known S-G analysis [14], [15] for computing the maximum throughput can be extended to analyzing the virtual-slot system.…”

Section: Virtual-slot Based S-g Analysismentioning

confidence: 99%

“…At the steady state, a virtual-slot protocol in fact behaves similarly to a slotted ALOHA protocol, given the probabilities associated with the three types of virtual slots. It is well-known that the S-G analysis [14], [15] can be applied to obtain the maximum MAC capacity of slotted ALOHA. As a counterpart, we develop the virtual-slot based S-G (VS S-G) analysis as a generic approach to compute the optimal operation point and the corresponding maximum MAC capacity for all the CSMA/CA protocols.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Protocol-Independent Approach for Analyzing the Optimal Operation Point of CSMA/CA Protocols

2009

View full text Add to dashboard Cite

Abstract-This paper presents a protocol-independent approach to reveal a new insight into the performance of carrier sense multiple access with collision avoidance (CSMA/CA) protocols: the family of CSMA/CA protocols, independent of implementation details, share the same optimal operation point where the maximum protocol capacity is achieved. The protocolindependent analysis is inspired by the concept of virtual time slot. At the timescale of virtual-slot, all the CSMA/CA protocols show the same behavior pattern and, therefore, a generic virtualslot based S-G (VS S-G) analysis is developed to compute the optimal operation point. The accuracy of the VS S-G analysis is benchmarked against the precise protocol-specific analysis, in particular, for the 802.11 distributed coordination function (DCF) and the 802.15.4 contention access period (CAP). Furthermore, this paper discusses how to integrate the network-layer queueing analysis with the VS S-G analysis at the medium access control (MAC) layer to form a generic cross-layer framework for calllevel network capacity analysis.

show abstract

Section: Virtual-slot Based S-g Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Protocol-Independent Approach for Analyzing the Optimal Operation Point of CSMA/CA Protocols

2009

View full text Add to dashboard Cite

show abstract

“…Although there are considerable work [3,4,5] on determining D*(s) for various CSMA protocols, these results do not consider the effect of common channel acknowledgment traffic. We note that Tobagi & Kleinrock [6] have investigated the throughput of both non-persistent and l-persistent CSMAPA protocols.…”

Section: Introductionmentioning

confidence: 92%

“…We obtain an explicit expression for D'(s) by solving a set of renewal equations each of which is derived by suitable choices of system regeneration points. We have successfully used this approach to obtain D'(s) for various CSMA and CSMA-CD protocols [5]. We shall also give an exact throughput expression for l-persistent CS-MAPA.…”

Section: Introductionmentioning

confidence: 98%

Packet output processes of CSMA protocols with common channel acknowledgement

Tsai

Tan

IEEE International Conference on Communications, - Spanning the Universe.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The Random Access mechanism, such as CSMA [12], permits to node send their frames when the shared bus is idle. In this time, two or more nodes may compete to achieve the shared bus, but ultimately one of them will win the competition.…”

Section: The Masquerade Failurementioning

confidence: 99%

Contribution of Controller Area Networks Controllers to Masquerade Failures

Salmani

Miremadi

11th Pacific Rim International Symposium on Dependable Computing (PRDC'05)

View full text Add to dashboard Cite

This paper scrutinizes faults in a CAN controller that may result in masquerade failures, and suggests an even parity mechanism to detect them with minimum hardware overhead. To do this, a CAN controller is modeled by VHDL at behavioral level and is exploited to setup a CAN-based network composed of two nodes. A total of 5,500 faults are injected into essential parts of one of the controllers. The results show that about 3.44% of faults terminate in masquerade failures. The results, also, show that Register bank in the CAN controller are the most sensitive portions in which 92.10% of faults occurring in the Register bank result in masquerade failures. The even parity mechanism detects about 96.31% of all masquerade failures.

show abstract

Packet output processes of CSMA and CSMA/CD protocols

Cited by 15 publications

References 6 publications

A Protocol-Independent Approach for Analyzing the Optimal Operation Point of CSMA/CA Protocols

A Protocol-Independent Approach for Analyzing the Optimal Operation Point of CSMA/CA Protocols

Packet output processes of CSMA protocols with common channel acknowledgement

Contribution of Controller Area Networks Controllers to Masquerade Failures

Contact Info

Product

Resources

About