• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.1911-1930
• /
• 2017

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. The key to overlay routing is the placement and maintenance of the overlay infrastructure, especially, the selection and placement of key relay nodes. Spurred by the observation that a few relay nodes with high betweenness centrality can provide more optimal routes for a large number of node pairs, we propose a resilient routing overlay network construction method by introducing Super-Relay nodes. In detail, we present the K-Minimum Spanning Tree with Super-Relay nodes algorithm (SR-KMST), in which we focus on the selection and connection of Super-Relay nodes to optimize the routing quality in a resilient and scalable manner. For the simultaneous path failures between the default physical path and the overlay backup path, we also address the selection of recovery path. The objective is to select a proper one-hop recovery path with minimum cost in path probing and measurement. Simulations based on a real ISP network and a synthetic Internet topology show that our approach can provide high-quality overlay routing service, while achieving good robustness.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.108-110
• /
• 2015

In this paper, we proposed the relay node selection scheme using property of node such as velocity, direction in Delay Tolerant Networks. the existing selection scheme is caused the problem increasing the transmission delay and packet loss, if select the relay node for different mobile with destination. To overcome this problem, we proposed the relay node selection scheme using the property of mobile node. the proposed scheme represents and shares the property of mobile node. The proposed algorithm assumed the sketchy position of node from mobile node delivering property of destination. In addition, the propose algorithm recognizes and analyzes the context of mobile node to provide the relay node transferring the data efficiently. The simulation result provides the better result in terms of transmission delay and packet delivery ratio by selecting transmission by relay node according property of node.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4451-4466
• /
• 2014

We present joint radio selection and relay scheme that delivers data from a source to a sink in heterogeneous stationary sensor networks consisting of various radio interfaces. The proposed scheme finds the optimal relay nodes and their corresponding radio interfaces that minimize energy consumption throughout the network while satisfying the end-to-end packet deadline requirement. We formulate the problem of routing through radio interface selection into binary integer programs, and obtain the optimal solution by solving with an optimization solver. We examine a trade-off relationship between energy consumption and packet delay based on network level simulations. We show that given the end-to-end deadline requirement, our routing algorithm finds the most energy-efficient routing path and radio interface across mesh hops. We demonstrate that the proposed routing scheme exploits the given packet delivery time to turn into network benefit of reducing energy consumption compared to routing based on single radio interface.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5253-5270
• /
• 2016

With device-to-device (D2D) communications, an inactive user terminal can be utilized as a relay node to support multi-hop communication so that connective experience of the cell-edge user as well as the capacity of the whole system can be significantly improved. In this paper, we investigate the spectrum sharing for a cooperative relay assisted D2D communication underlying a cellular network. We formulate a joint relay selection and channel assignment problem to maximize the throughput of the system while guaranteeing the quality of service (QoS) requirements of cellular users (CUs) and D2D users (DUs). By exploiting coalition formation game theory, we propose two algorithms to solve the problem. The first algorithm is designed based on merge and split rules while the second one is developed based on single user's movement. Both of them are proved to be stable and convergent. Simulation results are presented to show the effectiveness of the proposed algorithms.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.633-638
• /
• 2011

In this paper, we consider resource allocation with proportional fairness in the downlink orthogonal frequency division multiple access relay networks, in which relay nodes operate in decode-and-forward mode. A joint optimization problem is formulated for relay selection, subcarrier assignment and power allocation. Since the formulated primal problem is nondeterministic polynomial time-complete, we make continuous relaxation and solve the dual problem by Lagrangian dual decomposition method. A near-optimal solution is obtained using Karush-Kuhn-Tucker conditions. Simulation results show that the proposed algorithm provides superior system throughput and much better fairness among users comparing with a heuristic algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.287-292
• /
• 2015

In this paper, we evaluated the performance of D2D advertisement dissemination algorithms with maximum-distance and transmission-efficiency based relay selections with respect to the total number of successfully received users and transmission efficiency. To assume more practical environment, we took into account pre-defined target-areas based on the information of user density and the limit for the maximum number of relay users. Through the simulations we compared the performance results of both D2D advertisement dissemination algorithms with maximum-distance and transmission-efficiency based relay selections according to increment of the number of sectors. And then, we analysed the superiority of algorithm with transmission-efficiency based relay selections more than maximum-distance based relay selections.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.320-326
• /
• 2016

In existing literature on multiple-input multiple-output (MIMO) relaying communication systems, antenna selection is often implemented by maximizing the channel capacity or the output single-to-noise ratio (SNR). In this paper, we propose an energy-efficient low-complexity antenna selection scheme for MIMO relaying communication systems. The proposed algorithm is based on beamforming and maximizing the Frobenius norm to jointly optimize the transmit power, number of active antennas, and antenna subsets at the source, relaying and destination. We maximize the energy efficiency between the link of source to relay and the link of relay to destination to obtain the maximum energy efficiency of the system, subject to the SNR constraint. Compared to existing antenna selection methods forMIMO relaying communication systems, simulation results demonstrate that the proposed method can save more power in term of energy efficiency, while having lower computational complexity.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.211-223
• /
• 2018

Mobile relay systems have been adopted by $4^{th}$ generation mobile systems as an alternative method to extend cell coverage as well as to enhance the system throughput at cell-edges. In order to achieve such performance gains, the mobile relay systems require path selection and resource allocation schemes that are specifically designed for these systems which make use of additional radio resources not needed in single-hop systems. This paper proposes an integrated path selection and resource allocation scheme for LTE-Advanced relay systems using collaborative communication. We first define the problem of maximizing the downlink throughput of LTE-Advanced relay systems using collaborative communication and transform it into a multi-dimensional multi-choice backpacking problem. The proposed Lagrange multiplier-based heuristic algorithm is then applied to derive the approximate solution to the maximization problem. It is shown through simulations that the approximate solution obtained by the proposed scheme can achieve a near-optimal performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.1140-1155
• /
• 2021

Up to now, many state-of-arts have been proposed for two-way relaying system with linear modulations. The performances of antenna selection (AS) at both transmit and relay nodes need to be investigated in some two-way relaying multiple-input multiple-output (TWRM) systems. In this paper, the goal is focused on the study of nonlinear modulations, i.e., continuous phase modulation (CPM) in TWRM systems. Firstly, the joint phase trellis are simplified by reversed Rimoldi processing so as to reduce the systems' complexity. Then the performances of joint transmit and receive antenna selection (JTRAS) with CPM modulations in two-way relaying MIMO systems are analyzed. More exactly, the pair wise probability (PEP) is used to evaluate the error performance based on the CPM signal matrix, which is calculated in terms of Laurent expression. Since the channels subject to two terminal nodes share common antennas at relay node R in multiple-access scheme, we revise the JTRAS algorithm and compare it to existing algorithm via simulation. Finally, the error performances for various schemes of antenna selection are simulated and compared to the analysis in this paper.

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

The purpose of this paper is to develop a genetic algorithm to determine the optimal locations of base stations and relay stations in Wibro MMR Network. Various issues related to the genetic algorithm such as solution representation, selection method, crossover operator, mutation operator, and a heuristic method for improving the quality of solutions are presented. The computational results are presented for determining optimal parameters for the genetic algorithm, and show the convergence of the genetic algorithm.