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.
Original language | English |
---|---|
Pages (from-to) | 1039-1046 |
Number of pages | 8 |
Journal | WSEAS Transactions on Communications |
Volume | 5 |
Issue number | 6 |
State | Published - Jun 2006 |
Keywords
- MANET
- Protocol
- Routing
- Ticket based probing
- Wireless network