2013
DOI: 10.1007/978-1-4614-3872-4_255
|View full text |Cite
|
Sign up to set email alerts
|

Selective Quality Routing Algorithm Based on Dynamic Programming in Wireless Mesh Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2016
2016

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 3 publications
0
1
0
Order By: Relevance
“…In the field of distributed network design algorithms, many attempts are made for design of routing protocols for ad hoc networks [19,20,21,22]. Researchers explore diverse disciplines such as dynamic programming [23], algorithm design [24], graph theoretical algorithms [4] and game theory [25] to propose an efficient routing algorithm for regular as well as random network topologies. The selection of route depends on geographical position of source and the destination node, network topology, and channel conditions.…”
Section: Related Workmentioning
confidence: 99%
“…In the field of distributed network design algorithms, many attempts are made for design of routing protocols for ad hoc networks [19,20,21,22]. Researchers explore diverse disciplines such as dynamic programming [23], algorithm design [24], graph theoretical algorithms [4] and game theory [25] to propose an efficient routing algorithm for regular as well as random network topologies. The selection of route depends on geographical position of source and the destination node, network topology, and channel conditions.…”
Section: Related Workmentioning
confidence: 99%