• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.73-81
• /
• 2015

Most of the software fault prediction studies focused on the binary classification model that predicts whether an input entity has faults or not. However the ability to predict entity fault-proneness in various severity categories is more useful because not all faults have the same severity. In this paper, we propose fault prediction models at different severity levels of faults using traditional size and complexity metrics. They are ternary classification models and use four machine learning algorithms for their training. Empirical analysis is performed using two NASA public data sets and a performance measure, accuracy. The evaluation results show that backpropagation neural network model outperforms other models on both data sets, with about 81% and 88% in terms of accuracy score respectively.

• Journal of KIISE:Information Networking
• /
• v.35 no.2
• /
• pp.158-165
• /
• 2008

In this paper, we present a MMPR (Minimizing the Maximum Used Power Routing) Algorithm in a MANET (Mobile ad hoc network) by modifying the route selection algorithm in well-known routing MANET protocol. In the previous route selection algorithms, the metric for cost function is the minimal hop which does not consider the energy status. MMPR uses the metric with used energy The node that want to know the route for some destination begins calculating the route cost function with alpha which is the maximum used energy in the known route. If the new route that contains the node whose used energy is greater than previous known alpha is known to the node that want to send a packet in some moment, the probability of selecting the new route is lower. Experimental results with MMPR show higher performance in both the maximum used energy and the number of dead nodes than that of the CMMBCR (Conditional Max-Min Battery Routing).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.5
• /
• pp.574-580
• /
• 2019

Conventional energy efficient routing protocols apply high weight to energy among routing metrics, causing nodes to concentrate on energy efficient paths and quickly exhaust energy on those paths. The unbalanced energy consumption of these wireless sensor networks causes network division and malfunction, and reduces network lifetime. Therefore, in this paper, it proposes a link cost based routing protocol to solve the unbalanced energy consumption of wireless sensor networks. The proposed routing protocol calculates the link cost by applying the weight of the routing metric differently according to the network problem situation and selects the path with the lowest value. As a result of the performance analysis, it confirmed that the proposed routing protocol has 22% longer network life, 2% energy consumption standard deviation and 2% higher data reception rate than the existing AODV protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10B
• /
• pp.872-882
• /
• 2006

The Wireless Mesh Network uses a wireless communication technology with transmission rates similar to that of a cable, which is used as a backbone network. The topology structure is in a Mesh form which resembles an Ad-hoc network, however a metric is needed in order to set the channel and channel methods since the operation intentions and interior motions are different. This thesis proposes a metric(ETR : Expected Transmission Rate) that sets the channel with physical link performance and multi hop transmission capabilities. This metric will also be based on multi channel creation methods and Hop-by-hop routing techniques for an effective multi hop transmission with no loops.

• The KIPS Transactions:PartC
• /
• v.13C no.1 s.104
• /
• pp.75-82
• /
• 2006

In this paper, a space-frequency coded orthogonal frequency division multiplexing (SFC-OFDM) scheme with dual Viterbi decoder is proposed and analyzed. Here, two independent half-rate OFDM symbols are generated after convolutional coding of the binary source code. A dual Viterbi decoder is exploited to decode the demodulated sequences independently in the receiver, and their path metrics are compared. Accordingly, the recovered binary data in the proposed scheme are composed of the combination of the sequences having larger path metrics while those in a conventional system are simply the output of single Viterbi decoder. As a result, the proposed SFC-OFDM scheme has a better performance than the conventional one for all signal-to-noise power ratio.

• Journal of Broadcast Engineering
• /
• v.24 no.2
• /
• pp.353-356
• /
• 2019

The main functionality of occupancy sensors is to determine the existence of humans in the space. If the space is occupied, a light is on and for vacancy, the light automatically turns off. In this letter, the functionality is realized by the utilization of color information. The color information of incoming people is saved. For outgoing people, their color distribution is compared with the saved information, thus providing the recognition of the outgoing people. For the comparison, four similarity metrics are examined to validate the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.5
• /
• pp.393-400
• /
• 2013

In conventional single-tier networks, downlink based association is the best association scheme for the uplink association because all macro base stations have the same physical specification. However, in uplink heterogeneous cellular networks, a downlink based cell association cannot be the best for uplink any more because of the difference of physical specification between the different base station. In this paper, we will propose a uplink based cell association scheme, and devise performance metric for describing a uplink performance in heterogeneous cellular networks. Then, we will discuss the necessity of the uplink based association by observing outage probability, delay constraint outage probability, delay constraint outage capacity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.6
• /
• pp.768-777
• /
• 2020

In this paper, we describe recent research results on AODV routing protocol, which is widely deployed at mobile ad hoc networks, and AODV related routing protocols with multi-path routing schemes. We suggest the critical problems which minimum hop routing schemes have, such as AODV routing protocol, and then, propose a new C-AODV routing protocol with two routing metrics: the primary metric is the hop count, the secondary metric is the sum of link delay times. We implemented C-AODV protocol by modifying AODV at the NS-3, and thus, elaborate on how we change the original AODV source code of NS-3 in order to implement the C-AODV scheme. We show numerical comparison of C-AODV scheme with the original AODV scheme and then, discuss how much the C-AODV enhances routing performance over AODV protocol. In conclusion, we present future research items.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.59-70
• /
• 2014

This paper propose a new wireless multi-hop routing protocol that takes the hierarchical mesh of the hybrid WMN into account. WMN that is possible to provide various applications of wireless networks still has many open issues that should be solved despite the studies carried out over a decade. Especially, in routing protocol area, a problem degrading the routing efficiency by applying one of the routing protocols, which are designed for the MANET, to the hybrid WMN be solved above all. For the improvement of the routing performance, both good routing protocol and metric are essential. However, the recent studies are only concentrated in routing metric by use of the cross-layer design. Therefore, this paper is dedicated to the routing protocol that is essential for the performance of the routing but needed more studies. The proposed protocol in this paper is reactive, and designed to reorganize the hybrid WMN with several pseudo domains, and carry out domain-based route decision. By the simulation result for the performance analysis of the proposed protocol, the average delay for the route decision was decreased by 43% compared to AODV that is the typical reactive protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2457-2464
• /
• 2015

Distributed Networked Control Systems (NCSs) through wireless networks have a tremendous potential to improve the efficiency of various control systems. In this paper, we define the State Update Interval (SUI) as the elapsed time between successful state vector reports derived from the NCSs. A simple expression of the SUI is derived to characterize the key interactions between the control and communication layers. This performance measure is used to formulate a novel optimization problem where the objective function is the probability to meet the SUI constraint and the decision parameter is the channel access probability. We prove the existence and uniqueness of the optimal channel access probability of the optimization problem. Furthermore, the optimal channel access probability for NCSs is lower than the channel access probability to maximize the throughput. Numerical results indicate that the improvement of the success probability to meet the SUI constraint using the optimal channel access probability increases as the number of nodes increases with respect to that using the channel access probability to maximize the throughput.