Ad-hoc Network Routing Using Connection Duration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional routing protocols are inefficient in dynamic ad-hoc networks with highly mobile nodes, such as air-to-air networks, as they require frequent updates and lead to route flooding, bandwidth occupation, and instability, and are cumbersome for achieving limited routing functionality.
Innovation Solution
A lightweight routing protocol that determines the next hop for packet routing based on the availability of communicative connections and location of nodes, using route-alive messages to identify connections and select nodes with longer updated route times for priority, thereby reducing the need for extensive routing tables and minimizing route flooding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional routing protocols are used in dynamic ad-hoc networks, then routing information can be obtained through exchange of big data structures, but network stability deteriorates due to frequent updates and route flooding
Solution Approach 1:
The patent extracts only the essential routing information needed for packet forwarding - specifically the route time parameter indicating connection availability - rather than exchanging complete routing tables with all destination nodes. This extraction of critical information reduces update frequency and improves network stability in dynamic ad-hoc environments
Solution Approach 2:
Instead of proactively updating routing tables whenever topology changes (traditional approach), the patent inverts the approach by having nodes request routing information only when needed for packet forwarding. This reactive routing model eliminates frequent routing updates and route flooding while maintaining network stability
2Loss of information
If traditional routing protocols exchange complete routing information, then all routing paths are known, but bandwidth is occupied by frequent routing updates
Solution Approach 1:
The patent extracts only the essential route time parameter from complete routing information, allowing nodes to determine connection availability without exchanging comprehensive routing tables. This selective information exchange maintains necessary routing knowledge while dramatically reducing bandwidth consumption for routing updates
Solution Approach 2:
The patent applies partial action by exchanging only the minimum necessary routing information (route time) rather than complete routing tables. This partial information exchange is sufficient for determining next-hop selection in ad-hoc networks while minimizing bandwidth occupation
3Ease of operation
If routing is based on number of next hops, then routing decisions are simple, but connection availability over time is not considered
Solution Approach 1:
The patent changes the routing decision parameter from static next-hop counting to dynamic route time measurement. Nodes select next-hops based on route time values indicating connection availability duration, making routing decisions both simple (comparing numeric values) and reliable (considering actual connection stability in mobile environments)
Data Source
AI summary
In an embodiment, a method of routing packets at a first node in an ad-hoc network is provided. The method includes receiving, at the first node, a plurality of route-alive messages corresponding to a destination, each of the plurality of route-alive messages including a route time indicating a length of time in which a communicative connection is available between the second node that sent the respective route-alive message and the destination. The method also includes determining an updated route time for each second node. The updated route time corresponds to a length of time in which a communication connection is available between the first node and the destination through the respective second node. A second node is selected for sending a packet to based on the updated route time for each of the second nodes, wherein a node having a longer updated route time is given higher priority for selection.