Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
3-2009
Abstract
In this paper, we propose a social relation aware routing protocol for mobile ad hoc networks, which is designed for content sharing mobile social applications. Since a content can be shared by a group of users who have similar interests, the similarity of users' interests is a good metric to predict who will consume which contents. Shared interests can be exploited in routing and replication of content request and reply to achieve enhanced efficacy in content sharing. Since routing determines which content will be forwarded by whom, a route selected based on similarity of interest increases the utilization of contents replication in intermediate nodes. This paper describes the design and implementation of a social relation aware routing protocol that uses social relation as a part of routing metric. Simulation results shows that the proposed routing protocol improves higher delivery ratio with lower network overhead than DSDV.
Keywords
Social-relation, ad hoc network, routing protocol
Discipline
OS and Networks | Software Engineering
Research Areas
Software and Cyber-Physical Systems
Publication
2009 IEEE International Conference on Pervasive Computing and Communications: March 9-13, Galveston, TX: Proceedings
First Page
1
Last Page
6
ISBN
9781424433049
Identifier
10.1109/PERCOM.2009.4912879
Publisher
IEEE
City or Country
Piscataway, NJ
Citation
AN, Jisun; KO, Yangwoo; and LEE, Dongman.
A social relation aware routing protocol for mobile ad hoc networks. (2009). 2009 IEEE International Conference on Pervasive Computing and Communications: March 9-13, Galveston, TX: Proceedings. 1-6.
Available at: https://ink.library.smu.edu.sg/sis_research/6725
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1109/PERCOM.2009.4912879