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

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

In this paper, an outage probability for the best relay selection in decode-and-forward relaying systems in the presence of interference is analyzed over Rayleigh fading channels. Based on the outage performance results, we propose a method to determine effective relay candidates for the best relay selection, where the effective relay candidates represent the relays except for relays that make no contribution to improving the performance. in all possible relays given in the system. By determining the effective relay candidates, the feedback overhead of channel state information and the energy consumption of relays can be significantly reduced while minimizing the performance degradation. In this paper, we provide important parameters that affect the determination of the effective relay candidates.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.117-118
• /
• 2015

본 논문은 Delay Tolerant Networks(DTNs)에서 이동노드의 이동 속성 정보를 효율적으로 관리하여 목적노드를 지향하여 이동하는 중계노드를 선정하는 기법을 제안한다. 목적노드와 상이한 이동성을 가진 중계노드를 통해 전송 지연시간 및 패킷 손실이 발생할 가능성이 높아지게 된다. 따라서 본 논문에서는 부정확한 이동 속성 정보로 인하여 발생할 수 있는 전송 지연시간 및 패킷 손실이 증가하는 문제를 해소하기 위해, 이동노드 간 이동 속성 정보를 관리하고 연결성을 분석함으로써 중계노드를 선정하는 기법을 제안한다. 제안하는 알고리즘에서 이동노드는 주기적으로 자신의 속도와 방향을 상황인식 매트릭스에 저장하며, 다른 이동노드와 통신이 확립되면 저장된 이동 속성 정보를 교환하게 된다. 또한 교환된 이동 속성 정보를 연결성으로 분석함으로써 목적노드를 지향하여 이동하는 중계노드를 선정한다. 주어진 모의실험 결과, 최신의 이동 속성 정보를 활용하여 중계노드를 선정함으로써 패킷전송률 측면에서 더 향상된 결과를 보여주었다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.3
• /
• pp.40-47
• /
• 2012

In dual-hop relaying systems, the conventional partial relay selection is based on the channel information only for the first hop. On the other hand, the efficient partial relay selection is based on the channel information for the hop with the minimum of the average channel powers for the first and second hops at each end-to-end link since the correlation coefficient between the end-to-end link quality and the link quality of the hop with the minimum of the average channel powers for the first and second hops is larger than that between the end-to-end link quality and the link quality of the other hop. In this paper, the outage probability of the conventional partial relay selection and the efficient partial relay selection in dual-hop decode-and-forward relaying systems is analyzed for non-identically distributed Rayleigh fading channels. Through numerical investigation, the outage performance of the efficient partial relay selection is compared with the outage performances of the conventional partial relay selection and the best relay selection based on all the channel information for the first and second hops.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.3
• /
• pp.520-526
• /
• 2018

In this paper, considering the superposition transmission-based wireless cooperative multicast communication system (ST-CMS) with multiple relays and destinations, we propose a relay selection scheme to improve the data rate of multicast communication. In addition, we adopt the optimal power allocation coefficient for the superposition transmission to maximize the data rate of the proposed relay selection scheme. To propose the relay selection scheme, we derive an approximate expression for the data rate of the ST-CMS, and present the relay selection scheme using only partial channel state information based on the approximate expression. Moreover, we derive an approximate average data rate of the proposed relay selection scheme. Through numerical investigation, comparing the average data rates of the proposed relay selection scheme and the optimal relay selection scheme using full channel state information, we show that the proposed scheme provides extremely similar performance to the optimal scheme in the high signal-to-noise power ratio region.

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.397-399
• /
• 2014

DTN(Delay/Disruption Tolerant Networks)은 노드의 불규칙적인 움직임으로 인한 연결단절과 불안정한 연결 상태를 극복하기 위해 효율적인 포워딩 전략이 필요하다. 제시하는 알고리즘은 노드의 속도, 방향 등의 상황정보를 활용하며 이를 통해 이후의 이동성을 예측하여 포워딩할 중계노드를 선택하기 위한 방법을 고려한다. 본 논문에서는 중계노드들의 상관관계를 분석하여 안정된 경로를 제공하기 위해 노드의 상황정보를 예측하는 EPCM(Efficient Prediction-based Context-awareness Matrix) 알고리즘을 제안한다. 이를 위해 상황 매트릭스라는 상황 분석 도구를 사용하여 시간에 따라 상황정보를 저장하고, 변화의 추이를 분석하여 노드의 속도, 방향 등의 정보를 예측하는데 활용된다. EPCM 알고리즘은 예측된 상황정보를 활용하여 노드 간 미래의 연결성을 분석하고 중계노드를 선택함으로써 안정된 포워딩 경로를 제공할 수 있고, 불필요한 포워딩으로 인한 자원 낭비를 방지할 수 있다. 제안하는 알고리즘을 시뮬레이션 해본 결과 예측된 상황정보의 값이 실제의 값에 대하여 약 2%내의 오차율을 나타내어 예측의 정확도를 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1A
• /
• pp.36-43
• /
• 2008

In this paper, we propose an optimal relay selection scheme for decode-and-forward relaying systems. The optimal relay selection minimizes the number of time slots used to relay source's signal and maximizes an end-to-end signal-to-noise ratio. However, decode-and-forward relaying systems require additional overhead for the optimal relay selection. Assuming independent and identically distributed Rayleigh fading channels, we provide exact and closed-form expressions for the outage probability of capacity and the bit error rate for decode-and-forward relaying systems with the optimal relay selection. It is shown that the analytic results are perfectly matched with the simulated ones. When the numbers of relay nodes are 2, 4, and 8, and the numbers of time slots for overhead are 1, 2, and 4, respectively, the proposed system achieves 1 dB, 2 dB, and 3 dB gains at 1% bit error rate, respectively, and 0.5 dB, 4 dB, and 12 dB gains at 1% outage probability for 1 bps/Hz, respectively, over the conventional decode-and-forward relaying system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.431-433
• /
• 2016

In this paper, we propose an algorithm that analyzes characteristic nodes to select efficient relay nodes using message distribution. Existing delay-tolerant network (DTN) routing algorithms have problems with large latency and overhead on account of the deficiency of network information in an unsteady network. We must solve this problem, predict future networks using node state information, and apply a weight factor that changes according to the message distribution. Simulation results show that the proposed algorithm provides enhanced performance compared to existing DTN routing algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.42-49
• /
• 2014

The conventional best relay selection based on all the channel information for the first and second hops in dual-hop systems has a large consumption of resources for channel feedback. In this paper, we analyze the average bit error rate for partial relay selection based on the channel information only for the first hop in dual-hop decode-and-forward relaying systems, where we assume independent Rayleigh fading channels. In particular, we provide an exact and closed-form expression for the average bit error rate of M-ary QAM. Also, through numerical investigation, the performance of the partial relay selection is compared with the performance of the best relay selection, and the performance is evaluated for different numbers of relays and various average channel power ratios for the first and second hops.