File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

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

TitleA novel socially-aware opportunistic routing algorithm in mobile social networks
Authors
KeywordsRouting Protocols
Mobile Social Networks
MANETs
Social Relations
Issue Date2013
Citation
2013 International Conference on Computing, Networking and Communications, ICNC 2013, 2013, p. 514-518 How to Cite?
AbstractRouting 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.
Persistent Identifierhttp://hdl.handle.net/10722/230930

 

DC FieldValueLanguage
dc.contributor.authorWong, Gary K W-
dc.contributor.authorJia, Xiaohua-
dc.date.accessioned2016-09-01T06:07:11Z-
dc.date.available2016-09-01T06:07:11Z-
dc.date.issued2013-
dc.identifier.citation2013 International Conference on Computing, Networking and Communications, ICNC 2013, 2013, p. 514-518-
dc.identifier.urihttp://hdl.handle.net/10722/230930-
dc.description.abstractRouting 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.-
dc.languageeng-
dc.relation.ispartof2013 International Conference on Computing, Networking and Communications, ICNC 2013-
dc.subjectRouting Protocols-
dc.subjectMobile Social Networks-
dc.subjectMANETs-
dc.subjectSocial Relations-
dc.titleA novel socially-aware opportunistic routing algorithm in mobile social networks-
dc.typeConference_Paper-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICCNC.2013.6504138-
dc.identifier.scopuseid_2-s2.0-84877616324-
dc.identifier.spage514-
dc.identifier.epage518-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats