• Title/Summary/Keyword: 자원할당방법

Search Result 345, Processing Time 0.023 seconds

Cluster Coordinator Node Based Inter-Cell Interference Management Methods in Heterogeneous Networks (이기종 네트워크에서 클러스터 코디네이터 노드 기반의 셀간 간섭 관리 방법)

  • Yang, Mochan;Wu, Shanai;Shin, Oh-Soon;Shin, Yoan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.3
    • /
    • pp.277-288
    • /
    • 2013
  • 3GPP LTE-Advanced (Third Generation Partnership Project Long Term Evolution-Advanced) as a next generation mobile communication standard introduced small base stations such as femto cells or pico cells, and D2D (Device-to-Device) communications between mobiles in the proximity in order to satisfy the needs of rapidly growing wireless data traffic. A diverse range of topics has been studied to solve various interference situations which may occur within a single cell. In particular, an introduction of a small base station along with D2D communication raises important issues of how to increase the channel capacity and frequency efficiency in HetNets (Heterogeneous Networks). To this end, we propose in this paper methods to manage the interference between the macro cell and other small cells in the HetNet to improve the frequency efficiency. The proposed CCN (Cluster Coordinator Node)-assisted ICI (Inter-Cell Interference) avoidance methods exploit the CCN to control the interference in HetNet comprising of an MeNB (Macro enhanced Node-B) and a large number of small cells. A CCN which is located at the center of a number of small cells serves to avoid the interference between macro cell and small cells. We propose methods of resource allocation to avoid ICI for user equipments within the CCN coverage, and evaluate their performance through system-level computer simulations.

A Frequency-Sharing Method to Use Frequency Resources Efficiently (효율적인 주파수 이용을 위한 주파수 공유 방법)

  • Kang, Sang-Gee;Hwang, Taek-Jin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.8
    • /
    • pp.1349-1355
    • /
    • 2008
  • Recently many short-range transceiver systems, such as ZigBee, Bluetooth and RFID(Radio Frequency Identification), have been developed. These systems are mostly low-power transceivers. In the near future many more low-power transceivers are appeared for WPAN(Wireless Personal Area Network) and interference mitigation technologies are necessary to the low-power transceivers for using frequency resources efficiently. In this paper we consider two methods for sharing frequency resources. The first case is that a frequency band previously assigned fer a certain system is shared and the second case is that the white frequency band is shared. We study the method and conditions for sharing frequency resources in the above two cases. When a frequency band is shared with ZigBee, RFID, DCP (Digital Cordless Phone) and Bluetooth as an example for the first case, the sharing conditions are investigated and the results are presented. We propose a balancing factor to maintain an equal transmitting conditions between systems having a different interference mitigation technique. In the interference simulation we use FH(Frequency Hopping) as a reference system and 0.9 of a balancing factor for LBT(Listen Before Talk) and 0.8 for DS(Direct Spreading). From the simulation results we know that a balancing factor reduces interference probability therefore many more systems can be operated in the same frequency bands compared with the case without using a balancing factor.

Elliptical Clustering with Incremental Growth and its Application to Skin Color Region Segmentation (점증적으로 증가하는 타원형 군집화 : 피부색 영역 검출에의 적용)

  • Lee Kyoung-Mi
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.9
    • /
    • pp.1161-1170
    • /
    • 2004
  • This paper proposes to segment skin color areas using a clustering algorithm. Most of previously proposed clustering algorithms have some difficulties, since they generally detect hyperspherical clusters, run in a batch mode, and predefine a number of clusters. In this paper, we use a well-known elliptical clustering algorithm, an EM algorithm, and modify it to learn on-line and find automatically the number of clusters, called to an EAM algorithm. The effectiveness of the EAM algorithm is demonstrated on a task of skin color region segmentation. Experimental results present the EAM algorithm automatically finds a right number of clusters in a given image without any information on the number. Comparing with the EM algorithm, we achieved better segmentation results with the EAM algorithm. Successful results were achieved to detect and segment skin color regions using a conditional probability on a region. Also, we applied to classify images with persons and got good classification results.

The Algorithm on Channel Converting and Monitoring of the Remote Controlled Transceiver (원격제어 송수신기의 채널변환 및 모니터링에 대한 알고리즘)

  • 조학현;최조천;김기문
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.05a
    • /
    • pp.266-271
    • /
    • 1999
  • The purpose in this study has to development the system on increasing operation of old-typed transceiver for solve the question that limited allocation frequencies and continuesly icreasment of traffic. Therefore, we are desigened the remote control system that has the function for variable channels, PTT and monitoring of transmission power and frequencies. Exchange of control data is to hold in common the twist two-wire or telephone line for the voice transmission. The H/W is consist of FSK and MCS-51 processor which are up-down control of channel, n control and monitoring display by serial data transmission. According to the simplex traffic operation is designed the algorithm of serial data transmission by sequential transmission sequence and protocol. The S/W of sequential transmission sequence is designed to usefully the intergrated communications system which is able to connection between the multi-transceiver and multi-terminal by master processor.

  • PDF

A Study on the Bandwidth Allocation Control of Virtual Paths in ATM Networks for Multimedia Service (멀티미디어 서비스를 위한 ATM망에서 가상경로의 대역폭 할당 제어에 관한 연구)

  • Jang, Yung-Chul;Lee, Jung-Jei;Oh, Moo-Song
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.6
    • /
    • pp.1433-1442
    • /
    • 1997
  • Algorithm design is needed to optimized bandwidth which satisfy quality of service(QoS) requirements of vary traffic classes for Multimedia service in ATM networks. The diverse flow characteristics e.g., burstiness, bit rate and burst length, have to guarantee the different quality of service(QoS) requirements in Asynchronous Transfer Mode(ATM). The QoS parameter may be measured in terms of cell loss probability and maximum cell dely. In this paper, we consider the ATM networks which the virtual path(vip) concept is implemented by applying the Markov Modulated Deterministic Process method. We develop an efficient algorithm to computer the minimum capacity required to satisfy all the QoS requirements when multiple classes of on-off source are multiplexed on single VP. Using above the result, we propose a simple algorithm to determine the VP combination to achieve the near optimum of total capacity required for satisfying the individual QoS requirements. Numerical results are also presented to demonstrate the performance of the algorithm, when compared to the optimal total capacity required.

  • PDF

A Novel Efficient Up-Link Scheduler for IEEE 802.16m (IEEE802.16m을 위한 효율적인 상향링크 스케줄러 연구)

  • Cho, Da-Young;Oh, Hyuk-Jun;Hong, Sung-Woong;Oh, Il-Hyuk;Ko, Kyung-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.11
    • /
    • pp.979-985
    • /
    • 2012
  • The design of an efficient scheduler is a key design factor in IEEE 802.16m systems, in order to support services with various QoS smoothly. Although conventional studies of schedules have been suggested, those had problems that are not able to satisfy the delay condition and make the through-put declined, because they only focused on a specific action scenario rather than reflecting practical action scenarios which have real-time and non-real-time traffics variously. In this paper, an efficient uplink scheduling algorithm is proposed for IEEE 802.16m system by introducing the concepts of Virtual Time(VT) and Virtual Finish Time(VFT) based priority determination, and separate buffers for each QoS class in the mobile terminal. Simulation results showed that the proposed scheme had satisfied the delay requirement of real-time services even with improved throughput performance compared to conventional methods.

Adaptive Rate Control for Improving the QoE of Streaming Service in Broadband Wireless Network (광대역 무선네트워크에서 스트리밍 서비스의 QoE 향상을 위한 적응적 전송률 제어기법)

  • Koo, Ja-Hon;Chung, Kwang-Sue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.2B
    • /
    • pp.334-344
    • /
    • 2010
  • Recently, due to the prevalence of various mobile devices and broadband wireless networks, a significant interests and demands for multimedia streaming services over the Internet have been increasing. However, it is difficult to transmit continuous multimedia stream when mobile terminals are moving. Therefore, in order to deploy mobile IPTV service in the broadband wireless network, efficient wireless resource utilization and seamless QoE (Quality of Experience) offers to the users are an important issue. In this paper, we propose a network based adaptive streaming scheme, called MARC (Mobile Adaptive Rate Control), which controls the quality of the video and rate of the video based on the status of the wireless channel. The proposed scheme uses awareness information of the wireless channel status and controls transmitting streaming video which is suitable for the wireless channel status and mobile station location, in order to provide a seamless video playback for mobile environment in addition to improving the quality of a streaming service. The proposed MARC scheme alleviates the discontinuity of video playback and allocates suitable client buffer in broadband wireless network. Simulation results demonstrate the effectiveness of our proposed scheme.

A Parameter Estimation of Software Reliability Growth Model with Change-Point (변화점을 고려한 소프트웨어 신뢰도 성장모형의 모수추정)

  • Kim, Do-Hoon;Park, Chun-Gun;Nam, Kyung-H.
    • The Korean Journal of Applied Statistics
    • /
    • v.21 no.5
    • /
    • pp.813-823
    • /
    • 2008
  • The non-homogeneous Poisson process(NHPP) based software reliability growth models are proved quite successful in practical software reliability engineering. The fault detection rate is usually assumed to be the continuous and monotonic function. However, the fault detection rate can be affected by many factors such as the testing strategy, running environment and resource allocation. This paper describes a parameter estimation of software reliability growth model with change-point problem. We obtain the maximum likelihood estimate(MLE) and least square estimate(LSE), and compare goodness-of-fit.

Resource Allocation Method in High-Rate Wireless Personal Area Networks (고속 무선 PAN에서의 자원 할당 방식)

  • Kim, Byung-Seo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.1
    • /
    • pp.39-45
    • /
    • 2008
  • High-Rate Wireless Personal Area Networks (HR-WPANs) in IEEE 802.15.3 standard use a TIme Devision Multiple Access (TDMA) protocol to support isochronous traffic. Isochronous traffic requires a delay-bounded service. However, the HR-WPAN standard suffers from long access delay and association delay. In this paper, we propose an enhanced MAC protocol for the delay-bounded traffic. This proposed protocol provides a way that a central node is able to collect traffic status on all member nodes. Furthermore, by utilizing the information, a scheduling algorithm is also proposed in order to synchronize the instant of a packet transmission with that of the packet arrival. With the proposed protocol and algorithm, the delay of access and association can be reduced. Performance analysis is carried out and the significant performance enhancement is observed.

  • PDF

Reduced Complexity QRD-M Algorithm for Spatial Multiplexing MIMO-OFDM Systems (공간 다중화 MIMO-OFDM 시스템을 위한 복잡도 감소 QRD-M 알고리즘)

  • Mohaisen, Manar;An, Hong-Sun;Chang, Kyung-Hi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4C
    • /
    • pp.460-468
    • /
    • 2009
  • Multiple-input multiple-output (MIMO) technology applied with orthogonal frequency division multiplexing (OFDM) is considered as the ultimate solution to increase channel capacity without any additional spectral resources. At the receiver side, the challenge resides in designing low complexity detection algorithms capable of separating independent streams sent simultaneously from different antennas. In this paper, we introduce an upper-lower bounded-complexity QRD-M algorithm (ULBC QRD-M). In the proposed algorithm we solve the problem of high extreme complexity of the conventional sphere decoding by fixing the upper bound complexity to that of the conventional QRD-M. On the other hand, ULBC QRD-M intelligently cancels all unnecessary hypotheses to achieve very low computational requirements. Analyses and simulation results show that the proposed algorithm achieves the performance of conventional QRD-M with only 26% of the required computations.