• Journal of the Korean Data and Information Science Society
• /
• v.22 no.6
• /
• pp.1153-1166
• /
• 2011

Detecting misbehavior in vehicular ad-hoc networks is very important problem with wide range of implications including safety related and congestion avoidance applications. Most misbehavior detection schemes are concerned with detection of malicious nodes. In most situations, vehicles would send wrong information because of selfish reasons of their owners. Because of rational behavior, it is more important to detect false information than to identify misbehaving nodes. In this paper, we propose the variable precision rough sets based misbehavior detection scheme which detects false alert message and misbehaving nodes by observing their action after sending out the alert messages. In the proposed scheme, the alert information system, alert profile is constructed from valid actions of moving nodes in vehicular ad-hoc networks. Once a moving vehicle receives an alert message from another vehicle, it finds out the alert type from the alert message. When the vehicle later receives a beacon from alert raised vehicle after an elapse of time, then it computes the relative classification error by using variable precision rough sets from the alert information system. If the relative classification error is lager than the maximum allowable relative classification error of the alert type, the vehicle decides the message as false alert message. Th performance of the proposed scheme is evaluated as two metrics: correct ratio and incorrect ratio through a simulation.

• Earthquakes and Structures
• /
• v.13 no.1
• /
• pp.59-66
• /
• 2017

Modern seismic codes rely on performance-based seismic design methodology which requires that the structures withstand inelastic deformation. Many studies have focused on the inelastic deformation ratio evaluation (ratio between the inelastic and elastic maximum lateral displacement demands) for various inelastic spectra. This paper investigates the inelastic response spectra through the ductility demand ${\mu}$, the yield strength reduction factor $R_y$, and the inelastic deformation ratio. They depend on the vibration period T, the post-to-preyield stiffness ratio ${\alpha}$, the peak ground acceleration (PGA), and the normalized yield strength coefficient ${\eta}$ (ratio of yield strength coefficient divided by the PGA). A new inelastic deformation ratio $C_{\eta}$ is defined; it is related to the capacity curve (pushover curve) through the coefficient (${\eta}$) and the ratio (${\alpha}$) that are used as control parameters. A set of 140 real ground motions is selected. The structures are bilinear inelastic single degree of freedom systems (SDOF). The sensitivity of the resulting inelastic deformation ratio mean values is discussed for different levels of normalized yield strength coefficient. The influence of vibration period T, post-to-preyield stiffness ratio ${\alpha}$, normalized yield strength coefficient ${\eta}$, earthquake magnitude, ruptures distance (i.e., to fault rupture) and site conditions is also investigated. A regression analysis leads to simplified expressions of this inelastic deformation ratio. These simplified equations estimate the inelastic deformation ratio for structures, which is a key parameter for design or evaluation. The results show that, for a given level of normalized yield strength coefficient, these inelastic displacement ratios become non sensitive to none of the rupture distance, the earthquake magnitude or the site class. Furthermore, they show that the post-to-preyield stiffness has a negligible effect on the inelastic deformation ratio if the normalized yield strength coefficient is greater than unity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2511-2517
• /
• 2009

Recently, a FMCW radar is used for the various purposes in the short range detection and tracking of targets. The main advantages of a FMCWradar are the comparative simplicity of implementation and the low peak power transmission characterizing the very low probability of signal interception. Since it uses the frequency modulated continuous wave for transmission and demodulation, the received beat frequency represents the range and Doppler information of targets. Detection and extraction of useful information from targets are performed in this beat frequency domain. Therefore, the resolution and accuracy in the estimation of a beat spectrum are very important. However, using the conventional FFT estimation method, the high resolution spectrum estimation with a low sidelobe level is not possible if the acquisition time is very short in receiving target echoes. This kind of problems deteriorates the detection performance of adjacent targets having the large magnitude differences in return echoes and also degrades the reliability of the extracted information. Therefore, in this paper, the model parameter estimation methods such as autoregressive and eigenvector spectrum estimation are applied to mitigate these problems. Also, simulation results are compared and analyzed for further improvement.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.569-578
• /
• 2003

Data dependencies are one of major hurdles to limit ILP(Instruction Level Parallelism), so several related works have suggested that the limit imposed by data dependencies can be overcome to some extent with use of the data value prediction. Hybrid value predictor can obtain the high prediction accuracy using advantages of various predictors, but it has a defect that same instruction has overlapping entries in all predictor. In this paper, we propose a new hybrid value predictor which achieves high performance by using the information of static and dynamic classification. The proposed predictor can enhance the prediction accuracy and efficiently decrease the prediction table size of predictor, because it allocates each instruction into single best-suited predictor during the fetch stage by using the information of static classification. Also, it can enhance the prediction accuracy because it selects a best- suited prediction method for the “Unknown”pattern instructions by using the dynamic classification mechanism. Simulation results based on the SimpleScalar/PISA tool set and the SPECint95 benchmarks show the average correct prediction rate of 85.1% by using the static classification mechanism. Also, we achieve the average correction prediction rate of 87.6% by using static and dynamic classification mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.12
• /
• pp.1310-1317
• /
• 2012

The Global Navigation Satellite System (GNSS) like US Global Positioning System (GPS) and EU Galileo are based on providing precise time and frequency synchronized ranging signals. Because of the exploitation of very precise timing signals these GNSS are used to provide both navigation and time distribution services. Moreover, because the positioning accuracy will improve as more satellites become available, we should expect that a combination of Galileo and GPS will provide better performance than those of both systems separately. However, Galileo will not use the same time reference as GPS and thus, a time difference arises - the GPS-Galileo Time Offset (GGTO). The navigation solution calculated by receivers using signals from both navigation systems will consequently contain a supplementary error if the GGTO is not accounted for. In this paper, we compared GPS Time (GPST) with Galileo Sytem Time (GST) and analyzed the effects of GGTO on positioning accuracy by simulation test. And then we also analyzed the characteristics of two representative GGTO correction methods such as the navigation message based method at system level and the estimation method at user level and propose the conceptual design of the novel correction method being capable of preventing previous method's problems.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.425-430
• /
• 2007

Without the aid of stationary infrastructure, maintaining routing information for all nodes is inefficient in the Mobile Ad hoc Networks(MANET). It is more efficient when every time routing information is necessary that the source node broadcasts a query message to neighbour nodes. The source node using Ad hoc On-Demand distance Vector(AODV), which is one of the routing protocols of MANET, uses the Expanding Ring Search(ERS) algorithm which finds a destination node efficiently. In order to reduce the congestion of the network, ERS algorithm does not broadcast Route REQuest(RREQ) messages in the whole network. When the timer expires, if source node does not receive Route REPly(RREP) messages from the destination node, it gradually increases TTL value and broadcasts RREQ messages. Existing AODV cost a great deal to find a destination node because it uses a fixed NODE_TRAVERSAL_TIME value. Without the message which is added in existing AODV protocols, this paper measures delay time among the neighbours' nodes by making use of HELLO messages. We propose Adaptive ERS(AERS) algorithm that makes NET_TRAVERSAL_TIME optimum which apply to the measured delay time to NODE_TRAVERSAL_TIME. AERS suppresses the unnecessary messages, making NET_TRAVERSAL_TIME optimum in this paper. So we will be able to improve a network performance. We prove the effectiveness of the proposed method through simulation.

• 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.12C no.3 s.99
• /
• pp.429-436
• /
• 2005

A mobile ad hoc network (MANET) is a collection of mobile nodes without any fixed infrastructure or my form of centralized administration such as access points and base stations. The ad hoc on-demand distance vector routing (AODV) protocol is an on-demand routing protocol for MANETs, which is one of the Internet-Drafts submitted to the Internet engineering task force (IETF) MANET working group. This paper proposes a new multipath routing protocol called maximally disjoint multipath AODV (MDAODV), which exploits maximally node- and link-disjoint paths and outperforms the conventional multipath protocol based on AODV as well as the basic AODV protocol. The key idea is to extend only route request (RREQ) message by adding source routing information and to make the destination node select two paths from multiple RREQs received for a predetermined time period. Compared to the conventional multipath routing protocol, the proposed MDAODV provides more reliable and robust routing paths and higher performance. It also makes the destination node determine the maximally node- and link-disjoint paths, reducing the overhead incurred at intermediate nodes. Our extensive simulation study shows that the proposed MDAODV outperforms the conventional multipath routing protocol based on AODV in terms of packet delivery ratio and average end-to-end delay, and reduces routing overhead.

• 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 KIISE:Computer Systems and Theory
• /
• v.32 no.3
• /
• pp.133-147
• /
• 2005

Various types of ray-tracing methods are used to predict the quantity measures of radiation illumination, the uniformity of illumination, radiation performance of LCD BLU(Hack-Light Unit). The uniformity of radiation illumination is one of the most important design factor of BLU and is usually controlled by the diffusive-ink pattern printed on the bottom of light-guide panel of BLU. Therefore it is desirable to produce an improved (ideally, the optimal) ink pattern to achieve the best uniformity of radiation illumination. In this paper, we applied the Welder-Mead simplex-search method among various direct search method to compute the optimal ink pattern. Direct search methods are widely used to optimize the functions which are often highly nonlinear, unpredictably discontinuous, and nondifferentiable, The ink-pattern controlling the uniformity of radiation illumination is one type of these functions. In this paper, we found that simplex search methods are well suited to computing the optimal diffusive-ink pattern. In extensive numerical testing, we have found the simplex search method to be reasonably efficient and reliable at computing the optimal diffusive-ink pattern. The result also suggests that optimization can improve the functionality of simulation tools which are used to design LCD BLU.