• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.5B no.2
• /
• pp.103-110
• /
• 2005

Broken rotor bars in induction motors can be detected by monitoring any abnormality of the spectrum amplitudes at certain frequencies in the motor current spectrum. Broken rotor bar fault detection schemes should rely on multiple signatures in order to overcome or reduce the effect of any misinterpretation of the signatures that are obscured by factors such as measurement noises and different load conditions. Multiple Discriminant Analysis (MDA) and Artificial Neural Networks (ANN) provide appropriate environments to develop such fault detection schemes because of their multi-input processing capabilities. This paper describes two fault detection schemes for broken rotor bar fault detection with multiple signature processing, and demonstrates that multiple signature processing is more efficient than single signature processing.

• Journal of Information Processing Systems
• /
• v.4 no.2
• /
• pp.41-52
• /
• 2008

In this paper, we discuss a novel reservation-based, asynchronous MAC protocol called 'Multi-rate Multi-hop MAC Protocol' (MMMP) for multi-hop ad hoc networks that provides QoS guarantees for multimedia traffic. MMMP achieves this by providing service differentiation for multirate real-time traffic (both constant and variable bit rate traffic) and guaranteeing a bounded end-to-end delay for the same while still catering to the throughput requirements of non real time traffic. In addition, it administers bandwidth preservation via a feature called 'Smart Drop' and implements efficient bandwidth usage through a mechanism called 'Release Bandwidth'. Simulation results on the QualNet simulator indicate that MMMP outperforms IEEE 802.11 on all performance metrics and can efficiently handle a large range of traffic intensity. It also outperforms other similar state-of-the-art MAC protocols.

• ETRI Journal
• /
• v.33 no.1
• /
• pp.39-49
• /
• 2011

A new structure learning approach for Bayesian networks based on asexual reproduction optimization (ARO) is proposed in this paper. ARO can be considered an evolutionary-based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter, the parent and its bud compete to survive according to a performance index obtained from the underlying objective function of the optimization problem: This leads to the fitter individual. The convergence measure of ARO is analyzed. The proposed method is applied to real-world and benchmark applications, while its effectiveness is demonstrated through computer simulations. Results of simulations show that ARO outperforms genetic algorithm (GA) because ARO results in a good structure and fast convergence rate in comparison with GA.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2454-2467
• /
• 2015

Increasing traffic and bandwidth requirements bring challenges to the next generation wireless networks (5G). As one of the main technology in 5G networks, Ultra-Dense Network (UDN) can be used to improve network coverage. In this paper, a radio over fiber based model is proposed to solve the load balancing problem in ultra-dense network. Stochastic differential game is introduced for the load balancing algorithm, and optimal load allocated to each access point (RAP) are formulated as Nash Equilibrium. It is proved that the optimal load can be achieved and the stochastic differential game based scheme is applicable and acceptable. Numerical results are given to prove the effectiveness of the optimal algorithm.

• Journal of Korea Multimedia Society
• /
• v.14 no.12
• /
• pp.1559-1571
• /
• 2011

In wireless ad hoc networks, nodes communicate with each other using multihop routed transmission in which hop-by-hop cooperative diversity can be effectively employed. This paper proposes (i) two cooperation models for per-link cooperation (PLC) and per-node cooperation (PNC) for exploiting cooperative diversity in wireless ad hoc networks and (ii) a cooperative routing algorithm for the above models in which best relays are selected for cooperative transmission. First, two cooperation models for PLC and PNC are introduced and represented as an edge-weighted graph with effective link quality. Then, the proposed models are transformed into a simplified graph and a cooperative routing algorithm with O(n2) time is developed, where n is the number of nodes in the network. The effectiveness of the algorithm is confirmed for the two cooperation models using simulation.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.85-92
• /
• 2006

In this paper, we study a wireless cellular network design problem. It consists of selecting the location of the base station controllers and mobile service switching centres, selecting their types, designing the network into a tree-topology, and selecting the link types, while considering the location and the demand of base transceiver stations. We propose a constraint programming model and develop a heuristic combining local search and constraint programming techniques to find very good solutions in a reasonable amount of time for this category of problem. Numerical results show that our approach, on average, improves the results from the literature.

• Journal of Information Processing Systems
• /
• v.6 no.3
• /
• pp.403-412
• /
• 2010

Multi-Relay Networks should accommodate mobile users of various speeds. The cellular system should meet the minimum residency time requirements for handover calls while considering an efficient use of available channels. In this paper, we design speed-sensitive handover under dynamic hierarchical cellular systems, in which mobile users are classified according to the mean speed of mobile users and each class has its cellular layer. In order to meet the minimum residency time, the cell size of each cellular layer is dynamically determined depending on the distributions of mean speeds of mobile users. Since the speed-dependent non-preferred cell can provide a secondary resource, overflow and take-back schemes are adopted in the system. We develop analytical models to study the performance of the proposed system, and show that the optimal cell size improves the blocking probability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1113-1135
• /
• 2018

Existing trust evaluation models for wireless sensor networks can accurately and objectively evaluate trust value of nodes, but the nodes' energy saving problem was ignored. Especially when there are a few malicious nodes in a network, the overall trust value calculation for all nodes would waste lots of energy. Beside that, the network failure caused by nodes death was also not considered. In this paper, we proposed a method for avoiding energy hole which applied trust evaluation models and a trust evaluation method based on information entropy, so as to achieve the purpose of improving nodes utilization. Simulation results show that the proposed method can effectively improve nodes utilization, and it has reasonable detection rate and lower false alert rate compared to other classical methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.199-201
• /
• 2016

Wireless sensor networks offer an attractive solution to several environments, security, and process monitoring problems. However, one barrier for their full adoption is the need to provide electrical power over extended periods of time without the need of dedicated wiring. Energy harvesting offers good solutions to this problem in several applications. This paper surveys the energy requirements of typical sensor network nodes and summarizes the future research work in the field of energy harvesting resource allocation in wireless sensor networks.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.182-186
• /
• 2004

This paper describes an advanced compensation for non-linear functions designed to remove steering aberrations from phased array antennas. This system alters the steering command applied to the antenna in a way that the appropriate angle commands are given to the array steering software for the antenna to point to the desired position instead of squinting. Artificial neural networks are used to develop the inverse function necessary to correct the aberration. Also a straightforward antenna steering function is implemented with neural networks for the 9-term polynomials of forward steering function. In all cases the aberration is removed resulting in small RMS angular errors across the operational angle space when the actual antenna position is compared with the desired position. The use of neural network model provides a method of producing a non-linear system that can correct antenna performance and demonstrates the feasibility of generating an inverse steering algorithm.