Examining Reliability of Wireless Multihop Network Routing with Linear Systems
"Study the reliability of routing in wireless multihop networks using theoretical tools. The research evaluates packet delivery within deadlines in the presence of random failures. A model is presented, applying concepts of stochastic dynamical systems to represent the dynamic behavior of wireless networks. Reachability analysis is employed for network performance evaluation, with simulations comparing standard routing protocols. Theoretical findings can benchmark existing approaches and identify vulnerabilities in routing algorithms."
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Examining Reliability of Wireless Multihop Network Routing with Linear Systems Trisha Biswas , Kendra Lesser , Rudra Dutta , Meeko Oishi North Carolina State University University of New Mexico
Problem Definition Study reliability of routing in wireless multihop networks using theoretical tools Reliability evaluates that a packet reaches the destination node within a given deadline Wireless networks are prone to random failures due to the medium
The Model: Multihop Network as a Dynamical System Present a model for multihop wireless networks Use concepts of stochastic dynamical systems to represent dynamic behavior of wireless networks = [1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1] 15 1 7 12 4 10 14 2 9 5 16 6 13 8 17 11 3
The System: Reachability Analysis for Network Performance Apply the concept of reachability analysis to multihop network model Use dynamic programming formulation to find upper bound on reachability probability
Evaluation & Results Simulations of the system and comparisons with standard routing protocols such as Optimized Link State Routing (OLSR) Ad hoc On-demand Distance Vector routing (AODV)
Conclusions and Applications Theoretical system computes optimal reliability path and successfully bounds standard routing protocols Can be used to benchmark existing routing approaches to build more robust protocols Can help identify vulnerabilities of existing routing algorithms
