2016 19th International Conference on Computer and Information Technology (ICCIT) 2016
DOI: 10.1109/iccitechn.2016.7860159
|View full text |Cite
|
Sign up to set email alerts
|

TTL based MaxProp routing protocol

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…Then the entire vector is normalised so that the magnitude of the whole vector is equal to one. Upon initial contact between two nodes, they exchange their vectors, in an optimal solution, every node has an up-to-date, accurate element within the vector containing the probabilities linked to every other node [37]. Then the vectors can be used during a depth-first search in order to find the shortest path to the destination node.…”
Section: Black and Grey Hole Maxpropmentioning
confidence: 99%
“…Then the entire vector is normalised so that the magnitude of the whole vector is equal to one. Upon initial contact between two nodes, they exchange their vectors, in an optimal solution, every node has an up-to-date, accurate element within the vector containing the probabilities linked to every other node [37]. Then the vectors can be used during a depth-first search in order to find the shortest path to the destination node.…”
Section: Black and Grey Hole Maxpropmentioning
confidence: 99%
“…This algorithm improves the possibility of successful information transmission and reduces resource overhead and transmission delay. Das et al [44] improved the MaxProp algorithm and proposed a MaxProp routing algorithm based on time-to-live. The algorithm focuses on the survival time of the information transmitted, ranks the data to be transmitted according to time, and avoids the loss of information with a high TTL value.…”
Section: Related Workmentioning
confidence: 99%
“…e MaxProp routing algorithm avoids each message transmission using the flooding technique in the whole network and reduces routing overhead. Das et al [29] recommends a Time-To-Live (TTL) based on the MaxProp routing algorithm, which based on hop count and TTL values prioritize the schedule of packets in data transmission. Compared with the MaxProp algorithm, this algorithm can greatly increase the amount of information transmission and reduce the overhead rate and delay under the same network resource consumption.…”
Section: Related Workmentioning
confidence: 99%