z-logo
open-access-imgOpen Access
Spatial and Temporal Correlations-Based Routing Algorithm in Intermittent Connectivity Human Social Network
Author(s) -
Tao Zhou,
Xu Hongbin,
Ming Liu,
Nianbo Liu,
Haigang Gong
Publication year - 2012
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1155/2012/515046
Subject(s) - computer science , routing algorithm , node (physics) , routing (electronic design automation) , key (lock) , transmission (telecommunications) , adaptive routing , computer network , delay tolerant networking , social network (sociolinguistics) , algorithm , static routing , routing protocol , computer security , telecommunications , social media , wireless routing protocol , structural engineering , engineering , world wide web
The social network formed by people is one of the key applications of Delay-Tolerant Network (DTN). Owing to its intermittent connectivity and unique human mobility patterns, how to transmit data in an effective way is a challenging problem for the social network. In this paper, we propose the idea of Trip History Model (THM) which establishes a model on a single person's mobility, and then a Spatial and Temporal Correlations-Based Routing Algorithm (STC) is proposed. In STC, the node delivery probability is calculated according to both a node's current moving prediction and its history record to give guidance for message transmission. Our simulation results show that, compared with LABEL and PROPHET algorithms, STC effectively improves the routing performance of the network. Copyright © 2012 Zhou Tao et al.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom