• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.8
• /
• pp.543-554
• /
• 2013

Model-Driven Development(MDD) helps developers verify requirements and design issues of a software system in the early stage of development process by taking advantage of a software model which is the most highly abstracted form of a software system. In practice, however, many software systems have been developed through a code-centric method that builds a software system bottom-up rather than top-down. So, without support of appropriate tools, it is not easy to introduce MDD to real development process. Although there are many researches about extracting a model from code to help developers introduce MDD to code-centrically developed system, most of them only extracted base-level models. However, using concept of abstract component one can continuously extract higher level model from base-level model. In this paper we propose a practical method for automatic extraction of base level abstract component from source code, which is the first stage of continuous extraction process of abstract component, and validate the method by implementing an extraction tool based on the method. Target code chosen is the source code of TinyOS, an operating system for wireless sensor networks. The tool is applied to the source code of TinyOS, written in nesC language.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.6
• /
• pp.65-71
• /
• 2017

Digital images and videos are subject to various types of noise during storage and transmission. Among these noises, Salt & Pepper noise degrades the compression efficiency of the original data and causing deterioration of performance in edge detection or segmentation used in an image processing method. In order to mitigate this noise, there are many filters such as Median Filter, Weighted Median Filter, Center Weighted Median Filter, Switching Weighted Median Filter and Adaptive Median Filter. However these methods are inferior in performance at high noise density. In this paper we propose a new type of filter for noise mitigation in wireless communication environment where Salt & Pepper noise occurs. The proposed filter detects the location of the damaged pixel by Salt & Pepper noise detection and mitigates the noise by using adjacent pixel values which are not damaged in a certain area. Among the proposed filters, the performance of the filter using the $3{\times}3$ error mask is compared with that of the conventional methods and it is confirmed that when density of noise in the image is 95%, their performances are improved as 13.24 dB compared to MF and 13.09 dB compared to AMF.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10C
• /
• pp.967-983
• /
• 2003

In wireless spread-spectrum communication systems utilizing PN (pseudo noise) sequences, a variety of noise sources from the channel affect the data reception performance. Among them, in this paper we are concerned with the narrowband interference that may arise from the use of the spectral bands overlapped by the existing narrowband users or the intentional jammers as in military communication. The effect of this interference can be reduced to some extent at the receiver with the PN demodulation by processing gain. It is known, however, that when the interferers are strong, the reduction cannot be sufficient and thereby requiring the extra use of narrowband interference cancellers (NIC's) at the receivers. A class of adaptive NIC's are studied here based on different two cost functions. One is the chip mean-squared error (MSE) computed prior to the PN demodulation and used in the conventional cancellers. Since thses conventional cancellers should be operated at the chip rate, the computational requirements are enormous. The other is the symbol MSE computed after the PN demodulation in which case the weights of the NIC's can be updated at a lot lower symbol rate. To compare the performance of these NIC's, we derive a common measure of performance, i.e., the symbol MSE after the PN demodulation. The analytical results are verified by computer simulation. As a result, it is shown that the cancellation capability of the symbol-rate NIC's are similar or better than the conventional one while the computational complexity can be reduced a lot.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11B
• /
• pp.1501-1509
• /
• 2001

Recently, the use of wireless communication systems has been rapidly increasing, which results in a difficult problem in efficient control of limited frequency resources. As a way of solving this problem, the ultra wideband time hopping impulse radio system attracts much attention. The impulse radio system communicates pulse position modulated data using Gaussian monocycle pulses of very short duration less than 1 nsec. Thus the transmitted signal has very low power spectral density and ultra wide bandwidth from near D.C. to a few GHz. It is blown that it hardly interferes with the existing communication systems because of its very low power spectral density. The purpose of this paper is to characterize multipath propagation of the impulse radio signal and to evaluate the performance of the correlator-based receiver for the multipath environments. In this paper, we consider the deterministic two-path model and the statistical indoor multipath model of Saleh and Valenzuela. For the two-path model the output of the correlator with the ideal reference waveform varies according to the relative difference between the indirect path delay and the time interval of PPM, and to the indirect path gains. In addition, the characteristics of bit error rates is measured for the two models through computer simulation. The simulation results indicate that the performance of the impulse radio system depends both on the relative difference between the indirect path delay and the time interval of PPM, and on the indirect path gains. Furthermore, it is observed that the reference signal designed for the AWGN channel can not be applied to the multipath channels.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.67-76
• /
• 2020

With the fast development in wireless communications and vehicular technologies, vehicular ad hoc networks (VANETs) have enabled to deliver data between vehicles. Recently, VANETs introduce a Vehicular Cloud (VC) model for collaborating to share and use resources of vehicles to create value-added services. To construct a VC, a vehicle should search vehicles that intend to provide their own resource. The single-hop search cannot search enough provider vehicles due to a small coverage and non-line-of-sights of communications. On the other hand, the multi-hop search causes very high traffics for large coverage searching and frequent connection breakages. Recently, many Roadside Units (RSUs) have been deployed on roads to collect the information of vehicles in their own coverages and to connect them to Internet. Thus, we propose a RSU-aided vehicular resource search and cloud construction mechanism in VANETS. In the proposed mechanism, a RSU collects the information of location and mobility of vehicles and selects provider vehicles enabled to provide resources needed for constructing a VC of a requester vehicle based on the collected information. In the proposed mechanism, the criteria for determining provider vehicles to provide resources are the connection duration between each candidate vehicle and the requester vehicle, the resource size of each candidate vehicle, and its connection starting time to the requester vehicle. Simulation results verify that the proposed mechanism achieves better performance than the existing mechanism.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.73-78
• /
• 2002

In WATM networks, in order to perform dynamic slot allocation required slots of mobile terminals are estimated based on DP (Dynamic Parameter) reflecting characteristics of traffic. In VBR (Variable Bit Rate) traffic, slot allocation is done at MT considering both time-dependent characteristics and QoS (Quality of Service) requirements. In this paper, DPs-buffer state information and buffer state change-are transmitted through in-band signaling. BS (Base Station) performs dynamic slot allocation considering traffic characteristics of each MT (Mobile Terminal), in other words, buffer state information informs the potentiality of 'buffer full state'to BS if MT buffer is over the specific threshold value and buffer state change notifies change in buffer state of incoming cells to MT. If buffer state information is equal to 'low (more than threshold)' and 'abrupt increase' it generates 'buffer full' state cell transmission delay or cell loss might occur. At this time BS should assign additional slots to MT, and then MT consumes cells in its buffer. In simulation, the proposed scheme shows better performance in cell delay and loss than EPSA (Estimation-Prorated Slot Assignment) in-band scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.1960-1972
• /
• 2006

In this thesis, GPS and the electronic mapping were used to realize such a system by recognizing license plate numbers and identifying the location of objects that move at synchronous times with simulated movement in the electronic map. As well, throughout the study, a camera attached to a PDA, one of the mobile devices, automatically recognized and confirmed acquired license plate numbers from the front and back of each cu. Using this mobile technique in a wireless network searches for specific plate numbers and information about the location of the car is transmitted to a remote sewer. The use of such a GPS-based system allows for the measurement of topography and the effective acquisition of a car's location. The information is then transmitted to a central controlling center and stored as text to be reproduced later in the form of diagrams. Getting positional information through GPS and using image-processing with a PDA makes it possible to estimate the correct information of a car's location and to transmit the specific information of the car to a control center simultaneously, so that the center will get information such as type of the cu, possibility of the defects that a car might have, and possibly to offer help with those functions. Such information can establish a mobile system that can recognize and accurately trace the location of cars.

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

VANET is one of the most developed technologies many people have considered a technology for the next generation. It basically utilizes the wireless technology and it can be used for measuring the speed of the vehicle, the location and even traffic control. With sharing those information, VANET can offer Cooperative ITS which can make a solution for a variety of traffic issues. In this way, safety for drivers, efficiency and mobility can be increased with VANET but data between vehicles or between vehicle and infrastructure are included with private information. Therefore alternatives are necessary to secure privacy. If there is no alternative for privacy, it can not only cause some problems about identification information but also it allows attackers to get location tracking and makes a target. Besides, people's lives or property can be dangerous because of sending wrong information or forgery. In addition to this, it is possible to be information stealing by attacker's impersonation or private information exposure through eavesdropping in communication environment. Therefore, in this paper we propose Privacy Assurance Architecture for VANET to ensure privacy from these threats.

• Journal of Korea Multimedia Society
• /
• v.9 no.5
• /
• pp.595-605
• /
• 2006

In this thesis, GPS and the electronic mapping were used to realize such a system by recognizing license plate numbers and identifying the location of objects that move at synchronous times with simulated movement in the electronic map. As well, throughout the study, a camera attached to a PDA, one of the mobile devices, automatically recognized and confirmed acquired license plate numbers from the front and back of each car. Using this mobile technique in a wireless network, searches for specific plate numbers and information about the location of the car is transmitted to a remote server. The use of such a GPS-based system allows for the measurement of topography and the effective acquisition of a car's location. The information is then transmitted to a central controlling center and stored as text to be reproduced later in the form of diagrams. Getting positional information through GPS and using image-processing with a PDA makes it possible to estimate the correct information of a car's location and to transmit the specific information of the car to a control center simultaneously, so that the center will get information such as type of the car, possibility of the defects that a car might have, and possibly to offer help with those functions. Such information can establish a mobile system that can recognize and accurately trace the location of cars.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.2
• /
• pp.103-112
• /
• 2010

In sensor networks, because sensors are deployed in an unprotected environment, they are prone to be targets of compromise attack, If the number of compromised nodes increases considerably, the key management in the network is paralyzed. In particular, compromise of Cluster Heads (CHs) in clustered sensor networks is much more threatening than that of normalsensors. Recently, rekeying schemes which update the exposed keys using the keys unknown to the compromised nodes are emerging. However, they cause some security and efficiency problems such as single group key employment in a cluster, passive eviction of compromised nodes, and excessive communication and computation overhead. In this paper, we present a proactive rekeying scheme using renewals of duster organization for clustered sensor networks. In the proposed scheme, each sensor establishes individual keys with neighbors at network boot-up time, and these keys are employed for later transmissions between sensors and their CH. By the periodic cluster reorganization, the compromised nodes are expelled from network and the individual keys employed in a cluster are changed continuously. Besides, newly elected CHs securely agree a key with sink by informing their members to sink, without exchangingany keying materials. The simulation results shows that the proposed scheme remarkably improves the confidentiality and integrity of data in spite of the increase of compromised nodes. Also, they show that the proposed scheme exploits the precious energy resource more efficiently than SHELL.