Ad Hoc Network Routing via Hop Count and Qualifier Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
There is a need for improvement in ascertaining presence in wireless networks, particularly in efficiently routing messages within ad hoc networks to ensure reliable communication while managing hop counts and node preferences.
Innovation Solution
The method involves maintaining a routing table with next hop addresses, hop counts, and qualifiers in ad hoc networks, where intermediate nodes select the next hop based on hop count and qualifier comparisons to ensure messages do not exceed a maximum hop count and prefer nodes with better traffic load, transmission failure, and signal strength characteristics.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Area of stationary object
If messages are routed through multiple intermediate nodes in ad hoc networks, then network coverage is extended, but the hop count increases and message delivery reliability decreases
Solution Approach 1:
The patent pre-calculates and stores routing information including next-hop addresses, hop counts, and qualifiers in routing tables before messages need to be transmitted. This preliminary preparation enables nodes to quickly select optimal paths without real-time computation, reducing transmission delays and improving reliability while maintaining extended network coverage through pre-planned multi-hop routes
Solution Approach 2:
The patent implements a qualifier field in routing table entries that provides feedback information about next-hop node quality. This qualifier is updated based on observed transmission success rates and traffic conditions, allowing the routing algorithm to preferentially select nodes with better performance history, thereby improving message delivery reliability while traversing extended network paths
2Loss of time
If the maximum hop count is strictly limited, then message delivery time is reduced, but network coverage area is restricted
Solution Approach 1:
The patent makes the maximum hop count dynamic rather than fixed. The effective maximum hop count adapts based on network conditions, message priority, and available routing paths. High-priority messages may receive increased hop count allowances to reach distant nodes, while low-priority messages maintain stricter limits, thus balancing delivery time requirements with extended coverage needs
Solution Approach 2:
The patent changes the parameter of maximum hop count from a static system-wide constant to a dynamic value that can be adjusted per message and per routing context. This parameter change allows the system to optimize between delivery speed and coverage area by selectively increasing hop limits for messages that benefit from extended routing paths while maintaining tight limits for time-sensitive communications
3Reliability
If routing decisions consider multiple qualifiers including traffic load and transmission failures, then message delivery reliability is improved, but routing table complexity increases
Solution Approach 1:
The patent creates a universal qualifier field in the routing table that consolidates multiple quality metrics (traffic load, transmission failure rate, signal strength) into a single composite value. This multi-functional qualifier captures diverse routing considerations in one parameter, allowing the routing algorithm to make reliable decisions without managing separate complex data structures for each metric, thus improving reliability while controlling routing table complexity
4Measurement precision
If intermediate nodes continuously update routing information, then routing accuracy is improved, but energy consumption increases
Solution Approach 1:
The patent implements periodic updates of routing table information at intermediate nodes rather than continuous updates. Nodes refresh their routing entries at predetermined intervals and only when significant changes occur, reducing the frequency of energy-intensive transmission and processing operations while maintaining sufficiently accurate routing information for reliable message delivery across the network
Data Source
AI summary
One of many aspects of the invention relates to an ad hoc network in which inbound messages are communicated from an originating node to a gateway node via a plurality of intermediate nodes. In this respect, a method performed by an intermediate node in communicating the inbound message to the gateway node includes: maintaining a routing table; and using the routing table, selecting a node for use as the next hop by determining whether a maximum number of allowable hops for an inbound message is exceeded by using such node, and comparing a preference of using such node to preferences of using other known nodes by which the maximum number of allowable hops would not be exceeded. Another aspect includes sending a “leave” message when an intermediate node leaves the ad hoc network, whereby the intermediate node is removed from similar routing tables maintained by other intermediate nodes.