Social delay-tolerant network routing

Gregory John Bigwood; Tristan Nicholas Hoang Henderson; Saleem Noel Bhatti

Social delay-tolerant network routing

Gregory John Bigwood, Tristan Nicholas Hoang Henderson, Saleem Noel Bhatti

School of Computer Science

Research output: Contribution to conference › Paper

Abstract

Routing in mobile delay-tolerant networks faces new challenges such as mobility and the dynamic nature of the network. Social network information may be useful for routing since mobile nodes in the same social network may be encountered more often and thus be more successful at message-passing. Collecting this social network information, however, can be challenging. We compare a social network traced from user encounters with a user-declared social network, and show some of the differences between these two networks.

Original language	English
Number of pages	5
Publication status	Published - Jan 2009
Event	2nd ICC Winter Workshop on Complexity in Social Systems - Lisbon, Portugal Duration: 10 Jan 2009 → 10 Jan 2009

Conference

Conference	2nd ICC Winter Workshop on Complexity in Social Systems
Country/Territory	Portugal
City	Lisbon
Period	10/01/09 → 10/01/09

Access to Document

Iccww2009Accepted author manuscript, 144 KB

D-SCENT: raising challenges to deception: D-SCENT: Raising challenges to deception attempts using data scent trails
Bhatti, S. (PI)
EPSRC
1/05/07 → 30/04/09
Project: Standard

Cite this

@conference{4056281d96ea4a298c0f14d4d74208f3,

title = "Social delay-tolerant network routing",

abstract = "Routing in mobile delay-tolerant networks faces new challenges such as mobility and the dynamic nature of the network. Social network information may be useful for routing since mobile nodes in the same social network may be encountered more often and thus be more successful at message-passing. Collecting this social network information, however, can be challenging. We compare a social network traced from user encounters with a user-declared social network, and show some of the differences between these two networks.",

author = "Bigwood, {Gregory John} and Henderson, {Tristan Nicholas Hoang} and Bhatti, {Saleem Noel}",

note = "Paper presented at the 2nd ICC Winter Workshop on Complexity in Social Systems; 2nd ICC Winter Workshop on Complexity in Social Systems ; Conference date: 10-01-2009 Through 10-01-2009",

year = "2009",

month = jan,

language = "English",

}

TY - CONF

T1 - Social delay-tolerant network routing

AU - Bigwood, Gregory John

AU - Henderson, Tristan Nicholas Hoang

AU - Bhatti, Saleem Noel

N1 - Paper presented at the 2nd ICC Winter Workshop on Complexity in Social Systems

PY - 2009/1

Y1 - 2009/1

N2 - Routing in mobile delay-tolerant networks faces new challenges such as mobility and the dynamic nature of the network. Social network information may be useful for routing since mobile nodes in the same social network may be encountered more often and thus be more successful at message-passing. Collecting this social network information, however, can be challenging. We compare a social network traced from user encounters with a user-declared social network, and show some of the differences between these two networks.

AB - Routing in mobile delay-tolerant networks faces new challenges such as mobility and the dynamic nature of the network. Social network information may be useful for routing since mobile nodes in the same social network may be encountered more often and thus be more successful at message-passing. Collecting this social network information, however, can be challenging. We compare a social network traced from user encounters with a user-declared social network, and show some of the differences between these two networks.

M3 - Paper

T2 - 2nd ICC Winter Workshop on Complexity in Social Systems

Y2 - 10 January 2009 through 10 January 2009

ER -

Social delay-tolerant network routing

Abstract

Conference

Access to Document

Fingerprint

Projects

D-SCENT: raising challenges to deception: D-SCENT: Raising challenges to deception attempts using data scent trails

Cite this