Patent classifications
H04L45/17
Self-Organizing Hyper Sync Network
A self-organizing mesh network system is disclosed, comprising: at least one master node generating a timing reference signal; a plurality of regular nodes deriving time synchronization from the timing reference signal; and a wireless medium for communicating location and timestamp information among the plurality of regular nodes, The plurality of regular nodes may be configured to each use communicated location and timestamp information of nearby nodes to independently generate a location map of the nearby nodes. The plurality of regular nodes may be configured to accept an additional regular node. The plurality of regular nodes may be configured to allow a node of the plurality of regular nodes to exit the plurality of regular nodes. The plurality of regular nodes may each use communicated location and timestamp information of the plurality of regular nodes to independently generate a location map of each of the plurality of regular nodes.
Self-Organizing Hyper Sync Network
A self-organizing mesh network system is disclosed, comprising: at least one master node generating a timing reference signal; a plurality of regular nodes deriving time synchronization from the timing reference signal; and a wireless medium for communicating location and timestamp information among the plurality of regular nodes, The plurality of regular nodes may be configured to each use communicated location and timestamp information of nearby nodes to independently generate a location map of the nearby nodes. The plurality of regular nodes may be configured to accept an additional regular node. The plurality of regular nodes may be configured to allow a node of the plurality of regular nodes to exit the plurality of regular nodes. The plurality of regular nodes may each use communicated location and timestamp information of the plurality of regular nodes to independently generate a location map of each of the plurality of regular nodes.
Clustering Routing Optimization Method Based on Adaptive Evolutionary Algorithm for Wireless Sensor Network
The present invention discloses a clustering routing optimization method based on adaptive evolutionary algorithm for a wireless sensor network, comprising following steps: performing population initialization by initial position and energy information of sensor nodes; calculating fitness values, and implementing iterative operation of elite preservation, adaptive crossover and mutation; after the iteration, selecting a cluster head; routing data packet of the cluster head to a base station. Convergence process of the evolutionary algorithm is improved by nonlinearly adjusting the probability of crossover and mutation; upper and lower bound of crossover and mutation operators are dynamically adjusted by fitness value; adding an incentive factor, adjusting the crossover and mutation probability when the fitness value tends to converge, and running the algorithm again to confirm that a new optimal value is generated. The global search capability and convergence speed of the algorithm are improved by the above method, and avoiding local convergence.
Clustering Routing Optimization Method Based on Adaptive Evolutionary Algorithm for Wireless Sensor Network
The present invention discloses a clustering routing optimization method based on adaptive evolutionary algorithm for a wireless sensor network, comprising following steps: performing population initialization by initial position and energy information of sensor nodes; calculating fitness values, and implementing iterative operation of elite preservation, adaptive crossover and mutation; after the iteration, selecting a cluster head; routing data packet of the cluster head to a base station. Convergence process of the evolutionary algorithm is improved by nonlinearly adjusting the probability of crossover and mutation; upper and lower bound of crossover and mutation operators are dynamically adjusted by fitness value; adding an incentive factor, adjusting the crossover and mutation probability when the fitness value tends to converge, and running the algorithm again to confirm that a new optimal value is generated. The global search capability and convergence speed of the algorithm are improved by the above method, and avoiding local convergence.
PACKET ENCAPSULATION METHOD, PACKET FORWARDING METHOD, ANNOUNCEMENT METHOD, ELECTRONIC DEVICE, AND STORAGE MEDIUM
The present disclosure provides a packet encapsulation method, including: determining a segment routing-traffic engineering (SR-TE) path; generating, according to a segment identifier (SID) of each node in the SR-TE path, an SID list, where each node supports a plurality of unified-SID encapsulation types (UETs) corresponding to SIDs of different lengths, and in the SID list, the SID of at least a node serving as an intermediate node of the SR-TE path is the SID having the non-longest length in the plurality of SIDs corresponding to the node; forming a segment routing header (SRH) from the SID list; and encapsulating an initial packet with the SRH to obtain a final packet. The present disclosure further provides a packet forwarding method, a UET announcement method, an electronic device, and a computer-readable storage medium. The final packet obtained by the packet encapsulation method has a higher load rate.
PACKET ENCAPSULATION METHOD, PACKET FORWARDING METHOD, ANNOUNCEMENT METHOD, ELECTRONIC DEVICE, AND STORAGE MEDIUM
The present disclosure provides a packet encapsulation method, including: determining a segment routing-traffic engineering (SR-TE) path; generating, according to a segment identifier (SID) of each node in the SR-TE path, an SID list, where each node supports a plurality of unified-SID encapsulation types (UETs) corresponding to SIDs of different lengths, and in the SID list, the SID of at least a node serving as an intermediate node of the SR-TE path is the SID having the non-longest length in the plurality of SIDs corresponding to the node; forming a segment routing header (SRH) from the SID list; and encapsulating an initial packet with the SRH to obtain a final packet. The present disclosure further provides a packet forwarding method, a UET announcement method, an electronic device, and a computer-readable storage medium. The final packet obtained by the packet encapsulation method has a higher load rate.
Methods and systems for communicating using a virtual private network
Systems and methods for communication. A network abstraction layer (NAL) is built on a public Internet; and a network virtualization layer (NVL) is built on the NAL.
Hardware backup failure mechanism for multipath next hop shrinking
A method for processing packets in a network device, comprising: determining that a packet received by the network device is to be processed using a next hop group, selecting a member of the next hop group, and transmitting the packet to a second network device associated with a second member of the next hop group.
Hardware backup failure mechanism for multipath next hop shrinking
A method for processing packets in a network device, comprising: determining that a packet received by the network device is to be processed using a next hop group, selecting a member of the next hop group, and transmitting the packet to a second network device associated with a second member of the next hop group.
HARDWARE BACKUP FAILURE MECHANISM FOR MULTIPATH NEXT HOP SHRINKING
A method for processing packets in a network device, comprising: determining that a packet received by the network device is to be processed using a next hop group, selecting a member of the next hop group, and transmitting the packet to a second network device associated with a second member of the next hop group.