Configuration-Aware Packet Routing in Ad-Hoc Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current ad-hoc wireless networks face challenges in route recovery due to link breakages, leading to packet drops and delayed communication, especially in real-time applications like VoIP, as existing protocols rely on brute force route discovery and do not account for network configuration, resulting in unacceptable latency and reliability issues.
Innovation Solution
The method employs configuration-aware routing, where nodes use pre-recorded configuration information to quickly forward packets towards the destination node during route breakages, and sends redundant packets along multiple routes to ensure timely delivery, adjusting the number of redundant packets based on distance to improve reliability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If reactive protocols are used for route discovery, then network resources are conserved, but route discovery latency increases significantly
Solution Approach 1:
The patent pre-calculates and stores routing paths using configuration information (such as geographic locations and transmission ranges) before actual data transmission occurs. When a route breakage is detected, the pre-computed alternative paths are immediately activated without requiring time-consuming brute force discovery, thus resolving the contradiction between resource conservation and fast route recovery
Solution Approach 2:
The routing protocol dynamically switches between using pre-computed paths and initiating new path discoveries based on network conditions. Configuration information is updated periodically or upon topology changes, allowing the system to adapt between proactive path preparation and reactive path discovery to optimize both resource usage and latency
2Loss of time
If proactive protocols are used to maintain current routing tables, then route discovery latency is reduced, but network resources are significantly consumed
Solution Approach 1:
Instead of maintaining complete routing tables to all nodes (global proactive approach), the patent maintains configuration information locally at each node about its position and transmission range. Route paths are computed on-demand using this local information, achieving fast routing without the resource overhead of comprehensive proactive routing tables
Solution Approach 2:
The patent changes the fundamental parameter from maintaining complete routing tables to maintaining compact configuration information (locations, transmission ranges). This parameter change enables efficient path computation without the resource consumption of traditional proactive protocols
3Reliability
If brute force route discovery is used after link breakage, then route recovery is achieved, but packet drops and communication delays increase
Solution Approach 1:
Alternative routing paths are pre-computed and stored based on configuration information before link breakages occur. When a breakage is detected, these pre-computed paths are immediately activated, avoiding packet drops and delays associated with brute force discovery while maintaining reliable route recovery
Solution Approach 2:
The patent prepares backup routing paths in advance as a cushion against potential link breakages. This beforehand preparation ensures that when breakages occur, immediate alternative paths are available, cushioning against packet drops and communication delays
Data Source
AI summary
A method of routing a packet in an ad-hoc network is provided. The method provides a packet at a first node, the first node being one of a plurality of nodes. A destination node is determined for the packet, the destination node being one of the plurality of nodes. Configuration information is also provided, the configuration information representing the location of each of the plurality of nodes. Finally, at least one forward node in a direction towards the destination node is selected based on the configuration information, and packets are sent to the at least one forward node.


