• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.6
• /
• pp.506-515
• /
• 1990

The major purpose of this thesis is suggest the simulation algorithm for performance analysis of throughput of slotted 1-persistent CSMA/CD bus protocol in Local Area Networks. The suggested simulation algorithm processes the effect of each station group that classified by the number of collision experience. Therefore, this simulation algorithm is more effective in terms of the execute than existing algorithm that processed the effect of each station. This study suggests the method for application to the busy/idle generator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.33-43
• /
• 2013

This paper proposes a distributed MAC protocol called Carrier Sensing Multiple Access with Collision Resolution (CSMA/CR) considering fully-connected single hop network environments for next-generation wireless LAN with high density of stations. The proposed CSMA/CR is compatible with the conventional MAC protocols by observing the operation of CSMA/CA and is able to detect a collision promptly without RTS/CTS exchange by applying the technique of CSMA/CD to wireless environments. Moreover, once a collision is detected, the dedicated resource is allocated to the next transmission and so the collision that may occur again is resolved. We investigate some implementation issues for the practicality of CSMA/CR and compare it with the typical distributed MAC protocols. The simulation results show that the proposed CSMA/CR has a low overhead as detecting a collision without the RTS/CTS exploitation and achieves always the best throughput regardless of the number of access stations, by using the reservation-based collision resolution technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.6
• /
• pp.402-410
• /
• 1986

The Media Access Control(MAC) Technologies in IEEE 802 Local Area Network(LAN) reference model include CSMA/CD, Token Ring and Token Bus methodes. The channel throughput of LAN can be affected by some parameters such as channel length, transmission rate and packet size, and station numbers. In this paper, the effect of these parameters to channel throughput are analyzed by normalized parameters. And the token ring and token bus method are analyzed by using the normalized parameter, and relatinonship bwtween channel thorughput and parameters is discussed. Finally, results are compared.

• Journal of applied mathematics & informatics
• /
• v.1 no.1
• /
• pp.1-12
• /
• 1994

We consider a single channel CSMA/CD system with D homogeneous stations and impeded buffer of infinite size. We find a sufficient condition for the model to be stable under the threshold control policy and derive the limiting distri-bution of the number of messages in the system at the moment of service completion. We also derive the limiting distributing of the number of messages in the system size at arbitrary time by using Markov regenerative processes. Some numerical examples and special cases are also treated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.2
• /
• pp.137-145
• /
• 1986

The contention resolution algorithm with the limited packet delay time as well stable distribution as the packet delay time is proposed and implementes for improving the mean packet delay time in the network employing CSMA/CD as the access method. The implementation of node controller is based on IEEE 802.2 standard logical link control(LLC) and IEEE 802.3 standard medium access control(MAC). Some portion of IEEE 802.3 Standard MAC, and the Binary Exponential Back-off(BEB) algorithm is replaced by the proposed algorithm. From the view of normalized mean packet transmission delay time, the controller implemented here can be applicable to the office-automation system, and the factory-and laboratory-automation environment where the limited time criterion is very significant.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.04a
• /
• pp.74-77
• /
• 1986

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.81-89
• /
• 2000

In this paper, we analyzed the performance for CATV/LAN added priority problem. Upstrea nm channel which analyzed very deeply for CATV/LAN network have the preferential access property depending upon that positionand unidirectional property. To solve that fairness problem and priority, we propose the CSMA-CD/U/P-P protocolthat transmit as P1 probability if data packets happen. We assumed 2-Class priority(high, low). As the analyticresult and simulation, we obtained P1, value and its average delay time under priority problem assumed twoscenarios. Also, we get its variance value and queue length. Especially, the mean delay time increases nearer thanposition from H/E

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.1033-1036
• /
• 2013

A study about collision resolution is needed because huge file, video and multimedia information are transmitted to wireless LAN. CSMA/CR protocol guarantees fairness, but doesn't consider QoS. To practicalize CSMA/CR protocol in saturation fully-connected single hop network environments, this paper proposes method of collision compensation. previous CSMA/CR protocol chooses CR Slot only considering fairness, but this paper chooses front CR Slot for compensation of collision to station experiencing collisions. The station transmits jam signal and has channel priority of transmission. So transmitting efficiency and successful transmission probability rise. This proposed simple method can offer benefit to station experiencing collisions without additional hardware cost.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.502-512
• /
• 2016

The wireless carrier sense multiple access with collision detection (WCSMA/CD) and carrier sense multiple access with collision resolution (CSMA/CR) protocols are considered representative distributed collision detection protocols for fully connected dense wireless local area networks. These protocols identify collisions through additional short-sensing within a collision detection (CD) period after the start of data transmission. In this study, we analyze their throughput numerically and show that the throughput has a trade-off that accords with the length of the CD period. Consequently, we obtain the optimal length of the CD period that maximizes the throughput as a closed-form solution. Analysis and simulation results show that the throughput of distributed collision detection protocols is considerably improved when the optimal CD period is allocated according to the number of stations and the length of the transmitted packet.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1987.04a
• /
• pp.128-131
• /
• 1987