Social routing: A novel routing protocol for delay tolerant network based on dynamic connectivity

There exist numerous routing protocols proposed to allow efficient routing in the network where the end-to-end paths are spontaneously unstable. Such networks are termed as Delay-tolerant-networks (DTNs). The existing famous routing protocols still remain important issues that need to be solved. For...

Full description

Saved in:
Bibliographic Details
Main Authors: Viet, Quoc Nguyen, Van Phuoc, Pham, Son, Trinh Quoc, Duc, Lung Vu
Format: Conference Proceeding
Language:English
Subjects:
Computer networks
Delay
delay tolerant networks
Delays
load distribution
Load distribution (forces)
message
Messages
Networks
Peer-to-peer computing
Routing
Routing (telecommunications)
Routing protocols
Telecommunication traffic
Traffic engineering
Traffic flow
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:There exist numerous routing protocols proposed to allow efficient routing in the network where the end-to-end paths are spontaneously unstable. Such networks are termed as Delay-tolerant-networks (DTNs). The existing famous routing protocols still remain important issues that need to be solved. For example, Epidemic quickly drains the resources of the network; PROPHET causes the unbalanced traffic load distribution between the nodes, and Fair-Route increases the delivery delay. Moreover, such protocols do not have a signal to notify the buffers to remove redundant copies of a message when the first copy of that message has been successfully delivered to the destination. We therefore propose Social Routing, a contacts history based routing protocol, resolves those problems. Simulation results show that our proposed protocol significantly obtains the balanced traffic load distribution between nodes, reduces the delivery delay, and provides better delivery ratio compared with other protocols.
ISSN:2154-0357
2154-0373
DOI:10.1109/EIT.2015.7293428