• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권10호
• /
• pp.2587-2600
• /
• 2012

It has been demonstrated that choosing an appropriate relay node can improve the transmission rate for the system. However, such system improvement brought by the relay selection may be degraded with the presence of the malicious relay nodes, which are selected but refuse to cooperate for transmissions deliberately. In this paper, we formulate the relay selection issue as a restless bandit problem with the objective to maximize the average rate, while considering the credibility of each relay node, which may be different at each time instant. Then the optimization problem is solved by using the priority-index heuristic method effectively. Furthermore, a low complexity algorithm is offered in order to facilitate the practical implementations. Simulation results are conducted to demonstrate the effectiveness of the proposed trust-based relay selection scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권10호
• /
• pp.2732-2749
• /
• 2023

Device-to-Device (D2D) communication has received increasing attention and been studied extensively thanks to its advantages in improving spectral efficiency and energy efficiency of cellular networks. This paper proposes a novel relay selection algorithm for multi-hop full-duplex D2D communications underlaying cellular networks. By selecting the relay of each hop in a reverse manner, the proposed algorithm reduces the heavy signaling overhead that traditional relay selection algorithms introduce. In addition, the social domain information of mobile terminals is taken into consideration and its influence on the performance of D2D communications studied, which is found significant enough not to be overlooked. Moreover, simulations show that the proposed algorithm, in absence of social relationship information, improves data throughput by around 70% and 7% and energy efficiency by 64% and 6%, compared with two benchmark algorithms, when D2D distance is 260 meters. In a more practical implementation considering social relationship information, although the proposed algorithm naturally achieves less throughput, it substantially increases the energy efficiency than the benchmarks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권3호
• /
• pp.477-493
• /
• 2011

The IEEE 802.16 mobile multi-hop relay (MMR) task group 'j' (TGj) has introduced the multi-hop relaying concept in the IEEE 802.16 Wireless MAN, wherein a relay station (RS) is employed to improve network coverage and capacity. Several RSs can be deployed between a base station and mobile stations, and configured to form a tree-like multi-hop topology. In such architecture, we consider the problem of a path selection through which the mobile station in and outside the coverage can communicate with the base station. In this paper, we propose a new path selection algorithm that ensures more efficient distribution of resources such as bandwidth among the relaying nodes for improving the overall performance of the network. Performance of our proposed scheme is compared with the path selection algorithms based on loss rate and the shortest path algorithm. Based on the simulation results using ns-2, we show our proposal significantly improves the performance on throughput, latency and bandwidth consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.2894-2909
• /
• 2015

As the number of mobile devices such as smart phones and tablets explodes, the need for new services or applications is also rapidly increasing. Smart class application is one of the emerging applications, in which most of contents are distributed to all members of a class simultaneously. It is highly required to select relay nodes to cover shadow area of radio as well as extend coverage, but existing algorithms in a smart class environment suffer from high control packet overhead and delay for exchanging topology information among all pairs of nodes to select relay nodes. In addition, the relay selection procedure should be repeated in order to adapt to the dynamic topology changes caused by link status changes or device's movement. This paper proposes the learning based relay selection algorithm to overcome aforementioned problems. The key idea is that every node keeps track of its relay quality in a fully distributed manner, where RQI (Relay Quality Indicator) is newly defined to measure both the ability of receiving packets from content source and the ability of successfully relaying them to successors. The RQI of each node is updated whenever it receives or relays broadcast packet, and the node having the higher RQI is selected as a relay node in a distributed and run-time manner. Thus, the proposed algorithm not only removes the overhead for obtaining prior knowledge to select relay nodes, but also provides the adaptability to the dynamic topology changes. The network simulation and experimental results prove that the proposed algorithm provides efficient and reliable content distribution to all members in a smart class as well adaptability against network dynamics.

• 한국통신학회논문지
• /
• 제37권8B호
• /
• pp.657-667
• /
• 2012

본 논문에서는 OLSR의 MPR 선택방법을 개선함으로써 애드혹(ad hoc) 네트워크의 처리율(throughput), 지연 시간(delay) 등의 성능을 향상시킬 수 있는 S-MPR 선택 방법을 제안한다. OLSR의 MPR 선택 방법은 각 노드가 독립적으로 MPR을 선택하기 때문에 대부분의 노드가 MPR로 선택되는 문제가 있다. 이러한 문제를 해결하기 위해 기존에 제안되었던 MPR 후보(candidate) 선택 방법은 MPR의 수는 감소시킬 수 있지만 그로 인해 경로의 효율성과 네트워크의 연결성(connectivity)이 저하되는 문제를 갖고 있다. 본 논문에서 제안하는 S-MPR 방법은 이러한 문제를 해결하기 위해 각 노드 입장에서 가장 중요한 노드를 S-MPR로 선택하고 나머지 MPR은 MPR 후보를 이용하여 선택하는 방법을 사용한다. 따라서 제안 방법은 경로 효율성의 저하를 최소화하면서 MPR로 선택되는 노드의 수를 줄임으로써 TC 메시지로 인한 오버헤드를 최소화하고 MPR간의 충돌을 감소시킴으로써 처리율, 지연 시간 성능을 향상시킬 수 있다. 본 논문에서 제안한 S-MPR의 성능을 알아보기 위해 OPNET을 활용하여 시뮬레이션을 수행하고 제안 S-MPR의 성능이 가장 우수함을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5282-5300
• /
• 2017

Multi-hop cellular networks (MCNs) reduce the transmit power and improve the system performance. Recently, several research studies have been conducted on MCNs. The mobile relay selection scheme is a rising issue in the design of MCNs that achieves these advantages. The conventional opportunistic relaying (OR) is performed on the single factor for maximum signal-to-interference-plus-noise ratio (SINR). In this paper, a comprehensive OR scheme based on Bi-Target is proposed to improve the system throughput and reduce the relay handover by constraining the amount of required bandwidth and SINR. Moreover, the proposed algorithm captures the variability and the mobility that makes it more suitable for dynamic real scenarios. Numerical and simulation results show the superiority of the proposed algorithm in both enhancing the overall performance and reducing the handover.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2011년도 하계학술대회
• /
• pp.310-313
• /
• 2011

Broadcasting nature of wireless communications makes it possible to apply opportunistic network coding (OPNC) by overhearing transmitted packets from a source to sink nodes. However, it is difficult to apply network coding to the topology of multiple relay and sink nodes. We propose to use relay node selection, which finds a proper node for network coding since the OPNC alone in the topology of multiple relays and sink nodes cannot guarantee network coding gain. The proposed system is a novel combination of wireless network coding and relay selection, which is a key contribution of this paper. In this paper, with the consideration of channel state and potential network coding gain, we propose relay node selection techniques, and show performance gain over the conventional OPNC and a channel-based selection algorithm in terms of average system throughput.

• 방송공학회논문지
• /
• 제14권2호
• /
• pp.134-143
• /
• 2009

본 논문에서는 양방향 다중 중계기 채널(two-way multiple relay channel)에서의 중계기 선택 기법을 제안한다. 양방향 다중 중계기 채널에서는 2명의 사용자가 다수의 중계기의 도움을 받아 서로 정보를 주고받는다. 단방향 중계 채널에서와 같이 중계기는 복호화 재전송 프로토콜 또는 증폭 재전송 프로토콜을 기반으로 정보를 중계하며, 정보 전송에 필요한 채널 자원을 줄이기 위해 정보의 결합 과정을 추가로 적용한다. 특히, 중계기가 다수인 환경에서는 정보 전송 경로의 수가 증가함으로 인해 다이버시티 이득이 증가한다는 것이 알려져 있다. 따라서 본 논문에서는 다수의 중계기 중 채널 조건을 바탕으로 가장 좋은 중계기를 선택하는 기법을 제안하고 이를 통해 다이버시티 이득의 향상을 확인한다. 우선, 중계기들은 핸드셰이킹(handshaking) 과정을 이용하여 채널 정보의 크기를 얻고, 이를 바탕으로 데이터의 전송이 이루어지기 전에 분산된 방식으로 최적의 중계기 선택이 이루어진다. 중계기 선택 기준은 각각의 사용자와 중계기 간 일시적 채널 이득을 바탕으로 사용자-사용자 간(end-to-end) 경로 조건의 최대값을 계산하는 메트릭(metric)을 사용한다. 또한, 전송량을 계산하기 위해 자동반복요구(automatic repeat request, ARQ)를 사용한 알고리즘을 제안하고, 이를 통해 전송량을 분석한다. 모의실험을 통해, 제안된 중계기 선택 기법은 사용 가능한 중계기의 수가 증가함에 따라 전송량이 증가함을 보이고, 사용 가능한 중계기의 개수에 해당하는 다이버시티 이득을 얻을 수 있음을 보여준다.

• 한국통신학회논문지
• /
• 제37권3A호
• /
• pp.141-150
• /
• 2012

본 논문에서는 UWB 기술 기반 WiMedia Distributed Medium Access Control (D-MAC) 표준 프로토콜에 적용할 수 있는 릴레이 자원 예약 프로토콜을 제안한다. 그리고, 무선 채널 상태에 따라 변화하는 UWB 링크 전송속도에 적응적인 릴레이 노드 선정 알고리즘을 제안한다. 본 논문에서 제안하는 UWB 링크에 적응적인 릴레이 통신 프로토콜은 분산적인 D-MAC 표준 기술과 호환성을 갖고, 각 디바이스에서 독립적으로 실행되는 Satisfaction of QoS (SoQ) 기준에 따라 실행된다.

• ETRI Journal
• /
• 제37권4호
• /
• pp.717-726
• /
• 2015

In this paper, we study an asymmetric two-way relaying network where two source nodes intend to exchange information with the help of multiple relay nodes. A hybrid time-division broadcast relaying scheme with joint relay selection (RS) and power allocation (PA) is proposed to realize energy-efficient transmission. Our scheme is based on the asymmetric level of the two source nodes' target signal-to-noise ratio indexes to minimize the total power consumed by the relay nodes. An optimization model with joint RS and PA is studied here to guarantee hybrid relaying transmissions. Next, with the aid of our proposed intelligent optimization algorithm, which combines a genetic algorithm and a simulated annealing algorithm, the formulated optimization model can be effectively solved. Theoretical analyses and numerical results verify that our proposed hybrid relaying scheme can substantially reduce the total power consumption of relays under a traffic asymmetric scenario; meanwhile, the proposed intelligent optimization algorithm can eventually converge to a better solution.