Controlled mobility in stochastic and dynamic wireless networks

被引:7
作者
Celik, Guener D. [1 ]
Modiano, Eytan H. [1 ]
机构
[1] MIT, Cambridge, MA 02139 USA
关键词
Spatial queueing models; Controlled mobility in wireless networks; Dynamic vehicle routing; DTRP; Queuing in space; Delay tolerant networks; Sensor networks; Mobile wireless networks; EUCLIDEAN PLANE; SYSTEMS; SPACE;
D O I
10.1007/s11134-012-9313-y
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider the use of controlled mobility in wireless networks where messages arriving randomly in time and space are collected by mobile receivers (collectors). The collectors are responsible for receiving these messages via wireless transmission by dynamically adjusting their position in the network. Our goal is to utilize a combination of wireless transmission and controlled mobility to improve the throughput and delay performance in such networks. First, we consider a system with a single collector. We show that the necessary and sufficient stability condition for such a system is given by rho < 1 where rho is the expected system load. We derive lower bounds for the expected message waiting time in the system and develop policies that are stable for all loads rho < 1 and have asymptotically optimal delay scaling. We show that the combination of mobility and wireless transmission results in a delay scaling of with the system load rho, in contrast to the delay scaling in the corresponding system without wireless transmission, where the collector visits each message location. Next, we consider the system with multiple collectors. In the case where simultaneous transmissions to different collectors do not interfere with each other, we show that both the stability condition and the delay scaling extend from the single collector case. In the case where simultaneous transmissions to different collectors interfere with each other, we characterize the stability region of the system and show that a frame-based version of the well-known Max-Weight policy stabilizes the system asymptotically in the frame length.
引用
收藏
页码:251 / 277
页数:27
相关论文
共 58 条
[1]  
Akyildiz I. F., 2005, Ad Hoc Networks, V3, P257, DOI 10.1016/j.adhoc.2005.01.004
[2]   Polling on a space with general arrival and service time distribution [J].
Altman, E ;
Foss, S .
OPERATIONS RESEARCH LETTERS, 1997, 20 (04) :187-194
[3]   QUEUING IN-SPACE [J].
ALTMAN, E ;
LEVY, H .
ADVANCES IN APPLIED PROBABILITY, 1994, 26 (04) :1095-1116
[4]  
Altman E., 1992, Queueing Systems Theory and Applications, V11, P35, DOI 10.1007/BF01159286
[5]  
[Anonymous], 1976, Queueing Systems, Volume II
[6]   APPROXIMATION ALGORITHMS FOR THE GEOMETRIC COVERING SALESMAN PROBLEM [J].
ARKIN, EM ;
HASSIN, R .
DISCRETE APPLIED MATHEMATICS, 1994, 55 (03) :197-218
[7]  
Bertsekas D. P., 1992, Data Networks, V2nd
[8]   STOCHASTIC AND DYNAMIC VEHICLE-ROUTING WITH GENERAL DEMAND AND INTERARRIVAL TIME DISTRIBUTIONS [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
ADVANCES IN APPLIED PROBABILITY, 1993, 25 (04) :947-978
[9]   STOCHASTIC AND DYNAMIC VEHICLE-ROUTING IN THE EUCLIDEAN PLANE WITH MULTIPLE CAPACITATED VEHICLES [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
OPERATIONS RESEARCH, 1993, 41 (01) :60-76
[10]   A STOCHASTIC AND DYNAMIC VEHICLE-ROUTING PROBLEM IN THE EUCLIDEAN PLANE [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
OPERATIONS RESEARCH, 1991, 39 (04) :601-615