- BIUSTRE Home
- →
- Electronic Theses and Dissertations
- →
- Faculty of Sciences
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.supervisor | Mpoeleng, Dimane | |
| dc.contributor.author | Oladeji-Atanda, Gbadebo | |
| dc.date.accessioned | 2025-08-25T12:48:43Z | |
| dc.date.available | 2025-08-25T12:48:43Z | |
| dc.date.issued | 2023-07 | |
| dc.identifier.citation | Atanda, G. (2023) A multi-greedy forwarding approach in geographic packet routing, Masters Theses, Botswana International University of Science and Technology: Palapye | en_US |
| dc.identifier.uri | https://repository.biust.ac.bw/handle/123456789/644 | |
| dc.description | Thesis (PhD in Computer Science and Software Engineering)-- Botswana International University of Science and Technology, 2023 | en_US |
| dc.description.abstract | This thesis presents a multi-greedy approach to efficient progress-based forwarding in geographic packet routing over fluctuating and varying mobile ad hoc network (MANET) topologies. Several factors cause MANET topologies to vary, including node mobility, node size fluctuations, and wireless link vagaries. The pertinent packet routing environments have demanded specialized, context-aware, and hybrid approaches. The distributed geographic routing method is found most suitable for MANETs of extremely varying topologies, such as the emergent vehicular ad hoc networks (VANETs) and flying ad hoc networks (FANETs). In the progress-based geographic routing, a greedy forwarding algorithm at each intermediate node computes the next-hop to be a neighbour that is closer in Euclidean distance to the packets’ final destination. The choice is also determined by the greedy algorithm’s supplementary criteria, e.g., the Compass Routing’s selection of a neighbour that also has the minimum angle wedged between the next-hop and the destination. Additionally, the underlying network topology influences the efficacy of greedy algorithms. Thus, each greedy forwarding algorithm matches specific topologies or requirements best. However, literature shows that the existing geographic routing protocols perform progress based forwarding using a sole greedy method, which is inefficient over topologically varying environments. That is, the existing geographic routing protocols do not switch the greedy computation methods for efficient adaptation to topology changes in progress-based forwarding.Accordingly, a multi-greedy model is defined in this thesis to address packet forwarding efficiency in geographic routing over fluctuating and varying MANET topologies. A multi-greedy model consists of selected existing greedy metrics that are each assignable and re-assignable to a routing task for optimized forwarding performances over varying topologies. Based on the defined model, context-aware multi-greedy designs can be specified. Two example designs with sample multi-xviii greedy formulations are evaluated. The first design is a multi-greedy forwarding approach using the ‘IP Flow Information Export (IPFIX)’ packet delivery performance reports. The IPFIX-derived multi-greedy formulations, especially GREEDY~GREEDY-COMPASS~ELLIPSOID (GGCE), showed improved forwarding efficiency in comparison to its greedy constituents over a simulated VANET environment. For example, a packet delivery rate of 66.96% was achieved by the GGCE method in comparison to 59.51, 61.61, and 62.58% of its three constituents including GREEDY, ELLIPSOID, and GREEDY-COMPASS respectively. The second design is a topology-aware demonstration of multi-greedy forwarding efficiency using average packet forwarding distance dissimilarities. Accordingly, the dissimilarity indices of a MANET’s topology by node size can be matched to selected forwarding metrics for adaptive multi-greedy performance. The simulation results show that multi-greedy forwarding would be beneficial in the examined VANET case, but vaguely so for a less dynamic MANET case. With its simple ‘if-else’ condition checking from coupled context-aware schemes, the multi-greedy forwarding mechanism can replace the conventional method in most existing geographic routing protocols. | en_US |
| dc.description.sponsorship | Botswana International University of Science and Technology (BIUST) | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Botswana International University of Science and Technology (BIUST) | en_US |
| dc.subject | Mobile ad hoc networks | en_US |
| dc.subject | Position-based protocols | en_US |
| dc.subject | Geographic greedy packet routing | en_US |
| dc.subject | Context-awareness | en_US |
| dc.subject | Multi-greedy forwarding | en_US |
| dc.subject | Topology characterizing | en_US |
| dc.title | A multi-greedy forwarding approach in geographic packet routing | en_US |
| dc.description.level | phd | en_US |
| dc.description.accessibility | unrestricted | en_US |
| dc.description.department | cis | en_US |
Files in this item
This item appears in the following Collection(s)
-
Faculty of Sciences
This collection is made up of electronic theses and dissertations produced by post graduate students from Faculty of Sciences