• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.2035-2046
• /
• 2015

Recently, researches on resource allocation algorithms operating in a distributed way are widely conducted because of the increasing number of network nodes and the rapidly changing the network environment. In this paper, we propose Multi-Hop DESYNC(MH DESYNC), that is bio-inspired TDMA-based resource allocation scheme operating in a distributed manner in multi-hop networks. In this paper, we define a frame structure for the proposed MH DESYNC algorithm and firing message structure which is a reference for resource allocation and propose the related operating procedures. We show that MH DSYNC can resolve the hidden-node problem effectively and verify that each node shares resources fairly among its neighboring nodes. Through simulation evaluations, it is shown that MH DESYNC algorithm works well in a multi-hop networks. Furthermore, results show that MH DESYNC algorithm achieves better performance than CSMA/CA algorithm in terms of throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.580-591
• /
• 2013

The Orthogonal Frequency Division Multiple Access (OFDMA) is considered as a novel modulation and multiple access technique for 4th generation wireless systems. In this paper, we formulate a base station's power allocation algorithm for each user to maximize the user's sum rate, subject to constraints on total power, bit error rate, and rate proportionality among the users for a better proportional rate adaptive (RA) resource allocation method for OFDMA based system. We propose a novel power allocation method based on the proportion of subcarrier allocation and the user's normalized proportionality constant. We adapt a greedy algorithm and waterfilling technique for allocating the subcarriers among the users. In an end-to-end simulation, we validate that the proposed technique has higher system capacity and lower CPU execution times, while maintaining the acceptable rate proportionality among users.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.703-705
• /
• 1999

셀룰러 네트워크에서의 효율적인 채널 할당 문제는 통신자원의 사용을 최적화하려는 의도에서 여러 연구자들에 의해 최근 활발히 연구되고 있다. 셀룰러 네트워크는 셀을 나타내는 노드들로 이루어진 삼각형의 격자모양의 그래프로 모델 되어지며, 셀룰러 네트워크에서의 채널할당 문제는 그래프에서의 컬러링 문제로 바꿔질 수 있다. 본 논문에서는 셀룰러 네트워크에서의 최적의 채널 할당 알고리즘을 제안하며, 셀의 수가 N일 때 시간 복잡도가 O(N)인 알고리즘이다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1095-1104
• /
• 2008

In multiuser OFDM systems, subcarrier and bit allocation plays an important role for the efficient resource use. However, in multiuser adaptive allocation as a non-linear problem, it is impractical to compute all to get the best solution because of the complexity. We set the goal of minimizing the transmit power while satisfying the BER and minimum bits required to transmit through the highest fitness combination of subcarriers and users. The proposed improved genetic algorithm employs the diversity of adaptive allocation more than existing genetic algorithm. Therefore, from the numerical simulation results, we find that the proposed heuristic algorithm has more performance than the existing algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2769-2774
• /
• 2013

The key of USN(Ubiquitous Sensor Network) technology is low power wireless communication technology and proper resource allocation technology for efficient routing. The distinguished resource allocation method is needed for efficient routing in sensor network. To solve this problems, we propose an algorithm that can be adopted in USN with making up for weak points of PQ and WRR in this paper. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class in sensor network. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12A
• /
• pp.1191-1199
• /
• 2008

We propose the Staggered-zone Resource Allocation (SRA) in order to relax throughput decrease problems by the co-channel interference of the cell boundary users at the cellular OFDMA system using frequency reuse factor K=1 and analyze the throughput improvement. The proposed algorithm allocates the resources to the users in compliance with resource allocation rule which is planned in order to minimize co-channel interference between cells without any additional information. The resource allocation method in the SRA lines up the users in pathloss order as descending series, and then allocates from pre-determined resource allocation region where decides differently in each cell. This algorithm prevents the co-channel interferences of the cell boundary user to be caused by using same resource simultaneously and equalizes interference to the users in the cell.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.30-32
• /
• 1999

본 논문에서는 자원제약을 목적함수로 하여 파이프라인 실행이 가능하게 하는 데이터패스 합성을 위해 개발되어진 스케쥴링 알고리즘들의 실행시간과 실행결과를 도표를 기준으로 정렬한다. 평가의 대상이 되는 알고리즘들은 스케쥴을 위해 제안되는 함수의 계산시점, 함수의 역할과 적용방법에 의해 구분되어지는 논문 [1],[2],[3]에 대하여 수행되어지며, 충돌을 발생시키는 파티션 내에 위치하는 모빌리티를 가지는 각각의 연산에 대해 다음 파티션으로의 지연시 충돌수 변이와 각 연산의 모빌리티를 요소로 계산되는 우선 순위 함수를 정의하여 스케쥴 순열을 정렬하는 결정하는 논문[1]과 자원 할당 가능성 판단함수를 제안하고 이를 기준으로 배정가능 범위를 축소해 나가며 연산을 스케쥴하는 논문[2]와, 논문[2]의 자원할당 가능성 판단시 부과되는 시간감소를 위해 현재의 스케쥴 상황 값들을 정량화 하여 연산이 선택되도록하여 결과적 실행 시간을 감소시키는 논문[3]에 대하여 벤치마크 성능평가와 알고리즘 실행시간 결과 비교를 수행하고 향후 연구 진행 방향을 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.583-591
• /
• 2008

This paper proposes a resource allocation algorithm for minimizing the overall distortion of multiple users in orthogonal frequency division multiplex (OFDM). The proposed algorithm exploits the diversity of multiuser and the rate-distortion function using packet distortion model in a system with limited resources. We first induce a rate-distortion function considering error concealment and error propagation properties of H.264 video structures. Then we perform adaptive resource allocation utilizing multiuser diversity for minimizing the overall video quality degradation. We also consider the proportional rate which is pre-determined for each user. Simulation results show that compared to the previous time division multiple access method and the resource allocation method maximizing data rate, the proposed rate allocation algorithm substantially improves the received video quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8C
• /
• pp.819-827
• /
• 2002

Personal mobile communication has been developed up to IMT-2000 which is called the third generation mobile communication. The first generation of personal mobile communication was analog cellular, the second was digital cellular, and the 2.5 generation was PCS. Before the third generation had been developed, the personal mobile communication service was focused mainly on the voice-oriented service. But, we can expect that multimedia service after the third generation system will be the core of the subject. T In this thesis, we propose a dynamic resource allocation algorithm in the UTRA TDD systems which can support the asymmetric traffic propensity and multimedia traffic. The proposed algorithm consists two sub-algorithms. One is the dynamic channel allocation method that determines the amount of bandwidth assigned between uplink and downlink according to resource allocation status list through asymmetric traffic propensity. The other is the channel access mechanism that assigns RU to bearer service generated in a cell. By simulation, the proposed dynamic resource allocation algorithm is proved to support asymmetric propensity of traffic and shows a better throughput for multimedia traffic.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.17-29
• /
• 1999

This paper presents a high level synthesis method targeting low power consumption for data-dominated CMOS circuits (e.g., DSP). The high level synthesis is divided into three basic tasks: scheduling, resource and register allocation. For lower power scheduling, we increase the possibility of reusing an input operand of functional units. For a scheduled data flow graph, a compatibility graph for register and resource allocation is formed, and then a special weighted network is then constructed from the compatibility graph and the minimum cost flow algorithm is performed on the network to obtain the minimum power consumption data path assignment. The formulated problem is then solved optimally in polynomial time. This method reduces both the switching activity and the capacitance in synthesized data path. Experimental results show 15% power reduction in benchmark circuits.