Openly accessible

S-Kcore : a social-aware Kcore decomposition algorithm in pocket switched networks

Li, Ming, Gao, Longxiang and Zhou, Wanlei 2010, S-Kcore : a social-aware Kcore decomposition algorithm in pocket switched networks, in IEEE/IFIP 2010 : Proceedings of the IEEE/IFIP 8th International Conference Embedded and Ubiquitous Computing 2010, IEEE, Piscataway, N.J., pp. 737-742.

Attached Files
Name Description MIMEType Size Downloads
li-skcoreasocialawarekcore-2010.pdf Published version application/pdf 256.35KB 2

Title S-Kcore : a social-aware Kcore decomposition algorithm in pocket switched networks
Author(s) Li, Ming
Gao, Longxiang
Zhou, Wanlei
Conference name Embedded and Ubiquitous Computing. Conference (8th : 2010 : Hong Kong, China)
Conference location Hong Kong, China
Conference dates 11-13 Dec. 2010
Title of proceedings IEEE/IFIP 2010 : Proceedings of the IEEE/IFIP 8th International Conference Embedded and Ubiquitous Computing 2010
Editor(s) [Unknown]
Publication date 2010
Conference series Embedded and Ubiquitous Computing Conference
Start page 737
End page 742
Total pages 6
Publisher IEEE
Place of publication Piscataway, N.J.
Keyword(s) mobile social network
kcore algorithm
system recovery
Summary The key nodes in network play the critical role in system recovery and survival. Many traditional key nodes selection algorithms utilize the characters of the physical topology to find the key nodes. But they can hardly succeed in the mobile ad hoc network due to the mobility nature of the network. In this paper we propose a social-aware Kcore selection algorithm to work in the Pocket Switched Network. The social view of the network suggests the social position of the mobile nodes can help to find the key nodes in the Pocket Switched Network. The S-Kcore selection algorithm is designed to exploit the nodes' social features to improve the performance in data communication. Experiments use the NS2 shows S-Kcore selection algorithm workable in the Pocket Switched Network. Furthermore, with the social behavior information, those key nodes are more suitable to represent and improve the whole network's performance.
Notes This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ISBN 9780769543222
Language eng
Field of Research 080503 Networking and Communications
Socio Economic Objective 890103 Mobile Data Networks and Services
HERDC Research category E1 Full written paper - refereed
HERDC collection year 2010
Copyright notice ©2010, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30033646

Document type: Conference Paper
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Access Statistics: 185 Abstract Views, 10 File Downloads  -  Detailed Statistics
Created: Fri, 25 Mar 2011, 16:19:46 EST by Sandra Dunoon

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.