• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.97-98
• /
• 2007

In this paper, we investigate the throughput capacity of a multi-hop relay network with cognitive radio (CR) enabled relay stations (RS). We suggested a TDMA/FDMA based frame structure where RSs dynamically select unused channels to communicate with the base station (BS) using CR techniques to analyze the throughput capacity. We developed the throughput capacity model for the proposed system based on utilization factor. The analytical results based on those equations show significant improvement in throughput capacity for CR enabled multi-hop relay system.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.5-9
• /
• 2005

One of the imminent problems to be solved within wireless sensor network is to balance out energy dissipation among deployed sensor nodes. In this paper, we present a transmission relay method of communications between BS (Base Station) and CHs (Cluster Heads) for balancing the energy consumption and extending the average lifetime of sensor nodes by the fuzzy logic application. The proposed method is designed based on LEACH protocol. The area deployed by sensor nodes is divided into two groups based on distance from BS to the nodes. RCH (Relay Cluster Head) relays transmissions from CH to BS if the CH is in the area far away from BS in order to reduce the energy consumption. RCH decides whether to relay the transmissions based on the threshold distance value that is obtained as a output of fuzzy logic system. Our simulation result shows that the application of fuzzy logic Provides the better balancing of energy depletion and Prolonged lifetime of the nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1074-1086
• /
• 2015

We Relay-assisted cellular network architecture has been developed to cover cell-edge users and to improve capacity. However, the deployment of relay stations (RSs) in cellular networks may increase the total energy consumption. Though energy efficiency has become a major concern in cellular networks, little work has studied the energy efficiency of relay-assisted cellular networks by sleep scheduling. In this paper, a distributed base stations (BSs) sleep scheduling scheme in relay-assisted cellular networks is proposed. The goal is to maximize the energy efficiency under the spectral efficiency constraint. Firstly, whether the BSs should be sleeping or active is determined by the traffic profile. Then, the transmission powers of the active BSs are optimized within the game-theoretic framework, by using an interior-point method, so as to maximize the energy efficiency. Simulation results demonstrate that the effectiveness of the proposed scheme is superior to that turning on all the BSs without sleep scheduling.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.1
• /
• pp.69-74
• /
• 2017

Due to the advantage of communication coverage extension and removement of shadowing area, relay can be applied in various wireless communication systems. In this paper, we analyze performance of downlink with dual-hop communication systems which use a relay in railway environments. We adopted asymmetric communication system which use coherent modulation scheme in base station-relay link and differential modulation scheme in relay-destination link. The performance of communication system is analyzed using symbol error rate, and performance comparison with the systems which adopts fully coherent scheme is studied. We also investigate the performance of system depending on relay distance and energy allocation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5264-5281
• /
• 2017

Multihop relay-based cellular networks are attracting much interest because of their throughput enhancement, coverage extension, and low infrastructure cost. In these networks, relay stations (RSs) between a base station (BS) and mobile stations (MSs) drastically increase the overall spectral efficiency, with improved channel quality for MSs located at the cell edge or in shadow areas, and enhanced throughput of MSs in hot spots. These relay-based networks require an advanced radio resource management scheme because the optimal amount of radio resource for a BS-to-RS link should be allocated according to the MS channel quality and distribution, considering the interference among RSs and neighbor BSs. In this paper, we propose optimal resource planning algorithms that maximize the overall utility of relay-based networks under a proportional fair scheduling policy. In the first phase, we determine an optimal scheduling policy for distributing BS-to-RS link resources to RSs. In the second phase, we determine the optimal amount of the BS-to-RS link resources using the results of the first phase. The proposed algorithms efficiently calculate the optimal amount of resource without exhaustive searches, and their accuracy is verified by comparison with simulation results, in which the algorithms show a perfect match with simulations.

• Journal of Astronomy and Space Sciences
• /
• v.37 no.1
• /
• pp.11-18
• /
• 2020

Satellite optical communication has gained significant attention owing to its many quality features (e.g., a larger bandwidth, license free spectrum, higher data rate, and better security) compared to satellite microwave communication. Various experiments have been performed during many space missions to demonstrate and characterize inter-satellite links, downlinks, and uplinks. Korea has also planned to establish an experimental communication system using a geostationary earth orbit (GEO) satellite and the Geochang station as an optical ground station for low Earth orbit (LEO)-to-ground optical relay links. In this study, the performance of inter-satellite communication links and downlinks was investigated for the new Korean experimental communication system in terms of link margin, bit error rate (BER), and channel capacity. In particular, the performance of the inter-satellite links was analyzed based on the receiving apertures and the transmitting power, while that of the downlink was analyzed in terms of atmospheric turbulence conditions and transmitting power. Finally, we discussed two system parameters of receiving aperture and transmitting power to meet the three criteria of link margin, BER, and channel capacity.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.437-452
• /
• 2008

IEEE 802.16j MR networks introduce RSs (Relay Stations) within the IEEE 802.16 system in order to enhance the data throughput and extend the coverage. However, the current standardization defines that the BS (Base Station) controls MS's (Mobile Station's) handover, not only it induces the large signaling overhead but also handover latency could increase. In this paper, we propose a handover protocol in the MR networks where the high capability RSs that can process the MS's control functions are deployed. First, we classify the handover scenarios for the MR networks with the high capability RSs. Then, we define the MAC handover procedure, corresponding MAC management messages and the transmission routes for the proposed messages so that an 802.16e MS can perform seamless handover without noticing it is attached to an MR network. The simulation results show that the proposed handover protocol not only reduces the MAC management message overhead transferred through the wireless links compared to IEEE 802.16j/D1, which is the current standard for MR networks, but also performs the rapider and more secure MS handover than IEEE 802.16e and IEEE 802.16j/D1.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.11-18
• /
• 2009

In this paper, a hierarchical link allocation algorithm between mobile stations (MSs) and the corresponding base station (BS) by an optimal utilization of relay stations (RSs) is proposed to improve throughput of RS systems. In the proposed hierarchical algorithm, each RS operates cognitive radio functions to sense the degree of satisfaction in the quality of services (QoSs) and then selects the candidate set of MSs to have links with the RS. Such information is reported to the BS, where an auction process is performed to get an optimal allocation of communication links between the MSs and the BS. To maximize system throughput, the proposed auction algorithm is conducted upon bidding prices of communication links, considering both the co-channel interference (CCI) information shared among adjacent cells and the QoS enhancement information for each MS collected from RSs. The BS then switches the communication links of the auction winner MSs through the corresponding RS. The computer simulation shows that the proposed algorithm enhances the user QoS more than the conventional algorithm, especially for RS systems with more users requiring higher QoS. The proposed algorithm has also been proved to have more robust performance than the conventional one when the traffic load is higher and the CCI becomes stronger.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1549-1555
• /
• 2009

The Relay node placement problem is one of the most important requirements for many wireless sensor networks because the lifetime of sensor networks is closely related with the placement of relay nodes which receive sensed data from sensor nodes and forward them to the base station. Relay node placement problem has focused at minimization of dissipated total energy of the sensor nodes in whole networks. However, minimum total energy causes the unbalance of consumed energy in sensor nodes due to different distances between relay nodes and sensor nodes. This paper proposes the concept of energy balance ratio and finds the locations of relay nodes using objective functions which maximize the energy balance ratio. Maximizing this ratio results in maximizing the network lifetime by minimizing the energy consumption of large-scale sensor networks. However, finding a solution to relay node placement problem is NP-hard and it is very difficult to get exact solutions. Therefore, we get approximate solutions to EBR-RNP problem which considers both energy balance ratio and relay node placement using constraint programming.

• 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.