Premium
Exploiting intercontact time for routing in delay tolerant networks
Author(s) -
Luo Guangchun,
Zhang Junbao,
Huang Haojun,
Qin Ke,
Sun Haifeng
Publication year - 2013
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.2553
Subject(s) - computer science , computer network , node (physics) , replication (statistics) , routing (electronic design automation) , scheme (mathematics) , overhead (engineering) , distributed computing , geographic routing , centrality , hop (telecommunications) , routing protocol , delay tolerant networking , routing algorithm , static routing , wireless routing protocol , mathematics , engineering , structural engineering , combinatorics , operating system , mathematical analysis , statistics
Because of the dynamic nature of delay tolerant networks (DTNs), many replication‐based routing schemes were proposed to increase the probability of delivery by making multiple copies of each message. In such schemes, one concern is how many replicas of a message should be distributed in the network. In this paper, we propose a routing scheme for DTNs, called adaptive spraying based on the intercontact time (ASBIT). The scheme is based on the idea of that each node dynamically chooses the right number of message copies disseminated to respond to the current conditions of the network. When forwarding, ASBIT selects the node with a higher centrality as the next hop, and utilises the multi‐attribute decision making theory for the division of the replication number between two nodes. Simulation results show that ASBIT achieves comparable delivery ratio and delivery delay while maintaining lower overhead compared with some well‐known routing schemes in sparse scenarios. Copyright © 2012 John Wiley & Sons, Ltd.