• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1754-1766
• /
• 1993

The application of VXIbus system, an Industry standard, is rapidly spreading with its ability to offer the easiness of integration from GPIB and the fast data transmission from VMEbus system. Compared with VXIbus Register Based Device, VXIbus Message Based Device has a drawback In the aspect of speed. But it is possible to utilize high level ASCII commands to control a Message Based Device, therefore system integration is much easier with Message Based Device than with Register Based Device. And, the FFT analyzer is an instrument for signal analysis which can be inexpensively implemented to be fast and have high resolution. Its wide ability of analysis presents numerous application. So, it is necessary to apply VXIbus system to FFT analyzer. In this paper, the implementation of FFT analyzer is performed using a DSP module and by implementing all A/D conversion circuit and a control module which performs VXIbus interface. The device can be controlled by Slot0 Commender which supports VXIbus Shared Memory Protocol through VXIbus.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.526-535
• /
• 2010

In this paper, we propose the fault-tolerant network-based mobility management scheme for supporting multimedia services of broadcasting & communications convergence in fixed mobile convergence (FMC) networks. The proposed scheme is based on AIMS (Access Independent Mobility Service) which is developed for the mobility support among heterogeneous access networks. To support stable location management and handover control for a MN, the proposed scheme supports stable management of binding information by sensing network attachment and detachment of a mobile node (MN). In addition, the proposed fault-tolerant (FT) AIMS supports a function of message retransmission for the support of handover control message and a function of heartbeat message transmission for the support of stable access network environments to a mobile node. We evaluate and analyze the performance of the proposed scheme through the implementation of AIMS system test-bed.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.75-81
• /
• 2012

This paper has proposed Message Count Control Mechanism based Link State Update(LSU) Algorithm that has not had a strong influence on the depreciation of QoS routing performance. Most existing LSU algorithms have the limit that cannot control the count of LSU message. Especially, adaptive algorithms have a bad performance when traffic are excessive and fickle. We classify as the importance of LSU message that have a influence on available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.1-8
• /
• 2021

In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.3
• /
• pp.125-133
• /
• 2002

In this paper, we present an efficient broadcast protocol, called Btoken, that ensures total ordering of messages and atomicity of delivery in the large scaled distributed systems. Unlike the existing token-passing based protocol, Btoken does not circulate a token around the ring, instead, it uses three kinds of control messages for token transmission. The token has a sequence number field for broadcasting message, and the only site having the token can broadcast a message. When a site wishes to broadcast, It must send a message to the token site requesting the token. The token site sends a message with the token to the requester When the requester receives the token, it becomes the current token site and broadcasts a new message after setting sequence number derived from a field of the token into its message. Upon reception of it, any operating member is informed the position of the token site and will send token requesting message to the new token site. However, the other site may request the token to the old token site prior to receiving the broadcast message from the new token site. To resolve this problem, Btoken uses a message which is sent to the current token site by the old token site notifying who is the next token requester. Results of our simulation of the protocol show that Btoken is more efficient in the large scaled distributed system compared to existing broadcast protocols.

• Smart Media Journal
• /
• v.3 no.3
• /
• pp.9-14
• /
• 2014

The increasing number of ECUs in automobiles causes the CAN bus overloaded and consequently the error probability of data transmission increases. Since the time duration for the data transmission is proportional to CAN frame length, it is desirable to reduce the frame length. In this paper, we present a CAN message compression method using Data Length Code (DLC) and bit rearrangement. By simulations using actual CAN data, it is shown that the CAN transmission data is reduced up to 54 % by the proposed method, compared with conventional methods.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.5
• /
• pp.25-34
• /
• 1997

Relatively slow tuning speed of optical device causes the unwanted delay in high speed single-hop multiwavelength networks. To lessen the overhead, we present a channel access protocol with dynamjic message scheduling. Th eframe structure of proposed protocol adopts hybrid multiaccess scheme in which WDMA is used as a basic multiaccess technique and TDMA is used to provide subchannels within a wavelength band. This architecture has two merits : the network extention is not limited by available number of wavelengths, and the transmission delay caused by optical device tuning time can to minimize the number of tunings. It schedules messages that require same wavelength channels sequencely, so the total transmission delay is reduced by decreasement of wavelength changes. The performance of proposed protocol is evaluated through numerical analysis based on probability and queueing theory. The peformance of proposed protocol is evaluated through numerical analysis based on probability and queueing theory. The numeric results show that the peformance of proposed protocol is better than that of previous one.

• Journal of Sensor Science and Technology
• /
• v.29 no.2
• /
• pp.75-81
• /
• 2020

We introduce a new visible light communication (VLC) method in which three-level return-to-zero (RZ) modulation is used for flicker-free transmission. In the VLC transmitter, the three-level RZ modulation ensures that the average optical power is constant; thus, a flicker-free light-emitting diode (LED) light is achieved. In the VLC receiver, a resistor-capacitor high-pass filter is used for generating spike signals, which are used for data recovery while eliminating the 120 Hz optical noise from adjacent lighting lamps. In transmission experiments, we applied this method for wireless transmission of an air quality sensor message using the visible light of an LED array. This configuration is useful for the construction of indoor wireless sensor networks for air pollution monitoring using LED lights.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.203-206
• /
• 2004

Recently home network has been developed in the field of Information Technology. And there are many protocols for smart home, such as Lonworks, Echonet, KNX, LnCP etc. However, the performance evaluation has not been nearly known between the protocols. Hence, this paper evaluates the performance of KNX by Konnex Association and LnCP(Living network Control Protocol) by LG Electronics. We developed simulation model using flowchart of KNX and LnCP and simulation scenario through analysis of message to be generated in the home network. Furthermore, we evaluate simulation performance, such as mean transmission delay, maximum transmission delay, and collision rate of both protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2333-2353
• /
• 2020

This paper proposes a novel data prioritization and transmission mechanism to minimize the number of packets transmitted and reduce network overload using the constrained application protocol (CoAP) in resource-constrained networks. The proposed scheme adopts four classification parameters to classify and prioritize data from a sensor. With the packet prioritization scheme, the sensed data having the lowest priority is only delivered using the proposed keep-alive message notification to decrease the number of packets transmitted. The performance evaluation demonstrates that the proposed scheme shows the improvement of resource utilization in energy consumption, and bandwidth usage compared with the existing CoAP methods. Furthermore, the proposed scheme supports quality-of-service (QoS) per packet by differentiating transmission delays regarding priorities.