CN110839269A - Broadband frequency hopping clustering multilevel self-organizing network waveform design method - Google Patents

Broadband frequency hopping clustering multilevel self-organizing network waveform design method Download PDF

Info

Publication number
CN110839269A
CN110839269A CN201911170210.4A CN201911170210A CN110839269A CN 110839269 A CN110839269 A CN 110839269A CN 201911170210 A CN201911170210 A CN 201911170210A CN 110839269 A CN110839269 A CN 110839269A
Authority
CN
China
Prior art keywords
node
network
time slot
frequency hopping
nodes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201911170210.4A
Other languages
Chinese (zh)
Other versions
CN110839269B (en
Inventor
刘玉涛
宋志群
秦茜
倪光华
魏恒舟
张春晖
郑博文
孟旭东
魏萌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
CETC 54 Research Institute
Original Assignee
CETC 54 Research Institute
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by CETC 54 Research Institute filed Critical CETC 54 Research Institute
Priority to CN201911170210.4A priority Critical patent/CN110839269B/en
Publication of CN110839269A publication Critical patent/CN110839269A/en
Application granted granted Critical
Publication of CN110839269B publication Critical patent/CN110839269B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W56/00—Synchronisation arrangements
    • H04W56/001—Synchronization between nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/713—Spread spectrum techniques using frequency hopping
    • H04B1/7136—Arrangements for generation of hop frequencies, e.g. using a bank of frequency sources, using continuous tuning or using a transform
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/713—Spread spectrum techniques using frequency hopping
    • H04B1/7156—Arrangements for sequence synchronisation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

The invention discloses a broadband frequency hopping clustering multistage self-organizing network waveform design method, which realizes distributed centerless multi-hop frequency hopping synchronization, initial network establishment, dynamic gateway selection, physical layer modulation and demodulation and coding and adaptive route selection based on link learning. The multi-hop frequency hopping synchronization does not need to preset a synchronization center node, a special frequency hopping frequency set and patterns, the synchronization time is related to the number of frequency points, the frequency hopping rate, the relay hop number and the like in the frequency hopping frequency set, each node transmits a frequency hopping synchronization frame probabilistically according to a local clock and the preset frequency hopping pattern, the rest time is in a receiving state, after a frame header is captured, the current frequency is kept to receive complete frame data, TOD information and node number information of received data are obtained, and then synchronization is completed. Due to the movement of nodes or the change of external environment, multi-hop links exist from end to end and the link quality also changes, the performance of each link is comprehensively evaluated through a learning strategy, and finally the self-adaptive routing selection is realized.

Description

Broadband frequency hopping clustering multilevel self-organizing network waveform design method
Technical Field
The invention relates to distributed multi-hop frequency hopping self-synchronization, centerless self-organizing network node synchronization and network establishment in a mobile self-organizing network, a clustering multi-level self-organizing network dynamic gateway selection strategy, a physical layer modulation-demodulation and coding-decoding method and a link learning-based adaptive routing strategy, which are particularly suitable for regional mobile networking communication in a complex electromagnetic environment and a geographic environment, can realize centerless, self-organizing and self-recovery networking of communication equipment, can automatically detect topological information under the condition of network topological structure change, dynamically determine a transmission route and realize multi-hop end-to-end information transmission.
Background
The traditional communication technology is restricted by infrastructure, and communication blind areas exist in complex environments such as gobi of desert, canyons of mountainous areas, underground parking lots and the like; in addition, due to sudden disasters, the existing communication network can also be paralyzed to form a communication blind area, so that the functional department can not normally command and dispatch due to communication difficulty when carrying out anti-terrorism sudden or emergency rescue tasks. The mobile self-organizing network can adapt to complex terrain environment and real-time changing electromagnetic environment, a multi-hop end-to-end link is formed through the centerless self-organizing network, and the problem of barrier-free information transmission from a communication blind area to a communication network coverage area is effectively solved; meanwhile, the mobile ad hoc network can automatically adapt to the change of the environment on the battlefield to form a flexible centerless ad hoc network, and is an important means for realizing the maneuvering cooperative networking communication by relatively independent combat units.
The rapid development of wireless communication technology, especially the informatization and intellectualization, has a greater and greater demand on communication bandwidth, and the trend of realizing broadband ad hoc networking is to increase the communication capacity by expanding the communication frequency band. However, simply increasing the communication rate by expanding the communication signal bandwidth to increase the communication capacity leads to a reduction in the communication range and a deterioration in the practicability.
The large-scale coverage means that the number of forwarding times is increased due to the fact that the connectivity of the network is deteriorated, and the large-scale user ad hoc network generates huge network maintenance cost due to the fact that the number of connections is too large. Especially in the case of mobile communication, survivable reorganization and user random access, the rapid change of communication situation, the instability of connection, and the existence of flickering of hidden and exposed terminals may cause the routing of the ad hoc network to fail to converge and collapse. Therefore, the broadband ad hoc network must be reasonably designed according to the characteristics of communication requirements, the information transmission range is restricted, the network transmission overhead is reduced, the routing change is controlled, and stable, reliable and efficient information transmission is realized.
A large amount of intentional or unintentional interference exists in a frequency band below 3GHz suitable for mobile communication, so that parameter planning of a communication unit is directly influenced by multiple factors such as geographic environment, electromagnetic environment, network topology and the like. The broadband frequency hopping self-organizing network waveform can be suitable for formation or emergency communication scenes with topology dynamic change, high requirement on expansibility and more hops, the intelligence, the self-organizing self-recovering capability and the wireless MESH network function can effectively guarantee reasonable scheduling and distribution of communication resources, and the frequency hopping anti-interference function can guarantee reliable end-to-end transmission when part of frequency points are intentionally or unintentionally interfered. Therefore, the functions of self-organization, self-recovery and MESH network are provided, and the realization of frequency hopping self-organization networking is becoming a key factor of emergency communication and tactical communication.
The multi-hop frequency hopping synchronization does not need to preset a synchronization center node, a special frequency hopping frequency set and patterns, the synchronization time is related to the number of frequency points, the frequency hopping rate, the relay hop number and the like in the frequency hopping frequency set, each node transmits a frequency hopping synchronization frame probabilistically according to a local clock and the preset frequency hopping pattern, the rest time is in a receiving state, after a frame header is captured, the current frequency is kept to receive complete frame data, TOD information and node number information of received data are obtained, and then synchronization is completed. After the initial start or network break of the node, the received time information of a plurality of nodes is collected through an interception channel, the selection of a time synchronization starting node is carried out according to a certain principle, and the clock information of the node is set to complete the initial network establishment and the synchronous network access. The discovery of the neighbor subnet nodes is realized by setting an independent internetwork control frame, and the cross-network gateway nodes are automatically optimized by adopting a channel state estimation method, so that the cascade connection of the multi-level subnets is realized. The physical layer adopts SC-FDE and QPSK systems, and high-efficiency Turbo coding is comprehensively adopted to guarantee reliable transmission of information. Due to the movement of nodes or the change of external environment, multi-hop links exist from end to end and the link quality also changes, the performance of each link is comprehensively evaluated through a learning strategy, and finally the self-adaptive routing selection is realized.
The self-organizing network waveform designed in the invention supports the frequency hopping anti-interference function, and can realize reliable end-to-end information transmission after the frequency points of half or less of the frequency hopping frequency set are blocked and interfered. The self-organizing networking waveform in the invention supports the functions of self-organization, self-recovery, new node late network access and automatic network fusion and splitting, two or more networks with consistent parameter settings can be automatically fused into one network when approaching, and partial nodes in one network can be automatically split into two or more networks when departing. The self-organizing networking waveform in the invention supports the roaming access function of a single node or a whole subnet, and any node or subnet can realize access by forming a cross-network gateway through self-adaptation after moving from one network to another network.
Disclosure of Invention
The invention aims to solve the technical problem of providing a broadband frequency hopping clustering multistage self-organizing network waveform design method, which realizes distributed centerless multi-hop frequency hopping synchronization, initial network establishment, dynamic gateway selection, physical layer modulation and demodulation and coding and adaptive routing based on link learning. The method realizes broadband frequency hopping self-organizing networking, dynamic gateway selection and intra-network and inter-network routing, and comprises distributed centerless multi-hop frequency hopping synchronization, initial network establishment, dynamic gateway selection, physical layer modulation and demodulation, coding and decoding and link learning-based self-adaptive routing selection. The invention completely solves the problem of broadband frequency hopping clustering multilevel self-organizing networking, and provides a feasible way and method for high reliability and high adaptability of military and civil self-organizing network data transmission radio stations and broadband transmission equipment.
The technical scheme adopted by the invention is as follows:
a broadband frequency hopping clustering multilevel self-organizing network waveform design method realizes distributed centerless multi-hop frequency hopping synchronization, initial network establishment, dynamic gateway selection, physical layer modulation and demodulation, coding and decoding and link learning-based adaptive routing selection, and comprises the following steps:
(1) the method comprises the steps that node equipment is started, node parameter information is configured, and the node parameter information comprises a node number, a frequency hopping rate, a frequency hopping frequency set and a frequency hopping pattern;
(2) the nodes transmit synchronous information with a certain probability according to a local time reference, a frequency hopping rate and a frequency hopping frequency set, and the other time slots receive the synchronous information transmitted by other nodes in the subnet to carry out frequency hopping synchronization and inter-node synchronization;
(3) after synchronization is completed, the nodes acquire a preassigned topological time slot table, maintain a neighbor table locally, analyze the neighbor table information of other nodes after receiving the neighbor table information of other nodes, perform fusion calculation on the received neighbor table information of all the nodes and the local neighbor table information to obtain a topological graph of the whole network, and send out the topological graph of the whole network in own sending time slot to complete network access synchronization;
(4) after the nodes finish the network access synchronization, a pair of 'scheduling time slots' which are distributed in advance, namely a DOWN frame and an UP frame, is obtained, the nodes monitor DOWN information in the DOWN frame, if the DOWN information is received in a set period, a cluster head exists in the subnet, and if the DOWN frame is not received in the set period, the node with the minimum number of the nodes in the subnet is selected as the cluster head according to topology;
(5) the nodes periodically send the synchronous information and receive the synchronous information sent by other nodes, and the synchronous state of the network is maintained;
(6) when the node receives the synchronization information of the nodes outside the subnet, the node sends a cross-network node application frame to the cluster head, the cluster head makes a decision and then issues a cross-network node designated frame, and when the node receives the cross-network node designated frame, the node can be determined as a cross-network node of the subnet;
(7) if the node does not receive the service information, turning to the step (5); if an upper layer service application is received, turning to the step (8); if the service sent by other nodes is received, turning to the step (10);
(8) when a node receives an upper-layer service application, firstly, whether a service target node is in a subnet or outside the subnet is judged, if the service target node is an out-subnet node, a cross-network node in the subnet is used as a target node in the subnet, and if the target node is an in-subnet node, the target node in the subnet and the service target node are the same node;
(9) the nodes self-adaptively determine a routing strategy in the subnet according to the network topology and the target nodes in the subnet, select a transmission route with the best link quality, send a time slot resource application to a cluster head in a scheduling time slot when each node in the transmission route carries out service transmission, and turn to the step (11);
(10) after receiving the services sent by other nodes, the node firstly judges whether the final destination node of the service is the node per se according to the routing information carried in the service, if so, the node analyzes the service and sends the service to an upper layer for output, and turns to the step (7) after the service is finished; if not, applying for time slot resources from the cluster head, and turning to the step (11);
(11) after receiving the time slot resource application, the cluster head firstly judges whether a cross-network service exists in the network, when the cross-network service exists, the cross-network time slot of the cross-network node is firstly distributed, and then the sub-network time slot of the other nodes is distributed according to the current service quantity and type; when no cross-network service exists, directly allocating the time slot of the sub-network;
(12) if the node is not a cross-network node, forwarding information in the sub-network time slot allocated by the cluster head; if the node is a cross-network node, judging whether a target node is in the subnet, if the target node is an intra-subnet node, forwarding information in the time slot of the subnet distributed by the cluster head, and if the target node is an extra-subnet node, forwarding information in the cross-network time slot distributed by the cluster head;
(13) and (7) turning to the step after the node information is forwarded.
When the cluster head allocates the time slot of the sub-network in the step (11), if the number of the unicast services simultaneously and concurrently sent by the nodes is 1, turning to the step (1.1); if the number of the unicast services simultaneously and concurrently sent by the nodes is more than 1 and less than the preset maximum value NmaxAnd then turning to the step (1.2); if the number of the unicast services simultaneously and concurrently sent by the nodes is larger than the preset maximum value NmaxOr if the broadcast/multicast service exists, turning to the step (1.3);
(1.1) the cluster head allocates the rest time slot resources except the cross-network time slot for the service, and the allocation adopts a time slot multiplexing principle, namely the time slot is allocated to two or more nodes for use after the relay hop number is more than or equal to 3;
(1.2) the cluster head allocates the residual time slot resources except the cross-network time slot according to the number of the existing services and the source node and the forwarding node of each service;
and (1.3) the cluster head equally divides the residual time slot resources except the cross-network time slot according to the number of nodes in the network.
Wherein, the step (2) comprises the following steps:
(2.1) before the node is accessed to the network, initializing according to a local time reference, a frequency hopping frequency set and a frequency hopping rate, calculating the type of the current frequency hopping time slot according to a preset probability, and if the current frequency hopping time slot is a sending time slot, switching to (2.2); if the time slot is a receiving time slot, turning to (2.3);
(2.2) selecting a frequency hopping frequency point to be transmitted according to the called 'synchronous' frequency hopping pattern, transmitting local synchronous information in a broadcasting mode, and then turning to the step (2.1);
(2.3) calling a service frequency hopping pattern according to the node number, selecting a receiving frequency hopping frequency point, and then carrying out signal sliding receiving processing;
(2.4) if the synchronous information sent by other nodes is not received in the time slot, the step (2.1) is carried out; if receiving the synchronous information sent by other nodes, keeping the current frequency unchanged until receiving complete frame data;
and (2.5) the node modifies the local time reference and the frequency hopping pattern information according to the received synchronization information to complete frequency hopping synchronization and inter-node synchronization, and then the step (2.1) is carried out to continue the periodic synchronization maintenance.
Wherein, the step (3) comprises the following steps:
(3.1) after the node synchronization is finished, calculating to obtain a one-hop neighbor list and a corresponding topological time slot distribution result;
(3.2) judging the type of the current time slot according to the synchronization time and the distribution result of the topology time slot, if the current time slot is the topology time slot of the node, switching to the step (3.3), and if not, switching to the step (3.4);
(3.3) the node performs fusion calculation on the 'one-hop' neighbor list information of the node and the received 'one-hop' neighbor list information of other nodes to obtain a topological graph of the whole network and broadcasts the topological graph, and then the step (3.2) is carried out;
(3.4) receiving and analyzing the 'one-hop' neighbor list information of other nodes;
and (3.5) after the received one-hop neighbor list information sent by all the nodes and the self one-hop neighbor list information of the nodes are subjected to fusion calculation, updating to obtain a topology map of the whole network.
Wherein, the step (6) comprises the following steps:
(6.1) the node calculates the type of the current frequency hopping time slot according to the preset probability and the traffic busy degree, and if the current frequency hopping time slot is a sending time slot, the node is switched to (6.2); if the time slot is a receiving time slot, turning to (6.3);
(6.2) selecting a frequency hopping frequency point to be transmitted according to the called 'synchronous' frequency hopping pattern, transmitting local synchronous information in a broadcasting mode, and then turning to the step (6.1);
(6.3) calling a service frequency hopping pattern according to the node number, selecting a receiving frequency hopping frequency point, and then carrying out signal sliding receiving processing;
(6.4) if the synchronous information sent by other nodes is not received in the time slot, the step (6.1) is carried out; if receiving the synchronous information sent by the sub-network node, carrying out sub-network synchronization; if receiving the synchronous information sent by other sub-network nodes, judging whether the node has a route to the node, if so, turning to the step (6.1), otherwise, keeping the current frequency unchanged until receiving the complete frame data and turning to the step (6.5);
(6.5) judging whether the node is a cluster head node or not by the node, if so, judging whether a default gateway timer is overtime or not, if so, selecting the node as a cross-network node, otherwise, ignoring all cross-network node applications, and turning to the step (6.1); if not, applying the node to the cluster head as a cross-network node, sending a cross-network node designated frame after the cluster head receives the application, and turning to the step (6.6);
(6.6) the node judges whether a cross-network node appointed frame sent by the cluster head node is received, if so, the node is determined to be a cross-network node, and then the gateway information is diffused into the subnet; if not, go to (6.1).
Wherein, the node in step (9) adaptively determines the routing strategy in the subnet according to the network topology and the destination node in the subnet, and selects the transmission route with the best link quality, which specifically comprises the following steps:
(9.1) the node calculates all end-to-end links according to the destination node and the network topology;
(9.2) counting the channel quality of each single-hop link in all end-to-end links, dividing the channel quality into four grades of excellent, good, poor and non-communication, and dividing the weight coefficient into four gradesRespectively is counted as l1＜l2＜l3＜＜l4；
(9.3) adding all the single-hop link weight coefficients to calculate the link quality of all the end-to-end links;
and (9.4) selecting the link with the best link quality, namely the link with the smallest weight coefficient after being added as the transmission route.
Wherein, the step (1.2) specifically comprises the following steps:
(12.1) periodically updating the service application information of other nodes by the cluster head;
(12.2) judging the type and the number of the service application by the cluster head, if the number of the unicast services is more than 5 or the broadcast and multicast services exist, equally dividing the available time slot resources according to the number of the network nodes, and then turning to the step (12.1); if no broadcast and multicast service exists and the number of unicast services is 2-5, switching to the step (12.3);
(12.3) accumulating the relay hop count of each service, and counting as m;
(12.4) performing digital-to-analog m on the available time slots, wherein the obtained integer is the time slot number obtained by dividing each node on each service transmission link, and the remainder is the rest time slot resource to be divided;
(12.5) comparing the residual time slots to be divided with the relay hop count of each service, and distributing the service with the maximum hop count, wherein the relay hop count is not more than the residual time slots to be divided; this step is repeated until the number of remaining slots is less than the hop count of any one service, and then a transition is made (12.1).
Compared with the prior art, the invention has the following beneficial effects:
(1) aiming at the problems that the existing wireless self-organizing network communication equipment is low in adaptive capacity of a complex electromagnetic environment and easy to be interfered intentionally or unintentionally due to the adoption of a fixed frequency working mode, the invention provides an anti-interference system based on diversity hopping spread spectrum, strong error correction long interleaving and self-adaptive interference erasure, and can resist blocking type interference of more than 50% of frequency points in frequency hopping frequency concentration; by adopting the multi-hop frequency hopping self-synchronization technology, the Beidou or high-stability clock is not relied on any more, and the use flexibility and the application scene are remarkably expanded.
(2) Aiming at the problems that the existing wireless self-organizing network communication equipment adopts a multi-channel cross-network system, so that the cross-network node is large in size, high in power consumption, not easy to integrate and use a handheld terminal and the like, the invention adopts a single-channel time division cross-network system, and realizes multi-level network cascade in different sub-networks through time division work of cross-network nodes; the inter-network signaling interaction frame is set, the self-adaptive selection of the cross-network gateway node is realized, and the use flexibility of the wireless self-organizing network communication equipment is improved.
(3) Aiming at the problems of obvious increase of network overhead and information transmission or receiving collision among nodes caused by continuous increase of multi-hop end-to-end concurrent transmission services of a distributed self-organizing network, the invention adopts a time slot management strategy based on unified scheduling of cluster head nodes, effectively avoids time slot collision and can better support concurrent transmission of multiple services; the cluster head centralized time slot resource scheduling strategy can adopt different optimization schemes aiming at single service, multiple services, unicast, multicast, broadcast and other service types, and can adapt to different service requirements and application scenes.
Drawings
Fig. 1 is a flow chart of the operation of an ad hoc network communication device to which the present invention is applicable.
Fig. 2 is a schematic diagram of a physical layer frame structure design.
Fig. 3 is a diagram of the structure design of a MAC frame.
Fig. 4 is a schematic diagram of a clustered multi-level networking.
Fig. 5 is a schematic diagram of dynamic gateway and cross-network service transmission.
Fig. 6 is a schematic diagram of time slot resource multiplexing.
Fig. 7 is a schematic diagram of time slot resource allocation in multi-service concurrent transmission.
Detailed Description
The present invention will be further described with reference to the accompanying drawings.
Broadband frequency hopping clustering multistage self-organizing network waveform, multi-hop frequency hopping self-synchronization is realized by setting a synchronization head and controlling transceiving logic, intra-network synchronization and network connection topology are realized by signaling interaction frames among nodes, neighbor network node discovery and dynamic gateway selection are realized by setting flexible inter-network signaling frames and different frequency hopping patterns, anti-multipath reliable transmission is realized by adopting SC-FDE and efficient Turbo coding, and a self-adaptive routing strategy is realized by multi-hop end-to-end link channel estimation and link quality learning, as shown in figure 1. The method comprises the following steps:
(1) and starting the node equipment, and configuring parameter information such as a node number, a frequency hopping rate, a frequency hopping frequency set, a frequency hopping pattern and the like.
(2) The nodes transmit frequency hopping synchronization information according to a local time reference, a frequency hopping rate and a frequency hopping frequency set at a certain probability, and the other time slots receive the synchronization information transmitted by other nodes in the subnet to perform frequency hopping synchronization and inter-node synchronization;
the physical layer frame structure is shown in fig. 2, wherein the synchronization header is four segments of SP, and each segment of SP is a gray code training sequence with a fixed length; and the last SP is a Gray code training sequence with the same length and is used for assisting in frequency offset estimation and channel estimation.
Since the transmitted synchronization preamble is composed of golay complementary sequences, the signal acquisition first needs to perform sliding matching correlation between the received signal and the local golay sequences, which is called preamble matching filtering. After sliding matching correlation, delay difference autocorrelation is carried out on the matching correlation result at a certain interval, finally the delay autocorrelation result is correlated with the difference filter again, and the power value is obtained from the correlation result, so that a sharp correlation peak is obtained for synchronous capture.
The receiving end can complete frequency offset estimation and compensation through four sections of SP in the synchronous head, and aims to estimate and correct carrier frequency offset. By calculating the phase angle of the autocorrelation result of the two repeated training sequences, the frequency deviation carried in the signal can be estimated.
Figure BDA0002288491520000101
Wherein, thetaestPhase angle, f, representing the result of an autocorrelation operation on two repeated sequencessRepresenting the clock sampling frequency, Tc＝Nc/fsRepresenting the training sequence duration. To estimate accurately and unambiguouslyOut of thetaestThen its maximum range may not exceed θmaxPi, which indicates that the maximum allowable carrier frequency deviation is fmax＝θmaxfs/(2πNc)＝±fs/(2Nc). In AWGN channels, considering the normalized variance of the estimator as a measure of the reliability of the estimation, the normalized variance of the present estimator can be expressed as:
var{(fest-Δf)/fs}＝1/(4π2ρ)
where ρ represents the signal-to-noise ratio and Δ f represents the actual carrier frequency deviation.
In addition, the SNR can be estimated in the frequency domain and the channel estimation can be performed in the time domain by utilizing the four-segment repetition characteristic in the synchronous training sequence.
(3) After the synchronization is completed, the time parity can be realized, and the MAC frame structure shown in fig. 3 is obtained, in which the "topology time slot" of each node is indicated, and the "topology time slot" exists all the time no matter whether the node is networked or not. The node MAC layer locally maintains a 'neighbor table', analyzes and updates the neighbor table after receiving the topology information, obtains a topology map of the whole network through fusion calculation, and sends the topology map of the whole network out in own sending time slot to complete network access synchronization;
after the topology is generated, the MAC layer maintains a neighbor table in real time, and each node periodically reads the neighbor table. Each node maintains a 20 x 20 matrix, and the matrix is sent in the route sending time slot of the node; the matrix is updated after topology packets sent by other nodes are received.
Converting the 20 × 20 directed graph into an undirected graph with bidirectional links, namely removing edges of the unidirectional links; and then calculating a minimum spanning tree by adopting a Prim algorithm, and taking the cluster head node as an initial condition of the Prim algorithm. And taking the cluster head node as a root node, sequentially distributing INDEX numbers according to the size of the node number, and calculating according to an algorithm 1 to obtain the scheduling tree.
Algorithm 1: with the cluster head nodes as the root, the nodes are firstly layered from top to bottom according to the hop count from the root node and are arranged from left to right according to the size of the node number. And if the number of the upper-layer nodes is a, the number of the lower-layer nodes is b, c is rounded up to a/b, and d is a remainder, the parent-child relationship determination rule is as follows, wherein c child nodes are respectively distributed to the front a-d nodes of the upper layer in sequence, and c +1 child nodes are respectively distributed to the rear d nodes of the upper layer in sequence.
The DOWN frame is used for issuing a time slot distribution result by the cluster head, and is broadcasted to the whole sub-network layer by layer according to the topological tree structure, and the payload meaning is shown in table 1.
TABLE 1 DOWN frame payload part identification and meaning List
Identifier Function(s) Remarks for note
node_id Node number
uType Frame type
uHostId Cluster head node number
mode Mode(s)
uTree Scheduling field 5 x 20 array
sch On-demand field allocation
yuliu Reservation
TOD Frequency hopping synchronization information
The UP frame is used for each node to send an application to the cluster head, after each node receives the UP frame, the information needs to be analyzed and combined with the request of the node, and then the information is continuously sent, and the payload meaning is shown in table 2.
TABLE 2 UP frame payload part identification and list of meanings
Figure BDA0002288491520000121
(4) After the nodes finish the network access synchronization, a pair of 'scheduling time slots' which are distributed in advance, namely a DOWN frame and an UP frame, is obtained, the nodes monitor DOWN information in the DOWN frame, if the DOWN information is received in a set period, a cluster head exists in the subnet, and if the DOWN frame is not received in the set period, the node with the minimum number of the nodes in the subnet is selected as the cluster head according to topology;
(5) the nodes periodically send the synchronous information and receive the synchronous information sent by other nodes, and the synchronous state of the network is maintained;
(6) when the node receives the synchronization information of the nodes outside the subnet, the node sends a cross-network node application frame to the cluster head, the cluster head makes a decision and then issues a cross-network node designated frame, and when the node receives the cross-network node designated frame, the node can be determined as a cross-network node of the subnet; and completing automatic selection of the cross-network gateway to form a clustered multi-level network, as shown in fig. 4.
The method comprises the following specific steps:
(6.1) the node calculates the type of the current frequency hopping time slot according to the preset probability and the traffic busy degree, and if the current frequency hopping time slot is a sending time slot, the node is switched to (6.2); if the time slot is a receiving time slot, turning to (6.3);
(6.2) selecting a frequency hopping frequency point to be transmitted according to the called 'synchronous' frequency hopping pattern, transmitting local synchronous information in a broadcasting mode, and then turning to the step (6.1);
(6.3) calling a service frequency hopping pattern according to the node number, selecting a receiving frequency hopping frequency point, and then carrying out signal sliding receiving processing;
(6.4) if the synchronous information sent by other nodes is not received in the time slot, the step (6.1) is carried out; if receiving the synchronous information sent by the sub-network node, carrying out sub-network synchronization; if receiving the synchronous information sent by other sub-network nodes, judging whether the node has a route to the node, if so, turning to the step (6.1), otherwise, keeping the current frequency unchanged until receiving the complete frame data and turning to the step (6.5);
(6.5) judging whether the node is a cluster head node or not by the node, if so, judging whether a default gateway timer is overtime or not, if so, selecting the node as a cross-network node, otherwise, ignoring all cross-network node applications, and turning to the step (6.1); if not, applying the node to the cluster head as a cross-network node, sending a cross-network node designated frame after the cluster head receives the application, and turning to the step (6.6);
(6.6) the node judges whether a cross-network node appointed frame sent by the cluster head node is received, if so, the node is determined to be a cross-network node, and then the gateway information is diffused into the subnet; if not, go to (6.1).
(7) If the node does not receive the service information, turning to the step (5); if an upper layer service application is received, turning to the step (8); if the service sent by other nodes is received, turning to the step (10);
(8) when a node receives an upper-layer service application, firstly, whether a service target node is in a subnet or outside the subnet is judged, if the service target node is an out-subnet node, a cross-network node in the subnet is used as a target node in the subnet, and if the target node is an in-subnet node, the target node in the subnet and the service target node are the same node;
as shown in fig. 5, when two nodes in the subnet 1 simultaneously listen to the message of the subnet 2, the cluster head of the subnet 1 selects one of the nodes as the cross-network node according to the "link quality first" principle. It can be seen from the figure that when subnet 1 sends a message to subnet 2 through the cross-network node, the cross-network node of subnet 1 works in the frequency hopping pattern F of subnet 22The above step (1); similarly, when subnet 2 sends a message to subnet 1 through the cross-network node, the cross-network node of subnet 2 works in frequency hopping pattern F of subnet 11The above.
(9) The nodes self-adaptively determine a routing strategy in the subnet according to the network topology and the target nodes in the subnet, select a transmission route with the best link quality, send a time slot resource application to a cluster head in a scheduling time slot when each node in the transmission route carries out service transmission, and turn to the step (11);
the method for adaptively determining the routing strategy in the subnet and selecting the transmission route with the best link quality specifically comprises the following steps:
(9.1) the node calculates all end-to-end links according to the destination node and the network topology;
(9.2) counting the channel quality of each single-hop link in all end-to-end links, dividing the channel quality into four grades of excellent, good, poor and non-communication, and correspondingly counting the weight coefficient as l1＜l2＜l3＜＜l4；
(9.3) adding all the single-hop link weight coefficients to calculate the link quality of all the end-to-end links;
and (9.4) selecting the link with the best link quality, namely the link with the smallest weight coefficient after being added as the transmission route.
(10) After receiving the services sent by other nodes, the node firstly judges whether the final destination node of the service is the node per se according to the routing information carried in the service, if so, the node analyzes the service and sends the service to an upper layer for output, and turns to the step (7) after the service is finished; if not, applying for time slot resources from the cluster head, and turning to the step (11);
(11) after receiving the time slot resource application, the cluster head firstly judges whether a cross-network service exists in the network, when the cross-network service exists, the cross-network time slot of the cross-network node is firstly distributed, and then the sub-network time slot of the other nodes is distributed according to the current service quantity and type; when no cross-network service exists, directly allocating the time slot of the sub-network;
when the cluster head distributes the time slot of the sub-network, if the number of the unicast services simultaneously and concurrently sent by the nodes is 1, turning to the step (1.1); if the number of the unicast services simultaneously and concurrently sent by the nodes is more than 1 and less than the preset maximum value NmaxAnd then turning to the step (1.2); if the number of the unicast services simultaneously and concurrently sent by the nodes is larger than the preset maximum value NmaxOr if the broadcast/multicast service exists, turning to the step (1.3);
(1.1) the cluster head allocates the rest time slot resources except the cross-network time slot for the service, and the allocation adopts a time slot multiplexing principle, namely the time slot is allocated to two or more nodes for use after the relay hop number is more than or equal to 3;
(1.2) the cluster head allocates the residual time slot resources except the cross-network time slot according to the number of the existing services and the source node and the forwarding node of each service; the method specifically comprises the following steps:
(12.1) periodically updating the service application information of other nodes by the cluster head;
(12.2) judging the type and the number of the service application by the cluster head, if the number of the unicast services is more than 5 or the broadcast and multicast services exist, equally dividing the available time slot resources according to the number of the network nodes, and then turning to the step (12.1); if no broadcast and multicast service exists and the number of unicast services is 2-5, switching to the step (12.3);
(12.3) accumulating the relay hop count of each service, and counting as m;
(12.4) performing digital-to-analog m on the available time slots, wherein the obtained integer is the time slot number obtained by dividing each node on each service transmission link, and the remainder is the rest time slot resource to be divided;
(12.5) comparing the residual time slots to be divided with the relay hop count of each service, and distributing the service with the maximum hop count, wherein the relay hop count is not more than the residual time slots to be divided; this step is repeated until the number of remaining slots is less than the hop count of any one service, and then a transition is made (12.1).
And (1.3) the cluster head equally divides the residual time slot resources except the cross-network time slot according to the number of nodes in the network.
Fig. 6 is a schematic diagram of time slot allocation when only unicast traffic from the source node 1 to the destination node 10 exists in the network. In the time slot optimal allocation result, the nodes 1 and 4, the nodes 2 and 8, and the nodes 3 and 9 may adopt the same time slot due to the spatial isolation effect of the signals.
Fig. 7 shows the time slot allocation result when three unicast services are transmitted concurrently, where the node 4 as a relay node needs to forward the services from the source node 1 to the destination node 10, from the source node 3 to the destination node 11, and from the source node 5 to the destination node 12, and the nodes 3, 8, and 9 as relay nodes need to forward two services. When the priorities of the three services are consistent, in the final time slot allocation result, the node 4 is allocated with 9 time slots, the nodes 3, 8 and 9 are respectively allocated with 6 time slots, and the nodes 1, 2, 5 and 7 are respectively allocated with 3 time slots.
(12) If the node is not a cross-network node, forwarding information in the sub-network time slot allocated by the cluster head; if the node is a cross-network node, judging whether a target node is in the subnet, if the target node is an intra-subnet node, forwarding information in the time slot of the subnet distributed by the cluster head, and if the target node is an extra-subnet node, forwarding information in the cross-network time slot distributed by the cluster head;
(13) and (7) turning to the step after the node information is forwarded.

Claims (7)

1. A broadband frequency hopping clustering multilevel self-organizing network waveform design method realizes distributed centerless multi-hop frequency hopping synchronization, initial network establishment, dynamic gateway selection, physical layer modulation and demodulation, coding and decoding and link learning-based adaptive routing selection, and is characterized by comprising the following steps:
(1) the method comprises the steps that node equipment is started, node parameter information is configured, and the node parameter information comprises a node number, a frequency hopping rate, a frequency hopping frequency set and a frequency hopping pattern;
(2) the nodes transmit synchronous information with a certain probability according to a local time reference, a frequency hopping rate and a frequency hopping frequency set, and the other time slots receive the synchronous information transmitted by other nodes in the subnet to carry out frequency hopping synchronization and inter-node synchronization;
(3) after synchronization is completed, the nodes acquire a preassigned topological time slot table, maintain a neighbor table locally, analyze the neighbor table information of other nodes after receiving the neighbor table information of other nodes, perform fusion calculation on the received neighbor table information of all the nodes and the local neighbor table information to obtain a topological graph of the whole network, and send out the topological graph of the whole network in own sending time slot to complete network access synchronization;
(4) after the nodes finish the network access synchronization, a pair of 'scheduling time slots' which are distributed in advance, namely a DOWN frame and an UP frame, is obtained, the nodes monitor DOWN information in the DOWN frame, if the DOWN information is received in a set period, a cluster head exists in the subnet, and if the DOWN frame is not received in the set period, the node with the minimum number of the nodes in the subnet is selected as the cluster head according to topology;
(5) the nodes periodically send the synchronous information and receive the synchronous information sent by other nodes, and the synchronous state of the network is maintained;
(6) when the node receives the synchronization information of the nodes outside the subnet, the node sends a cross-network node application frame to the cluster head, the cluster head makes a decision and then issues a cross-network node designated frame, and when the node receives the cross-network node designated frame, the node can be determined as a cross-network node of the subnet;
(7) if the node does not receive the service information, turning to the step (5); if an upper layer service application is received, turning to the step (8); if the service sent by other nodes is received, turning to the step (10);
(8) when a node receives an upper-layer service application, firstly, whether a service target node is in a subnet or outside the subnet is judged, if the service target node is an out-subnet node, a cross-network node in the subnet is used as a target node in the subnet, and if the target node is an in-subnet node, the target node in the subnet and the service target node are the same node;
(9) the nodes self-adaptively determine a routing strategy in the subnet according to the network topology and the target nodes in the subnet, select a transmission route with the best link quality, send a time slot resource application to a cluster head in a scheduling time slot when each node in the transmission route carries out service transmission, and turn to the step (11);
(10) after receiving the services sent by other nodes, the node firstly judges whether the final destination node of the service is the node per se according to the routing information carried in the service, if so, the node analyzes the service and sends the service to an upper layer for output, and turns to the step (7) after the service is finished; if not, applying for time slot resources from the cluster head, and turning to the step (11);
(11) after receiving the time slot resource application, the cluster head firstly judges whether a cross-network service exists in the network, when the cross-network service exists, the cross-network time slot of the cross-network node is firstly distributed, and then the sub-network time slot of the other nodes is distributed according to the current service quantity and type; when no cross-network service exists, directly allocating the time slot of the sub-network;
(12) if the node is not a cross-network node, forwarding information in the sub-network time slot allocated by the cluster head; if the node is a cross-network node, judging whether a target node is in the subnet, if the target node is an intra-subnet node, forwarding information in the time slot of the subnet distributed by the cluster head, and if the target node is an extra-subnet node, forwarding information in the cross-network time slot distributed by the cluster head;
(13) and (7) turning to the step after the node information is forwarded.
2. The method for designing the broadband frequency hopping clustering multilevel self-organizing network waveform according to claim 1, wherein: when the cluster head distributes the time slot of the sub-network in the step (11), if the number of the unicast services simultaneously and concurrently sent by the nodes is 1, turning to the step (1.1); if the number of the unicast services simultaneously and concurrently sent by the nodes is more than 1 and less than the preset numberMaximum value NmaxAnd then turning to the step (1.2); if the number of the unicast services simultaneously and concurrently sent by the nodes is larger than the preset maximum value NmaxOr if the broadcast/multicast service exists, turning to the step (1.3);
(1.1) the cluster head allocates the rest time slot resources except the cross-network time slot for the service, and the allocation adopts a time slot multiplexing principle, namely the time slot is allocated to two or more nodes for use after the relay hop number is more than or equal to 3;
(1.2) the cluster head allocates the residual time slot resources except the cross-network time slot according to the number of the existing services and the source node and the forwarding node of each service;
and (1.3) the cluster head equally divides the residual time slot resources except the cross-network time slot according to the number of nodes in the network.
3. The method for designing the broadband frequency hopping clustering multilevel self-organizing network waveform according to claim 1, wherein: the step (2) specifically comprises the following steps:
(2.1) before the node is accessed to the network, initializing according to a local time reference, a frequency hopping frequency set and a frequency hopping rate, calculating the type of the current frequency hopping time slot according to a preset probability, and if the current frequency hopping time slot is a sending time slot, switching to (2.2); if the time slot is a receiving time slot, turning to (2.3);
(2.2) selecting a frequency hopping frequency point to be transmitted according to the called 'synchronous' frequency hopping pattern, transmitting local synchronous information in a broadcasting mode, and then turning to the step (2.1);
(2.3) calling a service frequency hopping pattern according to the node number, selecting a receiving frequency hopping frequency point, and then carrying out signal sliding receiving processing;
(2.4) if the synchronous information sent by other nodes is not received in the time slot, the step (2.1) is carried out; if receiving the synchronous information sent by other nodes, keeping the current frequency unchanged until receiving complete frame data;
and (2.5) the node modifies the local time reference and the frequency hopping pattern information according to the received synchronization information to complete frequency hopping synchronization and inter-node synchronization, and then the step (2.1) is carried out to continue the periodic synchronization maintenance.
4. The method for designing the broadband frequency hopping clustering multilevel self-organizing network waveform according to claim 1, wherein: the step (3) specifically comprises the following steps:
(3.1) after the node synchronization is finished, calculating to obtain a one-hop neighbor list and a corresponding topological time slot distribution result;
(3.2) judging the type of the current time slot according to the synchronization time and the distribution result of the topology time slot, if the current time slot is the topology time slot of the node, switching to the step (3.3), and if not, switching to the step (3.4);
(3.3) the node performs fusion calculation on the 'one-hop' neighbor list information of the node and the received 'one-hop' neighbor list information of other nodes to obtain a topological graph of the whole network and broadcasts the topological graph, and then the step (3.2) is carried out;
(3.4) receiving and analyzing the 'one-hop' neighbor list information of other nodes;
and (3.5) after the received one-hop neighbor list information sent by all the nodes and the self one-hop neighbor list information of the nodes are subjected to fusion calculation, updating to obtain a topology map of the whole network.
5. The method for designing the broadband frequency hopping clustering multilevel self-organizing network waveform according to claim 1, wherein: the step (6) specifically comprises the following steps:
(6.1) the node calculates the type of the current frequency hopping time slot according to the preset probability and the traffic busy degree, and if the current frequency hopping time slot is a sending time slot, the node is switched to (6.2); if the time slot is a receiving time slot, turning to (6.3);
(6.2) selecting a frequency hopping frequency point to be transmitted according to the called 'synchronous' frequency hopping pattern, transmitting local synchronous information in a broadcasting mode, and then turning to the step (6.1);
(6.3) calling a service frequency hopping pattern according to the node number, selecting a receiving frequency hopping frequency point, and then carrying out signal sliding receiving processing;
(6.4) if the synchronous information sent by other nodes is not received in the time slot, the step (6.1) is carried out; if receiving the synchronous information sent by the sub-network node, carrying out sub-network synchronization; if receiving the synchronous information sent by other sub-network nodes, judging whether the node has a route to the node, if so, turning to the step (6.1), otherwise, keeping the current frequency unchanged until receiving the complete frame data and turning to the step (6.5);
(6.5) judging whether the node is a cluster head node or not by the node, if so, judging whether a default gateway timer is overtime or not, if so, selecting the node as a cross-network node, otherwise, ignoring all cross-network node applications, and turning to the step (6.1); if not, applying the node to the cluster head as a cross-network node, sending a cross-network node designated frame after the cluster head receives the application, and turning to the step (6.6);
(6.6) the node judges whether a cross-network node appointed frame sent by the cluster head node is received, if so, the node is determined to be a cross-network node, and then the gateway information is diffused into the subnet; if not, go to (6.1).
6. The method for designing the broadband frequency hopping clustering multilevel self-organizing network waveform according to claim 1, wherein: in the step (9), the node adaptively determines a routing strategy in the subnet according to the network topology and the destination node in the subnet, and selects the transmission route with the best link quality, which specifically comprises the following steps:
(9.1) the node calculates all end-to-end links according to the destination node and the network topology;
(9.2) counting the channel quality of each single-hop link in all end-to-end links, dividing the channel quality into four grades of excellent, good, poor and non-communication, and correspondingly counting the weight coefficient as l1＜l2＜l3＜＜l4；
(9.3) adding all the single-hop link weight coefficients to calculate the link quality of all the end-to-end links;
and (9.4) selecting the link with the best link quality, namely the link with the smallest weight coefficient after being added as the transmission route.
7. The method for designing the broadband frequency hopping clustering multilevel self-organizing network waveform according to claim 2, wherein: the step (1.2) specifically comprises the following steps:
(12.1) periodically updating the service application information of other nodes by the cluster head;
(12.2) judging the type and the number of the service application by the cluster head, if the number of the unicast services is more than 5 or the broadcast and multicast services exist, equally dividing the available time slot resources according to the number of the network nodes, and then turning to the step (12.1); if no broadcast and multicast service exists and the number of unicast services is 2-5, switching to the step (12.3);
(12.3) accumulating the relay hop count of each service, and counting as m;
(12.4) performing digital-to-analog m on the available time slots, wherein the obtained integer is the time slot number obtained by dividing each node on each service transmission link, and the remainder is the rest time slot resource to be divided;
(12.5) comparing the residual time slots to be divided with the relay hop count of each service, and distributing the service with the maximum hop count, wherein the relay hop count is not more than the residual time slots to be divided; this step is repeated until the number of remaining slots is less than the hop count of any one service, and then a transition is made (12.1).
CN201911170210.4A 2019-11-26 2019-11-26 Broadband frequency hopping clustering multilevel self-organizing network waveform design method Active CN110839269B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911170210.4A CN110839269B (en) 2019-11-26 2019-11-26 Broadband frequency hopping clustering multilevel self-organizing network waveform design method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911170210.4A CN110839269B (en) 2019-11-26 2019-11-26 Broadband frequency hopping clustering multilevel self-organizing network waveform design method

Publications (2)

Publication Number Publication Date
CN110839269A true CN110839269A (en) 2020-02-25
CN110839269B CN110839269B (en) 2021-04-02

Family

ID=69577458

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911170210.4A Active CN110839269B (en) 2019-11-26 2019-11-26 Broadband frequency hopping clustering multilevel self-organizing network waveform design method

Country Status (1)

Country Link
CN (1) CN110839269B (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111555773A (en) * 2020-05-26 2020-08-18 上海无线电设备研究所 Frequency hopping synchronization method
CN111954306A (en) * 2020-07-08 2020-11-17 北京瀚诺半导体科技有限公司 Hybrid transmission method and system based on time slot and packet scheduling
CN112511189A (en) * 2020-11-18 2021-03-16 北京中天星控科技开发有限公司 Anti-interference method based on wireless transmission equipment frequency hopping networking application
CN112752336A (en) * 2020-12-29 2021-05-04 北京融讯信通科技有限公司 Method and system for centralized synchronous common-frequency simulcasting
CN113055830A (en) * 2021-05-31 2021-06-29 北京理工大学 Frequency hopping multiple access networking communication method and ultra-short wave ad hoc network radio station
CN113613306A (en) * 2021-09-09 2021-11-05 湖南智领通信科技有限公司 Multipath routing method and device suitable for wireless ad hoc network
CN115665777A (en) * 2022-12-13 2023-01-31 天地信息网络研究院(安徽)有限公司 Subnet fusion method of directed ad hoc network
CN116208193A (en) * 2021-12-01 2023-06-02 杭州联芯通半导体有限公司 Method for wireless channel frequency hopping synchronization in PLC and RF integrated network
CN116318632A (en) * 2023-05-18 2023-06-23 天津七一二通信广播股份有限公司 Safe multicast method and system for data link information distribution system

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103220800A (en) * 2013-04-07 2013-07-24 中国电子科技集团公司第三十研究所 Channel control method and device of multi-channel frequency hopping access system
US20130279540A1 (en) * 2012-04-20 2013-10-24 Cisco Technology, Inc. On-demand pair-wise frequency-hopping synchronization
US20140321317A1 (en) * 2013-04-26 2014-10-30 Nokia Corporation Method, apparatus, and computer program product for network type determination
CN107070498A (en) * 2017-04-17 2017-08-18 中国电子科技集团公司第五十四研究所 A kind of multistage MANET method for synchronizing time of the sub-clustering based on frequency hopping TDMA system
CN108768577A (en) * 2018-08-27 2018-11-06 武汉中元通信股份有限公司 A kind of communication network time service method and system based on PTP time synchronizing signals

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130279540A1 (en) * 2012-04-20 2013-10-24 Cisco Technology, Inc. On-demand pair-wise frequency-hopping synchronization
CN103220800A (en) * 2013-04-07 2013-07-24 中国电子科技集团公司第三十研究所 Channel control method and device of multi-channel frequency hopping access system
US20140321317A1 (en) * 2013-04-26 2014-10-30 Nokia Corporation Method, apparatus, and computer program product for network type determination
CN107070498A (en) * 2017-04-17 2017-08-18 中国电子科技集团公司第五十四研究所 A kind of multistage MANET method for synchronizing time of the sub-clustering based on frequency hopping TDMA system
CN108768577A (en) * 2018-08-27 2018-11-06 武汉中元通信股份有限公司 A kind of communication network time service method and system based on PTP time synchronizing signals

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
倪光华: ""A Multipath Redundant Transmission Algorithm for MANET"", 《WEB OF SCIENCE》 *
倪光华: ""无线自组网时间同步算法研究"", 《数字技术与应用》 *
刘艺: ""跳频自组网同步关键技术研究"", 《信息科技辑》 *
秦茜: ""一种改进的动态TDMA时隙分配算法研究"", 《无线电工程》 *
赵天鹤: ""移动自组网MAC协议组网和业务调度算法研究"", 《遥测遥控》 *

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111555773A (en) * 2020-05-26 2020-08-18 上海无线电设备研究所 Frequency hopping synchronization method
CN111954306A (en) * 2020-07-08 2020-11-17 北京瀚诺半导体科技有限公司 Hybrid transmission method and system based on time slot and packet scheduling
CN111954306B (en) * 2020-07-08 2024-02-27 北京瀚诺半导体科技有限公司 Hybrid transmission method and system based on time slot and packet scheduling
CN112511189B (en) * 2020-11-18 2022-03-11 北京中天星控科技开发有限公司 Anti-interference method based on wireless transmission equipment frequency hopping networking application
CN112511189A (en) * 2020-11-18 2021-03-16 北京中天星控科技开发有限公司 Anti-interference method based on wireless transmission equipment frequency hopping networking application
CN112752336A (en) * 2020-12-29 2021-05-04 北京融讯信通科技有限公司 Method and system for centralized synchronous common-frequency simulcasting
CN113055830A (en) * 2021-05-31 2021-06-29 北京理工大学 Frequency hopping multiple access networking communication method and ultra-short wave ad hoc network radio station
CN113613306A (en) * 2021-09-09 2021-11-05 湖南智领通信科技有限公司 Multipath routing method and device suitable for wireless ad hoc network
CN116208193A (en) * 2021-12-01 2023-06-02 杭州联芯通半导体有限公司 Method for wireless channel frequency hopping synchronization in PLC and RF integrated network
CN116208193B (en) * 2021-12-01 2024-02-06 杭州联芯通半导体有限公司 Method for wireless channel frequency hopping synchronization in PLC and RF integrated network
CN115665777A (en) * 2022-12-13 2023-01-31 天地信息网络研究院(安徽)有限公司 Subnet fusion method of directed ad hoc network
CN115665777B (en) * 2022-12-13 2023-03-07 天地信息网络研究院(安徽)有限公司 Subnet fusion method of directed ad hoc network
CN116318632A (en) * 2023-05-18 2023-06-23 天津七一二通信广播股份有限公司 Safe multicast method and system for data link information distribution system
CN116318632B (en) * 2023-05-18 2023-10-24 天津七一二通信广播股份有限公司 Safe multicast method and system for data link information distribution system

Also Published As

Publication number Publication date
CN110839269B (en) 2021-04-02

Similar Documents

Publication Publication Date Title
CN110839269B (en) Broadband frequency hopping clustering multilevel self-organizing network waveform design method
US8750159B2 (en) Self-organizing multi-channel mesh network
Liu et al. Spectrum-aware opportunistic routing in multi-hop cognitive radio networks
US6621805B1 (en) Method and apparatus for multicasting real-time variable bit-rate traffic in wireless Ad-Hoc networks
EP1479197B1 (en) Cross-layer integrated collision free path routing
US8050196B2 (en) Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation
CN110225565B (en) Mobile networking method based on multi-beam directional antenna
CN1947440A (en) Routing protocol within hybrid-cellular networks
CN105636148A (en) Wireless multi-hop network data transmission method
CN111526557B (en) Wireless ad hoc network routing information acquisition method
CN112040528B (en) Method for selecting control node of wireless ad hoc network center
CN112423311B (en) Simple wireless ad hoc network scheme
Gupta et al. A D2D multicast network architecture for vehicular communications
Seferoglu et al. Network coding-aware rate control and scheduling in wireless networks
CN114615745B (en) Wireless self-organizing network channel access and transmission power joint scheduling method
Mansoor et al. CoAd: A cluster based adhoc cognitive radio networks architecture with broadcasting protocol
CN114268360B (en) Aircraft ad hoc network method based on simultaneous same-frequency full duplex
CN112637789B (en) VHF and UHF section fusion intelligent ad hoc network method
CN106131887B (en) Distribution topology control method based on serial interference elimination
CN115665860A (en) Unmanned aerial vehicle ad hoc network resource allocation method based on migratory bird swarm characteristics
Chen et al. Cross layer design of heterogeneous virtual MIMO radio networks with multi-optimization
CN114143852A (en) Anti-interference communication link selection method applied to unmanned aerial vehicle cluster
KR102078780B1 (en) The apparatus and method of intelligent transmission in wireless personal area network
CN111277304A (en) Unicast transmission method and system based on multi-relay cooperation
CN103731835A (en) Multiple input multiple output medium access control (MIMO MAC) protocol method for achieving singlecast and broadcast

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant