• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.2
• /
• pp.151-159
• /
• 2008

An efficient location registration scheme is essential to accommodate continuously increasing mobile subscribers and to offer a variety of multimedia services with good quality. In this study, we consider a distance-based registration scheme where the number of location areas varies on the basis of cell-by-cell, not of ring-by-ring, to analyze the optimal size of the location area. Using our proposed cell-by-cell distance-based registration scheme with random walk mobility model, we analyze a variety of circumstances to obtain the optimal number of cells for location area that minimizes total signaling traffic on radio channels. From our analysis results, we show that the optimal number of cells for location area is between 4 and 6 in most cases, and our cell-by-cell distance-based location registration scheme has less signaling traffic than optimal ring-by-ring distance-based location registration scheme where optimal distance threshold is 2 (thus the optimal number of cells for location area is 7).

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.85-88
• /
• 2002

Maintaining a proper level of cell lead, system throughput can be maximized by a transmission rate control over the uplink in DS/CDMA cellular system to support integrated services of real-time and delay-tolerant traffic. We find that the cell load-based rate control scheme can be further enhanced by taking the varying channel condition into account In conjunction with some fair scheduling algorithm. Our simulation results show that the proposed scheme outperforms the original cell load-based rate control with the round-robin sharing scheduling scheme.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.10
• /
• pp.9-25
• /
• 1997

Personal Communication Networks will be composed of ATM-based broadband ISDN in the future. However, unlike the wired networks, many challenges will arise in the wireless communication service such as PCS. These callenges are frequency alteration of cell routing path, relatively very high error rate at transmission over the wireless interface, etc. Particularly, the alteration of cell routing path caused by handoff makes temporary deterioration of QoS. In this paper, the signaling flows of handoff scenarios which may occur on Personal Communication Networks are presented, and verified by Pertri-Net toolkit. In addition, the cell flow control scheme which minimizes the lagging gap between cells and maintains the cell sequence during handoff is proposed. The proposed scheme can be summarized as the differentiation of normal queue and handoff queue, and the cell flow control between these queues. For verification of the proposed scheme, we used two approaches, which are mathermatical manipulation and SLAM simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2231-2245
• /
• 2014

Cognitive Radio (CR) has very promising potential to improve spectrum utilization by allowing unlicensed Secondary Users (SUs) to access the spectrum dynamically without disturbing licensed Primary Users (PUs). Mitigating interference is a fundamental problem in CR scenarios. This is particularly problematic for deploying CR in cellular networks, when users are located at the cell edge, as the inter-cell interference mitigation and frequency reuse are critical requirements for both PUs and SUs. Further cellular networks require higher cell edge performance, then SUs will meet more challenges than PUs. To solve the performance decrease for SUs at the cell edge, a novel Dynamic Spectrum Allocation (DSA) scheme based on Game Theory is proposed in this paper. Full frequency reuse can be realized as well as inter-cell interference mitigated according to SUs' sensing, measurement and interaction in this scheme. A joint power/channel allocation algorithm is proposed to improve both cell-edge user experience and network performance through distributed pricing calculation and exchange based on game theory. Analytical proof is presented and simulation results show that the proposed scheme achieves high efficiency of spectrum usage and improvement of cell edge SUs' performance.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.195-200
• /
• 2004

The change of traffic by the CDV is entered in a condensed form in UUC/NPC, overflowing the buffer of the net and possibly causing its congestion. For this reason this paper proposes the Cell Spacing Scheme. As the Cell Shaping Scheme, two method is proposed ; RAT based on the time in which cells enter the spacer and RDT based on the time in which cells come out from the spacer. This paper proposes the improved spacing sheme in which the departure time of the present cell determines the departure time of the next one, by combining with Leaky Bucket and on the traffic characteristics of ATM network.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.3
• /
• pp.67-79
• /
• 2003

An efficient mobility management for mobile stations plays an important role in mobile communication networks. Even though many a mobility management schemes have been proposed, most of mobile communication networks adopt the mobility scheme based on zone-based registration. This paper studies the mobility management scheme that combines zone-based registration and 2-step selective paging. We assume cell by cell registration area, not ring by ring registration area of previous studies, and set up a new mobility model based on 2-dimensional random walk model considering the characteristic of zone-based registration to evaluate its performance exactly. We provide numerical results using proposed model to demonstrate the performance of zone-based registration and 2-step selective paging under various circumstances.

• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.393-398
• /
• 2010

For multi-cell environments, coordinated random beamforming technique in multiuser MIMO(multiple-input multiple-output) broadcast channel is considered. In order to mitigate severe interference at receivers, the multi-cell environments might require complex transmitter and receiver design because the scheduler decision based on full channel state information (CSI) in one cell must be intertwined with decision made by other cells' CSI. With limited CSI, however, this paper considers a scheme of randomizing transmitters' beamforming but being coordinated with other cell transmitters. The transmitters in each cell share random beamforming patterns and schedule data transmission within coherent scheduling period. The corandomized beams allow the users to be selected with the highest SINRs even in multi-cell environments. We analyze the performance of the proposed scheme. And numerical results show that the scheme achieves better performance than the conventional random beamforming when applying to multi-cell environments.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.81-84
• /
• 2000

Scheduling algorithm proposed in this paper is based on both DWRR(Dynamic Weighed Round Robin) method and QLT(Queue Length Threshold) method. The proposed scheduling algorithm guarantees delay property of realtime traffic, not considered in previous DWRR method, with serving realtime traffic preferentially by using RR(Round Robin) method which service each channel equally and QLT algorithm that is dynamic time priority method. Proposed cell scheduling algorithm may increase some complexity over conventional DWRR scheme because of delay priority based cell transmission method. However, due to reliable ABR service and congesition avoidance capacity, proposed scheduling algorithm has good performance over conventional DWRR scheme. Also, delay property based cell transmission method in proposed algorithm minimizes cell delay and requires less temporary buffer size

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.29-34
• /
• 2007

This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• Journal of Industrial Technology
• /
• v.26 no.B
• /
• pp.191-198
• /
• 2006

In this paper, we focus on a question. Which is better between time-based location update method and movement-based location update method? Or, does any other method combining the two methods show better performance? For the question, we propose a hybrid location update scheme, which integrates the time-based and the movement-based methods. In the proposed scheme, a mobile terminal updates its location after n cell boundary crossing and a time interval of T, or the inverse. We derive an analytical solution for the performance of the hybrid scheme with exponential cell resident time. From the numerical analysis, we conclude that the movement-based method seems to have better performance than the time-based and hybrid methods, that is the optimal costs occur at T=0.