• 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 Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.181-184
• /
• 2003

Recently, the fieldbus becomes an indispensable component for many automated systems. In the fieldbus system, realtime data containing sensor values and control commands has a tendency to rapidly lose its value as time elapses after its creation. In order to deliver these data in time, the fieldbus network should be designed to have short delay compared to the maximum allowable delay. Because the communication delay is affected by performance parameters such as target rotation timer of token passing protocol, it is necessary to select proper parameter settings to satisfy the real-time requirement for communication delay. This paper presents the timer selection method for Profibus token passing networks using genetic algorithm (GA) to meet the delay requirements.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.5
• /
• pp.486-496
• /
• 2013

Time synchronization in underwater environment is challenging due to high propagation delay and mobility of sensor nodes. Previous researches do not consider practical issues affecting on the accuracy of time synchronization such as high-channel access delay and relative position between sensor nodes. Also, those protocols using bidirectional message exchange shorten the network lifetime and decrease the network throughput because numerous transmission, reception and unnecessary overhearing can be occurred. Therefore, in our research, we suggest enhanced time synchronization based on features of underwater environment. It controls the instant of transmission by exploiting the feature of an oceanic movement and node deployment. Moreover, the protocol uses more accurate time information by removing channel access delay from the timestamp. The proposed scheme is also practical on the underwater sensor network requiring low-power consumption because the scheme conducts time-synchronization with smaller transmission and reception compared with previous works. Finally, simulation results show that the proposed protocol deceases time error by 2.5ms and 0.56ms compared with TSHL and MU-Sync respectively, reducing energy consumption by 68.4%.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.106-114
• /
• 2015

Wireless Body Area Network(WBAN) is a network standard around a human body which connects various medical sensor and devices It has to satisfy various demands such as data transmission rate, priority, and delay time. In this paper, considering a data priority and transmission delay time, is proposed to improve efficiency of WBAN service depending on congestion status of network. The proposed algorithm operates with adapted data removal probability according to data priority when the hub buffer is congested than before. And in the case of lower congestion within the hub buffer data is served considering data delay time. Through the comparison with other existing scheduling algorithms, it is confirmed that quality of WBAN service is improved due to lower data loss rate of medical data and less delay time in the proposed algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.101-114
• /
• 2002

The real multimedia application in wide area communication needs the guaranteed performance of communication service. Therefore, the resource is reserved at the moment of traffic burst and the region of connection admission possibility is widened at the basis of maximum cell rate. This of study shows that the end-to-end traffic delay to the traffic of burst state is guaranteed when the total of maximum transmission rate is higher than link speed by using the region of deterministic delay. The network load rate of connection admission can be improved by the inducement of delay bounds consideration each traffic characteristic to guarantee the end-to-end delay of network from single switch. This suggested buffering system using deterministic service do not give any influence to service quality and can guarantee the bounds of end-to-end delay. And it can also reduce the load of network even if the delay is increased according to the burst traffic characteristic. The above suggested system can be applied effectively to the various kinds of general network specification which admit both real time trafnc service and non-real time traffic service.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1495-1502
• /
• 2015

Data compression involves a trade-off between delay time and data size. Greater delay times require smaller data sizes and vice versa. There have been many studies performed in the field of wireless sensor networks on increasing network life cycle durations by reducing data size to minimize energy consumption; however, reductions in data size result in increases of delay time due to the added processing time required for data compression. Meanwhile, as energy generation occurs periodically in solar energy-based wireless sensor networks, redundant energy is often generated in amounts sufficient to run a node. In this study, this excess energy is used to reduce the delay time between nodes in a sensor network consisting of solar energy-based nodes. The energy threshold value is determined by a formula based on the residual energy and charging speed. Nodes with residual energy below the threshold transfer data compressed to reduce energy consumption, and nodes with residual energy above the threshold transfer data without compression to reduce the delay time between nodes. Simulation based performance verifications show that the technique proposed in this study exhibits optimal performance in terms of both energy and delay time compared with traditional methods.

• ETRI Journal
• /
• v.44 no.6
• /
• pp.1020-1033
• /
• 2022

In this paper, we propose novel disaggregated memory module (dMM) architecture and memory access control schemes to solve the collision and contention problems of memory disaggregation, reducing the average memory access time to less than 1 ㎲. In the schemes, the distributed scheduler in each dMM determines the order of memory read/write access based on delay-sensitive priority requests in the disaggregated memory access frame (dMAF). We used the memory-intensive first (MIF) algorithm and priority-based MIF (p-MIF) algorithm that prioritize delay-sensitive and/or memory-intensive (MI) traffic over CPU-intensive (CI) traffic. We evaluated the performance of the proposed schemes through simulation using OPNET and hardware implementation. Our results showed that when the offered load was below 0.7 and the payload of dMAF was 256 bytes, the average round trip time (RTT) was the lowest, ~0.676 ㎲. The dMM scheduling algorithms, MIF and p-MIF, achieved delay less than 1 ㎲ for all MI traffic with less than 10% of transmission overhead.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.40.1-40
• /
• 2001

In this paper, control theoretic approaches are proposed to guarantee QoS (Quality of Series) such as packet delay and packet loss of real-time traffic in high-speed communication network. Characteristics of variable rate real-time traÆc in communication networks are described. The mathematical model describing networks including source and destination nodes are suggested. By a traffic control mechanism, it is shown that worst-case end-to-end transfer delay of traffic can be controlled and packet loss can be prevented. The simulation shows results of delay control and buer level control to raise QoS in realtime traffic.

• Journal of the Korea Society for Simulation
• /
• v.8 no.2
• /
• pp.101-109
• /
• 1999

In a commercial facsimile network system, a simulation analysis has been performed using ARENA due to the unavailability of theoretical models. The effect of a priority is compared with that of the current FCFS rule on the arriving call blocking rate and transmission time delay. The result shows that the priority rule reduces more service time delay as the arrival rate increases. A simulation analysis procedure is proposed to select optimal in/out port ratio at various hourly arrival rates with a given multiple-place transmission requests ratio.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.06a
• /
• pp.61-66
• /
• 2003

Mobile IP has been designed only to maintain communication as they move form place to place, so it doesn't guarantee Quality of Service(QoS). QoS in mobile IP is important to provide multimedia and real-time applications services in mobile, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to guarantee QoS as a main issue in mobile IP research area Next generation Mobile IPv6 resolve this problem somewhat, triangle problem for first packet and handoff delay still remain. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-Based routing. After modeling of suggested method and existing handoff method simulations we carried out with NS-2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.