Efficient Data Query in Intermittently-Connected Mobile Ad Hoc Social Networks

被引：38

作者：

Liu, Yang ^{[1
]}

Han, Yanyan ^{[1
]}

Yang, Zhipeng ^{[1
]}

Wu, Hongyi ^{[1
]}

机构：

[1] Univ Louisiana Lafayette, Ctr Adv Comp Studies, Lafayette, LA 70504 USA

来源：

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 2015年 / 26卷 / 05期

关键词：

Data query; mobile ad hoc social networks; centralized optimization model; distributed protocol; testbed experiment; simulations; TOLERANT; ALLOCATION; PROTOCOL; DESIGN;

D O I：

10.1109/TPDS.2014.2320922

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This work addresses the problem of how to enable efficient data query in a Mobile Ad-hoc SOcial Network (MASON), formed by mobile users who share similar interests and connect with one another by exploiting Bluetooth and/or WiFi connections. The data query in MASONs faces several unique challenges including opportunistic link connectivity, autonomous computing and storage, and unknown or inaccurate data providers. Our goal is to determine an optimal transmission strategy that supports the desired query rate within a delay budget and at the same time minimizes the total communication cost. To this end, we propose a centralized optimization model that offers useful theoretic insights and develop a distributed data query protocol for practical applications. To demonstrate the feasibility and efficiency of the proposed scheme and to gain useful empirical insights, we carry out a testbed experiment by using 25 off-the-shelf Dell Streak tablets for a period of 15 days. Moreover, extensive simulations are carried out to learn the performance trend under various network settings, which are not practical to build and evaluate in laboratories. Index Terms-Data query, mobile ad hoc social networks, centralized optimization model,

引用

页码：1301 / 1312

页数：12

共 45 条

[1]

[Anonymous], P IEEE INFOCOM, DOI DOI 10.1109/INFOCOM.2006.172

[2]

[Anonymous], P 9 ACM INT S MOB AD

[3]

[Anonymous], 2011, P 17 ANN INT C MOB C

[4]

[Anonymous], 2005, P 2005 ACM SIGCOMM W

[5]

[Anonymous], PERFORMANCE EVAL

[6]

[Anonymous], IEEE T VEHICULAR TEC

[7]

Avin C, 2004, IPSN '04: THIRD INTERNATIONAL SYMPOSIUM ON INFORMATION PROCESSING IN SENSOR NETWORKS, P277

[8] DTN routing as a resource allocation problem [J].

Balasubramanian, Aruna ;

Levine, Brian Neil ;

Venkataramani, Arun .

ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2007, 37 (04) :373-384

[9] Relays, Base Stations, and Meshes: Enhancing Mobile Networks with Infrastructure [J].

Banerjee, Nilanjan ;

Corner, Mark D. ;

Towsley, Don ;

Levine, Brian N. .

MOBICOM'08: PROCEEDINGS OF THE FOURTEENTH ACM INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING, 2008, :81-91

[10]

Burns B, 2005, IEEE INFOCOM SER, P398

← 1 2 3 4 5 →