A social relation aware routing protocol for mobile ad hoc networks

Jisun An, Yangwoo Ko, Dongman Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

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.

Original languageEnglish
Title of host publication7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009
DOIs
Publication statusPublished - 28 Sep 2009
Externally publishedYes
Event7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009 - Galveston, TX, United States
Duration: 9 Mar 200913 Mar 2009

Other

Other7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009
CountryUnited States
CityGalveston, TX
Period9/3/0913/3/09

Fingerprint

Mobile ad hoc networks
Routing protocols

Keywords

  • Ad hoc network
  • Component
  • Routing protocol
  • Social-relation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Cite this

An, J., Ko, Y., & Lee, D. (2009). A social relation aware routing protocol for mobile ad hoc networks. In 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009 [4912879] https://doi.org/10.1109/PERCOM.2009.4912879

A social relation aware routing protocol for mobile ad hoc networks. / An, Jisun; Ko, Yangwoo; Lee, Dongman.

7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009. 2009. 4912879.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

An, J, Ko, Y & Lee, D 2009, A social relation aware routing protocol for mobile ad hoc networks. in 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009., 4912879, 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009, Galveston, TX, United States, 9/3/09. https://doi.org/10.1109/PERCOM.2009.4912879
An J, Ko Y, Lee D. A social relation aware routing protocol for mobile ad hoc networks. In 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009. 2009. 4912879 https://doi.org/10.1109/PERCOM.2009.4912879
An, Jisun ; Ko, Yangwoo ; Lee, Dongman. / A social relation aware routing protocol for mobile ad hoc networks. 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009. 2009.
@inproceedings{631abf284c9d4216a5baa2557ca18d7e,
title = "A social relation aware routing protocol for mobile ad hoc networks",
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 = "Ad hoc network, Component, Routing protocol, Social-relation",
author = "Jisun An and Yangwoo Ko and Dongman Lee",
year = "2009",
month = "9",
day = "28",
doi = "10.1109/PERCOM.2009.4912879",
language = "English",
isbn = "9781424433049",
booktitle = "7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009",

}

TY - GEN

T1 - A social relation aware routing protocol for mobile ad hoc networks

AU - An, Jisun

AU - Ko, Yangwoo

AU - Lee, Dongman

PY - 2009/9/28

Y1 - 2009/9/28

N2 - 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.

AB - 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.

KW - Ad hoc network

KW - Component

KW - Routing protocol

KW - Social-relation

UR - http://www.scopus.com/inward/record.url?scp=70349324227&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349324227&partnerID=8YFLogxK

U2 - 10.1109/PERCOM.2009.4912879

DO - 10.1109/PERCOM.2009.4912879

M3 - Conference contribution

AN - SCOPUS:70349324227

SN - 9781424433049

BT - 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009

ER -