Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorBigwood, Gregory John
dc.contributor.authorHenderson, Tristan Nicholas Hoang
dc.contributor.authorBhatti, Saleem Noel
dc.date.accessioned2011-10-11T14:55:49Z
dc.date.available2011-10-11T14:55:49Z
dc.date.issued2009-01
dc.identifier.citationBigwood , G J , Henderson , T N H & Bhatti , S N 2009 , ' Social delay-tolerant network routing ' , Paper presented at 2nd ICC Winter Workshop on Complexity in Social Systems , Lisbon , Portugal , 10/01/09 - 10/01/09 .en
dc.identifier.citationconferenceen
dc.identifier.otherPURE: 427286
dc.identifier.otherPURE UUID: 4056281d-96ea-4a29-8c0f-14d4d74208f3
dc.identifier.otherstandrews_research_output: 28129
dc.identifier.otherORCID: /0000-0002-5566-9997/work/29827881
dc.identifier.urihttps://hdl.handle.net/10023/2019
dc.descriptionPaper presented at the 2nd ICC Winter Workshop on Complexity in Social Systemsen
dc.description.abstractRouting 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.
dc.format.extent5
dc.language.isoeng
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject.lccQA75en
dc.titleSocial delay-tolerant network routingen
dc.typeConference paperen
dc.contributor.sponsorEPSRCen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.description.statusNon peer revieweden
dc.identifier.grantnumberEP/F008562/1en


This item appears in the following Collection(s)

Show simple item record