• 전기학회논문지
• /
• 제58권6호
• /
• pp.1238-1240
• /
• 2009

In the wireless sensor network, cooperative transmission is an effective technique to combat multi-path fading and reduce transmitted power. Relay selection and power allocation are important technical issues to determine the performance of cooperative transmission. In this paper, we proposed a new multi-relay selection and power allocation algorithm to increase network lifetime. The proposed relay selection scheme minimizes the transmitted power and increase the network lifetime by considering residual power as well as channel conditions. Simulation results show that proposed algorithm obtains much longer network lifetime than the conventional algorithm.

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

• 대한전자공학회논문지TC
• /
• 제45권2호
• /
• pp.13-18
• /
• 2008

본 논문에서는 M 개의 전송 안테나를 가진 송신국(source)이 단일 안테나를 가진 R 개의 릴레이(relay)를 이용하여 단일 안테나를 가진 수신국(destination)에 신호를 전송하는 증폭 후 전달(amplify-and-forward, AF) 릴레이 시스템에서의 outage 확률 성능을 살펴본다. 이때, R 개의 릴레이 중에서 수신국에서의 수신 신호에 대한 가장 큰 신호 대 잡음비(signal-to-noise ratio, SNR)를 보장하는 하나의 릴레이를 선택하는 최적 릴레이 선택(best relay selection) 기법이 사용되고, 송신국과 선택된 릴레이 링크에서 송신 maximum-ratio-combining(transmit MRC)이 적용되었을 때의 AF 릴레이 시스템의 outage 확률을 분석한다. 또한, 분석의 타당성을 입증하기 위해 모의실험들을 제공한다.

• 한국정보통신학회논문지
• /
• 제17권12호
• /
• pp.2812-2817
• /
• 2013

본 논문에서는 간섭 환경을 고려하여 디코딩 후 전달 중계 시스템에서 최적의 중계 노드 선택 기법에 대한 아웃티지 확률을 레일레이 페이딩 채널을 가정하여 분석한다. 그리고, 아웃티지 성능 결과를 토대로 최적의 중계 노드 선택을 위하여 이용되는 중계 노드 후보들의 유효한 집합을 결정하는 방법을 제안한다. 여기서, 중계 노드 후보들의 유효한 집합은 시스템에서 중계 노드 선택을 위하여 주어진 중계 노드들 중 성능 개선에 기여하지 못하는 중계 노드들을 제외한 집합을 의미한다. 중계 노드 후보들의 유효한 집합 결정은 성능의 저하를 최소화하면서 채널 정보의 피드백오버헤드를 절감시키고 중계 노드들의 불필요한 에너지 낭비를 방지할 수 있다. 본 논문에서는 중계 노드 후보들의 유효한 집합 결정에 영향을 주는 중요한 변수를 제공한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5335-5353
• /
• 2019

The definition of the bandwidth efficiency (BE) of cognitive cooperative network (CCN) is the ratio between a number of the licensed slot(s) or sub-channel(s) used by the unlicensed users to transmit a single data packet from the unlicensed transmitter to unlicensed destination, and from unlicensed relay(s) to unlicensed destination. This paper analyzes and improves the BE in the underlay CCN with a new reactive relay selection under interference and power constraints. In other words, this paper studies how unlicensed cooperative users use the licensed network slot(s) or sub-channel(s) efficiently. To this end, a reactive relay selection method named as Relay Automatic Repeat Request (RARQ) is proposed and utilized with a CCN under interference and power constraints. It is shown that the BE of CCN is higher than that of cooperative transmission (CT) due to the interference and power constraint. Furthermore, the BE of CCN is affected by the distance of the interference links which are between the unlicensed transmitter to the licensed destination and unlicensed relay to the licensed destination. In addition, the BE for multiple relays selection over a CCN under interference and power constraints is also analyzed and studied, and it is shown that the BE of CCN decreases as the number of relays increases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권6호
• /
• pp.2095-2110
• /
• 2015

This paper presents a design for a throughput-efficient online relay selection scheme for dual-hop multi-relay cooperative networks. Problems arise with these networks due to unpredictability of the relaying link quality and high time-consumption to probe the dual-hop link. In this paper, we firstly propose a novel probing and relaying protocol, which greatly reduces the overhead of the dual-hop link estimation by leveraging the wireless broadcasting nature of the network. We then formulate an opportunistic relay selection process for the online decision-making, which uses a tradeoff between obtaining more link information to establish better cooperative relaying and minimizing the time cost for dual-hop link estimation to achieve higher throughput. Dynamic programming is used to construct the throughput-optimal control policy for a typically heterogeneous Rayleigh fading environment, and determines which relay to probe and when to transmit the data. Additionally, we extend the main results to mixed Rayleigh/Rician link scenarios, i.e., where one side of the relaying link experiences Rayleigh fading while the other has Rician distribution. Numerical results validate the effectiveness and superiority of our proposed relaying scheme, e.g., it achieves at least 107% throughput gain compared with the state of the art solution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4623-4643
• /
• 2015

This paper considers physical-layer security protocols in multicast cognitive radio (CR) networks. In particular, we propose dual-hop cooperative decode-and-forward (DF) and randomize-and-forward (RF) schemes using partial relay selection method to enhance secrecy performance for secondary networks. In the DF protocol, the secondary relay would use same codebook with the secondary source to forward the source's signals to the secondary destination. Hence, the secondary eavesdropper can employ either maximal-ratio combining (MRC) or selection combining (SC) to combine signals received from the source and the selected relay. In RF protocol, different codebooks are used by the source and the relay to forward the source message secretly. For each scheme, we derive exact and asymptotic closed-form expressions of secrecy outage probability (SOP), non-zero secrecy capacity probability (NzSCP) in both independent and identically distributed (i.i.d.) and independent but non-identically distributed (i.n.i.d.) networks. Moreover, we also give a unified formula in an integral form for average secrecy capacity (ASC). Finally, our derivations are then validated by Monte-Carlo simulations.

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

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

• Journal of Communications and Networks
• /
• 제17권2호
• /
• pp.162-171
• /
• 2015

This paper provides an analytic performance evaluation of the bit error rate (BER) of underlay decode-and-forward cognitive networks with best relay selection over Rayleigh multipath fading channels. A generalized BER expression valid for arbitrary operational parameters is firstly presented in the form of a single integral, which is then employed for determining the diversity order and coding gain for different best relay selection scenarios. Furthermore, a novel and highly accurate closed-form approximate BER expression is derived for the specific case where relays are located relatively close to each other. The presented results are rather convenient to handle both analytically and numerically, while they are shown to be in good agreement with results from respective computer simulations. In addition, it is shown that as in the case of conventional relaying networks, the behaviour of underlay relaying cognitive networks with best relay selection depends significantly on the number of involved relays.