A routing protocol for socially selfish delay tolerant networks

Qinghua Li, Wei Gao, Sencun Zhu, Guohong Cao

Research output: Contribution to journalArticle

61 Citations (Scopus)

Abstract

Existing routing algorithms for Delay Tolerant Networks (DTNs) assume that nodes are willing to forward packets for others. In the real world, however, most people are socially selfish; i.e., they are willing to forward packets for nodes with whom they have social ties but not others, and such willingness varies with the strength of the social tie. Following the philosophy of design for user, we propose a Social Selfishness Aware Routing (SSAR) algorithm to cope with user selfishness and provide good routing performance in an efficient way. To select an effective forwarding node, SSAR considers both users' willingness to forward and their contact opportunity, and derives a metric with mathematical modeling and machine learning techniques to measure the forwarding capability of the mobile nodes. Moreover, SSAR formulates the data forwarding process as a Multiple Knapsack Problem with Assignment Restrictions (MKPAR) to satisfy user demands for selfishness and performance. Trace-driven simulations show that SSAR allows users to maintain selfishness and achieves good routing performance with low transmission cost.

Original languageEnglish (US)
Pages (from-to)1619-1632
Number of pages14
JournalAd Hoc Networks
Volume10
Issue number8
DOIs
StatePublished - Nov 1 2012

Fingerprint

Delay tolerant networks
Routing algorithms
Routing protocols
Learning systems
Costs

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

@article{83959743a2e14f1e85a7b2c30882b14c,
title = "A routing protocol for socially selfish delay tolerant networks",
abstract = "Existing routing algorithms for Delay Tolerant Networks (DTNs) assume that nodes are willing to forward packets for others. In the real world, however, most people are socially selfish; i.e., they are willing to forward packets for nodes with whom they have social ties but not others, and such willingness varies with the strength of the social tie. Following the philosophy of design for user, we propose a Social Selfishness Aware Routing (SSAR) algorithm to cope with user selfishness and provide good routing performance in an efficient way. To select an effective forwarding node, SSAR considers both users' willingness to forward and their contact opportunity, and derives a metric with mathematical modeling and machine learning techniques to measure the forwarding capability of the mobile nodes. Moreover, SSAR formulates the data forwarding process as a Multiple Knapsack Problem with Assignment Restrictions (MKPAR) to satisfy user demands for selfishness and performance. Trace-driven simulations show that SSAR allows users to maintain selfishness and achieves good routing performance with low transmission cost.",
author = "Qinghua Li and Wei Gao and Sencun Zhu and Guohong Cao",
year = "2012",
month = "11",
day = "1",
doi = "10.1016/j.adhoc.2011.07.007",
language = "English (US)",
volume = "10",
pages = "1619--1632",
journal = "Ad Hoc Networks",
issn = "1570-8705",
publisher = "Elsevier",
number = "8",

}

A routing protocol for socially selfish delay tolerant networks. / Li, Qinghua; Gao, Wei; Zhu, Sencun; Cao, Guohong.

In: Ad Hoc Networks, Vol. 10, No. 8, 01.11.2012, p. 1619-1632.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A routing protocol for socially selfish delay tolerant networks

AU - Li, Qinghua

AU - Gao, Wei

AU - Zhu, Sencun

AU - Cao, Guohong

PY - 2012/11/1

Y1 - 2012/11/1

N2 - Existing routing algorithms for Delay Tolerant Networks (DTNs) assume that nodes are willing to forward packets for others. In the real world, however, most people are socially selfish; i.e., they are willing to forward packets for nodes with whom they have social ties but not others, and such willingness varies with the strength of the social tie. Following the philosophy of design for user, we propose a Social Selfishness Aware Routing (SSAR) algorithm to cope with user selfishness and provide good routing performance in an efficient way. To select an effective forwarding node, SSAR considers both users' willingness to forward and their contact opportunity, and derives a metric with mathematical modeling and machine learning techniques to measure the forwarding capability of the mobile nodes. Moreover, SSAR formulates the data forwarding process as a Multiple Knapsack Problem with Assignment Restrictions (MKPAR) to satisfy user demands for selfishness and performance. Trace-driven simulations show that SSAR allows users to maintain selfishness and achieves good routing performance with low transmission cost.

AB - Existing routing algorithms for Delay Tolerant Networks (DTNs) assume that nodes are willing to forward packets for others. In the real world, however, most people are socially selfish; i.e., they are willing to forward packets for nodes with whom they have social ties but not others, and such willingness varies with the strength of the social tie. Following the philosophy of design for user, we propose a Social Selfishness Aware Routing (SSAR) algorithm to cope with user selfishness and provide good routing performance in an efficient way. To select an effective forwarding node, SSAR considers both users' willingness to forward and their contact opportunity, and derives a metric with mathematical modeling and machine learning techniques to measure the forwarding capability of the mobile nodes. Moreover, SSAR formulates the data forwarding process as a Multiple Knapsack Problem with Assignment Restrictions (MKPAR) to satisfy user demands for selfishness and performance. Trace-driven simulations show that SSAR allows users to maintain selfishness and achieves good routing performance with low transmission cost.

UR - http://www.scopus.com/inward/record.url?scp=84863369462&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863369462&partnerID=8YFLogxK

U2 - 10.1016/j.adhoc.2011.07.007

DO - 10.1016/j.adhoc.2011.07.007

M3 - Article

AN - SCOPUS:84863369462

VL - 10

SP - 1619

EP - 1632

JO - Ad Hoc Networks

JF - Ad Hoc Networks

SN - 1570-8705

IS - 8

ER -