The impact of message lifetime on Delay-Tolerant Networks with non-cooperative nodes

Author(s):  
Ravi Theja ◽  
Yanda Ramesh
2013 ◽  
Vol 18 (6) ◽  
pp. 867-878 ◽  
Author(s):  
João A. F. F. Dias ◽  
Joel J. P. C. Rodrigues ◽  
João N. G. Isento ◽  
Jianwei Niu

2010 ◽  
Vol 171-172 ◽  
pp. 561-564
Author(s):  
Hui Ye ◽  
Zhi Gang Chen ◽  
Xiao Jian Shen

Recently, many researchers focus on delay tolerant networks (DTN). In DTN, the mobile characteristic of nodes is used to help transfer data. Therefore, how to use the cooperative relations and cache resource of nodes effectively to avoid network congestion and improve network performance is an important issue. In this paper, we proposed a cooperative caching policy based on human mobile patterns, which referred as HMP-Cache. The node movement characteristics are discussed in detail in HMP-Cache. HMP-Cache uses the standard of target address matching to choose cooperative caching nodes. In addition, the sharing caching information is done by synchronization of caching table in local region. Therefore, the impact of useless data dissemination of multiple hops is reduced. And the shortcoming of limited caching resources is compensated. The simulation results show that our policy can control the network cost effectively. Also, the remote data latency is reduced.


2010 ◽  
Vol 14 (11) ◽  
pp. 1026-1028 ◽  
Author(s):  
Yong Li ◽  
Pan Hui ◽  
Depeng Jin ◽  
Li Su ◽  
Lieguang Zeng

2021 ◽  
Vol 9 (01) ◽  
pp. 1138-1156
Author(s):  
Gballou Yao Theophile ◽  
◽  
Toure Kidjegbo Augustin ◽  
Tiecoura Yves ◽  
◽  
...  

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.


2011 ◽  
Vol 60 (5) ◽  
pp. 2224-2238 ◽  
Author(s):  
Yong Li ◽  
Guolong Su ◽  
Dapeng Oliver Wu ◽  
Depeng Jin ◽  
Li Su ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document