2008
DOI: 10.1007/978-3-540-88636-5_86
|View full text |Cite
|
Sign up to set email alerts
|

ANT Based Routing Algorithm over a HAP Network with Integrated Services

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…Irrespective of the routing algorithm or protocol, minimizing the end-to-end delay is important. A routing algorithm that identifies the minimum hop path that satisfies the maximum delay constraint in a mesh network of HAPs is proposed in [214]. The algorithm, which is based on ant colony behaviour and takes path length, delay, and traffic load into consideration, reduces propagation delay compared to the conventional Dijkstra shortest path algorithm.…”
Section: Networkingmentioning
confidence: 99%
“…Irrespective of the routing algorithm or protocol, minimizing the end-to-end delay is important. A routing algorithm that identifies the minimum hop path that satisfies the maximum delay constraint in a mesh network of HAPs is proposed in [214]. The algorithm, which is based on ant colony behaviour and takes path length, delay, and traffic load into consideration, reduces propagation delay compared to the conventional Dijkstra shortest path algorithm.…”
Section: Networkingmentioning
confidence: 99%