Locating mobile nodes with EASE: Learning efficient routes from encounter histories alone

被引:45
作者
Grossglauser, Matthias [1 ]
Vetterli, Martin [1 ]
机构
[1] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci, CH-1015 Lausanne, Switzerland
关键词
location service; mobile wireless networks; mobility; routing;
D O I
10.1109/TNET.2006.876204
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Routing in large-scale mobile ad hoc networks is challenging because all the nodes are potentially moving. Geographic routing can partially alleviate this problem, as nodes can make local routing decisions based solely on the destinations' geographic coordinates. However, geographic routing still requires an efficient location service, i.e., a distributed database recording the location of every destination node. Devising efficient, scalable, and robust location services has received considerable attention in recent years. The main purpose of this paper is to show that node mobility can be exploited to disseminate destination location information without incurring any communication overhead. We achieve this by letting each node maintain a local database of the time and location of its last encounter with every other node in the network. This database is consulted by packets to obtain estimates of their destination's current location. As a packet travels towards its destination, it is able to successively refine an estimate of the destination's precise location, because node mobility has "diffused" estimates of that location. We define and analyze a very simple algorithm called EASE (Exponential Age Search) and show that in a model where Theta (n) nodes perform independent random walks on a square lattice of size n, the length of the routes computed by EASE are of the same order as the distance between the source and destination even for very large n. Therefore, without disseminating any explicit location information, the length of EASE routes are within a constant factor of routes obtained with perfect information. We discuss refinements of the EASE algorithm and evaluate it through extensive simulations. We discuss general conditions such that the mobility diffusion effect leads to efficient routes without an explicit location service. In practical settings, where these conditions may not always be met, we believe that the mobility diffusion effect can complement existing location services and enhance their robustness and scalability.
引用
收藏
页码:457 / 469
页数:13
相关论文
共 24 条
[1]   Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks [J].
Baccelli, F ;
Tchoumatchenko, K ;
Zuyev, S .
ADVANCES IN APPLIED PROBABILITY, 2000, 32 (01) :1-18
[2]  
BASAGNI S, 1998, ACM MOBICOM DALL TX
[3]  
BOSE P, 1999, 3 INT WORKSH DISCR A
[4]   GPS-less low-cost outdoor localization for very small devices [J].
Bulusu, N ;
Heidemann, J ;
Estrin, D .
IEEE PERSONAL COMMUNICATIONS, 2000, 7 (05) :28-34
[5]  
CAPKUN S, 2002, CLUSTER COMPUT, V5
[6]  
DUBOISFERRIERE H, 2003, ACM MOBIHOC ANN MD J
[7]  
DUBOISFERRIERE H, 2003, AD HOC NETW WIR WORK
[8]  
GIORDANO S, 1999, SSC1999037 EPFL
[9]   Mobility increases the capacity of ad hoc wireless networks [J].
Grossglauser, M ;
Tse, DNC .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (04) :477-486
[10]  
Grossglauser M, 2003, IEEE INFOCOM SER, P1954