Preemptive routing in Ad Hoc networks

By T. Goff, Nael B. Abu-Ghazaleh, Dhananjay S. Phatak, Ridvan Kahvecioglu. ACM/IEEE International Conference on Mobile Computing and Networking, 2001

364 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/10b4ef2f0940ce72877fa3bde3fcb6fb46b6367e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Routing protocols in ad hoc networks: A survey (2011, neutral): “Preemptive routing in ad hoc networks [47]: In conventional protocols, a path is considered broken only after several retransmissions have timed out.”
a high-throughput path metric for multi-hop wireless routing (2003, neutral): “A number of existing ad hoc wireless routing algorithms collect per-link signal strength information and apply a threshold to avoid links with high loss ratios [8, 9, 10, 11, 14, 17, 22, 28].”
Supporting aggregate queries over ad-hoc wireless sensor networks (2002, background): “Networking protocols for routing data in wireless networks are very popular within the literature [12, 1, 4, 5], however, none of them address higher level issues of data processing, merely techniques for data routing.”
SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks (2009, background): “To address this issue, various linkquality metrics have been proposed [1], [7], [9], [10], [12], [13].”
Routing in multi-radio, multi-hop wireless mesh networks (2004, background): “Similar ideas have also been explored in [18, 20].”
Ad hoc on-demand multipath distance vector routing (2002, background): “Preemptive routing [37] is another mechanism which proactively repairs routes by monitoring the likelihood of a path break and informing the source which will initiate an early route discovery.”
Mobile Ad Hoc Networks (2004, neutral): “The protocol proposed in [19] uses the technique of determining this by observing when the signal strength falls below a predetermined threshold.”
Performance of multihop wireless networks: shortest path is not enough (2003, background): “A number of existing ad hoc wireless routing algorithms coll ect per-link signal strength information and apply a threshold t eliminate low-quality links [10, 9, 21, 8, 13].”