• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.17-27
• /
• 2007

The enhanced distributed channel access (EDCA) of IEEE 802.11e has been standardized for supporting Quality of Service (QoS) in wireless LANs. In the EDCA, support of QoS can be achieved statistically by reducing the probability of medium access for lower priority traffics. In other words, it provides statistical channel access rather than deterministically prioritized access to high priority traffic. Therefore, lower priority traffics affect the performance of higher priority traffics. Consequently, at the high loads, the EDCA does not guarantee the QoS of multimedia applications such as voice and video even though it provides higher priority. In this paper, we propose a simple and effective scheme, called deterministic priority channel access (DPCA), for improving the QoS performance of the EDCA mechanism. In order to provide guaranteed priority channel access to multimedia applications, the proposed scheme uses a busy tone for limiting the transmissions of lower priority traffics when higher priority traffic has data packets to send. Performance of the proposed scheme is investigated by numerical analysis and simulation. Our results show that the proposed scheme outperforms the EDCA in terms of throughput, delay, jitter, and drop under a wide range of contention levels.

• Journal of Internet Computing and Services
• /
• v.21 no.2
• /
• pp.99-108
• /
• 2020

In this paper, we analyze the most suitable RA method among PAMA, DAMA, and RA classified by the multiple access method of satellite communication in the rapidly changing traffic environment according to the emergency and tactical situation. It suggests an alternative to improve the limit of output degradation. Based on the CRDSA protocol selected as the standard of DVB-RCS2 among the current satellite communication methods, CRDSA2R (Contention) maintains an optimal RA channel environment by checking the limitations in an environment where packet volume is rapidly increasing and observing channel load and channel conditions. We propose a Resolution Diversity Slotted ALOHA with Adaptive Random Access.

• 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 IKEEE
• /
• v.23 no.2
• /
• pp.735-738
• /
• 2019

Recently, orthogonal non-orthogonal multiple access (O NOMA) with polar on-off keying (POOK) has been proposed to mitigate the severe effect of the superposition. However, it is observed that the performance of the O NOMA strong channel user is better than that of the perfect successive interference cancellation (SIC), i.e., the performance of a single user transmission with binary phase shift keying (BPSK). Can the performance of the BPSK modulation be better that that of itself? It is not normal. It should be clearly understood theoretically, with the ultimate bound, i.e., the channel capacity. This paper proves that the channel capacity of the O NOMA strong channel user is non-zero with zero power allocation. Thus, it is shown that the interference is transformed effectively into the meaningful signal.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1425-1433
• /
• 1999

In this Paper, we analyzed the HIPERLAN(Hlgh PErformance Radio LAN) MAC(Medium Access Control) protocol, which was a standard for Wireless LANs defined by ETSI. We analyzed mathematically the elimination phase and the yield phase of the channel contention phase of CAC(Channel Access Control) layer in the infinite population model of the HIPERLAN using EY-NPMA(Elimination Yield-Nonpreemptive Priority Multiple Access)protocol. Also we analyzed the probability of successful transmission in the transmission phase. And, we proved results of a mathematical analysis by the simulation of HIPERLAN MAC protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1301-1318
• /
• 2017

In order to utilize the licensed channel of cognitive radio (CR) when the primary user (PU) is detected busy, a benefit-exchange access mode based on cooperative communication is proposed to allow secondary user (SU) to access the busy channel through giving assistance to PU's communication in exchange for some transmission bandwidth. A holistic joint optimization problem is formulated to maximize the total throughput of CR system through jointly optimizing the parameters of cooperative spectrum sensing (CSS), including the local sensing time, the pre-configured sensing decision threshold, the forward power of cooperative communication, and the bandwidth and transmission power allocated to SUs in benefit-exchange access mode and traditional access mode, respectively. To solve this complex problem, a combination of bi-level optimization, interior-point optimization and exhaustive optimization is proposed. Simulation results show that, compared with the tradition throughput maximizing model (TTMM), the proposed holistic joint optimization model (HJOM) can make use of the channel effectively even if PU is busy, and the total throughput of CR obtains a considerable improvement by HJOM.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2547-2552
• /
• 2013

To achieve better performance in dynamic spectrum access networks, each secondary user tracks channels and chooses a good channel to transmit its packet. When all secondary users adopt the same dynamic spectrum access policy, they have similar channel information, which leads secondary users to choose the same channel and more collisions among them. To relieve this problem, we propose an access policy using belief vector tracking method for other competing secondary users. Simulation results are provided to show that the proposed policy yields better performance than the existing policies which do not take into account what other secondary users are doing.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.25-33
• /
• 2008

In this paper we propose uplink packet transmission scheme based on Synchronized RA. The scheme can afford to support diverse QoS required from diverse multimeda traffics. In order to minimze the collision probability occurred in contention based channel access, we assign a reservation access channel additionally to the traffic channels. Access probability function for controlling collisions occurred in the reservation access channel is applied. Through assigning different access probability to each traffic user with respect to priority issued by his required QoS, the proposed scheme guarantees minimum throughput required by higher priority users in the whole range of system load.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.138-143
• /
• 2005

This paper aims to optimize an access probe algorithm for the CDMA 2000 system. The incremental value of PWR_STEP increases as NUM_STEP as 1dBm±0.2 for access probe of the area with good receiving sensitivity when the mobile station transmits via access channel and does not receive any ACK message. However, for the area with weak receiving sensitivity, according to the algorithm of open-loop power control, the transmitting power amplifier becomes saturated and PWR_STEP incremental value keeps performing access probe to 0dBm±0.2. Therefore interference and battery consumption increases according to the transmission of the mobile station. We have optimized the access probe algorithm according to the receiving sensitivity. We transmit the incremental value of access probe power, with delaying as much RT slot value as indicated by IS-95C standard in case of good receiving sensitivity and with delaying RT+l slot value in case of weak receiving sensitivity. Simulation results showed that the proposed algorithm contributes to decrease of the interference and battery consumption according to the transmitting power of the mobile station and improves the call duration.