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!
Abstract 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.
AbstractList 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.
Author Calafate, Carlos T.
Mota, Edjair
Cano, Juan Carlos
Souza, Camilo
Manzoni, Pietro
Galvao, Leandro
Author_xml – sequence: 1
  givenname: Camilo
  surname: Souza
  fullname: Souza, Camilo
  email: camilo@icomp.ufam.edu.br
  organization: Inst. of Comput., Fed. Univ. of Amazonas, Manaus, Brazil
– sequence: 2
  givenname: Edjair
  surname: Mota
  fullname: Mota, Edjair
  email: edjair@icomp.ufam.edu.br
  organization: Inst. of Comput., Fed. Univ. of Amazonas, Manaus, Brazil
– sequence: 3
  givenname: Leandro
  surname: Galvao
  fullname: Galvao, Leandro
  email: galvao@icomp.ufam.edu.br
  organization: Inst. of Comput., Fed. Univ. of Amazonas, Manaus, Brazil
– sequence: 4
  givenname: Pietro
  surname: Manzoni
  fullname: Manzoni, Pietro
  email: pmanzoni@disca.upv.es
  organization: Comput. Eng. Dept., Univ. Politec. de Valencia, Valencia, Spain
– sequence: 5
  givenname: Juan Carlos
  surname: Cano
  fullname: Cano, Juan Carlos
  email: jucano@disca.upv.es
  organization: Comput. Eng. Dept., Univ. Politec. de Valencia, Valencia, Spain
– sequence: 6
  givenname: Carlos T.
  surname: Calafate
  fullname: Calafate, Carlos T.
  email: calafate@disca.upv.es
  organization: Comput. Eng. Dept., Univ. Politec. de Valencia, Valencia, Spain
BookMark eNotj8FOAyEUADGxB1v7AcYLP7Arb1kW8GZWqU0aPbSeG4SHJa5sA5s0_Xtj7GnmNMnMyXUaExJyB6wGYPphve37umHQ1VK0XGl9ReYgmGask7q7IcZszSM1OWLy5RCP1CZPCw4hlkPCUmgY88lmH9PXn9JnHOyZ7sYBs00TfcPpNObvcktmwQ4FlxcuyId52fWv1eZ9te6fNlWEhk8VamQaALvGces88MYroUF57oUNrZPe2fazAR5ABaekYp2TEAQEcK1AzRfk_r8bEXF_zPHH5vP-ssZ_ASoMSEI
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ISCC.2016.7543899
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1509006796
9781509006793
EndPage 1207
ExternalDocumentID 7543899
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i123t-e9e0911e62c3acd132d85918d3d5af4c7dca4b213f18fc87806c71f51f1c45e93
IEDL.DBID RIE
IngestDate Thu Jun 29 18:35:59 EDT 2023
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i123t-e9e0911e62c3acd132d85918d3d5af4c7dca4b213f18fc87806c71f51f1c45e93
PageCount 8
ParticipantIDs ieee_primary_7543899
PublicationCentury 2000
PublicationDate 20160601
PublicationDateYYYYMMDD 2016-06-01
PublicationDate_xml – month: 06
  year: 2016
  text: 20160601
  day: 01
PublicationDecade 2010
PublicationTitle 2016 IEEE Symposium on Computers and Communication (ISCC)
PublicationTitleAbbrev ISCC
PublicationYear 2016
Publisher IEEE
Publisher_xml – name: IEEE
Score 2.0153346
Snippet This paper presents the friendship and selfishness forwarding (FSF) algorithm for Delay Tolerant Networks. This novel solution is based on two social...
SourceID ieee
SourceType Publisher
StartPage 1200
SubjectTerms Delays
Machine learning algorithms
Protocols
Relays
Routing
Title FSF: Friendship and selfishness forwarding for Delay Tolerant Networks
URI https://ieeexplore.ieee.org/document/7543899
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB7a4sGTSiu-ycGjaTf7SuK1uuilFFqht5LHBAulle5W8N-b7C4VwYu3SUgImUC-meSbGYD7ADks1hl1nBmaWiupNFLRzGJquBaaO1UXm-CTiVgs5LQDD4dYGESsyWc4DGL9l2-3Zh-eykY8C7W6ZRe6nOdNrFb7UckiOXqdjceBq5UP23G_CqbUeFGc_G-lUxj8BN6R6QFSzqCDmz4Uxax4JEVISGwDt4p455-UuHar8j1cVMTbnYH76mcEkTzhWn2R-XaNHocqMmmI3uUA3orn-fiFtuUP6MrDSUVRogdzhnlsEmWsdxttSDYnbGIz5bwmrVGpjlnimHBGcBHlhjOXMcdMmqFMzqG32W7wAojxvqeW2snY5GmkpZC-pblKnbfudGQvoR90sPxoMlws2-1f_d19DcdBzQ1h6gZ61W6Pt3BkPqtVuburj-UbfJqRpA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fS8MwED7mFPRJZRN_mwcf7da0adP4Oi0bzjLYhL2NJrngYGyydoL_vUk7JoIvvl1CQsgF8t0l390B3DvIoYGMPMOp8pjWwhNK5F6kkSkuE8lNXhWb4FmWTKdi1ICHXSwMIlbkM-w4sfrL1yu1cU9lXR65Wt1iD_YjxgK_jtbaflVSX3QH417PsbXiznbkr5IpFWKkx_9b6wTaP6F3ZLQDlVNo4LIFaTpOH0nqUhJrx64i1v0nBS7MvHh3VxWxlqdjv9oZTiRPuMi_yGS1QItEJclqqnfRhrf0edLre9sCCN7cAkrpoUAL5xTjQIW50tZx1C7dXKJDHeXG6lKrnMmAhoYmRiU88WPFqYmooYpFKMIzaC5XSzwHoqz3KYU0IlAx86VIhG1JnjNj7Tvp6wtoOR3MPuocF7Pt9i__7r6Dw_7kdTgbDrKXKzhyKq_pU9fQLNcbvIED9VnOi_VtdUTfP5uU6w
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2016+IEEE+Symposium+on+Computers+and+Communication+%28ISCC%29&rft.atitle=FSF%3A+Friendship+and+selfishness+forwarding+for+Delay+Tolerant+Networks&rft.au=Souza%2C+Camilo&rft.au=Mota%2C+Edjair&rft.au=Galvao%2C+Leandro&rft.au=Manzoni%2C+Pietro&rft.date=2016-06-01&rft.pub=IEEE&rft.spage=1200&rft.epage=1207&rft_id=info:doi/10.1109%2FISCC.2016.7543899&rft.externalDocID=7543899