• The Transactions of the Korean Institute of Power Electronics
• /
• v.9 no.6
• /
• pp.544-552
• /
• 2004

This paper deals with the hybrid active filter which can reduce the 11th/13th harmonics in AC network by using the single tuned filter. Since the proposed algorithm uses the detuning compensation capability of the filter, the output voltage of the proposed active power filter is changed according to the capacitance of capacitors, magnitude of harmonic current, resonance frequency and control mode. In this paper, the control characteristics and the design of hybrid active filter is investigated. A new hybrid active filter with new algorithm, which is an active filter with single tuned filter instead of double tuned filter, is proposed.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.59-69
• /
• 2006

Bluetooth is reputed as a wireless networking technology supplying ad-hoc networks between digital devices. In particular, Bluetooth scatternet is an essential part of dynamic ad-hoc networks. Yet, there have not been sufficient researches performed on scatternet environment. This paper proposes a scatternet reformation algorithm for ad-hoc networks for instances where some nodes enter or leave the scatternet. The proposed algorithm is a general algorithm that can be applied to many types of Bluetooth scatternet regardless of the topology. The proposed algorithm is made for two reformation cases, i.e., nodes leaving and nodes entering. For the reformation when nodes leave a scatternet, the recovery node vector (RNV) algorithm is proposed. It has short reformation setup delay because the process involves a single page process (not including inquiry process). For the reformation when nodes enter a scatternet, the entry node algorithm is proposed. This is a simple and easily implementable algorithm. In this paper, real hardware experiments are carried out to evaluate the algorithm's performance where the reformation setup delay, the reformation setup probability and the data transfer rate are measured. The proposed algorithm has shown improvement in the reformation setup delay and probability.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.334-345
• /
• 2010

In this paper, we study optimal tradeoffs of achievable throughput versus consumed power in wireless ad-hoc networks formed by a collection of multiple antenna nodes. Relying on adaptive modulation and/or dynamic channel coding rate allocation techniques for multiple antenna systems, we examine the maximization of throughput under power constraints as well as the minimization of transmission power under throughput constraints. In our examination, we also consider the impacts of enforcing quality of service requirements expressed in the form of channel coding block loss constraints. In order to properly model temporally correlated loss observed in fading wireless channels, we propose the use of finite-state Markov chains. Details of fading statistics of signal-to-interference-noise ratio, an important indicator of transmission quality, are presented. Further, we objectively inspect complexity versus accuracy tradeoff of solving our proposed optimization problems at a global as oppose to a local topology level. Our numerical simulations profile and compare the performance of a variety of scenarios for a number of sample network topologies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.502-510
• /
• 2011

In this paper, we propose a slot scheduling algorithm for balancing power consumption in tree-based sensor networks. In this type of networks, nodes with lower depths tend to consume more energy than those with higher depths, thereby reducing the life time of the network. The proposed algorithm allocates a series of receiving slots first and then a series of sending slots. This way of slot allocation eases packet aggregation and filtering, and thus reduces traffic load on nodes near a sink. We compare the proposed algorithm and the frame-slot allocation algorithm employed in the TreeMAC by resorting to simulation. The simulation results showed that the proposed approach well achieves the balancing of power consumption.

• Journal of Information Technology Applications and Management
• /
• v.15 no.1
• /
• pp.261-270
• /
• 2008

Wireless Mesh Networks (WMNs) have emerged as one of the new hot topics in wireless communications. WMNs have been suggested for use in situations in which some or all of the users are mobile or are located in inaccessible environments. Unconstrained transmission in a WMN may lead to the time overlap of two or more packet receptions, called collisions or interferences, resulting in damaged useless packets at the destination. There are two types of collisions; primary collision, due to the transmission of the stations which can hear each other, and hidden terminal collision, when stations outside the hearing range of each other transmit to the same receiving stations. For a WMN, direct collisions can be minimized by short propagation and carrier sense times. Thus, in this paper we only consider hidden terminal collision while neglecting direct collisions. To reduce or eliminate hidden terminal collision, code division multiple access (CDMA) protocols have been introduced. The collision-free property is guaranteed by the use of spread spectrum communication techniques and the proper assignment of orthogonal codes. Such codes share the fixed channel capacity allocated to the network in the design stage. Thus, it is very important to minimize the number of codes while achieving a proper transmission quality level in CDMA WMNs. In this paper, an efficient heuristic code assignment algorithm for eliminating hidden terminal collision in CDMA WMNs with general topology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11B
• /
• pp.722-729
• /
• 2005

Ethernet passive optical networks (EPONs) are an emerging access network technology which has a point-to-multipoint topology. EPONs operate point-to-multipoint in the OLT-ONU direction, and point-to-point in the ONU-OLT direction. To support point-to-point emulation and shared LAM emulation, EPONs use multi-point control protocol (MPCP). The MPCP uses logical link identification (LLID) field for frame tagging and filtering between the OLT and ONUs. In this paper, I propose logical-group identification (LGID) for logical link-based multicasting or VLAN services in EPONs. Using LGID with new frame tagging and filtering rules, EPONs support differentiated multimedia broadcasting or multicasting services. Additionally, EPONs can support logical link-based VLAN services that divides ONUs into several subsets.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.324-333
• /
• 2001

The Differentiated Services (Diffserv) framework has been proposed by the IETF as a simple service structure that can provide different Quality of Service (QoS) to different classes of packets in IP networks. IP packets are classified into one of a limited number of service classes, and are marked in the packet header for easy classification and differentiated treatments when transferred within a Diffserv domain. The Diffserv framework defines simple and efficient QoS differentiation mechanisms for the Internet. However, the original Diffserv concept does not provide a complete QoS management framework. Since traffic flows in IP networks are unidirectional from one network point to the other and routing paths and traffic demand get dynamically altered, it is important to monitor end-to-end traffic status, as well as traffic status in a single node. This paper suggests a distributed QoS monitoring method that collects the statistical data of each service class in every Diffserv router and calculates edge-to-edge QoS of the aggregated IP flows by combining routing topology and traffic status. A format modeling of edge-to-edge Diffserv flows and algorithms for aggregating edge-to-edge QoS is presented. Also an SNMP-based QoS management prototype system for Diffserv networks is presented, which validates our QoS management framework and demonstrates useful service management functionality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.247-256
• /
• 2007

In this paper, we propose Geographical Back-off Routing (Geo-Back Routing) protocol for wireless sensor networks. Geo-Back uses the positions of nodes, a packet's destination and a optimal back-off time to make the packet forwarding decisions using only source and destination's location information without information about neighbor nodes' location or the number of one hop neighbor nodes. Under the frequent topology changes in WSNs, the proposed protocol can find optimal next hop location quickly without broadcast algorithm for update. In our analysis, Geo-Back's scalability and better performance is demonstrated on densely deployed wireless sensor networks.

• BMB Reports
• /
• v.46 no.1
• /
• pp.41-46
• /
• 2013

Identifying genes indispensable for an organism's life and their characteristics is one of the central questions in current biological research, and hence it would be helpful to develop computational approaches towards the prediction of essential genes. The performance of a predictor is usually measured by the area under the receiver operating characteristic curve (AUC). We propose a novel method by implementing genetic algorithms to maximize the partial AUC that is restricted to a specific interval of lower false positive rate (FPR), the region relevant to follow-up experimental validation. Our predictor uses various features based on sequence information, protein-protein interaction network topology, and gene expression profiles. A feature selection wrapper was developed to alleviate the over-fitting problem and to weigh each feature's relevance to prediction. We evaluated our method using the proteome of budding yeast. Our implementation of genetic algorithms maximizing the partial AUC below 0.05 or 0.10 of FPR outperformed other popular classification methods.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.9
• /
• pp.920-926
• /
• 2007

Establishing a fixed path for the message delivery through a wireless network is impossible due to the mobility. Among the number of routing protocols that have been proposed for wireless ad-hoc networks, the AODV(Ad-hoc On-demand Distance Vector) algorithm is suitable in the case of highly dynamic topology changes, along with ZigBee Routing(ZBR), with the exception of route maintenance. Accordingly, this paper introduces a routing scheme focusing on the energy efficiency and route discovery time for wireless alarm systems using IEEE 802.15.4-based ZigBee. Essentially, the proposed routing algorithm utilizes a cluster structure and applies ZBR within a cluster and DSR (Dynamic Source Routing) between clusters. The proposed algorithm does not require a routing table for the cluster heads, as the inter-cluster routing is performed using DSR. The performance of the proposed algorithm is evaluated and compared with ZBR using an NS2 simulator. The results confirm that the proposed Cluster-based AODV (CAODV) algorithm is more efficient than ZBR in terms of the route discovery time and energy consumption.