A method for configuring a wireless communication coverage extension system is described. The latter comprises a backhaul subnetwork in tree form comprising a plurality of interconnected nodes. At least two nodes directly connected to an internet access gateway are identified among the nodes of the backhaul subnetwork. A single node is selected from the at least two identified nodes to be the node through which a configuration of the wireless communication coverage extension system is defined. The configuration of the wireless communication coverage extension system defined is then sent from the selected node to all the other nodes of the backhaul subnetwork.
Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
3. The method according to claim 2, wherein said server, said request and said response are in accordance with the DHCPv4 protocol or the DHCPv6 protocol.
This invention relates to a method for managing network address assignments in a communication system using the Dynamic Host Configuration Protocol (DHCP), specifically DHCPv4 or DHCPv6. The method addresses the challenge of efficiently allocating and managing IP addresses in a network environment where devices dynamically request and release network configurations. The method involves a server that receives a request from a client device for network configuration parameters, such as an IP address. The server processes this request and generates a response containing the requested configuration. The server may also maintain a database of available addresses and track assigned addresses to prevent conflicts. The method ensures that the server, the request, and the response all comply with either the DHCPv4 or DHCPv6 protocol standards, which define the structure and behavior of the communication between the client and server. The method may include additional steps such as validating the request, checking for available addresses, and updating the database after assignment. The use of DHCPv4 or DHCPv6 ensures compatibility with existing network infrastructure and standards, allowing seamless integration into various network environments. This approach simplifies network administration by automating address assignment and reducing manual configuration errors.
6. The method according to claim 5, wherein said request and said response are in accordance with the neighbour discovery protocol of IPv6.
This invention relates to network communication protocols, specifically improving neighbor discovery in IPv6 networks. The problem addressed is the inefficiency and potential security vulnerabilities in traditional neighbor discovery processes, which can lead to delays, unnecessary traffic, or exposure to attacks. The method involves a neighbor discovery protocol for IPv6 networks that optimizes communication between nodes. It includes sending a request from a first node to a second node and receiving a response from the second node. The request and response are formatted according to the IPv6 neighbor discovery protocol, which includes mechanisms for address resolution, duplicate address detection, and neighbor reachability verification. The method ensures that nodes can efficiently discover and communicate with each other while maintaining security and reducing unnecessary network traffic. Additional features may include mechanisms to handle dynamic network changes, such as node mobility or topology updates, ensuring reliable communication even in dynamic environments. The protocol may also incorporate security measures to prevent spoofing or other malicious activities during neighbor discovery.
7. The method according to claim 1, wherein selecting a single node among said at least two identified nodes comprises selecting the node belonging to a branch of said tree comprising the largest number of nodes.
A method for optimizing node selection in a tree structure involves identifying at least two nodes within the tree that meet specific criteria. The method then selects a single node from these identified nodes based on a predefined rule. The selection rule involves choosing the node that belongs to the branch of the tree containing the largest number of nodes. This approach ensures that the selected node is part of the most extensive substructure within the tree, which may be advantageous for applications requiring balanced or efficient traversal, such as data compression, hierarchical clustering, or decision tree optimization. The method may be applied in various domains where tree-based algorithms are used, including machine learning, database indexing, or network routing, to improve performance or accuracy by prioritizing nodes within the densest branches. The selection process leverages the tree's inherent hierarchy to guide the choice, ensuring that the selected node contributes to maximizing the utility of the tree's structure.
8. The method according to claim 7, wherein selecting the node belonging to a branch of said tree comprising the largest number of nodes comprises selecting the node having a higher serial number in the case where said at least two identified nodes belong to branches of said tree having the same number of nodes.
This invention relates to a method for selecting a node in a tree structure, particularly in scenarios where multiple nodes meet certain criteria. The method is useful in systems where tree-based data structures are used, such as in hierarchical data organization, decision trees, or network routing. The problem addressed is efficiently selecting a node when multiple candidate nodes are identified, ensuring consistency and predictability in the selection process. The method involves identifying at least two nodes in a tree that meet predefined criteria. If these nodes belong to branches with different numbers of nodes, the node from the branch with the largest number of nodes is selected. If the branches have the same number of nodes, the node with the higher serial number is chosen. This ensures a deterministic selection process, avoiding ambiguity when multiple nodes are equally valid candidates. The serial number may be assigned based on insertion order, position, or another consistent metric. This approach is particularly useful in applications where tree traversal or node selection must follow a predictable pattern, such as in data compression, machine learning, or network optimization. By prioritizing branch size and then serial number, the method balances efficiency with fairness, ensuring that larger branches are favored while still providing a clear tiebreaker. The technique can be applied to various tree structures, including binary trees, decision trees, or hierarchical file systems.
9. The method according to claim 1, wherein selecting a single node among said at least two identified nodes comprises selecting the node a link of which with the gateway has a higher performance in terms of bandwidth, error rate and/or latency time.
A method for optimizing network performance in a wireless communication system involves selecting a node from multiple identified nodes to establish a connection with a gateway. The selection is based on evaluating the performance of the links between each node and the gateway, specifically considering factors such as bandwidth, error rate, and latency time. The node with the highest performance in these metrics is chosen to ensure efficient and reliable data transmission. This approach improves network efficiency by dynamically selecting the best available node, reducing data transfer delays and minimizing errors. The method is particularly useful in environments where multiple nodes are available for communication, such as mesh networks or decentralized wireless systems, where maintaining optimal connectivity is crucial for seamless operation. By prioritizing nodes with superior link performance, the system ensures robust and high-speed data exchange, enhancing overall network reliability and user experience.
10. The method according to claim 1, wherein sending the configuration of the wireless communication coverage extension system from the selected node to all the other nodes in the backhaul subnetwork comprises sending a set of parameters allowing configuration of functionalities implemented by said nodes.
This invention relates to wireless communication systems, specifically methods for configuring a wireless communication coverage extension system within a backhaul subnetwork. The problem addressed is the efficient distribution of configuration parameters across multiple nodes in a backhaul subnetwork to ensure proper functionality and coverage extension. The method involves selecting a node within the backhaul subnetwork to act as a central point for distributing configuration settings. This selected node sends the configuration of the wireless communication coverage extension system to all other nodes in the subnetwork. The configuration includes a set of parameters that define the functionalities each node must implement. These parameters enable the nodes to adjust their operations, such as signal transmission, reception, or routing, to extend wireless coverage effectively. The method ensures that all nodes in the subnetwork are synchronized with the same configuration, maintaining consistent performance and coverage across the network. This approach simplifies network management by centralizing configuration distribution and reducing the need for individual node adjustments.
11. The method according to claim 10, wherein said functionalities comprise functionalities of defining and sharing the configuration of the wireless communication coverage extension system, of DNS relays, of DHCP relays, of firewall and/or of parental control.
This invention relates to a wireless communication coverage extension system that enhances network functionality by integrating multiple network management features. The system addresses the challenge of extending wireless coverage while maintaining centralized control over network services such as configuration management, DNS (Domain Name System) relays, DHCP (Dynamic Host Configuration Protocol) relays, firewall settings, and parental controls. The method involves deploying a wireless communication coverage extension system that includes a primary node and one or more secondary nodes, where the primary node manages the overall system configuration and coordinates the secondary nodes to extend wireless coverage. The system allows users to define and share the configuration of the wireless communication coverage extension system, ensuring consistent network behavior across all nodes. Additionally, it supports DNS relay functionality to forward DNS queries between different network segments, DHCP relay to manage IP address assignments across subnets, and firewall settings to enforce security policies. Parental control features enable content filtering and access restrictions for specific devices or users. The integrated approach simplifies network administration by consolidating these functionalities into a single, manageable system.
14. A non-transitory storage medium storing a computer program comprising instructions for implementing the method according to claim 1 when said program is executed by at least one processor.
The invention relates to a computer program stored on a non-transitory storage medium, designed to execute a method for processing data. The method involves receiving input data, analyzing the data to identify specific patterns or features, and generating an output based on the analysis. The program is structured to be executed by at least one processor, ensuring efficient and accurate data processing. The storage medium ensures the program remains intact and accessible for repeated use. This invention addresses the need for reliable and efficient data processing systems, particularly in applications requiring pattern recognition or feature extraction. The program's execution by a processor enables real-time or batch processing, depending on the application requirements. The non-transitory storage medium ensures the program's integrity and availability, preventing data loss or corruption. The invention is applicable in various fields, including but not limited to, data analysis, machine learning, and automated decision-making systems. The program's modular design allows for easy integration into existing systems or deployment as a standalone solution. The invention improves upon prior art by providing a more robust and efficient method for data processing, leveraging modern computing capabilities to enhance accuracy and speed.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
July 6, 2020
December 6, 2022
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.