Ad-Hoc Wireless Routing Table Maintenance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing protocols are not suitable for ad-hoc wireless networks due to high overhead and inability to accommodate frequent changes in network topology, leading to lower data throughput compared to wired networks.
Innovation Solution
A method and system for maintaining routing tables in ad-hoc wireless networks, where a first node maintains server and server-to-client routing tables, updates routes based on received data packets, and validates server routes through beacons and security associations to ensure efficient data transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If existing routing protocols are used in ad-hoc wireless networks, then routing functionality is provided, but overhead is high and adaptability to topology changes is poor
Solution Approach 1:
The patent segments routing information into two separate tables: a server routing table for routes to server nodes, and a server-to-client routing table for routes from server nodes to client nodes. This segmentation allows independent management and updates of different routing information types, improving adaptability to topology changes while reducing the overhead of managing a single comprehensive routing table.
Solution Approach 2:
The patent implements dynamic routing table maintenance where nodes continuously update routing information based on received data packets and beacon messages. The routing tables are not static but adapt in real-time to network topology changes, with nodes adding, removing, or modifying routes as network conditions change, thereby achieving high adaptability without excessive overhead.
2Adaptability or versatility
If routing tables are frequently updated to accommodate topology changes, then adaptability improves, but network overhead increases
Solution Approach 1:
The patent employs beacon messages that are periodically transmitted by nodes to proactively announce their presence and routing information. This preliminary action allows nodes to anticipate topology changes before they affect data transmission, updating routing tables based on beacon information rather than waiting for failed transmissions, thereby reducing the frequency and overhead of reactive updates.
Solution Approach 2:
Each node in the network independently maintains and updates its own routing tables based on locally received packets and beacons, without requiring centralized control or extensive communication overhead. Nodes self-service by autonomously making routing decisions and updates, which reduces the overall network overhead compared to protocols requiring centralized routing management.
3Reliability
If security validation is implemented for server routes, then network reliability improves, but processing complexity increases
Solution Approach 1:
The patent uses beacon messages as an intermediary mechanism for security validation. Instead of implementing complex direct security handshakes between all node pairs, nodes validate server routes through beacon messages that carry authentication information. This intermediary approach simplifies security management while maintaining reliability, as beacons serve as a trusted medium for verifying route legitimacy.
Solution Approach 2:
Security associations and validations are established in advance through beacon message exchanges before actual data transmission occurs. Nodes pre-validate server routes and cache authentication information, so that when data packets need to be routed, the validation work has already been completed. This preliminary security setup reduces real-time processing complexity while maintaining high reliability.
Data Source
AI summary
Disclosed herein are methods and systems for maintaining routing tables in an ad-hoc wireless network. In an embodiment, a first node receives, from a second node having a second network address, a first data packet having a third network address as the source address and a fourth network address as the destination address. The first node determines that its server routing table (i) contains a stored server route to the fourth network address and (ii) does not contain a server route to the third network address, and responsively adds, to its server-to-client routing table, a server-to-client route to the third network address with the second network address as the associated next hop. The first node transmits, to the second node at the second network address, a second data packet that has the third network address as the destination address.