Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Multiple centrality corrections in a primal-dual method for linear programming
Computational Optimization and Applications
Caching strategies in on-demand routing protocols for wireless ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Introduction to Linear Optimization
Introduction to Linear Optimization
Information Dissemination in Partitionable Mobile Ad Hoc Networks
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
ANSWER: AutoNomouS netWorked sEnsoR system
Journal of Parallel and Distributed Computing
Sink repositioning for enhanced performance in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A quality of relay-based routing scheme in multi-hop cellular networks
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
| Hi-index | 0.00 |
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.