• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.2
• /
• pp.856-865
• /
• 2012

Maintenance systems are demanded to manage malodor-information and deal effectively with the odor-related civil complaints by constructing the database for sources of malodor compounds in real time. In this paper, to carry out these tasks, a real-time monitering system for malodor based on ubiquitous sensor networks(USN) is presented. The constructed monitering system stores the malodor data collected periodically from industrial complex into the database and shows in real time the circumstances of the odor sources being emitted around the industrial complex by indicating on the map where it is taking place. Besides, by clicking an icon indicating the sensor node on the map, we can figure out what firms are located near the malodor source and possible material related with those firms. The proposed system is considered to enhance the efficiency of management of malodor-emitting firms based on the malodor-related information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.191-197
• /
• 2012

In this paper we propose the FQSM(Fairness and QoS Supporting MAC) protocol that supports fairness and Quality of Service(QoS). The received or measured data traffics will be assigned a priority level according to its transmission urgency in the FQSM. And the load prediction algorithm is used to support the fairness between different priority traffics. For this, the buffer length values of the nodes are continuously monitored for a some period. Based on the buffer length variations for this period, the order of transmission is determined. FQSM also adapts cross-layer concept to rearrange the data transmission order in each sensor node's buffer, saves energy consumption by allowing few nodes in data transmission, and prolongs the network lifetime.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.241-244
• /
• 2012

In mobile ad-hoc networks, it should be the most important issue to reduce the power consumption of communications, because the resource of a node is limited in these networks. In existing cluster-based routing protocols, cluster headers participate in almost all communication processes. Therefore the lifetime of the cluster header is shortened and it does not have the effective route. In the proposed cluster-based routing protocol, the cluster header transmits a control packet which gives the route information to member nodes. This makes that the cluster header decreases the number of participating in communications, and that node members do not have to communicate trough the cluster header. This results in extending the lifetime of the cluster header, and having the effective route, data transmission rate and improved stability of routes.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.9
• /
• pp.81-90
• /
• 2020

In order to operate multi drone efficiently, existing control methods must be improved, and drones must be able to construct communication networks autonomously. FANET(Flying Ad-Hoc Network), which is being considered as an alternative to solving these problems, is based on ad hoc network technology and can be exposed to a variety of security vulnerabilities. However, due to the limited computational power and memory of FANET nodes, and rapid and frequent changes in network topology, it is not easy to apply the existing security measures to FANET without modification. Thus, this paper proposes lightweight security measures applicable to FANET, which have distinct characteristics from existing ad hoc networks by utilizing PUF technology. The proposed security measures utilize unique values generated by non-replicable PUFs to increase the safety of AODV, FANET's reactive routing protocol, and are resistant to various attacks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3474-3497
• /
• 2016

Network Function Virtualization (NFV) and Software Defined Networking (SDN) are recently considered as very promising drivers of the evolution of existing middlebox services, which play intrinsic and fundamental roles in today's networks. To address the virtual service deployment issues that caused by introducing NFV or SDN to networks, this paper proposes an optimal solution by combining quantum genetic algorithm with cooperative game theory. Specifically, we first state the concrete content of the service deployment problem and describe the system framework based on the architecture of SDN. Second, for the service location placement sub-problem, an integer linear programming model is built, which aims at minimizing the network transport delay by selecting suitable service locations, and then a heuristic solution is designed based on the improved quantum genetic algorithm. Third, for the service amount placement sub-problem, we apply the rigorous cooperative game-theoretic approach to build the mathematical model, and implement a distributed algorithm corresponding to Nash bargaining solution. Finally, experimental results show that our proposed method can calculate automatically the optimized placement locations, which reduces 30% of the average traffic delay compared to that of the random placement scheme. Meanwhile, the service amount placement approach can achieve the performance that the average metric values of satisfaction degree and fairness index reach above 90%. And evaluation results demonstrate that our proposed mechanism has a comprehensive advantage for network application.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1436-1457
• /
• 2018

Secure routing services in Wireless Sensor Networks (WSNs) are essential, especially in mission critical fields such as the military and in medical applications. Additionally, they play a vital role in the current and future Internet of Things (IoT) services. Lightness and efficiency of a routing protocol are not the only requirements that guarantee success; security assurance also needs to be enforced. This paper proposes a Secure-Fuzzy Energy Aware Routing Protocol (S-FEAR) for WSNs. S-FEAR applies a security model to an existing energy efficient FEAR protocol. As part of this research, the S-FEAR protocol has been analyzed in terms of the communication and processing costs associated with building and applying this model, regardless of the security techniques used. Moreover, the Qualnet network simulator was used to implement both FEAR and S-FEAR after carefully selecting the following security techniques to achieve both authentication and data integrity: the Cipher Block Chaining-Message Authentication Code (CBC-MAC) and the Elliptic Curve Digital Signature Algorithm (ECDSA). The performance of both protocols was assessed in terms of complexity and energy consumption. The results reveal that achieving authentication and data integrity successfully excluded all attackers from the network topology regardless of the percentage of attackers. Consequently, the constructed topology is secure and thus, safe data transmission over the network is ensured. Simulation results show that using CBC-MAC for example, costs 0.00064% of network energy while ECDSA costs about 0.0091%. On the other hand, attacks cost the network about 4.7 times the cost of applying these techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.5062-5079
• /
• 2017

Malicious insider threats have increased recently, and methods of the threats are diversifying every day. These insider threats are becoming a significant problem in corporations and governments today. From a technology standpoint, detecting potential insider threats is difficult in early stage because it is unpredictable. In order to prevent insider threats in early stage, it is necessary to collect all of insiders' data which flow in network systems, and then analyze whether the data are potential threat or not. However, analyzing all of data makes us spend too much time and cost. In addition, we need a large repository in order to collect and manage these data. To resolve this problem, we develop an indicator-based behavior ontology (IB2O) that allows us to understand and interpret insiders' data packets, and then to detect potential threats in early stage in network systems including social networks and company networks. To show feasibility of the behavior ontology, we developed a prototype platform called Insider Threat Detecting Extractor (ITDE) for detecting potential insider threats in early stage based on the behavior ontology. Finally, we showed how the behavior ontology would help detect potential inside threats in network system. We expect that the behavior ontology will be able to contribute to detecting malicious insider threats in early stage.

• Journal of Information Processing Systems
• /
• v.12 no.2
• /
• pp.275-294
• /
• 2016

A primary task in wireless sensor networks (WSNs) is data collection. The main objective of this task is to collect sensor readings from sensor fields at predetermined sinks using routing protocols without conducting network processing at intermediate nodes, which have been proved as being inefficient in many research studies using a static sink. The major drawback is that sensor nodes near a data sink are prone to dissipate more energy power than those far away due to their role as relay nodes. Recently, novel WSN architectures based on mobile sinks and mobile relay nodes, which are able to move inside the region of a deployed WSN, which has been developed in most research works related to mobile WSN mainly exploit mobility to reduce and balance energy consumption to enhance communication reliability among sensor nodes. Our main purpose in this paper is to propose a solution to the problem of deploying mobile data collectors for alleviating the high traffic load and resulting bottleneck in a sink's vicinity, which are caused by static approaches. For this reason, several WSNs based on mobile elements have been proposed. We studied two key issues in WSN mobility: the impact of the mobile element (sink or relay nodes) and the impact of the mobility model on WSN based on its performance expressed in terms of energy efficiency and reliability. We conducted an extensive set of simulation experiments. The results obtained reveal that the collection approach based on relay nodes and the mobility model based on stochastic perform better.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.4
• /
• pp.77-82
• /
• 2020

Wireless sensor networks (WSNs) suffer from not only a short lifetime due to limited energy but also an energy imbalance between nodes close to the sink and others. In order to fundamentally solve the short lifetime, recent studies utilize the environmental energy such as solar power. Additionally, WSNs using mobile sinks are being studied to address the energy imbalance problem. This paper proposes an improved CTP (Collection Tree Protocol) scheme which uses these two approaches simultaneously. Basically, it is based on a CTP scheme which is a very popular data collection strategy designed for the typical battery-based WSNs with a fixed sink. Therefore, we tailored it for solar-powered WSNs with a mobile sink. Performance verification confirms that our scheme reduces the number of blackout nodes significantly compared to the typical CTP, thus increases the amount of data collected by the sink.

• Journal of the Korean Data and Information Science Society
• /
• v.7 no.1
• /
• pp.113-118
• /
• 1996

Principal component analysis(PCA) is an essential technique for data compression and feature extraction, and has been widely used in statistical data analysis, communication theory, pattern recognition, and image processing. Oja(1992) found that a linear neuron with constrained Hebbian learning rule can extract the principal component by using stochastic gradient ascent method. In practice real data often contain some outliers. These outliers will significantly deteriorate the performances of the PCA algorithms. In order to make PCA robust, Xu & Yuille(1995) applied statistical physics to the problem of robust principal component analysis(RPCA). Devlin et.al(1981) obtained principal components by using techniques such as M-estimation. The propose of this paper is to investigate from the statistical point of view how Xu & Yuille's(1995) RPCA works under the same simulation condition as in Devlin et.al(1981).