• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.94-102
• /
• 2009

In [1], the authors have proposed a novel scheme to achieve full diversity and to combat the time delays from each relay node, but decode-and-forward (DF) model operation mode puts more processing burden on the relay. In this paper, we not only extend their model into amplify and forward (AF) model proposed in [2],[3], but also propose an efficient decoding algorithm, which is able to order the joint channel coefficients of overall channel consisting of source-relay link and relay-destination link and cancels the previous decoded symbols at the next decoding procedure. The simulation results show that this algorithm efficiently improves its performance achieving 2-3dB gain compared to [1] in high SNR region and also useful to DF achieving more than 3dB gain compared to an original algorithm.

• Journal of Broadcast Engineering
• /
• v.20 no.2
• /
• pp.215-223
• /
• 2015

Energy harvesting technique is an energy charging technique for communication device in energy-constrained environment. Recently, energy harvesting technique that harvests energy from wireless radio frequency signal is proposed. Representatively, there are time switching technique and power splitting technique. This paper proposes an optimal harvesting time allocation scheme in a wireless cognitive relay network when secondary user relay uses energy harvesting technique to transmit information. Secondary user relay receives information and energy simultaneously from the secondary user source's signal via time switching technique. We aim to maximize the instantaneous throughput by optimizing harvesting time of the secondary user relay. Simulation results show that using optimized harvesting time gets larger instantaneous throughput compared to using constant harvesting time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.50-67
• /
• 2015

The Cognitive Radio (CR) paradigm in tactical ad hoc networks is an important element of future military communications for network-centric warfare. This paper presents a novel Cognitive Link State Routing protocol for CR-based tactical ad hoc networks. The proposed scheme provides prompt and reliable routes for Primary User (PU) activity through procedures that incorporate two main functions: PU-aware power adaptation and channel switching. For the PU-aware power adaptation, closer multipoint relay nodes are selected to prevent network partition and ensure successful PU communication. The PU-aware channel switching is proactively conducted using control messages to switch to a new available channel based on a common channel list. Our simulation study based on the ns-3 simulator demonstrates that the proposed routing scheme delivers significantly improved performance in terms of average end-to-end delay, jitter, and packet delivery ratio.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3108-3115
• /
• 1999

Frame relay needs UPC function for the multiplexed logical connections to prevent malicious user traffic from incoming to network, to guarantee the QoS of conformed user traffic, and to protect the normal operation of network system. On the FR/ATM interworking in ATM networks, the UPC may be conducted either by cell-based ATM UPC or frame-based FR UPC. Frames come into and traverse ATm networks by segmentation to ATM cells. Of course, FR QoS should be guaranteed in spite of segmentation and reassembly in ATM networks. In this paper, we compared the QoS of cell-based ATM UPC and frame-based FR UPC in terms of analysis and simulation in case of ingress of excess traffic over negotiated traffic parameters at user-to-network interface. Also we studied frame-based UPC schemes including window-based FR UPC and frame-based VSA which is an ATM UPC algorithm recommended by ITU-T. We described introductions to frame relay including frame structure and FR/ATM interworking, FR traffic parameters and their relationship, comparison of FR QoS between frame-based FR UPC and cell-based ATM UPC, comparison of FR UPC schemes, necessities of egress traffic control, and conclusions.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.655-659
• /
• 2010

In the conventional PNC scheme, the relay node requires simultaneous transmission of two source nodes with strict power control and carrier-phase matching between two received symbols. However, this pre-equalization process at source nodes is not practical in fading channels. In this letter, we propose a novel physical-layer network coding (PNC) scheme with log-likelihood ratio (LLR) conversion for fading channels, which utilizes not pre-equalizer at transmitters (source nodes) but joint detector at receiver (relay node). The proposed PNC requires only channel side information at the receiver (CSIR), which is far more practical assumption in fading channels. In addition, the proposed PNC scheme can use the conventional modulation scheme like M-QAM regardless of modulation order, while the conventional PNC scheme requires reconfiguration of modulation scheme at the source nodes for detection of the received signal at relay node. We consider the combination of the proposed PNC and channel coding, and find that the proposed PNC scheme is easily combined the linear channel codes such as turbo codes, LDPC, and convolutional codes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2689-2694
• /
• 2012

In recent years, cyber crimes were intended to get financial benefits through malicious attempts such as DDoS attacks, stealing financial information and spam. Botnets, a network composed of large pool of infected hosts, lead such malicious attacks. The botnets have adopted several evasion techniques and variations. Therefore, it is difficult to detect and eliminate them. Current botnet solutions use a signature based detection mechanism. Furthermore, the solutions cannot cover broad areas enough to detect world-wide botnets. In this paper, we propose IRC (Internet Relay Chat) that is used to control the botnet communication in a session channel of IRC servers connected through the analysis of the relationship of the channel and the connection with the server bot-infected hosts and how to detect.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1601-1607
• /
• 1999

LMDS(Local Multipoint Distribution Service) is a broadband wireless transmission system in millimeter wave frequency. LMDS system is consisted with relay system to connect between head-end and hub and distribution system to connect between hub and subscribers. In this study, we develop point-to-point relay system to use back-bone system n LMDS network. We develop STM-1 transceiver over 27GHz and analyze the system performance. We can get the similar measurement results comparing the theoretical results and then prove that this system can fit LMDS back-bone network requirement. This is the first system in Korea and we expect this system can apply the various network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.317-324
• /
• 2012

Physical layer network coding (PNC) was first introduce by Zhang et al. for two-way relay channels (TWRCs). By utilizing the PNC, we can complete two-way communications within two time slots, instead of three time slots required in non-PNC systems. Recently, the upper and lower bounds for a bit error rate (BER) of PNC have been analyzed for fading channels. In this paper, we derive an exact BER of the PNC for the TWRC over fading channels. We determine decision regions based on the nearest neighbor rule and partition them into several wedge areas to apply the Craig's polar coordinate form for computing the BER. We confirm that our derived analysis accurately matches with the simulation results.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1549-1555
• /
• 2009

The Relay node placement problem is one of the most important requirements for many wireless sensor networks because the lifetime of sensor networks is closely related with the placement of relay nodes which receive sensed data from sensor nodes and forward them to the base station. Relay node placement problem has focused at minimization of dissipated total energy of the sensor nodes in whole networks. However, minimum total energy causes the unbalance of consumed energy in sensor nodes due to different distances between relay nodes and sensor nodes. This paper proposes the concept of energy balance ratio and finds the locations of relay nodes using objective functions which maximize the energy balance ratio. Maximizing this ratio results in maximizing the network lifetime by minimizing the energy consumption of large-scale sensor networks. However, finding a solution to relay node placement problem is NP-hard and it is very difficult to get exact solutions. Therefore, we get approximate solutions to EBR-RNP problem which considers both energy balance ratio and relay node placement using constraint programming.

• Journal of KIISE:Information Networking
• /
• v.41 no.4
• /
• pp.186-191
• /
• 2014

Previous work only focuses on a maximization of network coding opportunity since it can reduce the number of packets in network system. However, it can make congestion in a relay node as each source node may transmit each packet with the maximum transmission rate based on the channel qualities. Therefore, in this paper, we propose CmNC (Congestion minimized Network Coding over unreliable wireless links) performing opportunistic network coding to guarantee the network coding gain with the consideration of the congestion and channel qualities. The relay node selects the best network code set based on the objective function for reducing the packet loss and congestion via a dynamic programming. With Qualnet simulations, we show CmNC is better up to 20% than the previous work.