• Journal of Industrial Technology
• /
• v.23 no.A
• /
• pp.41-46
• /
• 2003

Because the quality of a radio link in real environment is generally varied with time, there is a difference between the delay in the real environment and one obtained from the analytic model where a time-varying link model is not used as a link model for a Bluetooth. This paper analyzes the transmission delay of a message in the time-varying radio link model for the Bluetooth. The time-varying radio link is modeled with a two-state Markov model. The mean transmission delay of the message is analytically obtained in terms of the arrival rate of the message, the state transition probability in the Markov model, and the packet error rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.2
• /
• pp.98-111
• /
• 1990

In this paper a queneing model for the D channel access protocal recommeded by CCITT is developed, and delays of the signalling and packet messages are analyzed using the model, Behaviors of packet and signalling messages in the D-channel access system are also investigated. The analytical results have been verified by simulation.

• Journal of Digital Contents Society
• /
• v.10 no.1
• /
• pp.115-120
• /
• 2009

In traditional message ferrying schemes, only message ferries carry messages between partitioned networks. In this paper, we propose a new approach to make both finite-buffered c ferries and mobile nodes carry messages so that we reduce message delivery delay and increase throughput in delay tolerant networks. We evaluate our scheme against conventional message ferrying in terms of message delivery delay and throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.10
• /
• pp.629-644
• /
• 2014

The goal of this paper is to consider a co-design approach between time delay compensation and the message scheduling for CAN-Based Networked Control Systems (NCS). First we propose a hybrid priority scheme for the message scheduling in order to improve the Quality of Service (QoS). Second we present the way to calculate the closed-loop communication time delay and then compensate this time delay using the pole placement design method in order to improve the Quality of Control (QoC). The final objective is the implementation of a co-design which is the combination of the compensation for communication time delays and the message scheduling in order to have a more efficient NCS design.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.2
• /
• pp.190-197
• /
• 2011

In industrial distributed control systems, sensors collect data from the physical environment periodically and transmit them to the actuators, which process the control operations based on the received data. For the effective operation of the control systems, the data transmitted by the sensors has to be delivered to the actuators reliably within the deadline, and if the message reception rate of the actuators becomes lower than a threshold, then the performance of the control systems drops greatly. This paper suggests a message routing protocol to transmit periodic messages reliably in a distributed control system based on wireless sensor networks. For reliable message transmission, the proposed protocol selects a routing path whose end-to-end message reception rate is the highest before transmitting data messages. The proposed protocol has the capability of maintaining a target message reception rate for each flow. To maintain the required target reception rate, each destination monitors the actual message reception rate periodically and transmits a feedback message to the source if it drops below the target reception rate. On receiving the feedback message, the source tries to find a new path which can satisfy the target rate. The performance of the proposed protocol has been evaluated using simulation and compared with other protocols in terms of the message reception rate, the message delay and delay jitter, and so on. The simulation results show that the proposed protocol has a higher message reception rate and comparable message delay and delay jitter to other protocols. The simulation results also show that the proposed protocol has an ability to adapt well to the dynamic network traffic change.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.684-693
• /
• 2003

This paper analyzes transmissiondelays of a message and a packet in a time-varying and packet-based radio link. The paper assumes that thearrivals of messages have a Bernoulli process and the lengths of the messages a exponential distribution. To reflect the feature of the time-varying radio link, we use a two-state Markov model. From the model the mean transmission delay of and the mean queue length of the packet are analyzed in terms of the packet distribution function, the packet transmission service time, and the PER of the radio link. And the mean message transmission delay time and the mean queue length are derived using the performance indices of the packet. Numerical results show that the message arrival rate and the message length have some bounds to keep the transmission of the message steady and to improve the performance indices of the message. It can be known that the PER of the state influences on the performance indices more than the sojourn time of the state.

• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.153-163
• /
• 2023

This study is situated in the context of intelligent transport systems, where in-vehicle devices assist drivers to avoid accidents and therefore improve road safety. The vehicles present in a given area form an ad' hoc network of vehicles called vehicular ad' hoc network. In this type of network, the nodes are mobile vehicles and the messages exchanged are messages to warn about obstacles that may hinder the correct driving. Node mobilities make it impossible for inter-node communication to be end-to-end. Recognizing this characteristic has led to delay-tolerant vehicular networks. Embedded devices have small buffers (memory) to hold messages that a node needs to transmit when no other node is within its visibility range for transmission. The performance of a vehicular delay-tolerant network is closely tied to the successful management of the nodes' transit buffer. In this paper, we propose a message transit buffer management model for nodes in vehicular delay tolerant networks. This model consists in setting up, on the one hand, a policy of dropping messages from the buffer when the buffer is full and must receive a new message. This drop policy is based on the concept of intermediate node to destination, queues and priority class of service. It is also based on the properties of the message (size, weight, number of hops, number of replications, remaining time-to-live, etc.). On the other hand, the model defines the policy for selecting the message to be transmitted. The proposed model was evaluated with the ONE opportunistic network simulator based on a 4000m x 4000m area of downtown Bouaké in Côte d'Ivoire. The map data were imported using the Open Street Map tool. The results obtained show that our model improves the delivery ratio of security alert messages, reduces their delivery delay and network overload compared to the existing model. This improvement in communication within a network of vehicles can contribute to the improvement of road safety.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.120-122
• /
• 2015

In this paper, we proposed an algorithm of the unnecessary copied message inhibition using dynamic density what is called DDIM(Dynamic Density-based Inhibited Message diffusion) in DTNs(Delay Tolerant Networks). Existing DTN routing algorithms as Epidemic and Spray and Wait have some problems that occur large overhead in dense network due to the thoughtless message diffusion. Our proposed method, the DDIM, determines adjusted number of copied message through dynamic node density that is calculated using node's radio coverage and neighbor nodes in period time to solve message diffusion problem. It decrease overhead without losing message delivery ratio and increased latency through reducing message diffusion. In this paper, we compare delivery ratio, average latency and overhead of proposed algorithm, DDIM, and existing DTN routing algorithm and prove enhanced performance through simulation results.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.5
• /
• pp.21-29
• /
• 1992

This paper proposes a new MAC propocol for high-speed MAN. The proposed protocol is based on the P$_1$-persistent tranmission scheme and each node calculates the transmission probability periodically by using delay information(DI). A window mechanism for the calculation of message delay in each node is proposed to improve the adaptability of the proposed protocol to traffic changes. The capactiy of the proposed protocol is analyzed. The simulation results show that the proposed protocol gives fair message delay under heavy load conditions and, when the transmission speed or distance is increased, the message delay variation of the proposed protocol is less than that of IEEE 802.6 DQDB.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.365-373
• /
• 2001

We propose a new channel reservation protocol which can reduce message delay by using a counter for detection of d source conflict in a WDM single-hop network with non-equivalent propagation delay. A source convict occurs when a source node has the right to transmit more than or equal to two messages simultaneously, which are transmitted using different wavelengths. In such a case, the source node has to newly obtain the right to transmit the message. In the proposed protocol, by using a source conflict counter a source node can detect a source conflict before a wave-length assignment is performed. Therefore, the source node can start a procedure to newly obtain the right to transmit the message which cannot be transmitted due to a source conflict. We analyse the throughput performance by taking the effect of a source conflict into account, and show that the approximate analysis and the computer simulated results are close. Also, from computer simulated results, we show that our proposed protocol can reduce mean message delay dramatically without degrading throughput performance as the offered load becomes large.