TY - GEN
T1 - QoS routing protocol for ad hoc networks with mobile backbones
AU - Xiao, Wendong
AU - Soong, Boon Hee
AU - Law, Choi Look
AU - Guan, Yong Liang
PY - 2004
Y1 - 2004
N2 - In this paper, a new QoS routing protocol is proposed for ad hoc network with Mobile Backbones (MEN). The protocol is based on a proactive Intra-group Link state Updating Protocol (ILUP) to avoid the expensive global link state update. It reactively discovery multiple segmented QoS paths sequentially from the source to the destination. To find multiple paths can help the routing protocol to account for the imprecision of the link state and to increase the probability to find a feasible path. The protocol can be applied to various QoS routing problems including the minimal delay routing, least cost routing, bandwidth-constrained or delay-constrained least cost routing. The route search algorithm is modified from the k-shortest path algorithm and the Limited Path Dijkstra's Algorithm (LPDA). Route maintenance strategies for recovery from link breakage and violation of QoS constraints are also discussed. Simulation results show the efficiency of the proposed protocol.
AB - In this paper, a new QoS routing protocol is proposed for ad hoc network with Mobile Backbones (MEN). The protocol is based on a proactive Intra-group Link state Updating Protocol (ILUP) to avoid the expensive global link state update. It reactively discovery multiple segmented QoS paths sequentially from the source to the destination. To find multiple paths can help the routing protocol to account for the imprecision of the link state and to increase the probability to find a feasible path. The protocol can be applied to various QoS routing problems including the minimal delay routing, least cost routing, bandwidth-constrained or delay-constrained least cost routing. The route search algorithm is modified from the k-shortest path algorithm and the Limited Path Dijkstra's Algorithm (LPDA). Route maintenance strategies for recovery from link breakage and violation of QoS constraints are also discussed. Simulation results show the efficiency of the proposed protocol.
KW - Limited path Dijkstra's algorithm
KW - Mobile ad hoc network
KW - Mobile backbone
KW - QoS routing protocol
KW - Segmented QoS routing
UR - http://www.scopus.com/inward/record.url?scp=2942659389&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=2942659389&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:2942659389
SN - 0780381939
T3 - Conference Proceeding - IEEE International Conference on Networking, Sensing and Control
SP - 1212
EP - 1217
BT - Conference Proceeding - 2004 IEEE International Conference on Networking, Sensing and Control
T2 - Conference Proceeding - 2004 IEEE International Conference on Networking, Sensing and Control
Y2 - 21 March 2004 through 23 March 2004
ER -