Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking &Amp; Computing - MobiHoc '02 2002
DOI: 10.1145/513824.513825
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of broadcasting techniques for mobile ad hoc networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
466
0
2

Year Published

2008
2008
2013
2013

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 325 publications
(469 citation statements)
references
References 0 publications
1
466
0
2
Order By: Relevance
“…First, it allows nodes adequate time to receive redundant packets and assess whether to rebroadcast. Second, the randomized scheduling prevents collision [6].If the counter is less than the threshold upon the expiration of the RAD timer, the node simply retransmits the packet. Otherwise it shall drop it and decline to retransmit it.…”
Section: Review Of the Counter-based Schemementioning
confidence: 99%
See 3 more Smart Citations
“…First, it allows nodes adequate time to receive redundant packets and assess whether to rebroadcast. Second, the randomized scheduling prevents collision [6].If the counter is less than the threshold upon the expiration of the RAD timer, the node simply retransmits the packet. Otherwise it shall drop it and decline to retransmit it.…”
Section: Review Of the Counter-based Schemementioning
confidence: 99%
“…The study is conducted using Ns-2 simulator -a discrete event simulator [12] widely used in MANETs community [6][7][8][9][10][11]13,14], to simulate a network of 1000 x1000 m 2 area populated with 20, 40, 60, …, 200 mobile nodes. The simulation model consists of two set of scenario files: topology scenario and traffic generation files.…”
Section: A Simulation Setupmentioning
confidence: 99%
See 2 more Smart Citations
“…In flooding each mobile host rebroadcast the packets when received for the first time. In this scheme the total number of broadcast is equal to N-1, where N is the total number of vehicles [2]. Flooding is simple but it consumes much network resources as it has a large number of redundant messages.…”
Section: Introduction Vehicular Ad Hoc Network (Vanet) Is a New Tementioning
confidence: 99%