Reversing ticket based probing routing protocol for MANET

Authors:
Turgut Yucel;Min Song
Affiliations:
Department of Electrical and Computer Engineering, Old Dominion University, Norfolk, VA;Department of Electrical and Computer Engineering, Old Dominion University, Norfolk, VA
Venue:
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Year:
2006

Citing 3
Cited 0

Package Routing Algorithms in Mobile Ad-Hoc Wireless Networks

ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
QoS routing for wireless ad hoc networks: problems, algorithms, and protocols

IEEE Communications Magazine
Distributed quality-of-service routing in ad hoc networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The delay-constrained maximum-bandwidth routing problem in mobile ad hoc networks (MANET) is to find the maximum bandwidth path which satisfies a given delay constraint. The challenge of solving this problem is that the networking information used for routing may be imprecise. The Ticket-Based Probing (TBP) routing algorithm provides a heuristic approach to solve the routing problem. In this paper we present a Reversing Ticket-based Probing (RTBP) routing protocol. RTBP has two novel features compared to the original TBP algorithm. The first feature is the use of one type ticket. By using just one type ticket, RTBP generates less ticket at path request phase and it reduces message overhead. The second feature is that if a ticket violates delay constraint, RTBP can reverse previous nodes to search the alternative paths. Through extensive simulations, it is shown that RTBP has fewer messages overhead than existing ticket based probing algorithms.