Research@StAndrews
 
The University of St Andrews

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/1046
This item has been viewed 18 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
ParrisBigwoodHendersonPERCOM2010.pdf562.12 kBAdobe PDFView/Open
Title: Privacy-enhanced social network routing in opportunistic networks
Authors: Parris, Iain Siraj
Bigwood, Gregory John
Henderson, Tristan Nicholas Hoang
Keywords: Ad hoc networks
Data privacy
Message passing
Mobile radio
Social networking
Telecommunication security
QA76 Computer software
Issue Date: Mar-2010
Citation: Parris , I S , Bigwood , G J & Henderson , T N H 2010 , ' Privacy-enhanced social network routing in opportunistic networks ' . in Proceedings of the 2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops) : IEEE International Workshop on Security and Social Networking (SESOC 2010) . IEEE Computer Society , pp. 624-629 , 2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops) , Mannheim , Germany , 29-2 April .
conference
Abstract: Opportunistic networking-forwarding messages in a disconnected mobile ad hoc network via any encountered nodes-offers a new mechanism for exploiting the mobile devices that many users already carry. Forwarding messages in such a network often involves the use of social network routing-sending messages via nodes in the sender or recipient's social network. Simple social network routing, however, may broadcast these social networks, which introduces privacy concerns. This paper introduces two methods for enhancing privacy in social network routing by obfuscating the social network graphs used to inform routing decisions. We evaluate these methods using two real-world datasets, and find that it is possible to obfuscate the social network information without leading to a significant decrease in routing performance.
Version: Publisher PDF
URI: http://hdl.handle.net/10023/1046
DOI: http://dx.doi.org/10.1109/PERCOMW.2010.5470511
ISBN: 978-1-4244-6605-4
Type: Conference item
Rights: ©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Publisher: IEEE Computer Society
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.

 

DSpace Software Copyright © 2002-2012  Duraspace - Feedback
For help contact: Digital-Repository@st-andrews.ac.uk | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)