FSF: Friendship and selfishness forwarding for Delay Tolerant Networks

This paper presents the friendship and selfishness forwarding (FSF) algorithm for Delay Tolerant Networks. This novel solution is based on two social characteristics of nodes: friendship and selfishness. When a contact opportunity arises, FSF analyzes two aspects to make message forwarding decisions...

Full description

Saved in:
Bibliographic Details
Published in:2016 IEEE Symposium on Computers and Communication (ISCC) pp. 1200 - 1207
Main Authors: Souza, Camilo, Mota, Edjair, Galvao, Leandro, Manzoni, Pietro, Cano, Juan Carlos, Calafate, Carlos T.
Format: Conference Proceeding
Language:English
Published: IEEE 01.06.2016
Subjects:
Delays
Machine learning algorithms
Protocols
Relays
Routing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents the friendship and selfishness forwarding (FSF) algorithm for Delay Tolerant Networks. This novel solution is based on two social characteristics of nodes: friendship and selfishness. When a contact opportunity arises, FSF analyzes two aspects to make message forwarding decisions: first, FSF assesses the friendship strength among the pair of nodes, then it determines the individual selfishness of the relay node. Unlike other algorithms proposed in the DTN literature, we use a machine learning algorithm to quantify the friendship strength among pairs of nodes in the network. The individual selfishness of the relay node is determined by using a model based on the current level of its resources. The primary goal is to take into account the case where, despite a strong friendship with the message destination, the relay node does not accept processing the message to save its resources. By using trace-driven simulations we show that the FSF algorithm achieves better results in terms of delivery rate, average cost and efficiency.
DOI:10.1109/ISCC.2016.7543899