A Data Dissemination Policy by Using Human Mobility Patterns for Delay-Tolerant Networks

Author(s):  
Hui Ye ◽  
ZhiGang Chen ◽  
ZuoQun Xia ◽  
Ming Zhao
2017 ◽  
Vol 13 (7) ◽  
pp. 155014771771810 ◽  
Author(s):  
Xingyu He ◽  
Guisong Yang ◽  
Hao Zhang

In delay tolerant networks, the success rate and the transmission speed are restricted by limited social interaction and complex node mobility pattern analysis. To increase the success rate and reduce the transmission delay in delay tolerant networks, we propose Daily Routine Analysis for Node Searching in delay tolerant networks. In Daily Routine Analysis for Node Searching, each node is required to generate a Staying Probability Table and a Transiting Probability Table by analyzing its own daily routine, then to distribute its Staying Probability Table and Transiting Probability Table to the whole network with the help of other nodes having different mobility patterns. On the basis of the Staying Probability Table and Transiting Probability Table, Daily Routine Analysis for Node Searching further provides a node tracking strategy and an opportunistic routing strategy for delivering data from the source node to the destination node. Trace-driven experiments are performed to compare Daily Routine Analysis for Node Searching with previous node searching methods. The experimental results demonstrate that Daily Routine Analysis for Node Searching is able to promote the success rate and reduce the transmission delay effectively.


2016 ◽  
Vol 67 ◽  
pp. 128-146 ◽  
Author(s):  
Sobin CC ◽  
Vaskar Raychoudhury ◽  
Gustavo Marfia ◽  
Ankita Singla

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.


2013 ◽  
Vol 2013 ◽  
pp. 1-15 ◽  
Author(s):  
Jiaxu Chen ◽  
Yazhe Tang ◽  
Chengchen Hu ◽  
Guijuan Wang

Human mobility modeling has increasingly drawn the attention of researchers working on wireless mobile networks such as delay tolerant networks (DTNs) in the last few years. So far, a number of human mobility models have been proposed to reproduce people’s social relationships, which strongly affect people’s daily life movement behaviors. However, most of them are based on the granularity of community. This paper presents interest-oriented human contacts (IHC) mobility model, which can reproduce social relationships on a pairwise granularity. As well, IHC provides two methods to generate input parameters (interest vectors) based on the social interaction matrix of target scenarios. By comparing synthetic data generated by IHC with three different real traces, we validate our model as a good approximation for human mobility. Exhaustive experiments are also conducted to show that IHC can predict well the performance of routing protocols.


Sign in / Sign up

Export Citation Format

Share Document