• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2813-2819
• /
• 2015

In this paper, we investigate the physical layer network coding (PNC) technique in a two-way relay channel (TWRC) where two source nodes send and receive data with each other via a relay node. In particular, we consider the communication scenario where packet length from the two sources is different from each other. We analyze the bit error rate (BER) of the received packet at the relay node according to degree of overlapping between two packets. The BER of the short packet remains unchanged regardless of the degree of overlapping since the entire packet is overlapped with the longer packet, while the BER of the longer packet becomes improved as the degree of overlapping decreases. Thus, we need a novel transmission scheme to enhance BER performance of the PNC technique in TWRC environments since the overall BER performance of the PNC technique at the relay node depends on the worse BER between two ovelapping packets' BERs.

• International Journal of Contents
• /
• v.14 no.1
• /
• pp.18-27
• /
• 2018

The objective of this study was to derive approximate closed-form error rates for M-ary burst symbol transmission (MBST) of dual-hop adaptive decode-and-forward (ADF) cooperative relay systems over quasi-static Rayleigh fading channels. Within a burst, there are pilot symbols and data symbols. Pilot symbols are used for channel estimation schemes and each relay node's transmission mode selection schemes. At first, our focus was on ADF relay systems' error-events at relay nodes. Each event's occurrence probability and probability density function (PDF) were then derived. With error-event based approach, we derived a tractable form of PDF for combined signal-to-noise ratio (SNR). Averaged error rates were then derived as approximate expressions for arbitrary link SNR with different modulation orders and numbers of relays. Its accuracy was verified by comparison with simulation results.

• Journal of electromagnetic engineering and science
• /
• v.11 no.1
• /
• pp.5-10
• /
• 2011

We propose an adaptive cooperative scheme with a multi-relay node that achieves high bandwidth efficiency and achieves better SEP performance. In the proposed protocol, if the quality of the direct channel is better than that of the all channels from relays to destination, the source will transmit directly to the destination. Otherwise, the source broadcasts the signal and then a potential relay will be chosen to help the source. A re-transmission will also occur if the potential relay cannot be detected. The spectral efficiency is first derived by calculating the probability of each mode, i.e., direct and cooperation transmission. Subsequently, the SEP performance of M-PSK modulation for the scheme is analyzed by considering each event where the source transmits data to the destination. Finally, the obtained analytical results are verified through computer simulations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.956-958
• /
• 2010

The paper considers MIMO two-way scheme to optimize the end to end capacity in local wireless mesh network. The basic idea is to perform data transmission via intermediate cooperative nodes and cooperative relay therefore higher throughput can be achieved. Each node is equipped with multiple antennas, and has two time slots one for transmission (Tx) and the other is reception (Rx), which are arranged alternatively in the network. In the conventional SISO network, it takes at least four time slots to accomplish the function of two-way relay. Moreover, cooperative technique is used in order to enhance multiplexing of forward and backward streams.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.1
• /
• pp.65-71
• /
• 2022

In this paper, we propose an opportunistic data relay scheme in narrowband multihop combat radio networks. Narrowband networks have physical restrictions on high-speed transmission. Furthermore, the topology changes dynamically due to the jamming of the enemy, signal interference between friendly forces, and movement of network entities. Therefore, the traditional relay scheme that collects topology information and calculates a relay path before transmission is unsuitable for such networks. Our proposed scheme does not collect topology information and transmits data opportunistically. The scheme can cause unnecessary data relaying that is not related to data delivery to the destination node. However, for small networks, the effect of increasing network throughput by not gathering topology information is much greater than the effect of reducing throughput by unnecessary data relays. We demonstrate the performance superiority of the proposed scheme through simulation in the worst case of network topology.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.571-582
• /
• 2007

Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1063-1079
• /
• 2010

Vehicle ad hoc networks (VANET) are one of the most important technologies to provide various ITS services. While VANET requires rapid and reliable transmission, packet transmission in VANET is unstable because of high mobility. Many routing protocols have been proposed and assessed to improve the efficiency of VANET. However, topology-based routing protocols generate heavy overhead and long delay, and position-based routing protocols have frequent packet loss due to inaccurate node position. In this paper, we propose a position-based routing repair algorithm to improve the efficiency of VANET. This algorithm is proposed based on the premise that AODV (-PGB) can be used effectively in VANET, if the discovery, maintenance and repair mechanism of AODV is optimized for the features of VANET. The main focus of this algorithm is that the relay node can determine whether its alternative node exits and judge whether the routing path is disconnected. If the relay node is about to swerve from the routing path in a multi-hop network, the node recognizes the possibility of path loss based on a defined critical domain. The node then transmits a handover packet to the next hop node, alternative nodes and previous node. The next node repairs the alternative path before path loss occurs to maintain connectivity and provide seamless service. We simulated protocols using both the ideal traffic model and the realistic traffic model to assess the proposed algorithm. The result shows that the protocols that include the proposed algorithm have fewer path losses, lower overhead, shorter delay and higher data throughput compared with other protocols in VANET.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1624-1641
• /
• 2015

Instantaneous relay (relay-without-delay) using interference alignment is a promising approach to neutralizing interference and improving system capacity. In Wang Chenwei's work, a 2-user scenario required both source and relay to access the global channel state information (CSI). This paper shows a new method of interference alignment improves the degrees of freedom (DoF) prominently for the 3-user MIMO interference channel with instantaneous relay. This new method is focused on the relay node that completes the alignment interference neutralization so the global CSI is obtained only once and the pressure on the base station can be mitigated. In addition, the 3-user MIMO interference channels with instantaneous relay can achieve 2M DoF when source and destination have M antennas, respectively. This method shows 33% improvement over the conventional method using interference alignment which obtains 3M/2 DoF.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.6
• /
• pp.73-81
• /
• 2009

Wireless media communication has lower robustness and stability than wired communication because of narrow bandwidth and unstable channel state. To make up for the deficient points of wireless communication, we used the diversity effect of cooperation communication and the error correction effect of channel coding schemes. In this paper, the cooperative communication system with RCPC codes and Hybrid ARQ transmission scheme is proposed for improving reliability on wireless communication, and we executed these simulations. From the simulation results, proposed system is showed lower BER performance than legacy system. In addition, we confirm the fact that the channel state of Relay-node and source-node is more important than the channel state of Relay-node and destination-node.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.4
• /
• pp.155-161
• /
• 2014

In this paper, a cluster-based routing protocol in distributed sensor network is proposed, which enable the balanced energy consumption in the sensor nodes densely deployed in the sensor fields. This routing protocol is implemented based on clusters with hierarchical scheme. The clusters are formed by the closely located sensor nodes. A cluster node with maximum residual energy in the cluster, can be selected as cluster head node. In routing, one of the nodes in the intersection area between two clusters is selected as a relay-node and this method can extend the lifetime of all the sensor nodes in view of the balanced consumption of communication energy.