Evaluating Service Disciplines for On-Demand Mobile Data Collection in Sensor Networks

被引:55
作者
He, Liang [1 ]
Yang, Zhe [2 ]
Pan, Jianping [2 ]
Cai, Lin [2 ]
Xu, Jingdong [3 ]
Gu, Yu [1 ]
机构
[1] Singapore Univ Technol & Design, SUTD MIT Int Design Ctr, Singapore 138682, Singapore
[2] Univ Victoria, Dept Comp Sci, Victoria, BC V8W 3P6, Canada
[3] Nankai Univ, Coll Informat Tech Sci, Dept Comp Sci, Tianjin, Peoples R China
关键词
Wireless ad hoc sensor networks; mobile elements; on-demand data collection; ROUTING PROBLEM;
D O I
10.1109/TMC.2013.62
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Mobility-assisted data collection in sensor networks creates a new dimension to reduce and balance the energy consumption for sensor nodes. However, it also introduces extra latency in the data collection process due to the limited mobility of mobile elements. Therefore, how to schedule the movement of mobile elements throughout the field is of ultimate importance. In this paper, the on-demand scenario where data collection requests arrive at the mobile element progressively is investigated, and the data collection process is modelled as an M/G/1/c-NJN queuing system with an intuitive service discipline of nearest-job-next (NJN). Based on this model, the performance of data collection is evaluated through both theoretical analysis and extensive simulation. NJN is further extended by considering the possible requests combination (NJNC). The simulation results validate our models and offer more insights when compared with the first-come-first-serve (FCFS) discipline. In contrary to the conventional wisdom of the starvation problem, we reveal that NJN and NJNC have better performance than FCFS, in both the average and more importantly the worst cases, which offers the much needed assurance to adopt NJN and NJNC in the design of more sophisticated data collection schemes, as well as other similar scheduling scenarios.
引用
收藏
页码:797 / 810
页数:14
相关论文
共 46 条
[1]  
Ahmadi M., 2012, P IEEE INT C COMM IC
[2]   QUEUING IN-SPACE [J].
ALTMAN, E ;
LEVY, H .
ADVANCES IN APPLIED PROBABILITY, 1994, 26 (04) :1095-1116
[3]  
[Anonymous], P 6 INT WORKSH STRUC
[4]  
[Anonymous], ACM T SENSOR NETWORK
[5]  
Bansal N., 2001, P ACM INT C MEAS MOD
[6]   A STOCHASTIC AND DYNAMIC VEHICLE-ROUTING PROBLEM IN THE EUCLIDEAN PLANE [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
OPERATIONS RESEARCH, 1991, 39 (04) :601-615
[7]   Stochastic properties of the random waypoint mobility model [J].
Bettstetter, C ;
Hartenstein, H ;
Pérez-Costa, X .
WIRELESS NETWORKS, 2004, 10 (05) :555-567
[8]  
Bhadauria D., 2011, UMCS11015
[9]   OPTIMAL SCHEDULING WITH STRICT DEADLINES [J].
BHATTACHARYA, PP ;
EPHREMIDES, A .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1989, 34 (07) :721-728
[10]   Controlled mobility in stochastic and dynamic wireless networks [J].
Celik, Guener D. ;
Modiano, Eytan H. .
QUEUEING SYSTEMS, 2012, 72 (3-4) :251-277