GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. 2005
DOI: 10.1109/glocom.2005.1578231
|View full text |Cite
|
Sign up to set email alerts
|

Interference-aware QoS routing (IQRouting) for ad-hoc networks

Abstract: Abstract-Traditional distributed algorithms for QoS routing in wired networks may not work in the ad-hoc domain, due to interference between links. We propose a heuristic interferenceaware QoS routing algorithm (IQRouting) that chooses candidate paths based on localized information at the source nodes. The candidate paths are compared in a distributed manner using probe packets, with the best path confirmed by the destination node. Simulations demonstrate significant (up to 30%) improvements in admission ratio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
28
0

Year Published

2005
2005
2011
2011

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 39 publications
(29 citation statements)
references
References 13 publications
0
28
0
Order By: Relevance
“…In [11], we proposed a distributed Ad-hoc Shortest Widest Path (ASWP) routing algorithm, which transforms the well-known Shortest Widest Path paradigm to the ad-hoc domain by taking interference into account. We further proposed IQRouting [12] -a source-based heuristic mechanism that is able to select QoS routed paths in a dynamic manner, using only localized state information. Each of these algorithms relies on the computation of available bandwidth (Sec.…”
Section: Extensionsmentioning
confidence: 99%
“…In [11], we proposed a distributed Ad-hoc Shortest Widest Path (ASWP) routing algorithm, which transforms the well-known Shortest Widest Path paradigm to the ad-hoc domain by taking interference into account. We further proposed IQRouting [12] -a source-based heuristic mechanism that is able to select QoS routed paths in a dynamic manner, using only localized state information. Each of these algorithms relies on the computation of available bandwidth (Sec.…”
Section: Extensionsmentioning
confidence: 99%
“…But actually it is easier to compute cliques since they are made of closed links and nodes usually have a better knowledge of their neighborhood. So cliques are often preferred in the literature to compute constraints on flows [7], [11].…”
Section: A Network Modelmentioning
confidence: 99%
“…The aim of such protocols is typically to foster a better average QoS for all packets according to one or more metrics. QOLSR (QoS Optimized Link State Routing), DSARP (Delay-Sensitive Adaptive Routing Protocol) [29] and IAR (Interference-Aware Routing) [30] are typical independent protocols.…”
Section: Protocols Based On Interaction Between Network and Mac Layermentioning
confidence: 99%