• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.4
• /
• pp.53-64
• /
• 2009

Inter-vehicular communication that propagates information without infrastructures has drawn a lot of interest. However, it is difficult to apply conventional ad-hoc routing protocols directly in inter-vehicular communication due to frequent changes in the network topology caused by high mobility of the vehicles. MMFP(Multi-hop MAC Forwarding) is a unicast forwarding protocol that transport packets based on the reachability information instead of path selection or position information. However, delivering public safety messages informing road conditions such as collision, obstacles and fog through inter-vehicular communication requires broadcast rather than unicast since these messages contain information valuable to most drivers within a close proximity. Flooding is one of the simplest methods for multi-hop broadcast, but it suffers from reduced packet delivery-ratio and high transmission delay due to an excessive number of duplicated packets. This paper presents two multi-hop broadcast protocols for inter-vehicular communication that extend the MMFP. UMHB(Unreliable Multi-Hop Broadcast) mitigates the duplicated packets of MMFP by limiting the number of nodes to rebroadcast packets. UMHB, however, still suffers from low delivery ratio. RMHB(Reliable Multi-Hop Broadcast) uses acknowledgement and retransmission in order to improve the reliability of UMHB at the cost of increase in transmission delay, which we show through simulation is within an acceptable range for collision avoidance application.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.7
• /
• pp.914-919
• /
• 2004

When the motor is rotating, the torque and rpm are varying as the loads or the driving status connecting through reduction units are changing. On the contrary, one can monitor the changes of the loads or the driving status in the manner of measuring motor torque and rpm. There is a torque measuring method using the strain gauge and bridge circuit. But, because this is the contact method, it has the life time which is dependent on rotating velocity and used time. So this system demands on replacement of some Parts or whole system itself for maintenance. And this system is also relatively big and expensive, requiring preceding annoying process. In this paper, we are going to suppose non-contact method to measure torque and rpm using the Hall effects sensor For this we have made the planetary geared reduction motor with Hall sensors and with the monitoring system. The monitoring system displays the sensing data(torque, rpm) and calculated data( power) and also has the network capability with Bluetooth protocol. Our solution is much more inexpensive ;md simple method to measure torque and rpm than before.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.110-122
• /
• 1993

When voice is transmitted through packet switching network, there needs a overload control, that is, a control for the congestion which lasts short periods and occurrs in local extents. In this thesis, we analyzed the performance of the statistical packet voice multiplexer using the overload control strategy by bit dropping. We assume that the voice is coded accordng to (4,2) embedded ADPCM and that the voice packet is generated and transmitted according to the procedures in the CCITT recomendation G. 764. For the performance analysis, we must model the superposed packet arrival process to the multiplexer as exactly as possible. It is well known that interarrival times of the packets are highly correlated and for this reason MMPP is more suited for the modelling in the viewpoint of accuracy. Hence the packet arrival process in modeled as MMPP and the matrix geometric method is used for the performance analysis. Performance analysis is similar to the MMPP IG II queueing system. But the overload control makes the service time distribution G dependent on system status or queue length in the multiplexer. Through the performance analysis we derived the probability generating function for the queue length and using this we derived the mean and standard deviation of the queue length and waiting time. The numerical results are verified through the simulation and the results show that the values embedded in the departure times and that in the arbitrary times are almost the same. Results also show bit dropping reduces the mean and the variation of the queue length and those of the waiting time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2181-2190
• /
• 1997

The synchronous stream cipher has the problem of synchronization loss by cycle slip. Synchronization loss make the state which sender and receiver can't communicate and it may make the receiving system disordered. To lessen the risk, we usually use a continuous resynchronization which achieve resynchronization at fixed timesteps by inserting synchronization pattern and session key. While we can get effectively resynchronizationby continuous resynchronization, there are some problems. In this paper, we proposed an adaptive resynchronization algorithm for cipher system using LAPB protocol. It is able to solve the problem of the continunous resynchronization.The proposed adaptive algorithm make resynchronization only in the case that the resynchronization is occurred by analyzing the address field of LAPB. It measure the receiving rate of the address field in the decesion duration. If the receiving rate is smaller than threshold value, it make resynchronization or not. By using adaptively resynchronization, it solves the problems of continunous resynchronization. When the proposed adaptive algorithm is applied to the synchronous stream cipher system which is used in X.25 packet network, it reduced the time for resynchronization by ten times. It means that 11.3% of total data for transmit is compressed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.109-117
• /
• 2010

Building a large-scale testbed for Future Internet is very important to evaluate a new protocol and new network architecture designed by clean-slate approach. In Korea, new Future Internet testbed project, called FIRST (Future Internet Research for Sustainable Testbed), has been started since Mar. 2009 to design and test new protocols. This project is working together with ETRI and 5 universities. The FIRST@PC is to implement a virtualized hardware-accelerated PC-node by extending the functions of NetFPGA card and build a Future Internet testbed on the KOREN and KREONET for evaluating newly designed protocols and interesting applications. In this paper, we first briefly introduce FIRST@PC project and explain a 'MAC in IP Capsulator' user-space program using raw-socket in Linux to interconnect OpenFlow enabled switch sites on the KOREN and KREONET. After that, we address test results for TCP throughput performance for varying packet size. The test results show that the software based capsulator can support a reasonable bandwidth performance for most of applications.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.8
• /
• pp.74-85
• /
• 2015

PCI Express is a well-known and widely used de-facto system bus standard for connecting among a processor and IO devices. PCI Express is originated from old PCI standard, and its most of applications are limited to be used within a PC or server system. But, because of its fast speed, low power consumption, and good protocol efficiency, it is considered as one of a good candidate for an alternate system interconnect for many years. In this paper, we present design, implementation and early evaluation of an alternate system interconnect by utilizing PCI Express. The developed alternate system interconnect using PCI Express (named PCIeLINK) utilizes non-transparent bridging (NTB) technic which generally used in fail-over system in PCI and PCI Express. By using NTB technic, PCI Express device can be extended to outside of a system without electrical and logical problems arising during system boot and enumeration. To build up an alternate system interconnect, we designed and implemented a network interface card having multiple PCI Express ${\times}4$ connections (theoretically 20 Gbps) and tested, The early test results revealed that an ${\times}4$ port in the card showed 8.6 Gbps peak performance for bulk transmission and 5.1 Gbps peak for normal TCP/IP transfer.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.9
• /
• pp.144-155
• /
• 2013

This paper presents a low-cost remote power-quality-failure monitoring system (RPMS) using Android App and TI MCU (micro-controller unit), which is appliable to a micro-grid. The designed RPMS testbed consists of smart nodes, a server, and Android APPs. Especially, the C2000-series MCU-based RPMS smart node that is low-cost compared to existing monitoring systems has both a signal processing function for power signal processing and a data transmission function for power-quality monitoring data transmission. The signal processing function implements both a wavelet-based power failure detection algorithm including sag, swell, and interruption, and a FFT-based power failure detection algorithm including harmonics such that reliable and real-time power quality monitoring is guaranteed. The data transmission function implements a low-complexity RPMS transmission protocol and defines a simple data format (msg_Diag) for power monitoring message transmission. We may watch the monitoring data in real time both at a server and Android phone Apps connected to the WiFi network (or WAN). We use RS-232 (or Bluetooth) as the wired (or wireless) communication media between a server and nodes. We program the RPMS power-quality-failure monitoring algorithm using C language in the CCS (Code Composer Studio) 3.3 environment.

• Journal of Korean Society of Forest Science
• /
• v.101 no.3
• /
• pp.365-373
• /
• 2012

This study purposed to extract and assess the accuracy of assessment for deforestation area in Wonju city using medium resolution satellite image. The total size of deforestation area during the last nine years (2000-2008) was about 467 ha, and it was occurred annually about 52 ha. The most frequent form of deforestation was settlements (72%). Ninety percent of the size of deforestation was less than 2 ha in size. In addition, 79 percent of deforestation area was found within 500 m from the road network and within 100 m of the Forest/Non-forest boundary. This study compared the deforestation based on the administrative information (GIS deforestationI) with the deforestation (RS deforestation) extracted from the satellite imagery by vegetation indices (NDVI, NBR, NDWI). Extraction accuracy, mean-standard deviation${\times}1.5$ applied 3 by 3 filtering, showed reliable accuracy 35.47% k-value 0.20. However, error could be occurred because of the difference of land-use change and land-cover change. The actual rate of land-cover change deforestation area was 32% on administrative information. The 7.52% of forest management activities area was misjudged as deforestation by RS deforestation. Finally, the comparison of land-cover change deforestation (GIS deforestationII) with the RS deforestation accuracy, as a result NDVI mean-standard deviation${\times}2$ applied 3 by 3 filtering, showed improved accuracy 61.23%, k-value 0.23.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.47-54
• /
• 2004

The growth of computer resource and network speed has increased requests for the use of remotely located computer systems by connecting through computer networks. This phenomenon has hoisted research activities for application service provision that uses server-based remote computing paradigm. The server-based remote computing paradigm has been developed as the ASP (Application Service Provision) model, which provides remote users through application sharing protocol to application programs. Security requirement such as confidentiality, availability, integrity should be satisfied to provide ASP service using centralized computing system. Existing Telnet or FTP service for a remote computing systems have satisfied security requirement by a simple access control to files and/or data. But windows-based centralized computing system is vulnerable to confidentiality, availability, integrity where many users use the same application program installed in the same computer. In other words, the computing system needs detailed security level for each user different from others, such that only authorized user or group of users can run some specific functional commands for the program. In this paper, we propose windows based centralized computing system that sets security policies for each user for the use of instructions of the application programs, and performs access control to the instructions based on the security policies. The system monitors all user messages which are executed through graphical user interface by the users connecting to the system. Ail Instructions, i.e. messages, for the application program are now passed to authorization process that decides if an Instruction is delivered to the application program based on the pre-defined security polices. This system can be used as security clearance for each user for the shared computing resource as well as shared application programs.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.274-280
• /
• 2011

Due to their rapid growth and new paradigm applications, wireless sensor networks(WSNs) are morphing into low power personal area networks(LoWPANs), which are envisioned to grow radically. The fragmentation and reassembly of IP data packet is one of the most important function in the 6LoWPAN based communication between Internet and wireless sensor network. However, since the 6LoWPAN data unit size is 102 byte for IPv6 MTU size is 1200 byte, it increases the number of fragmentation and reassembly. In order to reduce the number of fragmentation and reassembly, this paper presents a new scheme that can be applicable to 6LoWPAN. When a fragmented packet header is constructed, we can have more space for data. This is because we use 8-bits routing table ill instead of 16-bits or 54-bits MAC address to decide the destination node. Analysis shows that our design has roughly 7% or 22% less transmission number of fragmented packets, depending on MAC address size(16-bits or 54-bits), compared with the previously proposed scheme in RFC4944. The reduced fragmented packet transmission means a low power consumption since the packet transmission is the very high power function in wireless sensor networks. Therefore the presented fragmented transmission scheme is well suited for low-power wireless sensor networks.