2011
DOI: 10.1016/j.simpat.2010.08.011
|View full text |Cite
|
Sign up to set email alerts
|

A new dynamic counter-based broadcasting scheme for Mobile Ad hoc Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
35
0
3

Year Published

2012
2012
2024
2024

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 60 publications
(41 citation statements)
references
References 12 publications
0
35
0
3
Order By: Relevance
“…These methods mainly belong to the geometric-based routing schemes that usually presume the accessibility of position, vehicles' density, and road network topology. There are also some other methods which utilize the local statistical information, such as statistical vehicular broadcast (SVB) [18], adaptive threshold-based broadcast [19] and other dynamic counter-based protocols [20,21]. Those statistical-based schemes usually depends on a number of threshold parameters, which is used to decide whether a mobile node should rebroadcast or discard their received messages.…”
Section: Related Workmentioning
confidence: 99%
“…These methods mainly belong to the geometric-based routing schemes that usually presume the accessibility of position, vehicles' density, and road network topology. There are also some other methods which utilize the local statistical information, such as statistical vehicular broadcast (SVB) [18], adaptive threshold-based broadcast [19] and other dynamic counter-based protocols [20,21]. Those statistical-based schemes usually depends on a number of threshold parameters, which is used to decide whether a mobile node should rebroadcast or discard their received messages.…”
Section: Related Workmentioning
confidence: 99%
“…Pure flooding is the simplest and most reliable mechanism proposed in the literature for route discovery in MANETs (Yassein et al, 2011). In pure flooding, each node rebroadcasts the message to its neighbors upon receiving it for the first time, starting at the source.…”
Section: Jcsmentioning
confidence: 99%
“…Once the RREQ reaches the destination, the destination node responds with a route reply (RREP) packet back to the source through the route from which it first received the RREQ. Otherwise, if the RREQ packet expired before reaching the destination, then the node at which it expires, sends a Route Error (RERR) packet back to the source to initiate a new route discovery process (Yassein et al, 2011).…”
Section: Introductionmentioning
confidence: 99%
“…In contrast, in this paper we address the disconnected network problem (in addition to the broadcast storm), which appears when no relay node within the sender transmission range can forward the packet to other nodes. Recent proposed schemes [6] [7] [8], suffer from the simultaneous broadcast problem, since a fixed timer is used at all nodes without considering the level/degree of network density; thus, increases the number of packets collisions. Prioritizing the rebroadcast operation at each node with respect to different network parameters such as a number of duplicated packets, network local and global density also are tackled in this paper.…”
Section: Introductionmentioning
confidence: 99%