• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.12
• /
• pp.1289-1297
• /
• 2014

In this paper, we use the ECMA-392 standard, the first cognitive radio networks to meet the demand for IT services in the ship. We propose a ECMA-392 cooperative MAC protocol to ensure QoS to support multimedia services in the ship area in a multi-hop wireless bridge using ECMA-392 networks. Because the proposed protocol transmits directly or relay transmission by selecting efficient routes based on the information of the ECMA-392 devices, it provides communication to ensure QoS of the device. The simulation results show that the proposed cooperative MAC protocol improves a throughput of devices compared to the existing method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1770-1785
• /
• 2013

In this paper, a multi-hop transmission protocol based on parallel communication of secondary users (SUs) is proposed. The primary multi-hop network coexists with a set of SUs by cooperative spectrum sharing. The main optimization target of our protocol is the overall performance of the secondary system with the guarantee of the primary outage performance. The energy consumption of the primary system is reduced by the cooperation of SUs. The aim of the primary source is to communicate with the primary destination via a number of primary relays. SUs may serve as extra decode-and-forward relays for the primary network. When an SU acts as a relay for a primary user (PU), some other SUs that satisfy the condition for parallel communication are selected to simultaneously access the primary spectrum for secondary transmissions. For the proposed protocol, two opportunistic routing strategies are proposed, and a search algorithm to select the SUs for parallel communication is described. The throughput of the SUs and the PU is illustrated. Numerical results demonstrate that the average throughput of the SUs is greatly improved, and the end-to-end throughput of the PU is slightly increased in the proposed protocol when there are more than seven SUs.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.4
• /
• pp.31-37
• /
• 2008

Conventional cooperative communications can attain gain of spatial diversity and path loss reduction because destination node independently received same signal from source node and relay node located between source node and destination node. However, these techniques bring about decreased spectral efficiency with relay node and increased complexity of receiver by using maximal ratio combining (MRC). This paper has proposed cooperative ARQ protocol that can improve the above problems and can get the better performance. This method can increase the spectral efficiency than conventional cooperative communication because if the received signal from source node is satisfied by the destination preferentially, the destination transmits ACK message to both relay node and source node and then recovers the received signal. In addition, if ARQ message indicates NACK relay node operates selective retransmission and we can increase reliability of system compared with that of general ARQ protocol in which source node retransmits data. In the proposed protocol, the selective retransmission and ARQ message are to be determined by comparing log-likelihood ratio (LLR) computation of received signal from source node with predetermined threshold values. Therefore, this protocol don't waste redundant bandwidth with CRC code and can reduce complexity of receiver without MRC. We verified spectral efficiency and BER performance for the proposed protocol through Monte-Carlo simulation over Rayleigh fading plus AWGN.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.5
• /
• pp.421-427
• /
• 2009

This paper has proposed 1-2-1 coded cooperative communication that is a combination of STBC and ARQ. Coded cooperative communication is a protocol that integrates channel coding with cooperative communication. In this paper consider convolution encoder. ARQ method can increase the spectral efficiency than conventional cooperative communication because if the received signal from source node is satisfied by the destination preferentially, the destination transmits ACK message to both relay node and source node and then recovers the received signal. Where each relay 1, 2 forwards a punctured portion of receive data. When relay transmit to destination apply STBC the reliability to increase. Moreover this protocol can get better BER performance of receiver using simple comparator. We verified BER performance for the proposed protocol through Monte-Carlo simulation over Rayleigh fading plus AWGN.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.12
• /
• pp.1233-1240
• /
• 2004

Recently the need for cooperative control among robots is increasing in a variety of industrial robot applications. Such a control framework enhances the efficiency of the real robotic assembly environment along with extending the robot application. In this paper, an ethernet-based cooperative control framework was proposed. The cooperative control of robots can multiply the handling capacity of robot system, and make it possible to implement jigless cooperation, due to realization of trajectory-synchronized movement between a master robot and slave robots. Coordinate transformation was used to relate among robots in a common coordinate. An optimized ethernet protocol of HiNet was developed to maximize the speed of communication and to minimize the error of synchronous movement. The proposed algorithm and optimization of network protocol was tested in several class of robots.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2262-2269
• /
• 2016

In IEEE 802.11 wireless LANs, when a source node with low data rate occupies the channel resource for a long time, network performance degrades. In order to improve performance, the cooperative communication has been proposed. In the previous cooperative communication protocols, relay nodes deliver data packets only for a source node. In this paper, we propose an additional transmission scheme in which relay nodes select an additional source node based on several information and deliver data packets for the original source node and the selected additional source node. The proposed scheme improves performance and provides fairness among source nodes. Performance of the proposed scheme is investigated by simulation. Our results show that the proposed scheme outperforms the previous protocol in terms of fairness index and throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10A
• /
• pp.746-751
• /
• 2009

We propose a dynamic time allocation method in cooperative multiplexing with partial relaying system. This method uses a linear programming and considers protocol that is based on relaying of partial information bits followed by cooperative multiplexing. In this protocol, regardless of the location of relay, the allocation time for each transmission time slots are constant. Using a dynamic time allocation method with considering the location of relay, we can find optimal transmission time slots, and show that the system capacity is optimized.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1819-1828
• /
• 2009

Until now, much research on cooperative communications to increase system throughput at Ad Hoc networks has been provided. In this paper, in order to enhance system throughput much more at Ad Hoc networks, a network coding-enabled new MAC protocol, called NC-MAC protocol, is proposed and its performance is evaluated with a mathematical approach. Numerical results show that this scheme provides conspicuously enhanced system throughput compared to DCF scheme, and more increased system throughput by 48% than rDCF and CO-MAC schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.3026-3045
• /
• 2012

In this paper, diversity-multiplexing tradeoff (DMT) of three-user wireless multiple-antenna cooperative systems is investigated in general fading channels when half-duplex and decode-and-forward relay is employed. Three protocols, i.e., adaptive protocol, receive diversity protocol, and dual-hop relaying protocol, are considered. The general fading channels may include transmit and/or receive correlation and nonzero channel means, and are extensions of independent and identically distributed Rayleigh or Rician fading channels. Firstly, simple DMT expressions are derived for general fading channels with zero channel means and no correlation when users employ arbitrary number of antennas. Explicit DMT expressions are also obtained when all users employ the same number of antennas and the channels between any two users are of the same fading statistics. Finally, the impact of nonzero channel means and/or correlation on DMT is evaluated. It is revealed theoretically that the DMTs depend on the number of antennas at each user, channel means (except for Rayleigh and Rician fading statistics), transmit and/or receive correlation, and the polynomial behavior near zero of the channel gain probability density function. Examples are also provided to illustrate the analysis and results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2686-2708
• /
• 2020

This paper investigates the energy efficiency of energy harvesting (EH) bidirectional cooperative sensor networks, in which the considered system model enables the uplink information transmission from the sensor (SN) to access point (AP) and the energy supply for the amplify-and-forward (AF) relay and SN using power-splitting (PS) or time-switching (TS) protocol. Considering the minimum EH activation constraint and quality of service (QoS) requirement, energy efficiency is maximized by jointly optimizing the resource division ratio and transmission power. To cope with the non-convexity of the optimizations, we propose the low complexity iterative algorithm based on fractional programming and alternative search method (FAS). The key idea of the proposed algorithm first transforms the objective function into the parameterized polynomial subtractive form. Then we decompose the optimization into two convex sub-problems, which can be solved by conventional convex programming. Simulation results validate that the proposed schemes have better output performance and the iterative algorithm has a fast convergence rate.