Ad Hoc Routing Using Rooted Trees and Shortcuts
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Ad hoc communication networks face challenges in maintaining efficient communication sessions due to dynamic node connections and the need for optimized resource allocation, particularly in large networks where existing routing protocols like AODV and GPS-based systems are inefficient and prone to delays and message flooding.
Innovation Solution
Organizing communication devices into rooted trees with shortcuts, where each node has a unique path to the tree root and can dynamically adjust coordinates to minimize updates and maximize connectivity, allowing for efficient routing and session management by fusing trees and introducing shortcuts to reduce message hops.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If search-driven routing protocols are used to find paths in dynamic ad hoc networks, then routing adaptability is improved, but network overhead and delay increase due to flooding of search messages
Solution Approach 1:
The patent applies preliminary action by pre-establishing routing tables at each node that store forwardings to neighboring nodes. When a node receives a packet, it consults its pre-computed routing table to determine the next hop, eliminating the need for real-time flooding of search messages. This pre-computation of routing information allows the system to adapt to dynamic network conditions while avoiding the overhead of on-demand path discovery.
2Quantity of substance
If AODV routing algorithm is used to reduce routing overhead, then network overhead is reduced, but queue overflow and message loss increase in large condensed networks
Solution Approach 1:
The patent applies segmentation by dividing the network into multiple rooted trees, where each node maintains routing information for multiple tree roots. This segmentation allows packets to be routed through different trees based on availability, providing redundancy. If one path fails or causes queue overflow, alternative paths through other trees can be used, improving message delivery reliability while maintaining controlled overhead through the hierarchical tree structure.
3Productivity
If GPS-based geographic routing is used to optimize path selection, then routing efficiency is improved, but device complexity increases due to location tracking requirements
Solution Approach 1:
The patent applies this principle by using virtual coordinates that are computationally inexpensive to calculate and update, replacing expensive GPS location tracking. The virtual coordinates are derived from the rooted tree structure and can be updated through simple path computations rather than requiring continuous location monitoring. This provides routing efficiency similar to GPS-based methods while significantly reducing device complexity and energy consumption.
4Device complexity
If rooted tree structure is used to organize nodes, then routing complexity is reduced, but network connectivity flexibility decreases compared to full mesh topology
Solution Approach 1:
The patent applies merging by combining multiple rooted trees into a forest structure, where each node can reach multiple tree roots. This allows the system to maintain the simplified routing benefits of tree structures while achieving the connectivity flexibility of mesh topologies. Nodes can route packets through different trees based on destination availability, effectively merging the advantages of both hierarchical and fully connected approaches.
Data Source
AI summary
A method for organizing a plurality of communication devices of an ad hoc communication system into a communication network. The devices are organized into one or more communication graphs where at least one of the graphs is a rooted tree. The invention also provides an ad hoc communication system wherein the devices are organized into one or more communication graphs, where at least one of the graphs is a rooted tree. A method for routing a communication session in the system is also provided where a session is routed from the calling node to the tree root and from the tree root to the called node. In a preferred embodiment, shortcuts are sought in the session route.