• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1031-1041
• /
• 2014

In this paper, we propose a traffic load control scheme, called fast congestion control (FCC), for a satellite channel using enhanced random access schemes. The packet repetition used by enhanced random access schemes increases not only the maximum throughput but also the sensitivity to traffic load. FCC controls traffic load by using an access probability, and estimates backlogged traffic load. If the backlogged traffic load exceeds the traffic load corresponding to the maximum throughput, FCC recognizes congestion state, and processes the backlogged traffic first. The new traffic created during the congestion state accesses the channel after the end of congestion state. During the congestion state, FCC guarantees fast transmission of the backlogged traffic. Therefore, FCC is very suitable for the military traffic which has to be transmit urgently. We simulate FCC and other traffic load control schemes, and validate the superiority of FCC in latency.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.83-87
• /
• 2009

The MAC protocol of HiperLAN/2 is based on TDMA/TDD. Mobile terminal acquires a data transmission opportunity as successfulness in channel competition through RCH (Random CHannel) phase. Therefore, AP (Access Point) be able to dynamically assign optimum RCH at next frame according to the number of success and collision. In this paper, we suggest scheme that fluctuate RCH (Random CHannel) number as fixed value considering success and collision for improvement of performance in HiperLAN/2. To prove efficiency of proposed scheme, a lots of simulations are conducted and analyzed in view of throughput and access delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3655-3673
• /
• 2014

Rendezvous is a process of two or more cognitive radio nodes gathering on the same channel at the same time for a negotiation to establish data communications. This paper discusses rendezvous issues in cognitive radio networks. It details why rendezvous is an issue in cognitive radio networks and how rendezvous works. It classifies channel access methods, and details sequence-based channel-hopping methods. It surveys existing works on blind rendezvous and compares the proposed algorithms in terms of the maximum time to rendezvous. This paper discusses the properties that an efficient channel-hopping rendezvous algorithm should have and illustrates common issues in the existing rendezvous methods. It also explains open research issues in the rendezvous area.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.38-44
• /
• 2013

This paper proposes a new dynamic spectrum access (DSA) algorithm for cognitive radio networks. Once initialized, this algorithm works without the need of coordination overhead and hence can be used when no control channel is available. Secondary user (SU) lists and predetermined access control are used in this algorithm. We analyze the probability of no SU collision with primary user and the throughput of our proposed algorithm. Extensive simulations show that our algorithm outperforms the existing DSA algorithm in terms of both the aggregate throughput and the traffic distribution fairness. Furthermore, the validity of our analysis is confirmed by simulation results.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.43-51
• /
• 2023

Slotted ALOHA (S-ALOHA) is a classical medium access control protocol widely used in multiple access communication networks, supporting distributed random access without the need for a central controller. Although stability and delay have been extensively studied in existing works, most of these studies have assumed ideal channel conditions or independent fading, and the impact of time-correlated wireless channels has been less addressed. In this paper, we investigate the queueing delay performance in S-ALOHA networks under time-correlated channel conditions by utilizing a Gilbert-Elliott model. Through simulation studies, we demonstrate how temporal correlation in the wireless channel affects the queueing delay performance. We find that stronger temporal correlation leads to increased variability in queue length, a larger probability of having queue overflows, and higher congestion levels in the S-ALOHA network. Consequently, there is an increase in the average queueing delay, even under a light traffic load. With these findings, we provide valuable insights into the queueing delay performance of S-ALOHA networks, supplementing the existing understanding of delay in S-ALOHA networks.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.845-855
• /
• 2015

To enable the coexistence of Licensed Assisted Access (LAA) and Wi-Fi in 5 GHz unlicensed bands, a new channel access mechanism is proposed. Accounting for the fairness between LAA and Wi-Fi, the proposed mechanism finds the optimal transmission time ratio by adaptively adjusting the transmission durations for LAA and Wi-Fi. In addition, we propose a new analytical model for the distributed coordination function of IEEE 802.11 through some modifications of conventional analytical models for saturation and non-saturation loads. By computing the activity ratio of Wi-Fi, the proposed analytical model is able to control the time ratio between LAA and Wi-Fi, which is required for practical implementation of the proposed access mechanism. Through numerical simulations, the proposed channel access mechanism is compared with conventional methods in terms of throughput and utility.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.7
• /
• pp.1026-1031
• /
• 2022

Cognitive Radio Ad-Hoc Networks (CRAHNs) enable to overcome the shortage of frequency resources due to the increase of radio services. In order to avoid interference with the primary user in CRANH, channel sensing to check the idle channel is required, and when the primary user appears, the time delay due to handover should be minimized through fast idle channel selection. In this paper, throughput was improved by reducing the number of channel sensing and preferentially sensing a channel with a high probability of being idle, using reinforcement learning. In addition, we proposed a multi-channel MAC (Medium Access Control) protocol that can minimize the possibility of collision with the primary user by sensing the channel at the time of data transmission without performing periodic sensing. The performance was compared and analyzed through computer simulation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.12
• /
• pp.32-40
• /
• 2015

Code division multiple access (CDMA) is one of the promising medium access control scheme for underwater acoustic sensor networks due to its beneficial features such as robustness against frequency-selective fading and high frequency-reuse efficiency. In this paper, we design a closed-loop power control scheme for the underwater CDMA, to adapt time-varying acoustic channel. In the proposed scheme, sink node sends to sensor nodes the associated path loss which is acquired by uplink-channel analysis based on received packets from the sensor nodes. Then, sensor nodes adjust their transmission power in an adaptive manner to time-varying underwater acoustic channel, according to the informations sent by the sink node.

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.340-348
• /
• 2004

In this paper, we proposed an efficient medium access protocol to share single transmission medium for several stations. There are two well known types of medium access protocols: collision allowance and collision avoidance, and each of them is adopted to their own suitable network with advantage. Our proposed protocol have channel reservation facility based on collision allow medium access protocol, CSMA/CD. In a collision, the stations delay collision with generating pseudo collision signal to reserve channel. Then, the collision terminates and the stations, which reserve channel successfully, participate the next competition with higher medium access probability. We show that the proposed protocol reduced collision times and improved utilization of the channel.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.22-29
• /
• 2000

In this paper, we analyzed the performance of EY-NPMA(Elimination Yield-Non-preemptive Priority Multiple Access) protocol-channel access control protocol of HIPERLAN(HIgh PErformance Radio Local Area Network) type 1 specification, adopted as european high speed wireless LAN standard by ETSI(European Telecommunication Standards Institute). We established a system model for EY-NPMA protocol analysis, analyzed success probability in a channel access cycle, and derived expressions for the average length of contention phase. Using a M/G/1 model, we approximated the normalized delay, and throughput, and we evaluated these results by simulations.