|
Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10023/2010
| Title: | Bootstrapping opportunistic networks using social roles |
| Authors: | Bigwood, Greg
Henderson, Tristan |
| Keywords: | Mobile computing
Social networking
Routing protocols
QA75 Electronic computers. Computer science |
| Issue Date: | 23-Jun-2011 |
| Citation: | Bigwood , G & Henderson , T 2011 , ' Bootstrapping opportunistic networks using social roles ' . in : 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) . IEEE , The Fifth IEEE WoWMoM Workshop on Autonomic and Opportunistic Communications (AOC) , Lucca , Italy , 20-24 June .
conference |
| Abstract: | Opportunistic routing protocols can enable message delivery in disconnected networks of mobile devices. To conserve energy in mobile environments, such routing protocols must minimise unnecessary message-forwarding. This paper presents an opportunistic routing protocol that leverages social role information. We compute node roles from a social network graph to identify nodes with similar contact relationships, and use these roles to determine routing decisions. By using pre-existing social network information, such as online social network friends, to determine roles, we show that our protocol can bootstrap a new opportunistic network without the delay incurred by encounter-history-based routing protocols such as SimbetTS. Simulations with four real-world datasets show improved performance over SimbetTS, with performance approaching Epidemic routing in some scenarios. |
| Version: | Postprint |
| URI: | http://hdl.handle.net/10023/2010 |
| DOI: | http://dx.doi.org/10.1109/WoWMoM.2011.5986139 |
| ISBN: | 978-1-4577-0352-2
978-1-4577-0350-8 |
| Type: | Conference item |
| Rights: | © 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
| Publisher: | IEEE |
| Appears in Collections: | University of St Andrews Research
Computer Science Research
|
This item is protected by original copyright
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
