• Title/Summary/Keyword: link allocation

Search Result 205, Processing Time 0.028 seconds

The link performance analysis of the satellite communications system using satellite network simulator (모의위성망을 활용한 위성통신체계의 링크성능 분석)

  • Jang, Jae-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5A
    • /
    • pp.441-450
    • /
    • 2007
  • In this paper, it is proposed the link performance analysis results using SNRAT(Satellite Network Resource Allocation & Analysis Tool) and verified the anticipated results by satellite communication network simulator. A communication satellite cannot be corrected or fixed for the error in orbit operation after launching unlike the ground operation equipment and has a restricted operation life. So, it is important to make possible to use satellite communications in the proper time. It is expected the link BER(Bit Error Rate), throughput and AJ(Anti-Jamming) performance using SNRAT tool before launching. And it is verified the performance of the repeaters and ground equipment specification using the satellite network simulator and is extracted the optimum operational scenarios through the tests of various network operational plans.

Dynamic Channel Allocation Algorithm for TD-SCDMA Smart Antenna System with Inter-cell Interference (인접 셀 간섭영향을 고려한 TD-SCDMA 스마트 안테나 시스템의 동적 채널 할당 알고리즘)

  • Jang, Min-Seok;Hong, Een-Kee
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.415-422
    • /
    • 2007
  • In this paper, we proposed a new dynamic channel allocation algorithm for TD-SCDMA with cross time slots. In order to reduce the interference in cross time slot, the mobile stations (MSs) are divided into two groups: the Near Group consisting of MSs near by the base station(BS) and the Far Group including the MSs far from the BS. The reverse link for MSs in the Near Group and forward link for MSs in the Far Group are allocated to the cross time slot. In cellular systems, a BS has multiple neighbor BSs. Some of neighbor BSs can operate in the same direction link while the others have cross time slot. Thus, it is required to determine which BS has the most significant impact in terms of interference. We divide each cell into 6 areas based on the direction of arrival of smart antenna and the most significant neighbor sector is determined with this division. The proposed allocation method and area division method can avoid the severe interference in cross time slots and increase the system capacity about 2%~9% compared to FCA, and 0.5%~1.3% compared to RCA.

  • PDF

Optimal Power and Rate Allocation based on QoS for CDMA Mobile Systems (CDMA 이동통신시스템을 위한 QoS 기반 최적 전송출력/전송률 할당 체계)

  • 장근녕
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.4
    • /
    • pp.1-19
    • /
    • 2003
  • This paper studies power and rate control for data users on the forward link of CDMA system with two cells. The QoS for data users is specified by delay and error rate constraints as well as a family of utility functions representing system throughput and fairness among data users. Optimal power and rate allocation problem is mathematically formulated as a nonlinear programming problem, which is to maximize total utility under delay and error rate constraints, and optimal power and rate allocation scheme (OPRAS) is proposed to obtain a good solution in a fast time. Computational experiments show that the proposed scheme OPRAS works very well and increases total utility compared to the separate power and rate allocation scheme (SPARS) which considers each cell individually.

Dynamic Sub-carrier Multiplexed channel allocation and efficient frame distribution scheme in optical access networks (광가입자망 SCM 채널 동적할당 및 효율적 프레임 분배 방안)

  • 김남욱;윤현호;김태연;유정주;김병휘;강민호
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.113-116
    • /
    • 2003
  • In this paper, we propose a dynamic parallel channel allocation mechanism that dynamically controls total number of allocation channels of each subscriber to effectively service user bandwidth demands while high utilization and fairness are guaranteed in WDM based optical access networks. The logical performance gain of statistical multiplexing by dynamic channel allocation is validated with analytic method as well as simulations. We also introduce the adaptive padding scheme in order to efficiently distribute forwarded frames to aggregated multi-link channels which are formed by parallel channel allocation mechanism. The proposed scheme shows the performance enhancement by minimizing unnecessary padding size and the processing time.

  • PDF

Implementation of a B-Link Interface Logic for a SCI Interconnect (SCI 연결망의 B-Link 인터페이스 회로 구현)

  • 한종석;모상만;기안도;한우종
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.412-415
    • /
    • 1999
  • In this paper, we describe an implementation of the B-Link bus interface logic for a directory controller and a remote access cash controller in the SCI-based CC-NUMA multimedia server developed by ETRI . The CC-NUMA multimedia server is composed of a number of Pentium III SHV nodes and a SCI interconnection network. To communicate with remote nodes, each node has a CC-Agent which consists of a processor bus interface(PIF). a directory controller(DC), a remote access cash controller(RC), and two SCI 1ink controllers(LCs). The B-Link bus interface logic is developed for a directory controller and a remote access cash controller in order to communicate with a SCI link controller on a B-Link bus. It consists of a sending master controller a receiving slave controller, and asynchronous data buffers. And It performs a self-arbitration, a data packet transmission, a queue allocation, an early terminal ion. and a cut-through data path.

  • PDF

Dynamic Resource Allocation Scheme for Interference Mitigation in Multi-Hop Relay Networks (멀티 홉 릴레이 네트워크에서 간섭을 완화하는 동적 자원 할당 기법)

  • An, Kwanghoon;Kim, Taejoon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.5
    • /
    • pp.103-108
    • /
    • 2016
  • In this paper, we propose a resource allocation scheme that guarantees transmission rate for each mobile stations by mitigating interference between a base station-to-mobile station link and a relay station-to-mobile station link. Specifically, we dynamically adjust the boundary between access zone and relay zone using signal to interference plus noise ratio. Moreover, we cluster the mobile stations under sever interference and manage the channel quality of these mobile stations by allocating additional radio resource. Our simulation results show that the proposed scheme can improve the efficiency of radio resources and ensure fairness among mobile stations.

A Session Allocation Algorithm for Fair Bandwidth Distribution of Multiple Shared Links (다중 공유 링크들의 공정한 대역폭 분배를 위한 세션할당 알고리즘)

  • Shim, Jae-Hong;Choi, Kyung-Hee;Jung, Gi-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.253-262
    • /
    • 2004
  • In this paper, a session allocation algorithm for a switch with multiple shared links is proposed. The algorithm guarantees the reserved bandwidth to each service class and keeps the delay of sessions belonging to a service class as close as possible even if the sessionsare allocated to different shared links. To support these qualities of services, a new scheduling model for multiple shared links is defined and a session allocation algorithm to decide a shared link to be allocated to a new session on the connection establishmentis developed based on the model. The proposed heuristic algorithm allocates a session to a link including the subclass with the shortest (expected) delay that subclasses of the service class the session belongs to will experience. Simulation results verify that a switch with multiple shared links hiring the proposed algorithm provides service classes with fairer bandwidth allocation and higher throughput, and guarantees reserved bandwidth better than the switch hiring other session algorithms. It also guarantees very similarservice delay to the sessions in the same service class.

Resource Allocation Scheme for D2D Communications in Multi-Cell Environments (다중 셀 환경에서 단말 간 직접 통신을 위한 자원 할당 방식)

  • Oh, Sung-Min;Lee, Changhee;Yun, Miyoung;Shin, Jaesheung;Park, Ae-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.10
    • /
    • pp.601-609
    • /
    • 2014
  • This paper proposes a resource allocation scheme suitable for D2D communications in multi-cell environment. In order to solve the inter-cell interference, the proposed scheme allocates the pre-assigned resource group and shares the information with neighbor cells. This paper also proposes a power control scheme for D2D communication to enhance the cell throughput. By the simulation results, the average SINR of the cellular uplink and D2D communication link are mostly higher than 10 dB when the proposed scheme is applied. On the other hand, with the inter-cell non-coordinated resource allocation scheme, the average SINR of the D2D communication link are decreased by 0 dB. In addition, the proposed scheme can enhance the cell throughput up to 8 % compared with the inter-cell non-coordinated resource allocation scheme.

An Improved Dynamic Buffer Allocation Scheme for Controlled Transfer Service in ATM Networks (ATM 망에서 CT 서비스를 위한 개선된 동적 버퍼 할당 방식)

  • Kim, Byung-Chul;Kim, Dong-Ho;Cho, You-Ze;Kwon, Yul
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.9
    • /
    • pp.36-48
    • /
    • 1999
  • Controlled transfer (CT) service has been recently proposed as a new ATM transfer capability for high-speed data applications, which used a credit-based flow control. This paper investigates buffer allocation schemes for CT service and proposes an improved dynamic bugger allocation scheme. In order to improve the responsiveness to a congestion, the proposed method is considered the load factor of a link when determining the amounts of virtual connection (VC)s buffer allocation. Also, in this paper we compare the performance of the proposed method with those of the existing buffer allocation methods such as flow controlled virtual channels (FCVC) and zero queueing flow control (ZQFC) through simulation. Simulation results show tat the proposed scheme exhibits a better performance than the existing schemes in terms of throughput, fairness, queue length and link utilization.

  • PDF

Resource Allocation Scheme Based on Spectrum Sensing for Device-to-Device Communications Underlaying Cellular Networks (셀룰러 네트워크 환경에서 D2D 통신을 위한 스펙트럼 센싱 기반 자원 할당 기법)

  • Kang, Gil-Mo;Shin, Oh-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.10
    • /
    • pp.898-907
    • /
    • 2013
  • For D2D communications underlaying cellular networks, it is essential to consider the mutual interference between the existing cellular communications and D2D communications as well as the spectral efficiency, as they need to share the same frequency. Accordingly, a resource allocation scheme should be designed in such a way that minimizes the mutual interference and maximizes the spectrum utilization efficiency at the same time. In this paper, we propose a resource allocation scheme based on cooperation of the base station and D2D terminals. Specifically, a D2D terminal senses the cellular spectrum to recognize the interference condition, chooses the best cellular resource, and reports the information to the base station. The base station allocates D2D resource such that the corresponding D2D link and cellular link share the same resource. The performance of the proposed resource allocation scheme is ated through compu under 3GPP LTE-Advanced scenarios.