TY - GEN
T1 - Integrating stability estimation into quality of service routing in Mobile Ad-hoc networks
AU - Weiying, Zhu
AU - Min, Song
AU - Olariu, Stephan
PY - 2006
Y1 - 2006
N2 - One of the notoriously difficult problems in Quality of Service (QoS) routing in Mobile Ad-hoc NETworks (MANET) is to ensure that the established path for a connection does not break before the end of the data transmission. This paper addresses the issue of reducing path breakage during data transmission, even if geographic location information is not available. Using delay-constrained QoS routing as an example, we propose a novel algorithm that we call ticket-based probing with stability estimation (TBP-SE) as an enhancement for the multi-path distributed QoS routing scheme proposed in [4]. Models are created to estimate relative link and path stability. During path discovery, the estimated relative stability is used to direct tickets along paths featuring high stability. Among multiple detected paths, the one with the highest relative stability is selected. Through extensive simulations, we show that our algorithm significantly improves the stability of established paths in terms of average relative path stability, path breakage speed, and percentage of data transmissions completed before path breakage.
AB - One of the notoriously difficult problems in Quality of Service (QoS) routing in Mobile Ad-hoc NETworks (MANET) is to ensure that the established path for a connection does not break before the end of the data transmission. This paper addresses the issue of reducing path breakage during data transmission, even if geographic location information is not available. Using delay-constrained QoS routing as an example, we propose a novel algorithm that we call ticket-based probing with stability estimation (TBP-SE) as an enhancement for the multi-path distributed QoS routing scheme proposed in [4]. Models are created to estimate relative link and path stability. During path discovery, the estimated relative stability is used to direct tickets along paths featuring high stability. Among multiple detected paths, the one with the highest relative stability is selected. Through extensive simulations, we show that our algorithm significantly improves the stability of established paths in terms of average relative path stability, path breakage speed, and percentage of data transmissions completed before path breakage.
KW - Mobile ad-hoc networks
KW - Path stability
KW - QoS routing
KW - Quality of service
KW - Wireless multimedia
UR - http://www.scopus.com/inward/record.url?scp=34250673860&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34250673860&partnerID=8YFLogxK
U2 - 10.1109/IWQOS.2006.250459
DO - 10.1109/IWQOS.2006.250459
M3 - Conference contribution
AN - SCOPUS:34250673860
SN - 1424404762
SN - 9781424404766
T3 - IEEE International Workshop on Quality of Service, IWQoS
SP - 122
EP - 129
BT - Proceedings - 2006 Fourteenth International Workshop on Quality of Service, IWQoS 2006
T2 - 2006 14th IEEE International Workshop on Quality of Service, IWQoS 2006
Y2 - 19 June 2006 through 21 June 2006
ER -