Reversing Ticket Based Probing (RTBP) Routing for MANET
Year: 2024
Type: dissertation
Abstract: The delay-constrained maximum-bandwidth routing problem in MANET (Mobile Ad hoc Networks) is to find the maximum bandwidth path which satisfies a given delay constraint. The research challenge for this problem is that the networking information used for routing may be imprecise. The Ticket-Based Probing (TBP) routing algorithm provides a heuristic approach by using two types of ticket. In this thesis a Reversing Ticket-based Probing (RTBP) routing algorithm is proposed. The RTBP has two novel features compared to the original ticket based probing algorithms. The first feature is using just one type ticket, instead of two types of ticket. RTBP generates less ticket at the path request phase and it therefore reduces message overhead. The second feature is that if a ticket violates delay constraint, RTBP can reverse previous nodes. Through extensive simulations, it is shown that RTBP has less message overhead than existing ticket based probing algorithms do and RTBP can find feasible paths with maximum bandwidth, without decreasing the success ratio.
DOI: 10.25777/9v0t-a120
Author: Yucel, Turgut
Institution: Old Dominion University
Language: English
Topic: Mobile Ad Hoc Networks
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6889639384
Cites:
Cited by:
Related to: