ASSESSMENT OF THE PERFORMANCE OF A BUFFER MANAGEMENT SYSTEM TO IMPROVE HIGH PRIORITY MESSAGE DELIVERY TIME LIMIT

In vehicular delay-tolerant networks, buffer management systems are developed to improve overall performance. However, these buffer memory management systems cannot simultaneously reduce network overload, reduce high priority message delivery time limit, and improve all priority class message delivery rates. As a result, quality of service is not guaranteed. In this paper, we propose a drop policy based on the constitution of two queues according to message weight, the position of the node in relation to the destination and the comparison of the oldness between the high-priority message and the messages in the low-priority queue. The results of the simulations show that compared to the existing buffer management policy based on time-to-live and priority, our strategy simultaneously reduces network overload, reduces the delivery time limit of high-priority messages and allows for an increase in the delivery rate of messages regardless of their priority.

Download Full-text

DEFENSE STRATEGY AGAINST SELFISH NODES TAKING INTO ACCOUNT TRAFFIC DIFFERENTIATION IN VEHICULAR DELAY-TOLERANT NETWORKS

International Journal of Advanced Research ◽

10.21474/ijar01/12402 ◽

2021 ◽

Vol 9 (01) ◽

pp. 1138-1156

Author(s):

Gballou Yao Theophile ◽

◽

Toure Kidjegbo Augustin ◽

Tiecoura Yves ◽

◽

...

Keyword(s):

Memory Management ◽

Network Performance ◽

Transmission Rate ◽

Buffer Management ◽

Delay Tolerant Networks ◽

Selfish Nodes ◽

Priority Class ◽

Network Overload ◽

Delay Tolerant ◽

The Impact

Vehicular Delay-Tolerant Networks (VDTNs) are vehicle networks where there is no end-to-end connectivity between source and destination. As a result, VDTNs rely on cooperation between the different nodes to improve its performance. However, the presence of selfish nodes that refuse to participate in the routing protocol causes a deterioration of the overall performance of these networks. In order to reduce the impact of these selfish nodes, proposed strategies, on the one hand, use the nodes transmission rate that does not take into account the message priority class of service, and on the other hand, are based on traditional buffer management systems (FIFO, Random). As a result, quality of service is not guaranteed in this type of network where different applications are derived from messages with different priorities. In this paper, we propose a strategy for detecting selfish nodes and taking action against them in relation to priority classes in order to reduce their impacts. The operation of this strategy is based, on a partitioned memory management system taking into account the priority and the lifetime of messages, on the calculation of the transmission rate of the node with respect to the priority class of the node with the highest delivery predictability, on a mechanism for calculating the nodes degree of selfishness with respect to the priority class, and on the monitoring mechanism. . The simulations carried out show that the proposed model can detect selfish nodes and improve network performance in terms of increasing the delivery rate of high-priority messages, reducing the delivery delay of high-priority messages, and reducing network overload.

Download Full-text