Minimum Spanning Trees of Moving Points in the Plane
IEEE Transactions on Computers
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Proximity problems on moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Sending messages to mobile users in disconnected ad-hoc wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Message traffic control capabilities of the R-DSDV protocol in mobile ad hoc networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Online power-aware routing in wireless Ad-hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Analysis of a randomized congestion control scheme with DSDV routing in ad Hoc wireless networks
Journal of Parallel and Distributed Computing - Special issue on wireless networks
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Agent Tcl: Targeting the Needs of Mobile Computers
IEEE Internet Computing
Performance Analysis of a Parallel PCS Network Simulation
HiPC '99 Proceedings of the 6th International Conference on High Performance Computing
GPS Query Optimization in Mobile and Wireless Networks
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Towards lightweight information dissemination in inter-vehicular networks
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Exploiting emergent behavior for inter-vehicle communication
HotAC II Hot Topics in Autonomic Computing on Hot Topics in Autonomic Computing
A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Robust content dissemination in disrupted environments
Proceedings of the third ACM workshop on Challenged networks
Octopus: a fault-tolerant and efficient ad-hoc routing protocol
Wireless Networks
DTN Routing with Probabilistic Trajectory Prediction
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Towards distributed network classification for mobile ad hoc networks
Proceedings of the 4th Annual International Conference on Wireless Internet
On the implications of routing metric staleness in delay tolerant networks
Computer Communications
KEPPAN: Knowledge exploitation for proactively-planned ad-hoc networks
Journal of Network and Computer Applications
Social-Stratification Probabilistic Routing Algorithm in Delay-Tolerant Network
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Routing for data delivery in dynamic networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Performance analysis of routing protocols in delay/disruption tolerant mobile ad hoc networks
NEHIPISIC'11 Proceeding of 10th WSEAS international conference on electronics, hardware, wireless and optical communications, and 10th WSEAS international conference on signal processing, robotics and automation, and 3rd WSEAS international conference on nanotechnology, and 2nd WSEAS international conference on Plasma-fusion-nuclear physics
Study of the impact of link availability on the performance of DTN routing protocols
Proceedings of the 44th Annual Simulation Symposium
Tuple space coordination across space and time
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Routing characterization in volatile connectivity environments
Proceedings of the 6th Euro American Conference on Telematics and Information Systems
Enhanced emergency communication using mobile sensing and MANET
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
A store-carry-process-and-forward paradigm for intelligent sensor grids
Information Sciences: an International Journal
A flocking-based approach to maintain connectivity in mobile wireless ad hoc networks
Applied Soft Computing
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
An ad hoc network is formed by a group of mobile hosts upon a wireless network interface. Previous research in communication in ad hoc networks has concentrated on routing algorithms which are designed for fully connected networks. The traditional approach to communication in a disconnected ad hoc network is to let the mobile computer wait for network reconnection passively. This method may lead to unacceptable transmission delays. We propose an approach that guarantees message transmission in minimal time. In this approach, mobile hosts actively modify their trajectories to transmit messages. We develop algorithms that minimize the trajectory modifications under two different assumptions: (a) the movements of all the nodes in the system are known and (b) the movements of the hosts in the system are not known.