• Proceedings of the KIEE Conference
• /
• 2005.11b
• /
• pp.99-101
• /
• 2005

This paper presents an adaptive overcurrent relay applied to interconnecting wind generators in distribution networks. When a fault occurs in the case of the decreasing the wind power generator output, the conventional overcurrent relay can't detect the fault. The suggested adaptive overcurrent relay can detect. An adaptive overcurrent relay improves reliability and security of the power system protection with distributed generator APSCAD/EMTDC simulation results have shown effectiveness of the proposed method.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.228-232
• /
• 2008

In recent years, wireless ad hoc networks have become increasingly popular in both military and civilian applications due to their capability of building networks without the need for a pre-existing infrastructure. Recently, IEEE 802.11 Task Group e has been working on a new mechanism, the Enhanced Distributed Coordination Function (EDCF), to enhance the performance of 802.11 DCF. However, EDCF only reduces the internal collisions within a station, and external collisions between stations remain high in ad-hoc networks. In this paper, we propose to adopt an adaptive backoff window control technique, based on a dynamic value of the initial value of the range in which the backoff is chosen, so the backoff timer is randomly chosen in the range (InitRng, CW-1). We use ns-2 simulation to evaluate the throughput of our scheme. Results show that the throughput is improved for our scheme compared to the original DCF due to the reduced the number of collisions.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.150-161
• /
• 2016

Coordinated multi-point transmission (CoMP) techniques are being touted as enabling technologies for interference mitigation in next generation heterogeneous wireless networks (HetNets). In this paper, we present a comparative performance study of uplink (UL) CoMP algorithms for the 3GPP LTE HetNets. Focusing on a distributed and functionally-split architecture, we consider six distinct UL-CoMP algorithms: 1. Joint reception in the frequency-domain (JRFD) 2. Two-stage equalization (TSEQ) 3. Log-likelihood ratio exchange (LLR-E) 4. Symmetric TSEQ (S-TSEQ) 5. Transport block selection diversity (TBSD) 6. Coordinated scheduling with adaptive interference mitigation (CS-AIM) where JRFD, TSEQ, S-TSEQ, TBSD and CS-AIM are our main contributions in this paper, and quantify their relative performances via the post-processing signal-to-interference-plus-noise ratio distributions.We also compare the CoMP-specific front-haul rate requirements for all the schemes considered in this paper. Our results indicate that, with a linear minimum mean-square error receiver, the JRFD and TSEQ have identical performances, whereas S-TSEQ relaxes the front-haul latency requirements while approaching the performance of TSEQ. Furthermore, in a HetNet environment, we find that CS-AIM provides an attractive alternative to TBSD and LLR-E with a significantly reduced CoMP-specific front-haul rate requirement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4799-4818
• /
• 2015

In this paper, we investigate the problem of achieving global optimization for distributed carrier aggregation (CA) in small cell networks, using a game theoretic solution. To cope with the local interference and the distinct cost of intra-band and inter-band CA, we propose a non-cooperation game which is proved as an exact potential game. Furthermore, we propose a spatial adaptive play learning algorithm with heterogeneous learning parameters to converge towards NE of the game. In this algorithm, heterogeneous learning parameters are introduced to accelerate the convergence speed. It is shown that with the proposed game-theoretic approach, global optimization is achieved with local information exchange. Simulation results validate the effectivity of the proposed game-theoretic CA approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.700-713
• /
• 2015

It is critical to design energy-efficient routing protocols for battery-limited mobile ad hoc networks, especially in which the energy-consuming MIMO techniques are employed. However, there are several challenges in such a design: first, it is difficult to characterize the energy consumption of a MIMO-based link; second, without a careful design, the broadcasted RREP packets, which are used in most energy-efficient routing protocols, could flood over the networks, and the destination node cannot decide when to reply the communication request; third, due to node mobility and persistent channel degradation, the selected route paths would break down frequently and hence the protocol overhead is increased further. To address these issues, in this paper, a novel Greedy Energy-Efficient Routing (GEER) protocol is proposed: (a) a generalized energy consumption model for the MIMO-based link, considering the trade-off between multiplexing and diversity gains, is derived to minimize link energy consumption and obtain the optimal transmit model; (b) a simple greedy route discovery algorithm and a novel adaptive reply strategy are adopted to speed up path setup with a reduced establishment overhead; (c) a lightweight route maintenance mechanism is introduced to adaptively rebuild the broken links. Extensive simulation results show that, in comparison with the conventional solutions, the proposed GEER protocol can significantly reduce the energy consumption by up to 68.74%.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3446-3464
• /
• 2017

Backoff mechanism serves as one of the key technologies in the MAC-layer of wireless mobile networks. The traditional Binary Exponential Backoff (BEB) mechanism in IEEE 802.11 Distributed Coordination Function (DCF) and other existing backoff mechanisms poses several performance issues. For instance, the Contention Window (CW) oscillations occur frequently; a low delay QoS guarantee cannot be provided for real-time transmission, and services with different priorities are not differentiated. For these problems, we present a novel Multi-Priority service differentiated and Adaptive Backoff (MPAB) algorithm over IEEE 802.11 DCF for wireless mobile networks in this paper. In this algorithm, the backoff stage is chosen adaptively according to the channel status and traffic priority, and the forwarding and receding transition probability between the adjacent backoff stages for different priority traffic can be controlled and adjusted for demands at any time. We further employ the 2-dimensional Markov chain model to analyze the algorithm, and derive the analytical expressions of the saturation throughput and average medium access delay. Both the accuracy of the expressions and the algorithm performance are verified through simulations. The results show that the performance of the MPAB algorithm can offer a higher throughput and lower delay than the BEB algorithm.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.151-164
• /
• 2009

The importance of sensor networks as a base of ubiquitous computing realization is being highlighted, and espicially the security is recognized as an important research isuue, because of their characteristics.Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop security Intrusion Detection System (IDS) that can survive malicious attacks from "insiders" who have access to keying materials or the full control of some nodes, taking their charateristics into consideration. In this perper, we design a distributed and adaptive IDS architecture on sensor networks, respecting both of energy efficiency and IDS efficiency. Utilizing a modified HEED algorithm, a clustering algorithm, distributed IDS nodes (dIDS) are selected according to node's residual energy and degree. Then the monitoring results of dIDSswith detection codes are transferred to dIDSs in next round, in order to perform consecutive and integrated IDS process and urgent report are sent through high priority messages. With the simulation we show that the superiorities of our architecture in the the efficiency, overhead, and detection capability view, in comparison with a recent existent research, adaptive IDS.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2259-2266
• /
• 2016

Recently dense wireless local area networks (WLANs) emerge as the number of WLAN cells and stations increases. In such dense WLAN environment, this paper proposes a new distributed medium access control (MAC) protocol. The proposed MAC protocol extends the previous CSMA with collision resolution (CSMA/CR) that uses a single collision detection (CD) phase and employs multiple CD phases to resolve more collisions. It checks the collision detection in each CD phase and stops the CD phase if consecutive non-detected CD phases occur more than the threshold. Therefore, the proposed protocol can control the number of CD phases adaptively according to the number of accessing stations and increase the probability of collision resolution while decreasing the packet overhead. The simulation results show that the proposed adaptive CSMA/CR protocol employs a variable number of CD phases according to the number of stations and achieves a greater throughput than the previous CSMA/CR protocol using the fixed number of CD phases.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.966-969
• /
• 2012

This study suggests a query conversion method based on Topic Maps MetaData Registry(TMDR) in order to solve heterogeneity problems distributed in networks and to integrate data efficiently. In order to integrate distributed data, TMDR provides global schema and it solves heterogeneity problem within local data using query conversion method. After analyzing relationship between Meta Schema Ontology(MSO) of eXtended Meta Data Registry(XMDR) and Topic Maps, this method allows integrated access through Meta Location(ML) which manages accessing information of local data. The processing method is to produce a global query for global processing by using TMDR and then to make the produced global query approach to systems distributed through networks so that allows integrated access at the end. For this, we propose a method to convert a global query into a query which is adaptive to local query.