TY - GEN
T1 - Expertise-based data access in content-centric mobile opportunistic networks
AU - Zhao, Jing
AU - Zhang, Xiaomei
AU - Cao, Guohong
AU - Srivatsa, Mudhakar
AU - Yan, Xifeng
PY - 2015/2/6
Y1 - 2015/2/6
N2 - In mobile opportunistic networks, most existing research focuses on how to choose appropriate relays to carry and forward data. Although relay selection is an important issue, other issues such as finding content from people with the right expertise are also very important since the ultimate goal of using mobile opportunistic network is to provide the right content to mobile users (nodes). In this paper, we study expertise-based data access in content-centric mobile opportunistic networks, where the objective is to minimize the average query delay given a sequence of queries considering node expertise, node queuing delay and communication delay. To solve this problem, we propose various query forwarding approaches under deterministic and probabilistic expertise models. Specifically, we propose centralized approaches to assign queries based on a modified Dijkstra's shortest path algorithm and distributed approaches in which query forwarding is based on a utility metric. Extensive simulations on both synthetic and realistic traces demonstrate that our solutions outperform existing approaches.
AB - In mobile opportunistic networks, most existing research focuses on how to choose appropriate relays to carry and forward data. Although relay selection is an important issue, other issues such as finding content from people with the right expertise are also very important since the ultimate goal of using mobile opportunistic network is to provide the right content to mobile users (nodes). In this paper, we study expertise-based data access in content-centric mobile opportunistic networks, where the objective is to minimize the average query delay given a sequence of queries considering node expertise, node queuing delay and communication delay. To solve this problem, we propose various query forwarding approaches under deterministic and probabilistic expertise models. Specifically, we propose centralized approaches to assign queries based on a modified Dijkstra's shortest path algorithm and distributed approaches in which query forwarding is based on a utility metric. Extensive simulations on both synthetic and realistic traces demonstrate that our solutions outperform existing approaches.
UR - http://www.scopus.com/inward/record.url?scp=84925351470&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84925351470&partnerID=8YFLogxK
U2 - 10.1109/MASS.2014.31
DO - 10.1109/MASS.2014.31
M3 - Conference contribution
T3 - Proceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014
SP - 199
EP - 207
BT - Proceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014
Y2 - 28 October 2014 through 30 October 2014
ER -