• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.61-67
• /
• 2008

In this paper, MAC algorithm for the IEEE 802.11 DCF improving the performance is proposed and analyzed by simulation. The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF(Distributed Coordination Function) and PCF(Point Coordination Function). The DCF controls the transmission based on CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance), that decides a random backoff time with the range of CW(Contention Window) for each station. Normally, each station increase the CW to double after collision, and reduces the CW to the minimum after successful transmission. The DCF shows excellent performance relatively in situation that competition station is less but has a problem that performance is fallen from throughput and delay viewpoint in situation that competition station is increased. This paper proposes an enhanced DCF algorithm that increases the CW to maximal CW after collision and decreases the CW smoothly after successful transmission in order to reduce the collision probability by utilizing the current status information of WLAN. To prove efficiency of proposed algorithm, a lots of simulations are conducted and analyzed.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2000.11a
• /
• pp.463-470
• /
• 2000

In this paper, we describe a wireless MAC protocol named APRMA(Abitrary Period Reservation Multiple Access), which is capable of supporting the ABR type data service and maximizing channel utilization. In original PRMA protocol, data terminals with random data packets cannot reserve slot. That is, slot reservation is applicable to the. time constraint voice packet exclusively. But the reservation scheme have to be performed for loss sensitive data packet, so data packets can get their quality of service. The aspects of service, if fixed bandwidth is allocated to data terminals, time constraint voice packets may have a low efficiency So in this study, the terminal which wants to request for ABR type service, acquires a minimum bandwidth from system for the first time. If the system have extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot. As a result, APRMA protocol can support the data service with loss sensitivity and maintain their channel utilization highly. Also high Priority services like voice can be satisfied with their QoS by APRMA.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.10 s.340
• /
• pp.39-50
• /
• 2005

In this paper, we propose a performance improving MAC algerian for the IEEE 802.11 DCF. WLAN based IEEE 802.11 uses two control methods called 'Distributed Coordination Function(UF)' and 'Point Coordination Function(PCF)'. The nF controls the Urnsmission based on carrier sense multiple access with collision detection(CSMA/CA), that decides a random backoff time with the range of contention window for each terminal. Normally, each terminal the CW double after collision, and reduces the CW to the minimum after successful transmission. This paper proposes an enhanced DCF algorithm that decreases the CW smoothly after successful transmission in order to reduce the collision Probability by utilizing the current status information of WLAN. We also analyze the throughput and delay performance for the unsaturated case mathematically. Simulation results show that our algorithm enhances the saturation throughput of WLAN. They also coincide well with the analytical results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.1-10
• /
• 2003

An EPON which is going on standardization in IEEE 802.3ah, is tree topology consists of a OLT and multiple ONU using passive optical components, so this network is susceptible to variable security threats - eavesdropping, masquerading, denial of service and so on. In this paper, we design a security protocol supporting authentication and confidentiality services in MAC layer in order to prevent these security threats and to guarantee secure data exchange The designed security protocol introduce public-key based authentication and key management protocols for efficient key management, and choose Rijndael algorithm, which is recent standard of AES, to provide the confidentiality of EPON Proposed authentication and key management protocols perform authentication and public-key exchange at a time, and are secure protocols using derived common cipher key by exchanging public random number To implement the designed security protocol, we propose the procedures of authentication and public-key exchange, session key update, key recovery. This proposed protocol is verified using unknown session key, forward secrecy, unknown key-share, key-compromise impersonation.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.49-52
• /
• 2003

IEEE 802.11 MAC uses a distributed coordination function (DCF) known as carrier sense multiple access with collision avoidance (CSMA/CA) for medium access. Random back-off algorithm helps to avoid the collision. This paper proposes virtual back-off and modified back-off algorithm for reduce a waiting time by back-off and reduce the collision. The modified DCF is consisted of these two algorithms. We expect to reduce the average waiting time of each transmission by using the modified DCF algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.20-29
• /
• 2008

WLP(WiMedia Logical link control Protocol) is a protocol to support IP services on the WiMedia UWB platform. It defines that DRP needs to be employed using TSPEC parameters when the packets from upper layer transmit with QoS. However, there is no appropriate means to provide QoS when the TSPEC of the traffic is unknown. In this paper, we propose TSPEC estimation scheme to provide QoS for such unknown applications by monitoring the traffic in realtime. Also, the scheme to estimate the effective TSPEC is proposed that compensate the packet losses in the wireless environment to provide the required QoS. The performances of the proposed TSPEC estimation schemes are evaluate by simulation assuming random wireless packet loss and 1mm-ACK mechanism.

• Journal of Computing Science and Engineering
• /
• v.5 no.4
• /
• pp.324-330
• /
• 2011

To avoid collisions, IEEE 802.11 medium access control (MAC) uses predetermined inter-frame spaces and the random back-off process. However, the retransmission strategy of IEEE 802.11 MAC results in considerable time wastage. The hidden node problem is well known in wireless networks; it aggravates the consequences of time wastage for retransmission. Many collision prevention and recovery approaches have been proposed to solve the hidden node problem, but all of them have complex control overhead. In this paper, we propose a fast retransmission scheme as a recovery approach. The proposed scheme identifies collisions caused by hidden nodes and then allows retransmission without collision. Analysis and simulations show that the proposed scheme has greater throughput than request-to-send and clear-to-send (RTS/CTS) and a shorter average waiting time.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.229-234
• /
• 2007

In the IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time. which is uniformly selected from the Contention Window (CW) This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. The BEB scheme suffers from a unfairness problem and low throughput under high traffic load. In this paper, I propose a new backoff algorithm for use with the IEEE 802.11 Distributed Coordination Function.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.91-94
• /
• 2007

In the IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. The BEB scheme suffers from a fairness problem and low throughput under high traffic load. In this paper, I propose a new backoff algorithm for use with the IEEE 802.11 Distributed Coordination Function.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.4
• /
• pp.67-76
• /
• 2002

Kerberos is designed to provide strong authentication between client and application servers which are working in distributed network environment by using symmetric-key cryptography, and supposed to trust other systems of the realm. In this paper, we design an efficient and strong authentication mechanism by introducing the public/private-key to Kerberos. In the mechanism to make a system more secure, the value of the session key is changed everytime using MAC(message authentication code) algorithm with the long-term key for user-authentication and a random number exchanged through the public key. Also, we employ a mutual authentication method, which is used on challenge-response mechanism based on digital signatures, to improve trust between realms, and present a way of reducing the number of keys by simplifying authentication steps.