Method of automatically selecting auxiliary time benchmark

A technology of auxiliary time and automatic selection, applied in the field of data link network, to achieve the effect of high synchronization accuracy

Active Publication Date: 2019-04-05
NO 20 RES INST OF CHINA ELECTRONICS TECH GRP
View PDF2 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In order to overcome the deficiencies of the prior art, the present invention provides a method for dynamically electing an auxiliary time reference based on link quality and neighbor information, and dynamically selects the optimal auxiliary time reference node by periodically exchanging neighbor link state information through nodes. So as to solve the time synchronization problem of time division multiplexing network

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method of automatically selecting auxiliary time benchmark
  • Method of automatically selecting auxiliary time benchmark
  • Method of automatically selecting auxiliary time benchmark

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0012] The present invention will be further described below in conjunction with the accompanying drawings and embodiments, and the present invention includes but not limited to the following embodiments.

[0013] Such as figure 1 Shown, the present invention comprises the following steps:

[0014] (1) Generate one-hop neighbor table and two-hop neighbor table

[0015] Each node sends a HELLO message at a T cycle, and the HELLO message includes the ID and link state information of the node's neighbors. By periodically receiving HELLO messages from neighbor nodes, the node obtains ID information and link state information of one-hop neighbors and two-hop neighbors. The HELLO message is only broadcast within one hop, and other nodes will not forward it after receiving it.

[0016] (a) One-hop neighbor table construction

[0017] The link status of one-hop neighbor nodes mainly includes: asymmetric link (ASYM_NEIGH), symmetric link (SYM_NEIGH), MPR link (MPR_NEIGH), failed li...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a method of automatically selecting auxiliary time benchmark. Interaction of neighbor link state information is periodically carried out through nodes, the best auxiliary time benchmark node is thus dynamically selected, and thus, the time synchronization problem of a time division multiplexing network is solved. The method can be used in a two-hop data link network and canalso be used in a multi-hop ad hoc network. The method is applied in practical engineering, the dynamic requirements of the network are effectively met, and the network synchronization accuracy is improved.

Description

technical field [0001] The invention relates to the technical field of data link networks, in particular to a method for automatically selecting an auxiliary time reference in a multi-hop network. Background technique [0002] The data link network is a centerless, distributed network architecture, which requires ensuring that services are delivered to the destination node reliably and quickly. In the tactical data link, time-division multiplexing shared channels are generally used. This method can solve the collision problem between network users and has high transmission efficiency. In order to ensure that the transmission time slots of each user do not collide, the entire network needs a unified time reference to ensure network time synchronization. In the network of this system, in order to expand the coverage of network communication, it sets the auxiliary time reference node so that the nodes outside the multi-hop It can be connected to the network to ensure the synch...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04J3/06H04L12/24H04L12/751H04L45/02
CPCH04J3/0641H04J3/0658H04L41/30H04L45/026
Inventor 石伟明史明伟陈震伟
Owner NO 20 RES INST OF CHINA ELECTRONICS TECH GRP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap