• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.42-48
• /
• 2002

In broadband wireless networks, the effective meeting of the QoS guarantees may strongly depend on the Contention Resolution Algorithm used in the uplink contention period. The time it takes a station to transmit a successful request to the base station, or request delay, must be kept low even during periods of high contention. If a request suffers many collisions, it cannot rely on the preemptive scheduler to receive low access delays. However, the conventional collision resolution algorithm has a problem that all collided stations are treated equally regardless of their delay from previous contention periods. Some requests may have very long request delay caused by continuous collisions. In this paper, we propose an adaptive collision resolution algorithm for fast random access in broadband wireless networks. The design goal is to provide quick access to the request with a high number of collisions. To do this, the proposed algorithm separates the whole contention region into multiple sub regions and permits access through each sub region only to the requests with equal number of collisions. The sub region is adaptively created according to the feedback information of previous random access. By simulation, the proposed algorithm can improve the performance in terms of throughput, random delay and complementary distribution of random delay by its ability to isolate higher priorities from lower ones. We can notice the algorithm provides efficiency and random access delay in random access environment.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.86-101
• /
• 2006

The bandwidth of channel and the power of the mobile devices are limited on a wireless environment. In this case, data broadcast has become an excellent technique for efficient data dissemination. A significant amount of researches have been done on generating an efficient broadcast program of a set of data items with different access frequencies over multiple wireless broadcast channels as well as single wireless broadcast channel. In this paper, an efficient data allocation method over multiple wireless broadcasting channels is explored. In the traditional approaches, a set of data items are partitioned into a number of channel based on their access probabilities. However, these approaches ignore a variation of access probabilities of data items allocated in each channel. In practice, it is difficult to have many broadcast channels and thus each channel need to broadcast many data items. Therefore, if a set of data items broadcast in each channel have different repetition frequencies based on their access frequencies, it will give much better performance than the traditional approaches. In this paper, we propose an adaptive data allocation technique based on data access probabilities over multiple broadcast channels. Our proposed technique allows the adaptation of repetition frequency of each data item within each channel by taking its access probabilities into at count.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1333-1343
• /
• 2016

Spectrum sharing in centrally controlled cognitive radio (CR) networks has been widely studied, however, research on channel access for distributively controlled individual cognitive users has not been fully characterized. This paper conducts an analysis of random channel access of cognitive users controlled in a distributed manner in a CR network. Based on the proposed estimation method, each cognitive user can estimate the current channel condition by using its own Markov-chain model and can compute its own blocking probability, collision probability, and forced termination probability. Using the proposed scheme, CR with distributed control (CR-DC), CR devices can make self-controlled decisions based on the status estimations to adaptively control its system parameters to communicate better.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.4
• /
• pp.201-206
• /
• 2009

The third generation mobile communications system requiring the reliable multimedia data transmission has provided with the reliable voice, data and video services over the variable propagation environment. However the broadband wireless multiple access technologies cause Inter Symbol Interference (ISI) or Multiple Access Interference (MAI) to degrade the performance of W-CDMA (Code Division Multiple Access) system. Constant Modulus Algorithm (CMA) which is frequently used as the adaptive blind equalizers to remove the interfering signal has ill-convergence phenomenon without proper initialization. In this paper, new blind equalization method based on conventional CMA is proposed to improve the channel efficiency, and through computer simulation this is tested over the time varying fading environment of mobile communication system. Consequently, new blind equalization method into concatenated Kalman filter with CMA is verified better than conventional CMA through adopting minimum mean square errors and eye-pattern obtained from algorithm are compared.

• The Journal of the Korea Contents Association
• /
• v.2 no.3
• /
• pp.113-118
• /
• 2002

To provide interactive sonics in HFC(Hybrid Fiber Coax)-CATV network, there must be supported a MAC(Medium Access Control) protocol. It is wet known that collision can be occurred in the HFC upstream channel because it is shared by up to 500 users. Thus it needs the collision resolution algorithm. Consequently, this paper proposes the analysis mood to study stability of binary stack algorithm for adaptive collision resolution algorithm in HFC-CATV. Also, it compares a system throughput between IPP model and D-BMAP model.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.191-194
• /
• 2003

In IEEE 802.11b, Medium Access Control Sublayer consists of DCF (Distributed Coordination Function) and PCF (Point Coordination Function). DCF provides contention based services and PCF provides contention free services for QoS satisfaction. DCF uses CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance) as an access protocol. And PCF uses Polling Scheme. In this paper, a modified New-PCF, which gives weights to channels with heavier traffic load, was suggested. NS-2 simulations were conducted to compare the service performances with original DCF, PCF and the modified New-PCF respectively. Simulation results has shown the increased overall throughput with the proposed New-PCF compared with other cases.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.121-124
• /
• 2003

Passive optical networks (PONs) will be the pervasive choice in the design of next-generation access networks. One possible solution to implementing Passive optical access network is to rely on wavelength-division multiplexing (WDM). In this paper, we solve the problem of providing real-time service to both hard and soft real-time messages in conjunction with a conventional vest-effort service in WDM. we propose an adaptive scheduling algorithm to schedule and manage the message transmissions in the optical access network. Proposed algorithm is MLF-MQF. Also, we suggest dynamic bandwidth algorithm(DBA) in Loop-back WDM-PON (LPB-PON).our mechanism based on bandwidth reservation protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.4
• /
• pp.639-644
• /
• 2001

Sequence Code Division Multiple Access) and TDMA(Time Division Multiple Access) system. In this system, the narrowband TDMA signals can cause intolerant interferences to CDMA signals. In this paper, DS-CDMA/TDMA frequency sharing system have been analyzed in AWGN(Additive white Gaussian Noise), MAI (Multi Access Interference) and NI(Narrowband Interference) environment. Also, performance improvement has been obtained by adopting an adaptive notch filtering scheme using complex filter bank and CCI canceller.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1198-1205
• /
• 2000

In this paper, we introduce a modified interference cancellation scheme to overcome MAI in DS-CDMA. Among ICs(Interference Cancellers), PIC(Parallel IC) requires the more complexity, and SIC(Successive IC) faces the problems of the long delay time. Most of all, the adaptive detector achieves the good BER performance using the adaptive Inter conducted iteration algorithm. So it requires many iterations. To resolve the problems of them, we propose an improved adaptive detector that the received signal removed MAI through the sorting scheme and the cancellation method are fed into the adaptive filter. Because the improved input signal is fed into the adaptive filter, it has the same BER performance only using smaller iterations than the conventional adaptive detector, and the proposed detector having adaptive filter requires less complexity than the other detectors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.10
• /
• pp.1945-1956
• /
• 1994

In this paper, a multiaccess network protocol for high-speed communication is proposed, which enables multimedia sevices with integrating the existing networks. We examine the traffic control mechanisms and configurations for the network architecture and compare with various protocols which are suitable to high speed LAN/MAN and propose an adaptive access control mechanism. ATMR has low channel utilization due to window size reset time, and that MetaRing is very sensitive over the change of traffic load. This suggested protocol, however, has quite a good performance for that situation by adding adaptive parameter condition. This mechanism may introduce a model of small-scaled Broadband Integrated Service Network and be used as an internetworking system for the ATM network.