Multi-Point Relaying Node Selection for Wireless Network Reliability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Mobile ad-hoc networks in convoy scenarios face challenges such as route breakage due to node mobility, interference, and physical barriers, which affect the reliability and efficiency of communication systems, particularly in the absence of a fixed infrastructure.
Innovation Solution
The method enhances the reliability of multicasting forwarding protocols by establishing a list of multi-point relaying (MPR) nodes that cover all nodes within two hops, with redundant MPR selection schemes to cope with high mobility and link failures, using techniques like secondary MPR set calculation and configuration-aware MPR selection to ensure continuous communication.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If proactive routing protocols are used to maintain current routing tables with routes to every other node, then route discovery latency is reduced, but network resource consumption increases considerably
Solution Approach 1:
The patent applies local quality by making routing information selective rather than universal. Nodes only maintain and update routing tables for destinations that are actually reachable within two hops, rather than maintaining tables for all possible network nodes. This localized approach reduces unnecessary network traffic and resource consumption while still providing fast route discovery for relevant destinations.
Solution Approach 2:
The patent uses partial action by implementing a hybrid approach that combines elements of both proactive and reactive routing. Instead of fully proactive routing that maintains all possible routes, or fully reactive routing that discovers routes on-demand, the system maintains routing tables proactively only for two-hop neighbors, providing a balanced solution that reduces overhead while maintaining low latency for local communications.
2Use of energy by moving object
If reactive routing protocols are used to maintain information only on current or recently used routes, then network resource usage is reduced, but route discovery latency increases during startup
Solution Approach 1:
The patent applies preliminary action by pre-establishing routing tables for two-hop neighbors before actual data transmission occurs. When a node joins the network or a route is needed, the routing information is already available in the routing table, eliminating the need for route discovery protocols and reducing latency. This pre-computation is done efficiently by leveraging the limited two-hop scope.
Solution Approach 2:
The routing table maintenance is made dynamic and adaptive. Nodes continuously update their routing tables for two-hop neighbors using efficient flooding mechanisms, but only when necessary. The system dynamically adjusts between proactive updates for stable routes and reactive discovery when routes change, optimizing the balance between resource usage and latency based on actual network conditions.
3Reliability
If the number of MPR nodes is increased to improve network coverage and reliability, then delivery ratio improves, but forwarding overhead increases
Solution Approach 1:
The patent merges the functions of multiple MPR nodes by allowing a single node to serve as an MPR for multiple different destinations. Instead of having separate MPR nodes for each destination, the system consolidates these roles, reducing the total number of forwarding operations required while maintaining comprehensive network coverage and reliability.
Solution Approach 2:
The patent uses copying by allowing routing information and MPR selections to be replicated and shared across multiple nodes through efficient flooding mechanisms. Instead of each node independently calculating and maintaining separate MPR sets, nodes copy and propagate routing information from neighbors, reducing computational overhead while maintaining accurate routing tables.
Data Source
AI summary
A method for enhancing the reliability of a simplified multicasting forwarding protocol in a wireless network is provided. The method comprises establishing a list of multi-point relaying (MPR) nodes for each of a plurality of nodes. The list of MPR nodes includes neighbor nodes that cover each of the plurality of nodes within two hops. A first set of nodes is identified that is not already in the list of MPR nodes. In a first approach, the first set of nodes includes nodes that are the only neighbor node to a node in the list of MPR nodes. In a second alternative approach, the first set of nodes includes nodes that are sequentially previous to a node in the list of MPR nodes. Once the first set of nodes is identified, the first set of nodes is added to the list of MPR nodes. If the first approach is used, the method further comprises identifying a second set of nodes that is not already in the list of MPR nodes. The second set of nodes comprises nodes that have the largest number of neighboring MPR nodes. The second set of nodes is then added to the list of MPR nodes.