• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1020-1030
• /
• 2016

This paper propose an improving relay node selection method for node-to-node connectivity. This concern with the mobility and analysis of deployed for masking operation using highest connectivity node. The major of Delay Tolerant Network (DTN) routing protocols make use of simple forwarding approach to transmit the message depend on the node's mobility. In this cases, the selection of the irrelevant mobile node induced the delay and packet delivery loss caused by limiting buffer size and computational power of node. Also the proposed algorithm provides the node connectivity considering the mobility and direction select the highest connectivity node from neighbor node using masking operation. From the simulation results, the proposed algorithm compared the packet delivery ratio with PROPHET and Epidemic. The proposed Enhanced Prediction-based Context-awareness Matrix(EPCM) algorithm shows an advantage packet delivery ratio even with selecting relay node according to mobility and direction.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.225-232
• /
• 2013

In this paper, we introduce a method that can be used to select the position of head node for context-awareness information. The validity of the head node optimal location is saving the energy in the path according to the clustering. It is important how to elect one of the relay node for energy efficiency routing. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution during the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. The proposed ECOPS (Energy Conserving Optimal path Schedule) algorithm that contextual information is contributed for head node selection in topology protocols. This proposed algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election technique show improving the entire node lifetime and network in management the network from simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.798-809
• /
• 2013

In this paper, we propose robust relay and destination filter design methods for the multi-user peer-to-peer amplify-and-forward relaying systems while taking imperfect channel knowledge into consideration. Specifically, the relay and destination filter sets are developed to minimize the sum mean-squared-error (MSE). We first present a robust joint optimum relay and destination filter calculation method with an iterative algorithm. Motivated by the need to reduce computational complexity of the iterative scheme, we then formulate a simplified sum MSE minimization problem using the relay filter decomposability, which lead to two robust sub-optimum non-iterative design methods. Finally, we propose robust modified destination filter design methods which require only local channel state information between relay node and a specific destination node. The analysis and simulation results verify that, compared with the optimum iterative method, the proposed non-iterative schemes suffer a marginal loss in performance while enjoying significantly improved implementation efficiencies. Also it is confirmed that the proposed robust filter design methods provide desired robustness in the presence of channel uncertainty.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3276-3292
• /
• 2015

Relay-assisted D2D communication extends the communication range of the D2D pairs and helps users to form D2D pairs effectively. However, due to the introduction of the multi-hop relaying, the D2D communication has to occupy extra transmission time, which may decrease the efficiency of the communication system. In this paper, we propose a scheme to make node receive D2D signal and BS signal at overlapping time to improve the spectrum efficiency according to ZigZag decoding and successive-interference-cancellation (SIC). In this way, more data can be delivered during the same duration, thus the network throughput can be further improved. Numerical results verify the performance improvement of the proposed scheme when compared with a baseline scheme. Moreover, we expand the proposed scheme from one-hop relay scenario to multi-hop relay scenario.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4865-4886
• /
• 2017

The user experience of practical indoor power line communication (PLC) applications is greatly affected by the system quality-of-service (QoS) criteria. With a general broadcast-and-multi-access (BMA) relay scheme, in this work we investigate the joint source and relay power optimization of the amplify-and-forward (AF) relay systems used under indoor broad-band PLC environments. To achieve both time diversity and spatial diversity from the relay-involved PLC channel, which is time-varying in nature, the source node has been configured to transmit an identical message twice in the first and second signalling phase, respectively. The QoS constrained power allocation problem is not convex, which makes the global optimal solution is computationally intractable. To solve this problem, an alternating optimization (AO) method has been adopted and decomposes this problem into three convex/quasi-convex sub-problems. Simulation results show the fast convergence and short delay of the proposed algorithm under realistic relay-involved PLC channels. Compared with the two-hop and broadcast-and-forward (BF) relay systems, the proposed general relay system meets the same QoS requirement with less network power assumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.7
• /
• pp.747-749
• /
• 2016

We consider a time-division multiple-access relay channel (MARC), in which two source nodes (SNs) transmit data with different data rate to a destination node (DN) with the help of a relay node (RN) using network coding (NC). However, due to its asymmetric data rate, the RN cannot combine the received bits by XOR NC. In this paper, we compare with the problem of asymmetric data rates by using zero padding and hierarchical 16QAM.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3120-3137
• /
• 2021

Small-sized IoT wireless sensing devices can be deployed with small aircraft such as drones, and the deployment of mobile IoT devices can be relocated to suit data collection with efficient relocation algorithms. However, the terrain may not be able to predict its shape. Mobile IoT devices suitable for these terrains are hopping devices that can move with jumps. So far, most hopping sensor relocation studies have made the unrealistic assumption that all hopping devices know the overall state of the entire network and each device's current state. Recent work has proposed the most realistic distributed network environment-based relocation algorithms that do not require sharing all information simultaneously. However, since the shortest path-based algorithm performs communication and movement requests with terminals, it is not suitable for an area where the distribution of obstacles is uneven. The proposed scheme applies a simple Monte Carlo method based on relay nodes selection random variables that reflect the obstacle distribution's characteristics to choose the best relay node as reinforcement learning, not specific relay nodes. Using the relay node selection random variable could significantly reduce the generation of additional messages that occur to select the shortest path. This paper's additional contribution is that the world's first distributed environment-based relocation protocol is proposed reflecting real-world physical devices' characteristics through the OMNeT++ simulator. We also reconstruct the three days-long disaster environment, and performance evaluation has been performed by applying the proposed protocol to the simulated real-world environment.

• 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 Society of Computer and Information
• /
• v.22 no.7
• /
• pp.101-108
• /
• 2017

A wireless image sensor node collecting image data for environmental monitoring or surveillance requires a large amount of energy to transmit the huge amount of video data. Even though solar energy can be used to overcome the energy constraint, since the collected energy is also limited, an efficient energy management scheme for transmitting a large amount of video data is needed. In this paper, we propose a method to reduce the number of blackout nodes and increase the amount of gathered data by selecting an appropriate video coding method according to the energy condition of the node in a solar-powered wireless video sensor network. This scheme allocates the amount of energy that can be used over time in order to seamlessly collect data regardless of night or day, and selects a high compression coding method when the allocated energy is large and a low compression coding when the quota is low. Thereby, it reduces the blackout of the relay node and increases the amount of data obtained at the sink node by allowing the data to be transmitted continuously. Also, if the energy is lower than operating normaly, the frame rate is adjusted to prevent the energy exhaustion of nodes. Simulation results show that the proposed scheme suppresses the energy exhaustion of the relay node and collects more data than other schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2C
• /
• pp.105-111
• /
• 2011

In this paper, we propose a novel Alamouti space-time transmission scheme for orthogonal frequency division multiplexing (OFDM) based asynchronous cooperative communication systems with low relay complexity. The conventional scheme requires an additional operation likes time-reversal at the relay nodes besides the simple multiplications at the relay nodes, which result in increasing the complexity of relay nodes. Unlike the conventional scheme, exploiting the simple combination of the symbols at the source node and the simple multiplications at the relay nodes, the proposed scheme achieves the second order diversity gain by obtaining the Alamouti code structure at the destination node. Simulation results show that the proposed scheme achieves the second order diversity gain and has the same bit error rate performance as the conventional scheme.