Trajectory control of mobile gateways for range extension in ad hoc networks

被引:14
作者
Ahmed, M
Krishnamurthy, S
Katz, R
Dao, S
机构
[1] HRL Labs, Informat Sci Lab, Malibu, CA 90265 USA
[2] Univ Calif Riverside, Dept Comp Sci, Riverside, CA 92521 USA
[3] Univ Calif Berkeley, Dept Comp Sci, Berkeley, CA 94720 USA
关键词
mobile ad hoc networks; gateway; convex optimization; trajectory control;
D O I
10.1016/S1389-1286(02)00249-9
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In order to facilitate scalability in a mobile ad hoc network (MANET) and to provide connectivity between partitions that might occur in wireless networks as a consequence of mobility, we can envision a 'range extension' network that consists of airborne communication platforms, and satellites. These airborne or satellite nodes will maintain communication links with specific 'gateway' nodes among the mobile ground nodes. To communicate with a node that is geographically distant or belongs to a different network partition, an ad hoc node can relay its data packets through an appropriate mobile gateway and via the range extension network. If we envision that the MANET is divided into different groups and a mobile gateway is deployed for each such group, an objective then, is to determine the trajectory of the mobile gateway to best serve the ad hoc group to which it belongs, in terms of network performance metrics such as throughput and latency. In this paper, this problem of computing the optimal position for a gateway is reduced to a linear optimization problem by means of some simplifying but realistic assumptions. We suggest methods that may be deployed to enable the gateway to follow this optimal trajectory as closely as possible (within the practical constraints imposed by its velocity and maneuverability). Simulation results for various scenarios show a 10-15% improvement in the throughput and in latency (per group containing a gateway) if a gateway has a dynamic trajectory whose locus follows the computed optimal position, as compared to a gateway that is statically placed at a regular position, or to a gateway that has a random trajectory. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:809 / 825
页数:17
相关论文
共 18 条
[1]  
AMOURIS K, 1999, P 49 IEEE VEH TECHN, V2, P1365
[2]  
*ANL COMP SCI DIV, MATH
[3]  
[Anonymous], P 6 ANN INT C MOB CO
[4]  
Bertsimas D., 1997, Introduction to linear optimization
[5]  
Gondzio J., 1996, Computational Optimization and Applications, V6, P137, DOI 10.1007/BF00249643
[6]  
HAAS Z, 1999, IEEE J SELECTED AREA, V17
[7]  
IEEE, 1997, 802111997 IEEE
[8]  
Johnson D. B., 1996, Mobile Comput., P153
[9]  
KARUMANCHI G, 1998, P 18 IEEE S REL DIST, P4
[10]  
KO Y, 1999, P 49 IEEE VEH TECHN, V3, P1952