Towards LP Modeling for Maximizing Throughput and Minimizing Routing Delay in Proactive Protocols in Wireless Multi-hop Networks
N. Javaid, Z. A. Khan, U. Qasim, M. A. Khan, K. Latif, A. Javaid

TL;DR
This paper develops Linear Programming models to optimize throughput and reduce routing delay in wireless multi-hop networks, analyzing different proactive routing protocols under various mobility and traffic scenarios.
Contribution
It introduces LP models tailored for WMhNs and evaluates their effectiveness across multiple proactive routing protocols and network conditions.
Findings
LP models effectively optimize network throughput and delay.
Routing protocol strategies significantly impact LP model constraints.
Performance varies with mobility and traffic flow scenarios.
Abstract
Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different routing protocols are used to facilitate users demand(s). To practically examine constraints of respective LP_models over different routing techniques, we select three proactive routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). These protocols are simulated in two important scenarios regarding to user demands; mobilities and different network flows. To evaluate the performance, we further relate the protocols strategy effects on respective constraints in selected network scenarios.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
