• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.2
• /
• pp.29-37
• /
• 2008

Clustering allows hierarchical structures to be built on the nodes and enables more efficient use of scarce resources, such as frequency spectrum, bandwidth, and energy in wireless sensor networks (WSNs). This paper proposes a hierarchical clustering algorithm called EEHC which is more energy efficient than existing algorithms for WSNs, It introduces region node selection as well as cluster head election based on the residual battery capacity of nodes to reduce the costs of managing sensor nodes and of the communication among them. The role of cluster heads or region nodes is rotated among nodes to achieve load balancing and extend the lifetime of every individual sensor node. To do this, EEHC clusters periodically to select cluster heads that are richer in residual energy level, compared to the other nodes, according to clustering policies from administrators. To prove the performance improvement of EEHC, the ns-2 simulator was used. The results show that it can reduce the energy and bandwidth consumption for organizing and managing WSNs comparing it with existing algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.1976-1997
• /
• 2016

This paper investigates the problem of co-tier interference mitigation for dynamic small- cell networks, in which the load of each small-cell varies with the number of active associated small-cell users (SUs). Due to the fact that most small-cell base stations (SBSs) are deployed in an ad-hoc manner, the problem of reducing co-tier interference caused by dynamic loads in a distributed fashion is quite challenging. First, we propose a new distributed channel allocation method for small-cells with dynamic loads and define a dynamic interference graph. Based on this approach, we formulate the problem as a dynamic interference graph game and prove that the game is a potential game and has at least one pure strategy Nash equilibrium (NE) point. Moreover, we show that the best pure strategy NE point minimizes the expectation of the aggregate dynamic co-tier interference in the small-cell network. A distributed dynamic learning algorithm is then designed to achieve NE of the game, in which each SBS is unaware of the probability distributions of its own and other SBSs' dynamic loads. Simulation results show that the proposed approach can mitigate dynamic co-tier interference effectively and significantly outperform random channel selection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4087-4102
• /
• 2014

Two-way relaying is an effective way of improving system spectral efficiency by making use of physical layer network coding. However, energy efficiency in OFDM-based bidirectional relaying with asymmetric traffic requirement has not been investigated. In this study, we focused on subcarrier transmission mode selection, bit loading, and power allocation in a multicarrier single amplified-and-forward relay system. In this scheme, each subcarrier can operate in two transmission modes: one-way relaying and two-way relaying. The problem is formulated as a mixed integer programming problem. We adopt a structural approximation optimization method that first decouples the original problem into two suboptimal problems with fixed subcarrier subsets and then finds the optimal subcarrier assignment subsets. Although the suboptimal problems are nonconvex, the results obtained for a single-tone system are used to transform them to convex problems. To find the optimal subcarrier assignment subsets, an iterative algorithm based on subcarrier ranking and matching is developed. Simulation results show that the proposed method can improve system performance compared with conventional methods. Some interesting insights are also obtained via simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2081-2100
• /
• 2013

In this paper, we propose a cooperative hybrid spectrum sharing protocol by jointly considering interweave (opportunistic) and underlay schemes. In the proposed protocol, secondary users can access the licensed spectrum along with the primary system. Our network scenario comprises a single primary transmitter-receiver (PTx-PRx) pair and a group of M secondary transmitter-receiver (STx-SRx) pairs within the transmission range of the primary system. Secondary transmitters are divided into two groups: active and inactive. A secondary transmitter that gets an opportunity to access the secondary spectrum is called "active". One of the idle or inactive secondary transmitters that achieves the primary request target rate $R_{PT}$ will be selected as a best decode-and-forward (DF) relay (Re) to forward the primary information when the data rate of the direct link between PTx and PRx falls below $R_{PT}$. We investigate the ergodic capacity and outage probability of the primary system with cooperative relaying and outage probability of the secondary system. Our theoretical and simulation results show that both the primary and secondary systems are able to achieve performance improvement in terms of outage probability. It is also shown that ergodic capacity and outage probability improve when the active secondary transmitter is located farther away from the PRx.

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

• Hwankyungkyoyuk
• /
• v.19 no.3
• /
• pp.114-122
• /
• 2006

Since 1985, the Ministry of Environment have supported environment conservation model schools (ECMS) to promote more structured and effective environmental education in schools. For driving ECMS to playa central role for sustainable schools in the community in Korea, international trends in foreign environmental education model schools need to be analysed in addition to overall evaluations of the present status. Eco-school related initiatives as whole-school approaches in other countries include Eco-Schools, Green School, Enviro School, and Sustainable School, etc. and most of them are usually involved in international network such as ENSI(Environment and School Initiatives) and FEE(Foundation for Environmental Education). This study was based on the literature analysis, which included available documents and reports of other countries from country reports, web-pages or official documents. Also, face-to-face or email interviews with personnels responsible for running such initiatives in a couple of countries were conducted. Implications for operating and supporting ECMS were provided based on the analysis and investigation on eco-school related initiatives of other countries, which included the main objective of initiatives, overall program direction, supporting methods, criteria for selection or accreditation, evaluation and monitoring.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.4
• /
• pp.1-11
• /
• 2016

Recently numerous studies are conducted to estimate the human personality from the online social activities. This paper develops a comprehensive model for political attitude estimation leveraging the Facebook Like information of the users. We designed a Facebook Crawler that efficiently collects data overcoming the difficulties in crawling Ajax enabled Facebook pages. We show that the category level selection can reduce the data analysis complexity utilizing the sparsity of the huge like-attitude matrix. In the Korean Facebook users' context, only 28 criteria (3% of the total) can estimate the political polarity of the user with high accuracy (AUC of 0.82).

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1308-1318
• /
• 1997

This paper proposes a new touthind algorithm, the Bandwidth-Delay-Loss based Routing(BDLR) algotithm, which supports the selection of an effcienet routing path by cinsidering the characteristics and QoS requirements of intergarted servies over the Untegrated Serives Packet Network(ISPN), and also compareas it with other touting algorithms by simulating their perfomances on the various combinations of the realtime and non-realtime traffic over the ISPN. The simulation shows that the BDLR algorithm takes great advantages on transmisson dealy, the satisfiability of QoS requirements, and the adapation of traffic envirment over the other routing algorithms priposed for ISPN until now.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.3
• /
• pp.188-193
• /
• 2000

This paper presents an approach to obtain a reduced neuro-fuzzy model for a plant. The Neuro-Fuzzy Network are compose of the Radial Basis Function Networks with Gausis membership and learned by using temporal back propagation. The dependency in rough set theory is used to eliminate rules. Dependency between the condition membership value of each rule in a model and the output of the plant can allow us to see how much contribution the rule is to identify the plant. While the reduced model maintains the same performance as the original one, the selection algorithm can minimize its complexity and redundancy of the structure.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.4
• /
• pp.505-510
• /
• 2005

The RPO(randomized policy optimizer) algorithm, which utilizes probabilistic policy for the action selection, is a recently developed tool in the area of reinforcement learning, and has been shown to be very successful in several application problems. In this paper, we propose a modified RPO algorithm, whose critic network is adapted via RLS(Recursive Least Square) algorithm. In order to illustrate the applicability of the modified RPO method, we applied the modified algorithm to Kimura's robot and observed very good performance. We also developed a MATLAB-based animation program, by which the effectiveness of the training algorithms on the acceleration or the robot movement were observed.