Swarm Autonomous Routing Algorithm for MANETs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing mobile ad hoc network (MANET) technologies face challenges in scalability, reliability, and adaptability due to node mobility, network traffic, and size, with existing routing protocols inefficiently handling dynamic environments and relying on outdated routing tables.
Innovation Solution
The Swarm Autonomous Routing Algorithm (SARA) employs biologically-inspired swarm intelligence, using pheromone tables to make routing decisions without relying on traditional routing tables, allowing nodes to adaptively determine the best path for packet transmission based on link quality and geographical location.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional routing tables are used in MANET, then routing decisions can be made based on pre-computed paths, but the system becomes unreliable and inefficient in dynamic environments with mobile nodes
Solution Approach 1:
The patent applies dynamics by making the routing system adaptive to changing network conditions. Instead of static routing tables, the system continuously updates routing information based on current node positions and link qualities, allowing the network to dynamically respond to node mobility and changing topologies.
Solution Approach 2:
The patent implements feedback mechanisms where nodes continuously exchange routing information and update their routing tables based on received feedback from neighbors. This feedback loop allows the system to adapt to changing conditions and maintain reliable routing despite node mobility.
2Loss of information
If routing tables are maintained for all possible destinations, then complete routing information is available, but the device complexity and memory requirements increase significantly
Solution Approach 1:
The patent applies segmentation by dividing the routing information into smaller, manageable pieces stored in distributed routing tables at each node. Instead of maintaining complete routing information centrally, each node stores only the routing information relevant to its local context, reducing individual device complexity while maintaining overall network routing capability.
Solution Approach 2:
The patent transitions from traditional flat routing tables to a multi-dimensional routing structure that considers not only destination addresses but also node positions, link qualities, and hierarchical network layers. This dimensional expansion allows more efficient storage and retrieval of routing information without increasing complexity linearly.
3Ease of manufacture
If conventional routing protocols are used, then implementation is straightforward based on existing standards, but the protocols cannot efficiently handle large-scale dynamic networks with hundreds or thousands of mobile nodes
Solution Approach 1:
The patent implements universal routing principles that can adapt to various network sizes and configurations. The routing protocol is designed to function efficiently whether the network has a few nodes or thousands, automatically adjusting its behavior based on network conditions rather than requiring different protocols for different scales.
Solution Approach 2:
The patent employs parameter changes by dynamically adjusting routing metrics such as link quality thresholds, routing table update frequencies, and packet forwarding probabilities based on network conditions. This allows the protocol to optimize performance for different network sizes and mobility patterns without changing the fundamental protocol structure.
Data Source
AI summary
A Swarm Autonomous Routing Algorithm (SARA) is performed by simple communication node devices for node to node communications in a network, especially a Mobile Ad hoc NETwork (MANET). Each node maintains a table of pheromone values for known neighbor nodes. Pheromone values are dynamic for adapting to a dynamic arrangement of nodes, and are updated either passively or actively. Routing tables are not used. When a node receives a packet, it uses the pheromone table to simply determine whether or not to forward (rebroadcast) the packet to a neighbor node, and if possible, determines and indicates the best neighbor node for next forwarding the packet. Destination Zone Routing (DZR) and Swarm Location Service (SLS) are alternative enhancements of SARA that can be used for more efficient routing when nodes are location aware/knowledgeable. SLS may also be used to improve routing algorithms other than SARA.