• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.290-296
• /
• 2007

We propose new routing scheme, Cooperative Diversity-based Routing (CDR) which utilizes the cooperative space diversity for power saving and performance enhancement of wireless ad-hoc networks. The improved performance is compared with Multi-hop Relay Routing (NRR) by analytical methods. When the required outage probability is $1\times10^{-3}$ at the destination node in ad-hoc networks with 7 nodes, we noticed that each node can save power consumption by 15.5 dB in average, by using our proposed CDR compared to MRR.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2876-2878
• /
• 2005

In this paper, we propose Genetic Algorithms(GAs)-based Optimal Polynomial Neural Networks(PNN). The proposed algorithm is based on Group Method of Data Handling(GMDH) method and its structure is similar to feedforward Neural Networks. But the structure of PNN is not fixed like in conventional Neural Networks and can be generated. The each node of PNN structure uses several types of high-order polynomial such as linear, quadratic and modified quadratic, and is connected as various kinds of multi-variable inputs. The conventional PNN depends on experience of a designer that select No. of input variable, input variable and polynomial type. Therefore it is very difficult a organizing of optimized network. The proposed algorithm identified and selected No. of input variable, input variable and polynomial type by using Genetic Algorithms(GAs). In the sequel the proposed model shows not only superior results to the existing models, but also pliability in organizing of optimal network. The study is illustrated with the ACI Distance Relay Data for application to power systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.688-695
• /
• 2014

In a small wireless environment, such as your home or office, a various network using WiMedia PHY can be mixed. Because these networks operate independently for each application, data conflict can occur between adjacent networks. To avoid data conflict, the resource in a different time zone can be utilized. However, if devices in a network increase, available resources in the network decrease, and then the lack of resources necessary to provide service can occur. To solve this problem, we propose collision avoidacne scheme for coexistence of various UWB systems. In this paper, we evaluate the performance of the proposed scheme through simulation.

• KIEE International Transactions on Power Engineering
• /
• v.3A no.4
• /
• pp.198-205
• /
• 2003

This paper proposes the adaptive relaying of protective devices applied in the neighboring distribution feeders for reliable and efficient operations of a wind farm interconnected with distribution networks by dedicated lines. A wind farm connected to an electric power network is one of the greatest alternative energy sources. However, the wind turbine generators are influenced by abnormal grid conditions such as disturbances occurring in the neighboring distribution feeders as well as the dedicated power. Particularly, in cases of a fault happening in the neighboring distribution feeders, a wind farm might be accelerated until protective devices clear the fault. Therefore, the delayed operation time of protective devices for satisfying the coordination might overly expose the interconnected wind turbine generators to the fault and cause damage to them. This paper describes the proper delayed operation time of protective relay satisfying the coordination of the distribution networks as well as reducing damage on the interconnected wind farm. The simulation results for the Hoenggye substation model composed of five feeders and one dedicated line using PSCAD/EMTDC showed that the proper delayed time of protective devices reflecting the fault condition and the power output of the wind farm could improve the operational reliability, efficiency, and stability of the wind farm.

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

In wireless sensor networks, adversaries may physically capture sensor nodes on the fields, and use them to launch false positive attacks (FPAs). FPAs could be conducted by injecting forged or old sensing reports, which would represent non-existent events on the fields, with the goal of disorientating the base stations and/or reducing the limited energy resources of sensor nodes on the fields. Researchers have proposed various mitigation methods against FPAs, including the statistical en-route filtering scheme (SEF). Most of these methods are based on key pre-distribution schemes and can efficiently filter injected false reports out at relay nodes through the verification of in-transit reports using the pre-distributed keys. However, their filtering power may decrease as time goes by since adversaries would attempt to capture additional nodes as many as possible. In this paper, we propose an adaptive key distribution method that could maintain the security power of SEF in WSNs under such circumstances. The proposed method makes, if necessary, BS update or re-distribute keys, which are used to endorse and verify reports, with the consideration of the filtering power and energy efficiency. Our experimental results show that the proposed method is more effective, compared to SEF, against FPAs in terms of security level and energy saving.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.3
• /
• pp.115-122
• /
• 2017

In this paper, we propose an adaptive data aggregation and compression scheme for wireless sensor networks with energy-harvesting nodes, which increases the amount of data arrived at the sink node by efficient use of the harvested energy. In energy-harvesting wireless sensor networks, sensor nodes can have more than necessary energy because they harvest energy from environments continuously. In the proposed scheme, when a node judges that there is surplus energy by estimating its residual energy, the node compresses and transmits the aggregated data so far. Conversely, if the residual energy is estimated to be depleted, the node turns off its transceiver and collects only its own sensory data to reduce its energy consumption. As a result, this scheme increases the amount of data collected at the sink node by preventing the blackout of relay nodes and facilitating data transmission. Through simulation, we show that the proposed scheme suppresses the occurrence of blackout nodes and collect the largest amount of data at the sink node compared to previous schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4295-4316
• /
• 2018

In this paper, the performance of non-orthogonal multiple access (NOMA) dual-hop (DH) amplify-and-forward (AF) relaying networks is investigated, where Nakagami-m fading channel is considered. In order to cover more details, in our analysis, the transceiver hardware impairments at source, relay and destination nodes are comprehensively considered. To characterize the effects of hardware impairments brought in NOMA DH AF relaying networks, the analytical closed-form expressions for the exact outage probability and approximate ergodic sum rate are derived. In addition, the asymptotic analysis of the outage probability and ergodic sum rate at high signal-to-noise ratio (SNR) regime are carried out in order to further reveal the insights of the parameters for hardware impairments on the network performance. Simulation results indicate the performance of asymptotic ergodic sum rate are limited by levels of distortion noise.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.7
• /
• pp.605-611
• /
• 2013

If an accident vehicle propagates emergency messages to other vehicles close to it, the other drivers may realize and avoid the accident spot. In this letter, we propose a broadcast scheme to propagate emergency messages fast in urban VANETs (Vehicular Ad-Hoc Networks) with the help of GPS (Global Position System). In our scheme, a transmitting vehicle chooses the farthest node as the next relay vehicle to propagate emergency messages. And, we suggest an algorithm for intersection recognition and SCF (Store-Carry-Forward) task by taking advantage of periodic hello packets to reduce the propagation time and enhance the delivery ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.1961-1974
• /
• 2019

In this letter, a harmonic-mean-based dual-antenna selection scheme at relay node is proposed in two-way relaying networks (TWRNs). With well-designed distributed orthogonal concatenated Alamouti space-time block code (STBC), a dual-antenna selection problem based on the instantaneous achievable sum-rate criterion is formulated. We propose a low-complexity selection algorithm based on the harmonic-mean criterion with linearly complexity $O(N_R)$ rather than the directly exhaustive search with complexity $O(N^2_R)$. From the analysis of network outage performance, we show that the asymptotic diversity gain function of the proposed scheme achieves as $1/{\rho}{^{N_R-1}}$, which demonstrates one degree loss of diversity order compared with the full diversity. This slight performance gap is mainly caused by sacrificing some dual-antenna selection freedom to reduce the algorithm complexity. In addition, our proposed scheme can obtain an extra coding gain because of the combination of the well-designed orthogonal concatenated Alamouti STBC and the corresponding dual-antenna selection algorithm. Compared with the common-used selection algorithms in the state of the art, the proposed scheme can achieve the best performance, which is validated by numerical simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4446-4462
• /
• 2019

In this paper, we focus on interference cancellation for three-hop cognitive radio networks (CRNs) over Rayleigh fading channels. In CRNs, secondary users (SUs) are allowed to opportunistically utilize the licensed spectrum during the idle time of primary users (PUs) to achieve spectrum sharing. However, the SUs maybe power constrained to avoid interference and cover a very short transmission range. We here propose an interference cancellation scheme (ICS) for three-hop CRNs to prolong the transmission range of SUs and improve their transmission efficiency. In the proposed scheme, a flexible transmission protocol is adopted to cancel the interference at both secondary relays and destinations at the same time. And a closed-form expression for the secondary outage probability over Rayleigh fading channels is derived to measure the system performance. Simulation results show that the proposed scheme can significantly reduce the secondary outage probability and increase the secondary diversity in comparison with the traditional cases.