Dynamic vehicle routing for data gathering in wireless networks

We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). The collector is responsible for receiving these messages via wireless communication by dynamically adjusting its positio...

Full description

Bibliographic Details
Main Authors: Celik, Guner Dincer (Contributor), Modiano, Eytan H. (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers, 2011-10-11T19:17:22Z.
Subjects:
Online Access:Get fulltext
LEADER 02231 am a22002533u 4500
001 66205
042 |a dc 
100 1 0 |a Celik, Guner Dincer  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Aeronautics and Astronautics  |e contributor 
100 1 0 |a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science  |e contributor 
100 1 0 |a Modiano, Eytan H.  |e contributor 
100 1 0 |a Celik, Guner Dincer  |e contributor 
100 1 0 |a Modiano, Eytan H.  |e contributor 
700 1 0 |a Modiano, Eytan H.  |e author 
245 0 0 |a Dynamic vehicle routing for data gathering in wireless networks 
260 |b Institute of Electrical and Electronics Engineers,   |c 2011-10-11T19:17:22Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/66205 
520 |a We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). The collector is responsible for receiving these messages via wireless communication by dynamically adjusting its position in the network. Our goal is to utilize a combination of wireless transmission and controlled mobility to improve the delay performance in such networks. We show that the necessary and sufficient condition for the stability of such a system is given by ρ <; 1 where ρ is the average system load. We derive a fundamental lower bound for the delay in the system. We develop algorithms that are stable for all loads ρ <; 1 and that have asymptotically optimal delay scaling. We show that the combination of mobility and wireless transmission results in a delay scaling of Θ(1/1-ρ) [theta (1/1-p)] with the system load ρ in contrast to the (1/(1-ρ)2) [1/(1-p) superscript 2)] delay scaling in the corresponding system where the collector visits each message location. 
520 |a National Science Foundation (U.S.) (Grant CNS-0626781) 
520 |a National Science Foundation (U.S.) (Grant CNS-0915988) 
520 |a United States. Army Research Office. Multidisciplinary University Research Initiative (Grant W911NF-08-1-0238) 
546 |a en_US 
655 7 |a Article 
773 |t IEEE Conference on Decision and Control (2010)