1999
DOI: 10.1109/49.779925
|View full text |Cite
|
Sign up to set email alerts
|

The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks

Abstract: Abstract-A number of different routing protocols proposed for use in multi-hop wireless ad hoc networks are based in whole or in part on what can be described as on-demand behavior. By ondemand behavior, we mean approaches based only on reaction to the offered traffic being handled by the routing protocol.In this paper, we analyze the use of on-demand behavior in such protocols, focusing on its effect on the routing protocol's forwarding latency, overhead cost, and route caching correctness, drawing examples f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
132
0
4

Year Published

2003
2003
2016
2016

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 280 publications
(137 citation statements)
references
References 11 publications
1
132
0
4
Order By: Relevance
“…The DSR protocol has been extensively studied since then through additional detailed simulations. In particular, we have implemented DSR in the ns-2 network simulator [NS-2, BROCH98] and performed extensive simulations of DSR using ns-2 (e.g., [BROCH98,MALTZ99a]). We have also conducted evaluations of the different caching strategies in this document [HU00].…”
Section: Security Considerationsmentioning
confidence: 99%
“…The DSR protocol has been extensively studied since then through additional detailed simulations. In particular, we have implemented DSR in the ns-2 network simulator [NS-2, BROCH98] and performed extensive simulations of DSR using ns-2 (e.g., [BROCH98,MALTZ99a]). We have also conducted evaluations of the different caching strategies in this document [HU00].…”
Section: Security Considerationsmentioning
confidence: 99%
“…At the link layer we simulated the distributed coordination function (DCF) of the IEEE 802.11 Wireless LAN standard [6]. For DSR all the optimization functions described in [7], were implemented. We simulated a scenario in which 50 nodes move randomly in an area of 1000 1000 m .…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Upon receiving an error packet, a host removes from its cache the parts of the routes that contain the broken link. Furthermore, by using source routing, SASR is able to take advantage of all optimization procedures proposed for DSR [7]such as salvaging, gratuitous route repair and promiscuous listening.…”
Section: Packet Forwarding and Route Maintenancementioning
confidence: 99%
“…Multi-hop connectivity is well studied in the literatures [17], [23], in terms of throughput [22], latency [20] and even TCP performance [29] etc. But Wi-Fi Direct based multihop connection setup is getting more attention only in the recent years.…”
Section: B Multi-hop Connectivitymentioning
confidence: 99%