Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A comparison of mechanisms for improving TCP performance over wireless links
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
M-TCP: TCP for mobile cellular networks
ACM SIGCOMM Computer Communication Review
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
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Query localization techniques for on-demand routing protocols in ad hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Analysis of TCP performance over mobile ad hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Analysis of a local-area wireless network
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
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
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Wireless LANs: Implementing Interoperable Networks
Wireless LANs: Implementing Interoperable 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
Distinguishing Congestion Losses from Wireless Transmission Losses: A Negative Result
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
GPS Query Optimization in Mobile and Wireless Networks
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
A Simulation Based Study of On-Demand Routing Protocols for Ad hoc Wireless Networks
SS '01 Proceedings of the 34th Annual Simulation Symposium (SS01)
Propagation measurements and models for wireless communications channels
IEEE Communications Magazine
The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
RBR: refinement-based route maintenance protocol in wireless ad hoc networks
Computer Communications
Survey Paper: Routing protocols in ad hoc networks: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.03 |
Routing in ad hoc networks is a challenging problem because nodes are mobile and links are continuously being created and broken. Existing on-demand ad hoc routing algorithms initiate route discovery only after a path breaks, incurring a significant cost in detecting the disconnection and establishing a new route. In this work, we investigate adding proactive route selection and maintenance to on-demand ad hoc routing algorithms. More specifically, when a path is likely to be broken, a warning is sent to the source indicating the likelihood of a disconnection. The source can then initiate path discovery early, potentially avoiding the disconnection altogether. A path is considered likely to break when the received packet power becomes close to the minimum detectable power (other approaches are possible). Care must be taken to avoid initiating false route warnings due to fluctuations in received power caused by fading, multipath effects and similar random transient phenomena. Experiments demonstrate that adding proactive route selection and maintenance to DSR and AODV (on-demand ad hoc routing protocols) significantly reduces the number of broken paths, with a small increase in protocol overhead. Packet latency and jitter go down in most cases. Because preemptive routing reduces the number of broken paths, it also has a secondary effect on TCP performance--unnecessary congestion handling measures are avoided. This is observed for TCP traffic under different traffic patterns (telnet, ftp and http). Additionally, we outline some problems in TCP performance in ad hoc environments.