• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.790-799
• /
• 2007

In this paper, we propose WLAN CR coexistence beacon protocol for thenext WLAN network. This method can provide WLAN with high-speed data rate in new WLAN architecture and network platform based on cognitive radio technology. WLAN CR devices that enter the CR network can know UHF channels by listening CR beacon including the coexistence parameter set and start using CR channel fast. During handover of WLAN device in UHF spectrums, WLAN device that lost their channel can change available channel by obtaining the current CR channel information from the CR beacon. In advance relaying coexistence parameter set to entire CR system, WLAN CR system can prepare own candidate channel set that is different with other CR system. In CR beacon and relay delay, we show the results that WLAN CR coexistence beacon protocol supports spectrum handover efficiently and decreases the probability of collision in candidate channel set.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.337-349
• /
• 2009

In this paper, we introduce a novel mobility model for mobile sinks in which the sinks move towards randomly distributed destinations, where each destination is associated with a mission. The novel mobility model is termed the random mobility with destinations. There have been many studies on mobile sinks; however, they merely support two extreme cases of sink mobility. The first case features the most common and general mobility, with the sinks moving randomly, unpredictably, and inartificially. The other case takes into account mobility only along predefined or determined paths such that the sinks can gather data from sensor nodes with minimum overhead. Unfortunately, these studies for the common mobility and predefined path mobility might not suit for supporting the random mobility with destinations. In order to support random mobility with destination, we propose a new protocol, in which the source nodes send their data to the next movement path of a mobile sink. To implement the proposed protocol, we first present a mechanism for predicting the next movement path of a mobile sink based on its previous movement path. With the information about predicted movement path included in a query packet, we further present a mechanism that source nodes send energy-efficiently their data along the next movement path before arriving of the mobile sink. Last, we present mechanisms for compensating the difference between the predicted movement path and the real movement path and for relaying the delayed data after arriving of the mobile sink on the next movement path, respectively. Simulation results show that the proposed protocol achieves better performance than the existing protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.8
• /
• pp.1004-1010
• /
• 2019

In the EH-WSN (Energy harvesting wireless sensor network), a MAC (medium access control) protocol is required to select a relay node considering the power status of a node. Existing EH-WSN studies emphasize the power aspect, so it does not consider the QoS like the urgency of the sensed data. The required power and transmission delay must be changed according to the urgency so that the medium access control according to the data QoS can be performed. In case of relay node, relaying data without consideration of data urgency and node power may cause delay due to power shortage in case of urgent data. In this paper, we designed a MAC protocol that minimizes the power shortage that can occur during emergency data generation. For this, relay node requirements are set differently according to the urgency of data. The performance was analyzed through simulation. Simulation results show the reduced latency and improved reliability of urgent data transmission.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.543-548
• /
• 2017

In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.202-208
• /
• 2015

A wireless ship area network is required to configure and control various sensors and electrical instruments embedded or boarded in a ship. In such environment, wireless communication protocol adopting relaying function is needed because direct link or communication between two nodes is hardly guaranteed due to spatial constraints in a ship. In this study, we introduce and analyze a WiMedia Distributed MAC (D-MAC) based approach considering throughput and energy constraint of wireless communication module. Performance evaluation results demonstrate that the relay-based wireless communication protocol improves reliability of wireless communication network in a ship.

• Journal of information and communication convergence engineering
• /
• v.14 no.3
• /
• pp.171-176
• /
• 2016

In this study, we investigate the physical layer secrecy performance of RF energy harvesting (EH) networks over Rayleigh fading channels. The RF-EH system considered here consists of one power transfer station, one source, one destination, and multiple passive eavesdroppers. The source harvests energy from the power transfer station and transmits the information to the destination by using a time switching-based relaying protocol. The eavesdroppers try to extract the transmitted information without an active attack. By using the statistical characteristics of the signal-to-noise ratio (SNR), the exact closed-form expressions of the existence probability of the secrecy capacity and the secrecy outage probability are derived. Further, we analyze the secrecy performance of the system with respect to various system parameters, such as the location of the system elements and the number of eavesdroppers. Finally, the equivalent Monte Carlo simulation results are provided to confirm the correctness of our calculations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3321-3341
• /
• 2014

This paper investigates the outage performance and optimization for the four-phase two-way transmission network with an energy harvesting (EH) relay. To enable the simultaneous information processing and energy harvesting at the relay, we firstly propose a power splitting-based two-way relaying protocol (PSTWR). Then, we discuss its outage performance theoretically and derive an explicit expression for the system outage probability. In order to find the optimal system configuration parameters such as the optimal power splitting ratio and the optimal transmit power redistribution factor, we formulate an outage-minimized optimization problem. As the problem is difficult to solve, we design a genetic algorithm (GA) based algorithm for it. Besides, we also investigate the effects of the power splitting ratio, the power redistribution factor at the relay, and the source to relay distance on the system outage performance. Finally, extensive simulation results are provided to demonstrate the accuracy of the analytical results and the effectiveness of the GA-based algorithm. Moreover, it is also shown that, the relay position greatly affects the system performance, where relatively worse outage performance is achieved when the EH relay is placed in the middle of the two sources.

• Journal of Communications and Networks
• /
• v.17 no.5
• /
• pp.499-505
• /
• 2015

We analyze the performance of multistage cooperation in decode-and-forward relay networks where the transmission between source and destination takes place in $T{\geq}2$ equal duration and orthogonal time phases with the help of relays. The source transmits only in the first time phase. All relays that can decode the source's transmission forward the source's message to the destination in the second time phase, using a space-time code. During subsequent time phases, the relays that have successfully decoded the source message using information from all previous transmitting relays, transmit the space-time coded symbols for the source's message. The non-decoding relays keep accumulating information and transmit in the later stages when they are able to decode. This process continues for T cooperation phases. We develop and analyze the outage probability of multistage cooperation protocol under orthogonal relaying. Through analytical results, we obtain the near-optimal placement strategy for relays that gives the best performance when compared with most other candidate relay location strategies of interest. For different relay network topologies, we also investigate an interesting tradeoff between an increased SNR and decreased spectral efficiency as the number of cooperation stages is increased. It is also shown that the largest multistage cooperation gain is obtained in the low and moderate SNR regime.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.288-289
• /
• 2019

This paper studies the secrecy capacity for a wireless cooperative network with perfect channel state information at the relays, and receiver. A similar assumption is also made for the instance where there exist a direct link between the transmitter and receiver. Physical Layer security techniques are employed in wireless networks to mitigate against the activity of eavesdroppers. It offers a viable alternative to computationally intensive encryption. In this paper the design of a protocol utilizing jamming (via jamming nodes) for better security and relaying (via relay nodes) for the amplify-and-forward (AF) operation, is investigated. A a signal-to-noise variant of secrecy known as secrecy gap is explored because of its use of lesser computational power - preferable for practical systems. Thus we maximize this signal-to-noise approach instead of the conventional secrecy capacity maximization method. With this, an iterative algorithm using geometric programming (GP) and semi-definite programming (SDP) is presented with appreciable benefits. The results show here highlight the benefits of using fractional components of the powers of the relays to offer better secrecy capacity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1373-1391
• /
• 2022

We investigate mobile multiple-input multiple-output (MIMO) molecular communication via diffusion (MCvD) system which is consisted of two source nodes, two destination nodes and one relay node in the mobile three-dimensional channel. First, the combinations of decode-and-forward (DF) relaying protocol and network coding (NC) scheme are implemented at relay node. The adaptive thresholds at relay node and destination nodes can be obtained by maximum a posteriori (MAP) probability detection method. Then the mathematical expressions of the average bit error probability (BEP) of this mobile MIMO MCvD system based on DF and NC scheme are derived. Furthermore, in order to minimize the average BEP, we establish the optimization problem with optimization variables which include the ratio of the number of emitted molecules at two source nodes and the initial position of relay node. We put forward an iterative scheme based on block coordinate descent algorithm which can be used to solve the optimization problem and get optimal values of the optimization variables simultaneously. Finally, the numerical results reveal that the proposed iterative method has good convergence behavior. The average BEP performance of this system can be improved by performing the joint optimizations.