2007 International Conference on Communications, Circuits and Systems 2007
DOI: 10.1109/icccas.2007.6250854
|View full text |Cite
|
Sign up to set email alerts
|

A pseudo gossip routing algorithm in mobile ad hoc networks

Abstract: Many routing algorithms, proposed for ad hoc wireless networks, are based on source routing scheme. In routing protocols that use flooding, many routing messages are propagated unnecessarily. Gossiping can be used to significantly reduce the number of routing messages sent. When a route is broken, route recovery and maintenance are executed. However, these procedures consume many resources. With a reactive routing protocol, this leads to increased delay and routing overheads while route repair procedures are c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…It frequently causes communication lines to be disrupted, resulting in data dissemination failures. According to this study conducted in the literature, 42 when the communication distance is minimum as 90% of the communication range R , the data transmission rate is nearly 100%. The safe zone is defined as an R of less than or equal to 90% (0.9 R ) in the proposed work.…”
Section: Proposed Uf‐gpsr Protocolmentioning
confidence: 93%
“…It frequently causes communication lines to be disrupted, resulting in data dissemination failures. According to this study conducted in the literature, 42 when the communication distance is minimum as 90% of the communication range R , the data transmission rate is nearly 100%. The safe zone is defined as an R of less than or equal to 90% (0.9 R ) in the proposed work.…”
Section: Proposed Uf‐gpsr Protocolmentioning
confidence: 93%
“…In [21], the author defined the term link availability as the probability that a link would be continuously available from t 0 to t 0 + t, given that it is active at t 0 . Moreover, some works also utilized this probability to predict the movement of nodes, where they represented the node's mobility as a stochastic process [21] [22] [23]. The velocity, moving direction and state change time are random variables, and the position of the node is a function of those variables.…”
Section: Uav's Stability In a Boundary Net-workmentioning
confidence: 99%
“…In [22], there was a strong assumption in the model, i.e., the number of the changing times of the node's mobile state during the period of prediction should be very large, which is not reasonable if that period is short. The model presented in [23] was simple, however, in this model the random walk mobility model of the node was simplified as four direction random movement, which is far from reality. Through discretizing the distance between two nodes, the authors in [21] transited the random variation of distance to a Markov chain with the discrete distances between the nodes as the state space, when a node moves with a random walk mobility model.…”
Section: Uav's Stability In a Boundary Net-workmentioning
confidence: 99%
“…Reference [14] analyzes the mathematical relationship between the distance and the link availability. When the distance is less than or equal to 0.9 r , the availability is almost equal to 1, which means the link is available.…”
Section: Fig 1 Radio Transmission Range Of Mobile Nodesmentioning
confidence: 99%