• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.1
• /
• pp.5-10
• /
• 2015

D2D (Device-to-Device) communication underlaying LTE-advanced networks is a promising technology to improve the system capacity and spectral efficiency. By sharing the same radio resources with cellular user equipments, D2D communications can significantly enhance the overall spectral efficiency. However, it may cause interference between D2D link and cellular link. Careful resource allocation and interference coordination between cellular and D2D communications are very important and need to be properly handled. This paper proposes a radio resource allocation scheme based on FFFR (Flexible Fractional Frequency Reuse) for D2D communication underlaying cellular networks. The base station selects randomly resource blocks assigned to cellular users, and reuses them for a D2D pair. Through simulations, we have confirmed that the proposed scheme improves the system throughput, reduces the computational complexity, and mitigates the interference of D2D link and cellular link.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.5
• /
• pp.293-301
• /
• 2014

It has been grown interests ot the convergence services about broadcasting and multicasting services such as Mobile IPTV. It needs the efficient scheduling and resource allocation algorithm because video contents have the large data. This paper proposes the resource allocation algorithm for the layered-encoded video coding in the multicasting services. Existing approaches only deal with the utility maximization in the current video frames. However, these algorithms have a problem for the Quality of Services(QoS) if the user's channel states are not good. We apply the delay constraint and find to maximize the utility values using the current content's frames and already assigned content's frames within the constraint periods. The performance of the proposed algorithm is evaluated by the higher layer transmission rates compared the existing algorithm and significantly improved for the QoS.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.37-37
• /
• 2004

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.27-34
• /
• 2013

We propose a simple power allocation scheme for an amplify-and-forward multiple relay system with multiple-input multiple-output antennas. Unlike the existing relay precoding matrix with full elements, proposed precoder is a diagonal matrix whose diagonal element is the relay gain for each stream. Furthermore, a weight vector is applied to streams, such that the mutual information of the system approaches that of the exhaustive search scheme, regardless of the number of antennas. Numerical results show that proposed scheme outperforms the conventional schemes with respect to mutual information.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.807-814
• /
• 2004

This paper researches and evaluates a bandwidth reallocation mechanism for efficient DiffServ QoS support in MPLS networks by monitoring the network traffic status and reallocating unused bandwidth. While the Differentiated Services in MPLS Networks architecture provides QoS management through the RSVP resource reservation, this mechanism is based on a static provisioning of resource. But this approach can lead to waste bandwidth in some service classes or, leave some service classes' resource starved. This paper presents the bandwidth reallocation dynamically based on network traffic status for bandwidth usage maximization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.4
• /
• pp.762-768
• /
• 2015

D2D communication as an underlaying LTE-Advanced network has proven to be efficient in improving the network performance and decreasing the traffic load of eNodeB(enhanced NodeB). However large amount of interference can be caused by sharing the resources between the cellular users and D2D pairs. So, a resource allocation for D2D communication to coordinate the interference is necessary. Related works for resource allocation that D2D can reuse the resources of more than one cellular user with best CQI(Channel Quality Indicator) have been proposed. D2D communications may still cause interference to the primary cellular network when radio resource are shared between them. To avoid this problem, we propose a radio resource allocation algorithm with low computational complexity for D2D communication in OFDM-based wireless cellular networks. Unlike the previous works, the proposed algorithm utilizes unused ones of the whole resource. The unused resource allocate to on D2D pair can be shared only with other D2D pairs. In other words, if the distance between the D2D pairs is sufficient, we allowed more than two D2D pairs to share the same resources. The simulation results have proven that the proposed algorithm has up to 11 times lower computational complexity than the compared one according to the number of D2D.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.601-608
• /
• 2001

The automated assignment of multiple tasks to executing agents is a key problem in the area of multi-agent systems. In many domains, significant savings can be achieved by reallocating tasks among agents with different costs for handling tasks. The automation of task reallocation among self-interested agents requires that the individual agents use a common negotiation protocol that prescribes how they have to interact in order to come to an agreement on "who does what". In this paper, we introduce the multi-agent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest the Vickery auction as an interagent negotiation protocol for solving this problem. In general, auction-based protocols show several advantageous features: they are easily implementable, they enforce an efficient assignment process, and they guarantce an agreement even in scenarios in which the agents possess only very little domain-specific Knowledge. Furthermore Vickrey auctions have the additional advantage that each interested agent bids only once and that the dominant strategy is to bid one′s true valuation. In order to apply this market-based protocol into task reallocation among self-interested agents, we define the profit of each agent, the goal of negotiation, tasks to be traded out through auctions, the bidding strategy, and the sequence of auctions. Through several experiments with sample multi-agent TSPs, we show that the task allocation can improve monotonically at each step and then finally an optimal task allocation can be found with this protocol.

• The Journal of the Acoustical Society of Korea
• /
• v.37 no.6
• /
• pp.457-467
• /
• 2018

This paper presents performance comparison of several high-resolution frequency estimation algorithms for pure real tone signal. Algorithms are DFT (Discrete Fourier Transform - for reference purpose), Jacobsen, Candan, reassignment and Cedron. Each algorithm is evaluated under various experimental conditions, e.g., different SNR (Signal to Noise Ratio), window function and window length and performance is compared in the perspective of bias, MSE (Mean Square-Error) and variance. Experimental results indicate that Cedron algorithms works well in the most cases. For actual usage in the engineering problem, each algorithm needs additional analysis and modification.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.964-972
• /
• 2009

Wireless mesh network (WMN) is emerging a future core technology to resolve many problems derived from exist wireless networks by employing multi-interface and multi-channel. Ability to utilize multiple channels in WMNs substantially increases the effective bandwidth available to wireless network nodes. However, minimum interference channel assignment algorithms are required to use the effective bandwidth in multi-channel environments. This paper proposes a cluster-based minimum interference channel assignment (MI-CA) algorithm to improve the performance of WMN. The MI-CA algorithm is consists of Inter-Cluster and Intra-Cluster Intrchannel assignment between clusters and in the internal clusters, respectively. The Inter-Cluster channel assignment assigns a barebone channel to cluster heads and border nodes based on minimum spanning tree (MST) and the Intra-Cluster channel assignment minimizes channel interference by reassigning ortasgonal channels between cluster mespann. Our simheation results show that MI-CA can improve the performance of WMNs by minimizing channel interference.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.01a
• /
• pp.275-277
• /
• 2016

이동통신망에서 광대역 멀티미디어 서비스를 위한 무선 자원 확보를 위해서는 매크로셀/마이크로/피코셀(macro/micro/pico cell) 구조를 통해 무선 자원을 효과적으로 재사용할 필요가 있다. 이런 구조에서는 작은 셀 반경으로 인하여 빈번히 핸드오버가 발생하게 되고 이동성 또한 시간과 장소에 따라서 다양하게 나타난다. 본 논문에서는 차세대 이동통신망의 핸드오버 상황에서, 다양한 고속 멀티미디어 서비스에 일정한 수준의 QoS (Quality of Services)를 보장하기 위한 자원할당 시의 부하 제어 방안을 제안한다.