• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.17-23
• /
• 2016

In the future network such as Internet of Things (IoT), the number of computing devices are expected to grow exponentially, and each of the things communicates with the others and acquires information by itself. Due to the growing interest in IoT applications, the broadcasting in Opportunistic ad-hoc networks such as Machine-to-Machine (M2M) is very important transmission strategy which allows fast data dissemination. In distributed networks for IoT, the energy efficiency of the nodes is a key factor in the network performance. In this paper, we propose a fuzzy logic based probabilistic multi-hop broadcast (FPMCAST) algorithm which statistically disseminates data accordingly to the remaining energy rate, the replication density rate of sending node, and the distance rate between sending and receiving nodes. In proposed FPMCAST, the inference engine is based the fuzzy rule base which is consists of 27 if-then rules. It maps input and output parameters to membership functions of input and output. The output of fuzzy system defines the fuzzy sets for rebroadcasting probability, and defuzzification is used to extract a numeric result from the fuzzy set. Here Center of Gravity (COG) method is used to defuzzify the fuzzy set. Then, the performance of FPMCAST is evaluated through a simulation study. From the simulation, we demonstrate that the proposed FPMCAST algorithm significantly outperforms flooding and gossiping algorithms. Specially, the FPMCAST algorithm has longer network lifetime because the residual energy of each node consumes evenly.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.1-18
• /
• 2008

Because we can usually get many information through analyzing trajectories of moving objects on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks such as FNR-tree and MON-tree. Also, because FNR-tree and MON-tree store the segment unit of moving objects, they can't support the trajectory of whole moving objects. In this paper, we propose an efficient trajectory index structures based on signatures on a spatial network, named SigMO-Tree. For this, we divide moving object data into spatial and temporal attributes, and design an index structure which supports not only range query but trajectory query by preserving the whole trajectory of moving objects. In addition, we divide user queries into trajectory query based on spatio-temporal area and similar-tralectory query, and propose query processing algorithms to support them. The algorithm uses a signature file in order to retrieve candidate trajectories efficiently Finally, we show from our performance analysis that our trajectory index structure outperforms the existing index structures like FNR-Tree and MON-Tree.

• Horticultural Science & Technology
• /
• v.33 no.5
• /
• pp.751-762
• /
• 2015

This study was performed to investigate the stability of soil moisture in controlling air ventilation rate within a horizontal biofilter, and to compare removal efficiency (RE) of indoor air pollutants including fine dust, volatile organic compounds (VOCs), and formaldehyde (HCHO), depending on whether dieffenbachias (Diffenbachia amoena) were planted in the biofilter. The relative humidity, air temperature, and soil moisture contents showed stable values, regardless of the presence of D. amoena, and the plants grew normally in the biofilter. REs for number of fine dust particles (PM10 and PM2.5) within the biofilter filled with only soil were at least 30% and 2%, respectively. REs for number of fine dust particles (PM10 and PM2.5) within the biofilter including the plants were above 40% and 4%, respectively. RE for fine dust (PM10) weight was above 4% and 20%, respectively, in the biofilter containing only soil or soil together with plants. In the case of the biofilter filled with only soil, REs for xylene, ethylbenzene, toluene or total VOC (T-VOC) were each more than 63%; however, REs for benzene and formaldehyde (HCHO) were above 22% and 38%, respectively. In the biofilter with the plants, REs for xylene, ethylbenzene, toluene, and T-VOC were each above 72%, and REs for benzene and HCHO were above 39%. Thus, RE of the biofilter integrated with plants was found to be higher for volatile organic compounds than for fine dust. Hence, the biofilter was very effective for indoor air quality improvement and the effect was higher when integrated with plants.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.413-424
• /
• 2009

Wireless sensor network is based on an event driven system. Sensor nodes collect the events in surrounding environment and the sensing data are relayed into a sink node. In particular, when events are detected, the data sensing periods are likely to be shorter to get the more correct information. However, this operation causes the traffic congestion on the sensor nodes located in a routing path. Since the traffic congestion generates the data queue overflows in sensor nodes, the important information about events could be missed. In addition, since the battery energy of sensor nodes exhausts quickly for treating the traffic congestion, the entire lifetime of wireless sensor networks would be abbreviated. In this paper, a new congestion control method is proposed on the basis of genetic algorithm. To apply genetic algorithm, the data traffic rate of each sensor node is utilized as a chromosome structure. The fitness function of genetic algorithm is designed from both the average and the standard deviation of the traffic rates of sensor nodes. Based on dominant gene sets, the proposed method selects the optimal data forwarding sensor nodes for relieving the traffic congestion. In experiments, when compared with other methods to handle the traffic congestion, the proposed method shows the efficient data transmissions due to much less queue overflows and supports the fair data transmission between all sensor nodes as possible. This result not only enhances the reliability of data transmission but also distributes the energy consumptions across the network. It contributes directly to the extension of total lifetime of wireless sensor networks.

• Journal of Korea Multimedia Society
• /
• v.5 no.4
• /
• pp.372-385
• /
• 2002

In this paper, we propose an efficient buffer replacement method for the real-time multimedia data. The proposed method has multi level priority to consider the real-time characteristics. Each priority level is divided into a cold data set that is likely to be referenced for the first time and a hot data set that is likely to be re-referenced. An operation to select the victim data is sequentially executed from the cold set with the minimum priority level to the hot set with the maximum Priority level. It is chosen only at the lower level than or equal to the priority of the transaction that requests a buffer allocation. In the cold set, our method selects a media that has the maximum size in the level for a target of victim first of all. And in the hot set, our method selects a medium that has the maximum interval of the reference first of all. Since it maintains many popular media in the limited buffer space, the buffer hit ratio is increased. It also manages many service requests. As a result, our method improves the overall performance of the system. We compare the proposed method with the Priority-Hints method in terms of the buffer hit ratio and the deadline missing ratio of transactions. It is shown through the performance evaluation that our method outperforms the existing methods.

• Journal of Korea Multimedia Society
• /
• v.16 no.1
• /
• pp.100-107
• /
• 2013

As the eBook market grows fast recently, various eBook viewer solutions such as hardware viewers and software readers came out to the market. We can, however, hardly find mobile eBook interfaces for the reading disabled people who have difficulties in reading for their visual impairment or learning disabilities, or dyslexia. An eBook viewer interfaces for the reading disabled people should be carefully and distinctively designed because the reading disabled people cannot use normal versions of eBook viewer. In this paper, we suggest a eBook viewer interface model to make the reading disabled people read eBooks easily. Depending on the type of the reading disabled people: the full blind, the almost blind, the just learning disabled, our model provides an adaptive interface to make them read eBooks effectively. In addition, unlike the existing simple audio books, we also support annotation systems to make the reading disabled people interact with eBook viewer. To show the effectiveness of our model, we implemented an eBook viewer prototype on an android-based mobile device. We are sure that our model and implementation can make the reading disabled people, who is 10% of all the domestic people, read eBooks effectively.

• Journal of Advanced Navigation Technology
• /
• v.7 no.1
• /
• pp.38-50
• /
• 2003

In this paper, a new high resolution reflectometry scheme, time-frequency domain reflectometry (TFDR), is proposed to detect and locate fault in wiring. Traditional reflectometry methods have been achieved in either the time domain or frequency domain only. However, time-frequency domain reflectometry utilizes time and frequency information of a transient signal to detect and locate the fault. The time-frequency domain reflectometry approach described in this paper is characterized by time-frequency reference signal design and post-processing of the reference and reflected signals to detect and locate the fault. Design of the reference signal in time-frequency domain reflectometry is based on the determination of the frequency bandwidth of the physical properties of cable under test. The detection and estimation of the fault on the time-frequency domain reflectometry relies on the time-frequency domain reflectometry is compared with commercial time domain reflectomtery (TDR) instrument. In these experiments provided in this paper, TFDR locates the fault with smaller error than TDR. Knowledge of time and frequency localized information for the reference and reflected signal gained via time-frequency analysis, allows one to detect the fault and estimate the location accurately.

• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.265-278
• /
• 2011

The objective of this paper is to analyze and characterize end-to-end packet statistics after modeling and simulation of WiFi (IEEE 802.11g) and WiMAX (IEEE 802.16e) of a virtual wireless network using OPNET Modeler Wireless Suite. Wireless internal and external network simulators such as Remcom's Wireless InSite Real Time (RT) module, WinProp: W-LAN/Fixed WiMAX/Mobile WiMAX, and SMI system, are designed to consider data transfer rate based on wireless propagation signal strength. However, we approached our research in a different perspective without support for characteristic of these wireless network simulators. That is, we will discuss the purpose of a visual analysis for these packets, how to receive each point packets (e.g., wireless user, base station or access point, and http server) through end-to-end virtual network modeling based on integrated wired and wireless network without wireless propagation signal strength. Measuring packet statistics is important in QoS metric analysis among wireless network performance metrics. Clear packet statistics is an especially essential metric in guaranteeing QoS for WiMAX users. We have found some interesting results through modeling and simulation for virtual wireless network using OPNET Modeler Wireless Suite. We are also able to analyze multi-view efficiency through experiment/observation result.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.4
• /
• pp.79-86
• /
• 2016

About 75% of software security incidents are caused by software vulnerability. In addition, the after-market repairing cost of the software is higher by more than 30 times than that in the design stage. In this background, the secure coding has been proposed as one of the ways to solve this kind of maintenance problems. Various institutions have addressed the weakness patterns of the standard software. A new Korean programming language Saesark has been proposed to resolve the security weakness on the language level. However, the previous study on Saesark can not resolve the security weakness caused by the API. This paper proposes a way to resolve the security weakness due to the API. It adopts a static analyzer inspecting dangerous methods. It classifies the dangerous methods of the API into two groups: the methods of using tainted data and those accepting in-flowing tainted data. It analyses the security weakness in four steps: searching for the dangerous methods, configuring a call graph, navigating a path between the method for in-flowing tainted data and that uses tainted data on the call graph, and reporting the security weakness detected. To measure the effectiveness of this method, two experiments have been performed on the new version of Saesark adopting the static analysis. The first experiment is the comparison of it with the previous version of Saesark according to the Java Secure Coding Guide. The second experiment is the comparison of the improved Saesark with FindBugs, a Java program vulnerability analysis tool. According to the result, the improved Saesark is 15% more safe than the previous version of Saesark and the F-measure of it 68%, which shows the improvement of 9% point compared to 59%, that of FindBugs.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.327-336
• /
• 2004

For visual inspection system in real industrial environment, it is one of most important tasks to design fast and stable pattern matching algorithm. This paper presents an edge-based point correlation algorithm avoiding full search in visual inspection system. Conventional algorithms based on NGC(normalized gray-level correlation) have to overcome some difficulties for applying to automated inspection system in factory environment. First of all, NGC algorithms need high time complexity and thus high performance hardware to satisfy real-time process. In addition, lighting condition in realistic factory environments if not stable and therefore intensity variation from uncontrolled lights gives many roubles for applying directly NGC as pattern matching algorithm in this paper, we propose an algorithm to solve these problems from using thinned and binarized edge data and skipping full point search with edge-map analysis. A point correlation algorithm with the thinned edges is introduced with image pyramid technique to reduce the time complexity. Matching edges instead of using original gray-level pixel data overcomes NGC problems and pyramid of edges also provides fast and stable processing. All proposed methods are preyed from experiments using real images.