• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.340-347
• /
• 2007

Vehicle safety service can be effectively achieved with inter-vehicle communication technologies, in which moving vehicles transmit a safety related urgency information such as traffic accidents, sudden stops, obstacle appearance etc. They usually utilize a broadcast of message propagation method because the communicating vehicles are not known each other. The pure broadcasting scheme does not satisfy the requirements of vehicle safety communication service due to the transmission delay with frequent message collisions. To resolve this problem, this paper presents a group based propagation method for the multi-hop transmission, in order to deliver an urgency message to the reasonable size of vehicle troop. A group header is elected in considering of the position information of vehicles and radio transmission range. And a vehicle equivalent group is formed with the header. With benefits of the group based transmission, it is possible to minimize the unnecessary transmission and the possibility of message collisions. Simulation results show that the message propagation performance is so stable regardless of vehicle's congestion degree.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.163-170
• /
• 2003

In this paper we propose a robust clustered croup Multicast in Ad-hoc network. The proposed scheme applies to weighted clustered Algorithm. Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base station. In ad hoc network routing protocol because of limited bandwidth and high mobility robust, simple and energy consume minimal. WCGM method uses a base structure founded on combination weighted value and applies combination weight value to cluster header keeping data transmission by scoped flooding, which is the advantage of the exiting FGMP method. Because this method has safe and reliable data transmission, it shows the effect to decrease both overhead to preserve transmission structure and overhead for data transmission.

• Journal of Power Electronics
• /
• v.16 no.4
• /
• pp.1324-1335
• /
• 2016

This article explores the speed regulation problem of permanent magnet synchronous motor (PMSM) systems subjected to unknown time-varying disturbances. A continuous sliding mode control (CSMC) technique is introduced for the speed loop to enhance the robustness of PMSM systems and eliminate the chattering phenomenon caused by high-frequency switch function in the conventional control law. However, the high control gain of the CSMC law in the presence of strong disturbances leads to large steady-state speed fluctuations for PMSM systems. In many application fields, PMSM systems are affected by time-varying disturbances instead of constant disturbances. For example, electric bicycles are usually affected by changing environmental disturbances, including wind speeds, road conditions, etc. These disturbances may be in the form of constant, ramp, and parabolic disturbances. Hence, a generalized proportional integral (GPI) observer is employed to estimate these types of disturbances. Then, the disturbance estimation method and the aforementioned CSMC method are combined to establish a composite sliding mode control method called the CSMC+GPI method for the speed loop of PMSM systems. Contrary to the conventional sliding mode control technique, the proposed method completely eliminates the chattering phenomenon caused by the switching function in the conventional control law. Moreover, a small control gain for the CSMC+GPI method is chosen by feed-forwarding estimated values to the speed controller. Hence, the steady-state speed fluctuations are small. The effectiveness of the proposed control scheme is verified by simulation and experimental result.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.16-18
• /
• 2004

Single system image(SSI) have been the mainstay high-performance computing for many years. SSI requires the integration and aggregation of all types of resources in a cluster to present a single interface to users. In this paper, we describe a cluster computing architecture with the concept of single process space(SPS) where all processes share a uniform process identification scheme. With SPS, a process on any node can create child process on the same or different node or communicate with any other process on a remote node, as if they are on a single node. For this purpose, SPS is built with the support of unique cluster-wide pid, signal forwarding, and remote fork. We propose a novel design of SPS cluster which addresses the scalability and flexibility problem of traditional clusterwidely unique pid implementation by using blocked pid assignment. We have implemented this new design of SPS cluster, and we demonstrate its performance by comparing it to Beowulf distributed process space. Benchmark performance results show that our design of SPS cluster realized both scalability and flexibility that are essential to building SPS cluster.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.79-85
• /
• 2006

Generally, it is essential that high-speed routers, switches, and network security appliances should have an efficient packet classification scheme in order to achieve the high-speed packet forwarding capability. For the multi-gigabit packet-processing network equipment the high-speed content search hardware such as TCAM and search engine is recently used to support the content-based packet inspection. During the packet classification process, hundreds and thousands of rules are applied to provide the network security policies regarding traffic screening, traffic monitoring, and traffic shaping. In addition, these rules could be dynamically changed during operations of systems if anomaly traffic patterns would vary. Particularly, in the high-speed network, an efficient algorithm that updates and reorganizes the packet classification rules is critical so as not to degrade the performance of the network device. In this paper, we have proposed an efficient update algorithm using a partial-ordering that can relocate the dynamically changing rules at the TCAM. Experimental results should that our algorithm does not need to relocate existing rules feature until 70$\%$ of TCAM utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.706-714
• /
• 2010

In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing two-hop lookahead. However, the study might cause heavy message exchange overhead and high computing complexity to carry out obtainment of two-hop neighborhood speed information in the entire sensor nodes whether data are delivered or not. Moreover, although multi-hop lookahead provides the least deadline miss ratio, due to the restriction from the overhead and the complexity, the recent study merely adopts the two-hop lookahead manner. In this paper, we propose a novel real-time routing protocol that adopts on-demand neighborhood multi-hop information obtainments only around data forwarding paths. Simulation results prove that the proposed routing protocol offers better performances with respect to deadline miss ratio, total communication costs, energy efficiency, and network lifetime.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.120-129
• /
• 2010

MANET(Mobile Ad Hoc NETwork) is a collection of mobile nodes that are free to move and organize themselves in an arbitrary manner without any fixed infrastructures. These mobile nodes are connected by wireless links and act as routers for all other nodes in the network. As a router each node in MANET consumes its batteries when forwarding a message, and the selection of the best path to minimize the total power needed to route packets is needed to maximize the lifetime of all nodes. In this paper, we propose a routing protocol considering the remaining battery capacity of nodes in the routing paths. The proposed scheme prevents the battery of each node from being overused and increases the lifetime of the network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.93-106
• /
• 2011

In this paper we describe an efficient and easy to use internet stopper, which is called AINS (Automatic Internet Stopper), which uses ARP spoofing scheme. Instead of forwarding packets to router for the case of hacking, in ARP spoofing, the AINS ignores all the packets so that internet stopping operates. The AINS program needs to be installed only in manager computer that does not require additional agent program. In addition to setting manually the stopping computer list, it is able to indentify network nodes automatically by analyzing broadcasting packets. The experimental results show that less than 4 secs for spoofing interval is enough for blocking internet usage regardless the number of computers and therefore network overhead is negligible. The AINS can indentify and control network nodes not only on same subnet but also on different subnet only if they are connected onto same ethernet switch physically. It is being used for an efficient tool for controling internet usage of university computer laboratory and also for an efficient network management.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.7-12
• /
• 2014

The data forwarding transmission is an important function of the relay in cooperative communication in wireless communication systems. However, additional relay cause the waste of power consumption and cost. Therefore, in this paper, we consider how to use the user mobile devices in stead of relays to deal with this problem. In this paper, we proposed the protocol that divide each relay into two states of idle and non-idle. The receiver has two functions of base station and user mobile device. In this case, it is possible that no additional cost, and improve the spectral efficiency and network capacity. We verified BER performance for the proposed protocol over Rayleigh fading through Monte-Carlo simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.3
• /
• pp.27-36
• /
• 2012

With the increase of various user's requirements, lots of interesting applications on the Internet have been emerging recently. However, Internet has many limitations for providing upcoming new services because it was only designed to provide basic connectivity between research networks and simplified forwarding functions at the first time. Internet has many problems in the aspects of routing scalability, mobility, security and QoS, so lots of researches are being actively performed in many countries to solve these problems. In this paper, we implement RED(Random Early Detection) scheduler using NetFPGA platform and local testbed to provide active queue management. Using the implemented RED scheduler, packets are dropped according to the specified drop probability, so Global Synchronization coming from simultaneous TCP segment losses in a congestion condition can be prevented. With the comparison to the Drop-Tail scheme in the basic router, we show TCP performance can be enhanced in the congestion situation using the NetFPGA-based RED scheduler.