Inter-local peer group routing for mobile ad-hoc networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication networks in mobile environments face challenges in efficiently routing messages between multiple local peer groups, particularly in achieving low latency and high throughput for inter-LPG communication, which is crucial for applications like collision avoidance.
Innovation Solution
An on-demand method for routing data between local peer groups, involving the transmission of route request and response messages, selection of boundary nodes, and maintenance of routing tables to ensure efficient data transfer across overlapping radio coverage areas.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If on-demand routing with route request messages is used for inter-LPG communication, then routing flexibility and adaptability improve, but message transmission latency increases
Solution Approach 1:
The patent pre-establishes routing paths between LPGs using route request messages during periods when no data needs to be transmitted. These pre-computed routes are stored in routing tables, allowing immediate data transmission without waiting for on-demand route discovery, thus reducing latency while maintaining routing flexibility.
Solution Approach 2:
The routing system dynamically adapts to changing network conditions by periodically updating routing tables and adjusting paths based on current LPG positions and network topology. This dynamic approach maintains routing flexibility while minimizing the impact of route discovery on latency through intelligent update scheduling.
2Adaptability or versatility
If route request messages are relayed across multiple LPGs to discover paths, then routing capability between distant LPGs improves, but network overhead and complexity increase
Solution Approach 1:
The patent divides the network into autonomous LPG segments, each managing its own internal routing independently. Boundary nodes act as gateways between segments, handling inter-LPG routing decisions. This segmentation reduces overall network complexity by localizing routing logic while maintaining capability to route between any LPGs through coordinated boundary node interactions.
Solution Approach 2:
Boundary nodes serve as intermediaries between different LPGs, simplifying inter-LPG communication by providing a standardized interface for route request messages. These boundary nodes aggregate routing information and coordinate path discovery across LPG boundaries, reducing the complexity burden on individual LPGs while maintaining comprehensive routing capability.
3Reliability
If routing tables are continuously updated with latest LPG positions, then routing accuracy and reliability improve, but processing overhead and energy consumption increase
Solution Approach 1:
The patent implements periodic routing table updates at predetermined intervals rather than continuously monitoring and updating with every LPG position change. This periodic approach maintains sufficient routing accuracy for mobile ad-hoc networks while dramatically reducing processing overhead and energy consumption compared to continuous updates.
Solution Approach 2:
The routing system adjusts update frequency and trigger conditions based on network conditions, LPG density, and mobility patterns. When LPGs are stationary or moving slowly, update frequency is reduced. When rapid topology changes are detected, updates are triggered more frequently. This adaptive parameter adjustment maintains routing accuracy while optimizing energy consumption.
Data Source
AI summary
An on-demand method of routing data between a plurality of local peer groups (LPG) of plural moving nodes comprises transmitting a route request message from a source node, relaying the route request message to a native boundary node; forwarding the route request message to a foreign boundary node, determining if the destination node is within an LPG for the foreign boundary node; relaying the route request message to another boundary node if the destination node is not within the LPG, relaying the route request message to the destination node if the destination node is within the LPG, receiving the routing request message at the destination node, transmitting a routing response to the source node, relaying the routing response to the source node through a path discovered by the route request, receiving the routing response at the source node, and transmitting the data, upon receipt of the routing response.