• Journal of Communications and Networks
• /
• 제17권1호
• /
• pp.84-92
• /
• 2015

Multi-hop relay networks have been widely considered as a promising solution to extend the coverage area and to reduce the deployment cost by deploying the relay stations (RSs) in mobile communication systems. Suitable deployment for the RSs is one of the most important features of the demand nodes (DNs) to obtain a high data transmission rate in such systems. Considering a tradeoff among the network throughput, the deployment budget, and the overall coverage of the systems, efficient RS deployment schemes and corresponding algorithms must be developed and designed. A novel cluster-based RS deployment scheme is proposed in this paper to select the appropriate deployment locations for the relay stations from the candidate positions. To make an ideal cluster distribution, the distances between the DNs are calculated when deploying the RSs. We take into account the traffic demands and adopt a uniform cluster concept to reduce the data transmission distances of the DNs. On the basis of the different candidate positions, the proposed scheme makes an adaptive decision for selecting the deployment sites of the RSs. A better network throughput and coverage ratio can be obtained by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the network throughput and the coverage ratio. Additionally, a suitable deployment budget can be implemented in multi-hop relay networks.

• 한국통신학회논문지
• /
• 제35권6A호
• /
• pp.594-599
• /
• 2010

본 논문은 멀티홉 셀룰러 네트워크에서 릴레이 노드의 배치 위치가 하향링크 SINR에 미치는 영향을 분석한다. 분석 모델에서는 릴레이 노드가 셀 안쪽으로 배치되는 것과 인접한 두 셀의 경계지역에 배치되는 두 가지 시나리오를 가정한다. 본 논문에서는 위 두 가지 시나리오의 하향링크 SINR을 비교 분석하기 위한 수학적 모델을 도출한다. 제안하는 수학적 모델에서는 멀티-셀 구조 및 셀 간 간섭 등을 고려한다. 수학적 분석 결과는 릴레이 노드들을 셀 안쪽에 배치하는 경우에 셀 간 간섭의 증가에도 불구하고 수신 신호 세기의 증가로 인해 릴레이 노드들을 셀 경계에 배치하는 경우에 비해 SINR이 증가함을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2098-2117
• /
• 2012

This paper jointly investigates the bandwidth allocation, transmission strategy and relay positions for two-way transmission aware cellular networks with network coding (NC). Our goal is to minimize the transmission power of mobile terminals (MTs). Consider a cellular system, where multiple MTs exchange information with their common base station, firstly, we propose an efficient bandwidth allocation method and then give a transmission strategy for each MT to determine whether to use relay stations (RSs) for its two-way transmission with the BS or not. To further improve the system performance, the optimal positions of RSs are also jointly discussed. A GA-based algorithm is presented to obtain the optimum positions for RSs. Besides, the impacts of frequency reuse on MT's transmission power and system spectral efficiency (SE) under different number of relays are also discussed in our work. Numerical results show that the proposed NC aware scheme can extend MTs' battery life at least 6% more than traditional method.

• 한국통신학회논문지
• /
• 제37권4A호
• /
• pp.227-238
• /
• 2012

본 논문에서는 시분할 반이중 릴레이 통신 시스템을 위한 추정 후 전달 (EF: Estimate and Forward) 릴레이 프로토콜을 제안한다. 기존의 EF 릴레이 프로토콜은 릴레이와 수신국 간 채널 상태가 좋을 때 적용할 수 있는 방식으로 릴레이의 위치가 송신국으로 이동할수록 성능 저하가 크다. 그러나 본 논문에서 제안하는 EF 릴레이 프로토콜은 릴레이에서의 양자화 및 송신국-릴레이 간의 전력 배분 등과 같은 동작 파라미터가 채널 상태 및 변조 차수에 따라 가변적으로 정해지므로 모든 릴레이 위치에 대해 기존의 방식에 비해 낮은 전송 오류율을 보이며 릴레이가 수신국으로부터 멀리 떨어져 있는 경우에도 낮은 전송 오류율을 보인다. 따라서 본 논문에서 제안하는 방식은 릴레이의 위치가 수시로 변하는 이동 릴레이 시스템에 적합하다. 한편, 제안된 방식이 기존의 방식에 비해 모든 릴레이 위치에서 낮은 전송 오류율을 보임을 모의실험을 통해 확인하였다.

• Journal of Electrical Engineering and Technology
• /
• 제6권4호
• /
• pp.466-473
• /
• 2011

This paper proposes a protection algorithm for a wind turbine generator (WTG) in a large wind farm. To minimize the outage section, a protection relay for a WTG should operate instantaneously for an internal fault or a connected feeder fault, whereas the relay should not operate for an internal fault of another WTG connected to the same feeder or an adjacent feeder fault. In addition, the relay should operate with a delay for an inter-tie fault or a grid fault. An internal fault of another WTG connected to the same feeder or an adjacent feeder fault, where the relay should not operate, is determined based on the magnitude of the positive sequence current. To differentiate an internal fault or a connected feeder fault from an inter-tie fault or a grid fault, the phase angle of the negative sequence current is used to distinguish a fault type. The magnitude of the positive sequence current is then used to decide either instantaneous operation or delayed operation. The performance of the proposed algorithm is verified under various fault conditions with EMTP-RV generated data. The results indicate that the algorithm can successfully distinguish instantaneous operation, delayed operation, or non-operation depending on fault positions and types.

• Journal of Communications and Networks
• /
• 제12권5호
• /
• pp.466-474
• /
• 2010

Various types of cooperative relaying (CR) schemes exhibit different levels of throughput and outage performance because of their inherent trade-off between diversity gain and opportunity cost; in other words, the overhead that is associated with cooperation. This article attempts to answer whether cooperative communication is beneficial or not from the system-level viewpoint and furthermore, if it is, how its average throughput can be maximized while maintaining the target outage rate. In order to improve throughput at the required outage performance, we propose a unified selection criterion to deal with different levels of combining gain and opportunity cost associated with each scheme, which allows for the employment of different CR schemes for various positions of the mobile station. Our system-level simulation results for an IEEE 802.16j multi-hop relay confirm the varying levels of trade-offs among different CR schemes and furthermore, show that CR will be a useful means of maximizing the average throughput for a multi-hop relay system as long as each type of the cooperating scheme is carefully selected, depending on the position of the mobile stations.

• 대한전자공학회논문지TC
• /
• 제44권8호
• /
• pp.62-67
• /
• 2007

센서네트워크 중에는 센서노드들이 넓은 지역에 걸쳐 정해진 위치에 산재되어야 하는 경우가 있다. 이런 경우 센서노드들을 interconnect하기 위한 최소개수의 연결노드들을 추가하는 문제가 대두되며, 이는 The Minimum number of Steiner Points라는 추상화된 문제로 귀결된다. 이 문제는 NP-hard 문제이므로, 본 논문에서는 문제가 내포하는 기하학적인 성질을 이용하여 연결노드의 최소개수에 근접하는 방안을 제시한다. 센서네트워크에서 노드의 개수를 줄임으로써 네트워크 내부에서 오가는 메시지의 교환량이 대폭 감소하게 된다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제11권4호
• /
• pp.1-8
• /
• 2007

In some wireless sensor networks, the sensor nodes are required to be located sparsely at designated positions over a wide area, introducing the problem of adding minimum number of relay nodes to interconnect the sensor nodes. The problem finds its a bstract form in literature: the Minimum number of Steiner Points. Since it is known to be NP-hard, this paper proposes an approximation scheme to estimate the minimum number of relay nodes through the properties of the abstract form. Note that by reducing the numb er of nodes in a sensor network, the amount of data exchange over the net will be far decreased.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권8호
• /
• pp.1388-1403
• /
• 2011

A vehicular ad-hoc network (VANET) consists of vehicles that form a network without any additional infrastructure, thus allowing the vehicles to communicate with each other. VANETs have unique characteristics, including high node mobility and rapidly changing network topology. Because of these characteristics, routing algorithms based on greedy forwarding such as greedy perimeter stateless routing (GPSR) are known to be very suitable for a VANET. However, greedy forwarding just selects the node nearest to the destination node as a relay node within its transmission range. This increases the possibility of a local maximum and link loss because of the high mobility of vehicles and the road characteristics in urban areas. Therefore, this paper proposes a reliability-improving position-based routing (RIPR) algorithm to solve those problems. The RIPR algorithm predicts the positions, velocities, and moving directions of vehicles after receiving beacon messages, and estimates information about road characteristics to select the relay node. Thus, it can reduce the possibility of getting a local maximum and link breakage. Simulation results using ns-2 revealed that the proposed routing protocol performs much better than the existing routing protocols based on greedy forwarding.

• 한국통신학회논문지
• /
• 제34권12A호
• /
• pp.941-948
• /
• 2009

3GPP LTE 시스템에서는 상향링크로 PAPR 효율이 좋은 SC-FDMA를 채택, 표준을 진행해왔다. 하지만, SC-FDMA는 주파수 영역에서 심한 왜곡이 생길 경우 OFDMA보다 성능이 저하된다는 단점이 있다. LTE에서 LTE-Advanced로 개량되면서 이를 보완하기 위해 셀 중심지역에서는 OFDMA를 사용하고, 셀 경계지역에서는 PAPR 효율이 좋은 SC-FDMA를 사용하자는 제안이 나왔다. 본 논문에서는 상향링크에서 Hybrid OFDMA/SC-FDMA를 기반으로 릴레이를 이용했을 경우의 성능을 측정하고 릴레이와 이동국의 위치에 따라 성능을 최대로 할 수 있는 전송방식을 제안한다. 주어진 시뮬레이션 환경에서 이동국과 릴레이 위치에 따라 선택되는 전송방식의 BLER 성능 및 송신전력을 비교하였고, 릴레이의 위치에 따라 적절한 전송 방식을 선택했을 때 성능이 최대가 되는 것을 확인하였다.