Mobile Router Directed Acyclic Graph Formation in Ad Hoc Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing MANET protocols face challenges in quickly adapting to rapid topology changes and efficiently connecting mobile ad hoc networks to the Internet, with existing protocols either requiring excessive processing and overhead or experiencing delays in convergence times.
Innovation Solution
Mobile routers in the ad hoc network are configured to concurrently attach to multiple parents, forming a directed acyclic graph relative to a clusterhead, allowing for the propagation of reachable prefixes and routing information with minimal overhead, enabling stable connectivity and load balancing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If mobile routers attach to multiple parents forming a directed acyclic graph, then network stability and connectivity are improved, but routing complexity and processing overhead increase
Solution Approach 1:
The patent implements dynamic parent selection where mobile routers can concurrently attach to multiple parents and dynamically switch between them based on link quality and network conditions. This dynamic approach allows the network to adapt to topology changes while maintaining stable connectivity, as routers can select optimal paths without requiring complete routing recalculations.
Solution Approach 2:
The patent changes the routing parameter model by introducing depth-relative addressing and prefix aggregation based on hierarchical levels in the directed acyclic graph. Instead of traditional flat routing tables, routers use depth-based parameter changes to simplify path selection and reduce processing overhead while maintaining multiple path capabilities.
2Loss of information
If traditional routing protocols are used in MANET, then routing information can be propagated, but convergence time increases and processing overhead becomes excessive
Solution Approach 1:
The patent implements preliminary action by pre-establishing multiple parent attachments and pre-calculating depth-based routing paths before topology changes occur. Routers maintain ready-to-use alternative paths and perform preliminary route validation, enabling rapid convergence when link failures occur without requiring extensive real-time routing recalculations.
Solution Approach 2:
The patent segments the routing information propagation by dividing the network into depth-based hierarchical zones relative to the clusterhead. Each router only needs to propagate routing information to its designated parents at higher depth levels, rather than flooding the entire network. This segmentation reduces processing overhead and accelerates convergence time by limiting the scope of routing updates.
Data Source
AI summary
Each mobile router in an ad hoc mobile network is configured for concurrently attaching to multiple parents advertising respective parent depths relative to a clusterhead of the ad hoc mobile network. The mobile router selects an advertised depth relative to the clusterhead based on adding a prescribed increment to a maximum one of the parent depths, enabling the mobile routers to form a directed acyclic graph relative to the clusterhead. Each mobile router sends to each of its parents a neighbor advertisement message specifying at least one reachable prefix, a corresponding cost for reaching the reachable prefix, and a corresponding sequence identifier that enables the parents to validate the neighbor advertisement message relative to stored router entries. Hence, mobile routers automatically can form a directed acylic graph relative to the clusterhead, and can distribute routing information with minimal overhead.