A novel socially-aware opportunistic routing algorithm in mobile social networks

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

13 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publication2013 International Conference on Computing, Networking and Communications, ICNC 2013
Pages514-518
Publication statusPublished - 2013

Conference

Title2013 International Conference on Computing, Networking and Communications, ICNC 2013
PlaceUnited States
CitySan Diego, CA
Period28 - 31 January 2013

Abstract

Routing in disconnected delay-tolerant mobile ad hoc networks (MANETs) continues to be a challenging issue. Several works have been done to address the routing issues using the social behaviors of each node. Yet, these algorithms rely purely on the mobility models without considering the social network characteristics. In this paper, we introduce the social relations and profiles among nodes as the key metrics, and our objective is to compute the best forwarding node in routing such that the packet delivery probability is maximized. We propose the Social Relation Opportunistic Routing (SROR) distributed protocol to solve the routing issue based on these metrics. Our results demonstrate the performance of our proposed algorithm through simulation, and we validate it with experiments using ns-2 compared with other existing benchmark methods. © 2013 IEEE.

Research Area(s)

  • MANETs, Mobile Social Networks, Routing Protocols, Social Relations

Citation Format(s)

A novel socially-aware opportunistic routing algorithm in mobile social networks. / Wong, Gary K. W.; Jia, Xiaohua.
2013 International Conference on Computing, Networking and Communications, ICNC 2013. 2013. p. 514-518 6504138.

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review