19 results about "Neighbour discovery" patented technology

The invention discloses a lightweight network neighbor discovery method and related equipment, and the method comprises the steps: enabling all equipment in a network to run a monitoring process, binding and monitoring a predetermined UDP port; when equipment in the network needs to be subjected to discovery operation, broadcasting a protocol discovery message to the local area network by the UDP port of the current equipment; and all the devices in the network receiving the broadcast receive the request through the bound UDP monitoring port, and reply own device information through a UDP response message after confirming that the devices meet reply conditions. According to the scheme, rapid identification and information acquisition can be performed on equipment in a network in a local area network or a private network environment with high efficiency and low overhead, and the problems in the prior art can be effectively solved.

An AR may provide information about a neighbor AR to a STA before roaming to assist with the STA associating with the neighbor AR. The information may include a BSSID of the neighbor AR and a time until the neighbor AR rotates the BSSID. If the STA fails to discover the neighbor AR while the STA is roaming, the STA can request more information about the neighbor AR from the AR.

The invention discloses an intention perception fair recommendation method based on a federated map neural network, and relates to the technical field of recommendation systems and federated map neural networks, in particular to the intention perception fair recommendation method based on the federated map neural network. According to the technology, sequence modeling is performed on a user behavior sequence, a global intention center is generated in combination with K-means clustering, and cross-client semantic similarity driven user embedding extension is realized, so that neighbor discovery of potential intention perception is completed, and the problems of cold start and data sparsity are effectively relieved. Under a federated learning framework, a joint optimization mechanism fusing double-layer comparative learning, sorting optimization and fairness constraint is constructed, and differential privacy noise is introduced to enhance privacy protection capability. The method supports a cooperative working mode of client local training and server security aggregation, and cooperative improvement of recommendation accuracy and group fairness is realized while data privacy and system expandability are guaranteed. Experimental results show that compared with an existing fair recommendation model, the method has better fairness and recommendation performance.

This invention discloses a method and system for coordinating neighbor discovery conflicts in wireless ad hoc networks based on Q-learning. The method includes: constructing a wireless ad hoc network model and initializing its parameters; based on the initialized model parameters, determining the activation state of time slots according to the working sequence, running and updating relevant data, and determining whether to enter the next learning round based on the cumulative number of time slot activations; if entering the next learning round, calculating the average reward value and determining the node state for the next learning round, updating the Q-table, and selecting actions according to the ε-greedy policy to achieve neighbor information transmission and reception for nodes in the wireless ad hoc network model. This invention can effectively coordinate beacon conflicts and significantly improve the neighbor discovery efficiency of nodes. As a method and system for coordinating neighbor discovery conflicts in wireless ad hoc networks based on Q-learning, this invention can be widely applied in the field of communication technology.

Provided are a method of estimating of the number of Bluetooth low energy (BLE) in an extended neighbor discovery process and an apparatus thereof, and a method of estimating the number of extended BLE may receive extended advertising data packets and data packets from a plurality of advertising devices, respectively based on a predetermined cycle, acquire a first candidate value, a second candidate value, and a third candidate value for the number of plural advertising devices based on a first measurement value for the number of extended advertising data packets measured, a second measurement value for the number of data packets measured based on the predetermined cycle, and a third measurement value for the number of advertising devices measured based on the predetermined cycle, and acquire information on the number of plural advertising devices based on information on the number of extended advertising data packets, information on the number of data packets, and information on the number of advertising devices related to the first candidate value, information on the number of extended advertising data packets, information on the number of data packets, and information on the number of advertising devices related to the second candidate value, and information on the number of extended advertising data packets, information on the number of data packets, and information on the number of advertising devices related to the third candidate value.

The invention discloses a cluster head replacement method based on hop counts, and relates to the technical field of wireless ad hoc network communication. The method comprises the following steps: planning a cluster head in a cluster and establishing a star network with common nodes in the cluster; the nodes in the cluster maintain respective one-hop neighbor information tables through a neighbor discovery mechanism; the common nodes in the cluster send respective one-hop neighbor information to the planned cluster head through network management information; planning cluster head calculation to obtain a whole network hop count matrix, and selecting a backup cluster head node based on the number of one-hop and two-hop neighbors of the node; the planning cluster head sends selected backup cluster head node information to all common nodes through a network management message; and when the planned cluster head is offline, the backup cluster head is upgraded into the cluster head, and the cluster head resource is occupied to perform message interaction with the common node. According to the invention, a proper backup cluster head is selected with low communication overhead and low calculation complexity. When the cluster head is offline, the backup cluster head can well maintain network operation.

An AP may provide information about a neighbor AP to a STA before roaming to assist with the STA associating with the neighbor AP. The information may include a BSSID of the neighbor AP and a time until the neighbor AP rotates the BSSID. If the STA fails to discover the neighbor AP while the STA is roaming, the STA can request more information about the neighbor AP from the AP.

The application discloses a kind of ultraviolet light communication cooperation networking method and system, comprising: all nodes in ultraviolet light network complete neighbor discovery, and establish neighbor table;The neighbor table only stores the distance information between nodes;According to the distance information stored in neighbor table, the distance from source node to destination node is obtained, and the time for transmitting each bit of data is dynamically adjusted according to the distance from source node to destination node;According to the distance information stored in neighbor table, the relay node in the shortest path from source node to destination node is selected;Data forwarding is carried out based on the adjusted time for transmitting each bit of data and the relay node in the shortest path;The application can effectively improve the throughput of network, and reduce the overall power consumption of network.

This application provides a node task execution method, apparatus, device, storage medium, and program product. The method includes: acquiring digital identity information and physical identity information of multiple nodes; the digital identity information is used to characterize the logical identity of the node in the communication domain, and the physical identity is used to characterize the entity characteristics of the node in the physical perception domain; performing consistency matching on the digital identity information and physical identity information of each node to obtain a matching result; determining a set of trusted candidate neighbor nodes based on the matching result; and executing a decision task based on the set of trusted candidate neighbor nodes. The solution of this application addresses the problem in the prior art where candidate forwarding nodes in UAV ad hoc networks are derived from ordinary neighbor discovery results, lacking verification of node identity trustworthiness.

The application discloses a kind of methods, equipment and medium for robot network-oriented neighbor discovery conflict coordination, it is related to communication technical field, method includes: initialization reference parameter and according to reference parameter, channel is listened to and conflict is detected, to update beacon quantity, beacon receiving list and conflict mark bit;According to conflict mark bit, identify conflict, when no conflict is identified, re-initialization reference parameter and according to reference parameter, channel is listened to and conflict is detected, to update beacon quantity, beacon receiving list and conflict mark bit, when conflict is identified, according to beacon quantity, conflict mark bit, preset time slot adjustment step, preset backoff window coefficient adjusts time slot length and backoff time, again according to backoff time, channel is listened to to update beacon receiving list;According to beacon receiving list, backoff time and preset beacon duration, the working state of robot is controlled.The application can adjust time slot length and backoff window according to network state and carry out conflict coordination adaptively.

Various embodiments herein disclose coordinating neighbor discovery between access points (APs) with auxiliary radios and APs without auxiliary radios. A corresponding wireless controller comprises a processor and a memory storing instructions that, when executed, cause the controller to perform operations. The operations comprise grouping APs into a first group of more flexible APs and a second group of less flexible APs and querying the second group of APs for a corresponding broadcast interval. The operations further comprise identifying when the second group of APs is scheduled to broadcast parameters, and a broadcast interval for each of the second group of APs and generating a schedule based on the scheduled broadcast and the broadcast interval for each of the second group of APs. The operations additionally comprise providing the generated schedule to the first group of APs and the second group of APs.

The application provides a wireless self-organizing network adaptive neighbor discovery method and device based on data amount, wherein the method is run in an initialization stage and a neighbor discovery stage of a subsequent time frame of network operation, and the operation of the method is performed by nodes in the network; the method comprises the following steps: selecting a single-node or multi-node beam transmission scanning mode according to the relationship between the number of nodes and the number of binary address bits of the nodes, increasing the number of scanning sub-stages of the neighbor discovery stage on demand based on the risk of beamforming frame collision, and enabling the nodes to adaptively control the execution of beam transmission scanning based on their own data amount in the process of neighbor discovery; thereby, whether in a wireless self-organizing network application occasion with a large number of nodes or a wireless self-organizing network application occasion with a small number of nodes, the control overhead can be reduced as a whole, the probability of beamforming frame collision and the probability of neighbor discovery failure can be reduced, and the time slot utilization rate of the wireless channel can be improved and the average end-to-end data packet delay can be reduced.

This invention discloses a marine area communication system, relating to the field of communication technology for marine aquaculture platforms. The system includes a multi-level communication platform, a distributed adaptive networking engine, and a cross-domain, cross-media communication gateway. The multi-level communication platform integrates satellite communication modules, surface communication modules, and underwater communication modules, and possesses local edge computing capabilities. The distributed adaptive networking engine communicates with the multi-level communication platform and is used for neighbor discovery, global topology aggregation, dynamic route calculation, and automatic hub switching. The cross-domain, cross-media communication gateway communicates with the multi-level communication platform and the distributed adaptive networking engine, and is used for signal format conversion and intelligent routing between the satellite, surface, and underwater communication domains. This invention's communication system enables cross-domain collaboration between satellite, surface, and underwater communications and possesses self-awareness, self-repair, and self-optimization capabilities.

This invention discloses a neighbor discovery method with adjustable beamwidth suitable for UAV ad hoc networks. The method first adjusts the scanning beamwidth to a wider beam and uses a random scanning algorithm to coarsely scan the neighbor information of a node. Then, based on the wide-beam scanning results, a probability distribution for narrow-beam scanning is generated. Finally, the beamwidth is adjusted to the beamwidth used for data transmission (narrow beam), and the neighbor discovery scanning process is performed according to the probability distribution. The probability distribution is adjusted based on the discovery process until the neighbor discovery process is complete. This method utilizes wide-beam scanning to quickly obtain coarse neighbor information, guiding the subsequent narrow-beam scanning process, greatly reducing the complexity of narrow-beam scanning and shortening the time required for the neighbor discovery process. Furthermore, the method protected by this application has good practicality and versatility.

This invention discloses an adaptive management method and system for intelligent terminal devices in a distributed power distribution network. The method constructs a self-organizing peer-to-peer communication network covering the entire network, enabling neighbor discovery and information sharing among intelligent terminal devices. Each terminal independently calculates control commands based on local electrical parameters and preset multi-objective functions, and optimizes regional control effects through a collaborative mechanism. An adaptive adjustment strategy for the control algorithm is introduced. When an operational anomaly is detected, the terminal can autonomously locate and isolate the fault, and restore power supply based on backup path judgment or microgrid switching. The central management unit periodically conducts capacity assessments and aggregates terminal model parameters through federated learning. The terminal possesses edge autonomy capabilities, maintaining local control and data retention even during communication interruptions. This invention features rapid response, flexible structure, intelligent collaboration, and strong adaptability, making it suitable for intelligent operation and management scenarios in various types of power distribution systems.

The invention provides a mine network-free communication method and system based on multi-hop self-healing, and relates to the technical field of mine communication, and the method comprises the steps: based on communication nodes in a roadway, according to a preset roadway topology, executing sectorized and power-adjustable neighbor discovery, exchanging information with response nodes to construct a local neighbor table, and forming a multi-hop self-organizing network. When nodes need to communicate, a plurality of candidate paths containing trusted nodes are screened based on the local neighbor table and the roadway topology. And calculating the comprehensive cost of each path through a multi-dimensional path evaluation strategy, taking the path with the minimum cost as a main path and taking the rest as standby paths, and caching. And encapsulating the data into a fusion message with a priority identifier, adaptively selecting a physical layer transmission mode based on a priority and channel state evaluation result, and initiating first transmission on a main path. In the forwarding process, the intermediate node monitors the state of a next hop link through a forward probe and a feedback mechanism and executes an active forwarding decision according to link health degree prediction and message priority, and reliable transmission is achieved.

This specification provides a message processing method, apparatus, electronic device, and medium. The method includes: receiving a first neighbor request (NS) message sent by a host, wherein the destination IP address in the first NS message is the host's IP address, and the source IP address in the first NS message is an all-zero address; if the destination IP address in the first NS message is a global unicast address, then sending a first neighbor advertisement (NA) message from each other interface except the interface that received the first NS message, wherein the source MAC address of the first NA message is the MAC address of that other interface, and the source IP address in the first NA message is the destination IP address in the first NS message; if no first NS message corresponding to the first NA message is received, then generating a neighbor discovery (ND) entry for the host based on the destination IP address and source MAC address of the first NS message.

The invention belongs to the technical field of wireless communication, and particularly relates to an adaptive broadcasting method for an ad hoc network in a high-dynamic environment. According to the scheme, the network system comprises a high-dynamic mobile ad hoc network composed of k mobile nodes, the nodes operate under a synchronous time slot structure, and each node achieves neighbor discovery and link maintenance by periodically broadcasting HELLO messages. According to the method, optimization of neighbor discovery efficiency and energy consumption balance is taken as a target, and a dual-stage adaptive mechanism is adopted: rapid topological convergence is realized through fast / slow start dual-mode probability broadcast in an initial discovery stage, and an HELLO interval is dynamically adjusted based on link duration prediction and node density in a link maintenance stage. Compared with the prior art, the scheme of the invention can significantly improve the neighbor discovery efficiency in a high dynamic environment and reduce the system energy consumption without the support of a GPS (Global Positioning System).

The invention discloses a self-adaptive time synchronization method for an unmanned aerial vehicle network, and relates to the technical field of time synchronization of an unmanned aerial vehicle self-organizing network. S2, a node network access and neighbor discovery step; s3, a main node selection step: calculating a main node score weight by each node according to the neighbor information table, and selecting a main node; s4, a centralized time synchronization step, wherein the child nodes carry out time synchronization according to the broadcast of the main node; s5, a TDMA time slot distribution and frame control step; s6, a distributed synchronization step; the child nodes perform time synchronization according to the broadcast of the child nodes; s7, a synchronization quality evaluation and backspacing switching step: when a synchronization backspacing condition is satisfied, performing S4; and when the main node reselection condition is met, S3 is carried out, and the current main node does not participate in main node selection. According to the method, a TDMA mechanism and self-adaptive switching of centralized synchronization and distributed synchronization are adopted, the node collision probability and energy consumption are reduced, and error accumulation of a single synchronization mode is avoided.