Data Network Node Numbering Algorithm for Base Station Elimination

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data networking technologies require powerful base stations and additional time for network reconstruction when signal conditions or node numbers change, leading to increased costs and deployment time.

Innovation Solution

A data networking method that uses a node numbering algorithm with minimal packet relays from a modem to a node, where nodes are assigned numbers based on the number of relays, allowing for efficient packet transmission without the need for powerful base stations and reduces network reconstruction time.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional base station architecture is used, then network coverage and signal quality are improved, but device complexity and deployment costs increase

Engineering Contradiction:
Improvenetwork coverageVSAvoidbase station requirements
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent extracts the base station functionality from the network architecture and replaces it with modem-based packet relaying. Each modem becomes a potential relay node, eliminating the need for dedicated powerful base stations while maintaining network coverage through distributed packet forwarding.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The network nodes (modems and devices) automatically determine their own packet relay paths based on the numbering algorithm without requiring centralized base station control. Each node independently participates in packet relaying based on its assigned number, enabling self-organizing network operation.

Inventive Principle:
Principle #25Self-service

2Adaptability or versatility

If network reconstruction is performed when signal conditions or node numbers change, then network adaptability is improved, but deployment time and operational disruption increase

Engineering Contradiction:
Improvenetwork adaptabilityVSAvoidnetwork reconstruction time
Core Design Contradiction:
Adaptability or versatilityVSLoss of time

Solution Approach 1:

The patent implements dynamic packet relaying where the relay path is determined by real-time node numbering rather than fixed network topology. When nodes are added or removed, the numbering algorithm automatically adjusts packet routes without requiring network reconstruction, as each node independently determines its relay role based on its assigned number.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The network pre-assigns numbers to nodes and pre-establishes the packet relaying logic based on these numbers. This preliminary numbering allows the network to dynamically adapt to changes without reconstruction time, as the relaying behavior is predetermined by the numbering scheme rather than requiring real-time topology optimization.

Inventive Principle:
Principle #10Preliminary action

3Measurement precision

If comprehensive network information is stored at each node, then routing precision is improved, but memory requirements and device complexity increase

Engineering Contradiction:
Improverouting precisionVSAvoidinformation storage
Core Design Contradiction:
Measurement precisionVSQuantity of substance

Solution Approach 1:

The patent implements local quality by having each node store only its own number and use this local information to determine packet relaying behavior. Instead of storing comprehensive network topology information at each node, the numbering scheme provides sufficient local routing information, reducing memory requirements while maintaining routing precision through the structured numbering system.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS11564146B2Method for organizing a data transmission network
Publication Date: 2023.01.24 SOKOLOV YURI BORISOVICH
  • US11564146B2 patent drawing

AI summary

A method for organizing a data transmission network relates to information technologies and is intended to create an information transmission network between two or more points at a distance. The technical result of the claimed solution is a simplification in structure and a reduction in build time and the cost of network usage. The method is built on a node indexing algorithm based on a minimum number of packet retransmissions from modem to node. The method allows the use of a plurality of optionally moveable modems in a network and the use of wired and wireless networks, does not require the presence of a powerful base station, does not require additional time for rebuilding a network when signal transmission conditions are changed or when the number of nodes in a network is changed, allows a network structure to be built and the built structure to be further optimized, and does not require the nodes to store information about the network environment, which substantially lowers the cost of the solution.