Virtual Addressing for Mesh Network Nodes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless mesh networks face inefficiencies due to the need for large addressing payloads to specify node and capability addresses, leading to increased power consumption and reduced network capacity, especially in battery-powered devices, as well as excessive network traffic from periodic requests for sensor data.
Innovation Solution
The implementation of virtual addressing, where a unique identifier (UID) is hashed to form a virtual address, reducing the size of the destination address in packet headers and enabling more efficient communication by allowing nodes to publish and subscribe to specific capabilities, thereby reducing the need for extensive addressing information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If device-level addressing is used to specify node and capability addresses, then addressing precision is improved, but packet size increases leading to higher power consumption
Solution Approach 1:
The patent segments the addressing function into two parts: a compact virtual address (portion of UID hash) for packet routing and a full UID for destination identification. This segmentation allows precise addressing while keeping packet addresses short, resolving the contradiction between addressing precision and power consumption.
Solution Approach 2:
The patent introduces a virtual address as an intermediary between the packet and the destination node. This virtual address (derived from UID hash) acts as a mediator that enables precise destination identification without requiring the full UID in every packet, thus reducing packet size and power consumption while maintaining addressing precision.
2Measurement precision
If device-level addressing is used to specify node and capability addresses, then addressing precision is improved, but network capacity is reduced
Solution Approach 1:
The patent segments the address into a compact virtual address portion (from UID hash) for network routing. This segmentation reduces the addressing payload size in packets, increasing network capacity while maintaining the ability to precisely identify destinations through the virtual address mechanism.
Solution Approach 2:
The patent creates a condensed copy (virtual address derived from UID hash) of the full destination identifier. This copy is used in packets instead of the full address, reducing packet size and increasing network capacity while preserving addressing precision through the hash-based virtual address.
3Loss of information
If periodic requests for sensor data are sent, then data freshness is improved, but network traffic increases
Solution Approach 1:
The patent implements periodic publishing of sensor data at the source node without requiring periodic requests from destination nodes. This periodic action maintains data freshness while eliminating the request-response traffic pattern, significantly reducing overall network traffic.
Solution Approach 2:
The source node autonomously publishes sensor data periodically without being triggered by destination node requests. This self-service approach maintains data freshness while eliminating the need for request-response interactions, reducing network traffic.
Data Source
AI summary
In embodiments of virtual addressing for mesh networks, a node in a mesh network publishes packets and/or subscribes to packets using a virtual address that is derived from a unique identifier. The unique identifier has a larger address space than the destination address field of the packet. The unique identifier and an application key are hashed to elide the unique identifier from the destination address that is transmitted in the packet over the mesh network. A node receiving the packet can determine that the address is a virtual address, and disambiguate the destination address to determine that the virtual address corresponds to a unique identifier known to the receiving node.