VINE Zero-Control Mesh Routing via Data Packet Inspection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing mesh network protocols face inefficiencies and scalability issues due to the reliance on control packets for route discovery, which consume bandwidth, increase channel contention, and reduce battery life, especially in large and rapidly changing networks.
Innovation Solution
The VINE protocol utilizes data packets to build routing state, known as gradient state, eliminating the need for control packets by using data packets to establish and maintain routing information, allowing packets to be forwarded along non-increasing gradients until the destination is reached.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If control packets are used for route discovery in mesh networks, then routing information can be exchanged between nodes, but bandwidth consumption increases and channel contention increases
Solution Approach 1:
The patent merges the routing control function with the data packet transmission function. Instead of using separate control packets for route discovery, the system uses data packets themselves to carry routing information through their headers. This consolidation eliminates the need for dedicated control traffic and reduces overall bandwidth consumption while maintaining reliable routing information exchange.
Solution Approach 2:
The data packets are given multiple functions: they carry user data payload while simultaneously embedding routing control information in their headers. This multi-functionality allows a single packet type to serve both communication and routing purposes, eliminating the need for separate control packets and reducing channel contention.
2Reliability
If control packets are used for route discovery, then routing state can be established, but battery life decreases due to increased energy consumption
Solution Approach 1:
By combining routing control information with data packet transmission, the system eliminates the need for separate control packets that would consume additional energy. The same radio resources used for data communication are also used for routing, thereby extending battery life while maintaining reliable routing state establishment.
Solution Approach 2:
The system maintains continuous routing state establishment through the ongoing data packet transmission process itself. As data packets flow through the network, they continuously update routing information, eliminating the need for periodic control packet exchanges that would consume additional energy and reduce battery life.
3Reliability
If traditional routing protocols are used, then routing tables can be maintained at each node, but scalability is limited due to the overhead of route updates
Solution Approach 1:
The patent extracts the routing control function from traditional routing protocols and integrates it directly into data packet processing. Instead of maintaining separate routing tables and performing periodic route updates, the system extracts routing information directly from the data packet headers, thereby enabling better scalability while maintaining reliable routing table maintenance through the data flow itself.
Solution Approach 2:
The data packets themselves provide the routing information needed for network operation. The packets serve their own routing needs by embedding control information in their headers, eliminating the need for separate routing protocol overhead and enabling scalability while maintaining effective routing table maintenance through the packets' own transmission process.
Data Source
Figure 1A~1C
Figure 2
Figure 3
AI summary
A MANET protocol, comprising: receiving a data packet (DP) from a current sender (CS) by a recipient, defining: an identity of the CS, a prior sender (PS) from which CS received DP, and a target recipient (ID), a count (HC) of hops previously traversed by DP, and a sequence identifier (SI); updating a forwarding table (FT) to mark CS as being reachable in one hop, and PS as being reachable in two hops via CS as next hop; determining if ID is the recipient; determining whether to rebroadcast by recipient, if and only if the SI is not present in a list of prior SIs; and selectively rebroadcasting DP by recipient in dependence on said determining, modified by: replacement of CS with an identity of the recipient, PS with CS, and ID with a next hop from the FT if present, and incrementing HC.