• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.75-83
• /
• 2016

In this paper, we propose a multi-channel medium access control (MAC) protocol, named underwater multi-channel MAC protocol (UMMAC), for underwater acoustic networks (UANs). UMMAC is a split phase and reservation based multi-channel MAC protocol which enables hosts to utilize multiple channels via a channel allocation and power control algorithm (CAPC). In UMMAC, channel information of neighboring nodes is gathered via exchange of control packets. With such information, UMMAC allows for as many parallel transmissions as possible while avoiding using extra time slot for channel negotiation. By running CAPC algorithm, which aims at maximizing the network's capacity, users can allocate their transmission power and channels in a distributed way. The advantages of the proposed protocol are threefold: 1) Only one transceiver is needed for each node; 2) based on CAPC, hosts are coordinated to negotiate the channels and control power in a distributed way; 3) comparing with existing RTS/CTS MAC protocols, UMMAC do not introduce new overhead for channel negotiation. Simulation results show that UMMAC outperforms Slotted floor acquisition multiple access (FAMA) and multi-channel MAC (MMAC) in terms of network goodput (50% and 17% respectively in a certain scenario). Furthermore, UMMAC can lower the end-to-end delay and achieves a lower energy consumption compared to Slotted FAMA and MMAC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.696-708
• /
• 1992

In this study, we have several objectives. First, In spite of a fixed bandwidth waste of reservation channel, we maximize the efficiency of transmission channel by the multiple access algorithm that performs channel reservation and data transmission independently, eliminating the frame structure of transmission channel and reserving it by the slot unit . Second, In order to improve the entire system performance, we accommodate the variation of traffic at each earth station more effectively, and accomplish the stable delay characteristics and the equlity of service #or users. For this purpose, we design the satellite channel that consists of reservation channel and transmission channel which are logically separate and operate Independently. We also design a demand assignment multiple access algorithm based on the satellite channel structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.330-335
• /
• 2007

This paper proposes a multichannel random access channel allocation scheme for multihop cellular networks to guarantee the stable throughput of a random access. The fundamental contribution is a mathematical formula for an optimal partition ratio of shared random access channels between a base station and a relay station. In addition, the proposed scheme controls the retransmission probability of random access packets under heavy load condition. Simulation results show that the proposed scheme can guarantee the required random access channel utilization and packet transmission delay even if the a random access packet arrival rate is higher than 0.1.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.641-655
• /
• 1992

In this paper, the performance of the various multiple accesstechniques for the mobile computer network has been studied in the consideration of the characteristics. Of the mobile communication channel. In the case of the hidden node occurring, it could be seen that the performance of the code division multiple access(CDMA) technique. With simultaneous access function is better than that of the other packet access methods such as carrier sensed multiple access(CAMA). Busy tone mulitiple access(BTMA)and idle signal muitiple access(ISMA) in the view of the throuhtput and mean delay time. Also it has been shown that the performance of the CDMA method is superior to that of other packet access techniques such as multiple access(CSMA).etc when the fading effect or impulsive noise exists in the mobile channel. Especially in the case of the distributed mobile network. It has been shown that the receiver-transmitter based CDMA method using the characteristics of CDMA effectively has better throughput and less mean delay time than the commontransmitter based CDMA technique.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.2
• /
• pp.139-146
• /
• 2002

The third generation mobile communication needs to provide multimedia service with increased data rates. Thus an efficient allocation of radio and network resources is very important. This paper models the 'burst switching' as an efficient radio resource allocation scheme and the performance is compared to the circuit and packet switching. In burst switching, radio resource is allocated to a call for the duration of data bursts rather than an entire session or a single packet as in the case of circuit and packet switching. After a stream of data burst, if a packet does not arrive during timer2 value ($\tau_{2}$), the channel of physical layer is released and the call stays in suspended state. Again if a packet does not arrive for timerl value ($\tau_{1}$) in the suspended state, the upper layer is also released. Thus the two timer values to minimize the sum of access delay and queuing delay need to be determined. In this paper, we focus on the decision of $\tau_{2}$ which minimizes the access and queueing delay with the assumption that traffic arrivals follow Poison process. The simulation, however, is performed with Pareto distribution which well describes the bursty traffic. The computational results show that the delay and the packet loss probability by the burst switching is dramatically reduced compared to the packet switching.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.896-905
• /
• 2005

In this paper, we propose a SPD(Selective Packet Delay) scheme to improve the performance of High-Speed Downlink Shared Channel(HS-DSCH) employing N-Channel Stop and Wait retransmission scheme in High Speed Downlink Packet Access(HSDPA) system. The proposed SPD coordinates packet transmissions according to the channel condition. When the channel condition is bad, packet transmission is forcedly delayed, and the designated time slot is set over to other users in good channel condition. Hence, the SPD is able to reduce the average transmission delay for packet transmission under the burst error environments. In addition, we propose two packet scheduling schemes called SPD-LDPF(Long Delayed Packet First) and SPD-DCRR(Deficit Compensated Round Robin) that are effectively combined with the SPD scheme. Simulation results show that the proposed scheme has better performance in terms of delay, throughput and fairness.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.6
• /
• pp.28-39
• /
• 2010

The study aims at offering a solution to the problems of transmission delay and data throughput decrease as the number of contending On-Board Units (OBU) increases by applying CSMA medium access control protocol based upon IEEE 802.11p. In a competition-based medium, contention probability becomes high as OBU increases. In order to improve the performance of this medium access layer, the author proposes EDCA which a adaptive adjustment of the Contention Windows (CW) considering traffic density and data type. EDCA applies fixed values of Minimum Contention Window (CWmin) and Maximum Contention Window (CWmax) for each of four kinds of Access Categories (AC) for channel-specific service differentiation. EDCA does not guarantee the channel-specific features and network state whereas it guarantees inter-AC differentiation by classifying into traffic features. Thus it is not possible to actively respond to a contention caused by network congestion occurring in a short moment in channel. As a solution, CWminAS(CWmin Adaptation Scheme) and ACATICT(Adaptive Contention window Adjustment Technique based on Individual Class Traffic) are proposed as active CW control techniques. In previous researches, the contention probabilities for each value of AC were not examined or a single channel based AC value was considered. And the channel-specific demands of IEEE 802.11p and the corresponding contention probabilities were not reflected in the studies. The study considers the collision number of a previous service section and the current network congestion proposes a dynamic control technique ACCW(Adaptive Control of Contention windows in considering the WAVE situation) for CW of the next channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5A
• /
• pp.451-458
• /
• 2006

In this paper, we propose a novel scheduling algorithm for downlink transmission which utilizes scarce wireless resource efficiently in an Orthogonal Frequency Division Multiple Access/Time Division Duplex system. Scheduling schemes which exploit channel information between a Base Station and terminals have been proposed recently for improved performance. Time series analysis is used to estimate the channel state of mobile terminals. The predicted information is then used for prioritized scheduling of downlink transmissions for improved throughput, delay and jitter performance. Through simulation, we show that the total throughput and mean delay of the proposed scheduling algorithm are improved compared with those of the Proportional Fairness and Maximum Carrier to Interference Ratio schemes.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.777-787
• /
• 2005

In this paper, we propose an urgency- and efficiency-based wireless packet scheduling (UEPS) algorithm that is able to schedule real-time (RT) and non-real-time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality-of-service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.1
• /
• pp.129-133
• /
• 2005

Slotted ALOHA(S-ALOHA) is widely used in local wireless network. We analyze the performance of contention-based model in wireless LAN using S-ALOHA protocol. We analyze the performance of binary exponential backoff (BEB) algorithm under the slotted ALOHA protocol: whenever a node's message which tries to reserve a channel is involved in a collision for the ith time, it chooses one of the next $2^i$ frames with equal probability and attempts the reservation again. We derive the expected access delay and throughput which is defined as the expected number of messages that reserve a channel in a frame. A simulation study is performed to verify our method.