CN111432351A - Method and system for networking tree-shaped multi-hop network - Google Patents
Method and system for networking tree-shaped multi-hop network Download PDFInfo
- Publication number
- CN111432351A CN111432351A CN202010229984.6A CN202010229984A CN111432351A CN 111432351 A CN111432351 A CN 111432351A CN 202010229984 A CN202010229984 A CN 202010229984A CN 111432351 A CN111432351 A CN 111432351A
- Authority
- CN
- China
- Prior art keywords
- relay
- node
- tree
- frequency
- base station
- 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
Links
- 230000006855 networking Effects 0.000 title claims abstract description 42
- 238000000034 method Methods 0.000 title claims abstract description 32
- 230000006854 communication Effects 0.000 claims description 38
- 238000004891 communication Methods 0.000 claims description 38
- 239000013078 crystal Substances 0.000 claims description 4
- 238000005265 energy consumption Methods 0.000 abstract description 5
- 238000001228 spectrum Methods 0.000 abstract description 5
- 230000000694 effects Effects 0.000 abstract description 3
- 238000012545 processing Methods 0.000 description 8
- 238000012423 maintenance Methods 0.000 description 6
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 4
- 230000036578 sleeping time Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000007175 bidirectional communication Effects 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006798 recombination Effects 0.000 description 1
- 238000005215 recombination Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- 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
- H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
- H04W52/0225—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal
- H04W52/0229—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal where the received signal is a wanted signal
-
- 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
- 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/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application discloses a networking method and a networking system of a tree-shaped multi-hop network, wherein the networking method of the tree-shaped multi-hop network comprises the following steps: forming a cell by a base station node, one or more relay nodes associated with the base station node and a terminal node; c, dividing adjacent different cells into the same group of same-frequency broadcast groups; c different cells in the same group of same-frequency broadcast groups are arranged to transmit same-frequency broadcast signals on C different time slots. The method and the device have the technical effects of avoiding mutual interference of adjacent cells, realizing full utilization of limited frequency spectrum resources and reducing the energy consumption of the whole network battery.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a networking method and system for a tree-like multi-hop network.
Background
The conventional Mesh network (Mesh Networks) structure has many limitations in practical applications. With the increase of nodes and the enlargement of network scale, the reliability of message transmission is obviously reduced, the time delay is obviously improved, the successful transmission of a message requires that each 'one hop' or each message forwarding node on a transmission path has no problem, namely, the average end-to-end message transmission packet loss rate or the time delay of the mesh network is correspondingly improved when each 'one hop' is increased.
Secondly, as the number of network nodes increases, the network topology becomes complex, the interruption of each link causes the topology of the whole network to be recombined, and for the internet of things, each recombination consumes a large amount of energy to exchange topology information with adjacent nodes, including sending or receiving network maintenance messages.
Furthermore, under normal conditions, a node of a multi-hop mesh network needs to exchange a link maintenance message with each adjacent node periodically, that is, as the number of network nodes increases, the density of the network nodes increases, and the conventional maintenance message traffic between the nodes may exceed the actual data traffic message number per se. If no mechanism exists, different nodes are enabled to be separated at the moment of sending, broadcasting or link maintenance messages, and link maintenance broadcasting signals from different nodes inevitably collide with each other, so that more maintenance flow expenses are caused, the electric quantity consumption of one internet of things node or an internet of things sensor terminal is possibly rapidly increased in practical application, and the electric quantity of part of nodes is finally rapidly exhausted, so that the whole network becomes unstable.
Disclosure of Invention
The purpose of the present application is to provide a networking method and system for a tree-like multi-hop network, which have the technical effects of avoiding mutual interference between adjacent cells, realizing full utilization of limited spectrum resources, and reducing the energy consumption of the battery of the whole network.
In order to achieve the above object, the present application provides a method for networking a tree-like multi-hop network, including: forming a cell by a base station node, one or more relay nodes associated with the base station node and a terminal node; c, dividing adjacent different cells into the same group of same-frequency broadcast groups; c different cells in the same group of same-frequency broadcast groups are arranged to transmit same-frequency broadcast signals on C different time slots.
As above, in a time frame, the base station node and all the relay nodes in a cell use the same frequency and select different fixed time slots to transmit the broadcast signal, and the time period β of the fixed time slots for the base station node and the relay nodes to transmit the broadcast signal satisfies:
wherein β is the time period, the crystal oscillator clock drift parameter of the relay/terminal node, and g is the time slot guard interval.
As above, one co-frequency broadcast group uses one broadcast frequency point, and the broadcast frequency points used by different co-frequency broadcast groups are the same.
As above, the cells in the non-same group of frequency broadcast groups broadcast in the same time slot using the same frequency point.
As above, one co-frequency broadcast group uses one broadcast frequency point, and the broadcast frequency points used by different co-frequency broadcast groups are different.
The relay sub-trees are formed by a plurality of relay nodes, the level limit of each relay sub-tree is n levels, wherein n is more than or equal to 0; when n is 0, the network topology is a star structure without a relay subtree; when n is greater than 0, the network topology contains a relay sub-tree, and the limited number of next-level relay nodes which can be accessed by the relay node of the ith level of the relay sub-tree is m (i), wherein i is 0,1, … …, n; when n is more than or equal to 1, the number of the time slots of the same-frequency broadcast allocated to the base station node and the relay nodes at each level in the relay sub-tree in the same honeycomb meets the following conditions:
wherein C represents the number of different cells in a same frequency broadcast group, β is a time period, m (i) is the limit number of the next-stage relay nodes which can be accessed by the relay node of the ith stage of the relay sub-tree, t is a fixed time slot length, t-g is satisfied, the residual time after t-g sends a complete data frame according to the current link rate, g is a time slot guard interval, and l is the maximum relay layer number in a cell.
As above, when n > 1, the relay node in the first-level relay node in the relay sub-tree is directly connected to the base station node, the second-level relay node is connected to the first-level relay node, and so on, the n-level relay node is connected to the n-1-level relay node, and the relay node in the n-level relay node is connected to the terminal node.
The present application further provides a networking system of a tree-like multi-hop network, including: three logic nodes and a wireless communication device; the three logical nodes include: a base station node, a relay node and a terminal node; the wireless communication device is used for realizing the networking method of the tree-shaped multi-hop network and is used for bearing the communication with the base station node, the relay node and the terminal node; the terminal node and the base station node communicate by establishing direct connection or indirect connection; the indirect connection includes a relay node connected between the terminal node and the base station node, or a relay sub-tree composed of a plurality of relay nodes.
As above, the wireless communication device comprises K independent communication modules, wherein K is more than or equal to 1; when K is more than 1, a plurality of independent communication modules are connected with each other; each independent communication module simultaneously undertakes communication with the base station node, the relay node and the terminal node, and the communication comprises data sending and data receiving.
As above, the base station node, the relay node and the terminal node use fn working frequency points altogether, and the working frequency points are calculated by the configurable basic frequency points, and the calculation formula is as follows: fx ═ FB + (Fh + Fz × Ft) × G; wherein Fx is a working frequency point, and x is 1,2,3,4,5, … …, fn; FB is a basic frequency point; fh is a frequency point number; fz is a frequency hopping group number; ft is the frequency of each group of hop; g is the channel spacing.
The beneficial effect that this application realized is as follows:
(1) in the networking method and the networking system of the tree-shaped multi-hop network, one honeycomb selects different fixed time slots of a time frame with a fixed time period to transmit broadcast signals, and the conflict of the broadcast signals transmitted by a base station node and a relay node related to the base station node is avoided.
(2) According to the networking method and the networking system of the tree-shaped multi-hop network, the C different cells in the same group of the same-frequency broadcast group are arranged to send the same-frequency broadcast signals on the C different time slots, so that a cellular network formed by a plurality of cell groups avoids mutual interference while broadcasting by using a single frequency point through frequency distribution and multiplexing, the broadcast signal searching power consumption when a terminal node accesses the network is reduced, and the full utilization of limited spectrum resources is realized.
(3) The networking method of the tree-shaped multi-hop network ensures that the network can well support ad hoc network and self recovery, and supports bidirectional communication between the base station node and the terminal node.
(4) The transceiving unit in the networking system of the tree-shaped multi-hop network controls the self and the awakening or sleeping time of the transceiving unit according to the networking method of the tree-shaped multi-hop network, so that the battery energy consumption of the whole network is reduced.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art according to the drawings.
FIG. 1 is a schematic structural diagram of an embodiment of a communication module;
fig. 2 is a flowchart of an embodiment of a networking method of a tree multi-hop network.
Detailed Description
The technical solutions in the embodiments of the present invention are clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The application provides a networking method and a networking system of a tree-shaped multi-hop network, which have the technical effects of avoiding mutual interference of adjacent cells, realizing full utilization of limited frequency spectrum resources and reducing the energy consumption of a battery of the whole network.
The application provides a network deployment system of treelike multihop network, includes: three logic nodes and a wireless communication device; the three logical nodes include: a base station node, a relay node and a terminal node; the wireless communication device is used for realizing the networking method of the tree-shaped multi-hop network and is used for bearing the communication with the base station node, the relay node and the terminal node;
the terminal node and the base station node communicate by establishing direct connection or indirect connection; the indirect connection includes a relay node connected between the terminal node and the base station node, or a relay sub-tree composed of a plurality of relay nodes.
Further, the relay node or the terminal node preferentially selects the base station node to establish the connection. When no suitable base station node exists, the relay node selects a suitable upper-level relay node to establish connection, and the terminal node selects a suitable relay node to establish connection. Specifically, the relay sub-tree composed of the relay nodes and the terminal node can dynamically change the network topology according to the signal propagation quality to enable the node connection in the network to be more balanced.
Further, the base station node, the relay node and the terminal node use fn working frequency points in total, the working frequency points are calculated by a configurable basic frequency point, and the calculation formula is as follows:
Fx＝FB+(Fh+Fz*Ft)*G；
wherein Fx is a working frequency point, and x is 1,2,3,4,5, … …, fn; FB is a basic frequency point; fh is a frequency point number; fz is a frequency hopping group number; ft is the frequency of each group of hop; g is the channel spacing.
Specifically, as an example, fn ═ 6 is described in the present application. As shown in table 1, the networking system of the tree-like multi-hop network of the present application uses 6 working frequency points in total. Each network element device (the network element device comprises a base station node, a relay node and a terminal node) is preset with a basic frequency point (FB).
TABLE 1
The base station node occupies 3 frequency points, wherein the 3 frequency points include F1, F3 and F6.
Specifically, the base station broadcasts a registration information frequency point (F1): and broadcasting a registration message for providing access of the subordinate devices (the relay nodes and/or the terminal nodes) in each frame period.
Base station service data communication frequency point (F3): the device is used for receiving uplink data and maintaining clock synchronization.
Downlink traffic data communication frequency point (F6): for transmitting downlink traffic data.
The relay node occupies 6 frequency points, wherein the 6 frequency points include F1, F2, F3, F4, F5 and F6.
Specifically, the base station broadcasts a registration information channel (F1): and receiving the broadcast registration information of the base station node, and performing clock calibration to access the network.
Relay broadcast registration information frequency point (F2): the registration information is broadcast periodically (4 frame periods) to provide access to subordinate devices (subordinate relay nodes or terminal nodes).
Base station service data communication/broadcast clock synchronization frequency point (F3): and sending uplink data, forwarding the data and receiving clock synchronization information.
Relay service data communication frequency point (F4): used for receiving the uplink data of the lower device and forwarding the data to the relay.
Relay broadcast clock synchronization frequency point (F5): maintaining clock synchronization with the lower level.
Downlink traffic data communication frequency point (F6): for receiving or transmitting downlink traffic data.
The terminal node occupies 6 frequency points, wherein the 6 frequency points include F1, F2, F3, F4, F5 and F6.
Specifically, the base station broadcasts a registration information frequency point (F1): and receiving the broadcast registration information of the base station node, and performing clock calibration to access the network.
Relay broadcast registration information frequency point (F2): and receiving the broadcast registration information of the relay node, and performing clock calibration to access the network.
Base station service data communication/broadcast clock synchronization frequency point (F3): and sending uplink data, forwarding the data and receiving clock synchronization information.
Relay service data communication frequency point (F4): and sending the uplink data to the relay node.
Relay broadcast clock synchronization frequency point (F5): and carrying out clock calibration with the relay node.
Downlink traffic data communication frequency point (F6): for receiving downlink traffic data.
Furthermore, the wireless communication device comprises K independent communication modules, wherein K is more than or equal to 1; when K is more than 1, a plurality of independent communication modules are connected with each other; each independent communication module simultaneously undertakes communication with the base station node, the relay node and the terminal node, and the communication comprises data sending and data receiving.
Further, as shown in fig. 1, each independent communication module includes a central processing unit, a transceiver unit, a storage unit and a power supply unit; the central processing unit is respectively connected with the transceiving unit, the storage unit and the power supply unit; the power supply unit is respectively connected with the transceiving unit and the storage unit.
Wherein, the central processing unit: the method is used for controlling the self and the awakening or sleeping time of the transceiving unit according to the time period and the time slot of the tree multi-hop network networking method.
A transmitting and receiving unit: the wireless signal processing device is used for sending the received wireless signal to the central processing unit for processing and sending the processed signal.
A storage unit: and the method is used for storing the connection information of the next-level relay node in the relay sub-tree.
A power supply unit: for providing power to the transceiver unit, the central processing unit and the memory unit.
Furthermore, the communication modules are connected with each other through respective central processing units.
As shown in fig. 2, the present application provides a networking method for a tree-like multi-hop network, including:
s1: a base station node, one or more relay nodes associated with the base station node, and a terminal node are grouped into a cell.
Further, a plurality of relay nodes form a relay sub-tree.
Furthermore, the stage number of each relay sub-tree is limited to n stages, wherein n is more than or equal to 0; when n is 0, the network topology is a star structure without a relay subtree; when n is greater than 0, the network topology contains a relay sub-tree, and the limited number of next-level relay nodes which can be accessed by the relay node of the ith level of the relay sub-tree is m (i), wherein i is 0,1, … …, n; when n is more than or equal to 1, the number of the time slots of the same-frequency broadcast allocated to the base station node and the relay nodes at each level in the relay sub-tree in the same honeycomb meets the following conditions:
wherein C represents the number of different cells in a same-frequency broadcast group, β is a time period, m (i) is the limit number of the next-stage relay nodes which can be accessed by the relay node of the i-th stage of the relay sub-tree, t is a fixed time slot length, the residual time after t-g can be met to send a complete data frame according to the current link rate, g is a time slot guard interval, and l is the maximum relay layer number of a cell.
Specifically, as an embodiment, the time period for setting one time frame includes 20 time slots, and each time slot is 800 ms. Because the clock synchronization timer uses a crystal oscillator of 32768hz20ppm, the clock skew problem exists, and clock guard intervals (gap, g) are needed at both ends of the transceiving equipment to ensure that signals can be normally received. In order to control the duration of g, the duration of g is set within 20ms to ensure enough time to transmit and receive data, and the clock synchronization period T is:
T＝A*B；
wherein T is a clock synchronization period; a is the frame number of the fixed time period; b is the time period of one frame; as an example, when a is 60 and B is 16s, then:
T＝60*16s；
＝960s
after the unit is converted, T is 960s 20/1000000 is 19.2 ms.
In a time period of 60 frames, the 0 th period is a broadcast clock synchronization frame of the base station node, and the total time slots of the remaining time periods of 59 frames are: 59 x 20 ═ 1180.
The broadcast clock synchronization message frequency points of each relay node are the same and need to be staggered in time, so 1180 is the maximum number of relay nodes under one base station node.
Therefore, the primary relay node is provided with 80 relay nodes, each relay node is provided with 4 secondary relay nodes, and each relay node under each secondary relay node is provided with 2 tertiary relay nodes.
The total number of relay nodes is:
80+4 × 80 × 2 ═ 80+320+640 ═ 1040.
1040 less than 1180 meets the total number of relays design requirement.
Further, when n is larger than 1, the relay node in the first-level relay node in the relay sub-tree is directly connected with the base station node, the second-level relay node is connected with the first-level relay node, and so on, the n-level relay node is connected with the n-1-level relay node, and the relay node in the n-level relay node is connected with the terminal node.
S2: the adjacent C different cells are grouped into the same group of same frequency broadcast group.
Further, in the same time frame, all relay nodes in a cell use the same frequency and select different fixed time slots to transmit the broadcast signal, and the time period β of the fixed time slots for the base station node and the relay nodes to transmit the broadcast signal satisfies:
wherein β is the time period, the crystal oscillator clock drift parameter of the relay/terminal node, and g is the time slot guard interval.
Further, the fixed time slots in one cell are uniformly maintained by the base station node in the cell, and the number of the fixed time slots set in one time frame is greater than or equal to the sum of the numbers of the base station node and all the relay nodes.
S3: c different cells in the same group of same-frequency broadcast groups are set to transmit the same-frequency broadcast signals on C different time slots, so that the time slots for transmitting the broadcast signals among adjacent cells in the same group of same-frequency broadcast groups are not overlapped.
Specifically, the time slots of C different cells in the same group of same-frequency broadcast groups for transmitting broadcast signals are separated, performed in different fixed time slots, and frequency-allocated and multiplexed according to a certain rule, so as to ensure that the time slots of adjacent cells in the same group of same-frequency broadcast groups for transmitting broadcast signals are not overlapped, and the time slot of a base station node or a relay node in one cell for broadcasting is not overlapped with the broadcast time slot of a base station or a relay node under a directly adjacent cell.
Further, each cell uses a time slot, and cells in the non-same group of same-frequency broadcast groups can use the same time slot if spaced far enough apart, so that limited frequency resources can be reused within a certain range. In addition, when the capacity is insufficient, the range of the cells can be reduced, more cells can be divided, and the utilization efficiency of the frequency can be further improved.
Furthermore, one same-frequency broadcast group uses one broadcast frequency point, and the broadcast frequency points used by different same-frequency broadcast groups are the same. The spatial multiplexing ensures that even if different same-frequency broadcast groups adopt the same broadcast frequency point, the cells in different same-frequency broadcast groups can broadcast by adopting the same frequency point in the same time slot without mutual interference, thereby saving the number of broadcast frequency points required to be searched when a low-power-consumption terminal accesses the network.
Specifically, as an embodiment, a same-frequency broadcast group a1 and a same-frequency broadcast group a2 are provided, the same-frequency broadcast group a1 includes C1 cells, the same-frequency broadcast group a2 includes C2 cells, and both the same-frequency broadcast group a1 and the same-frequency broadcast group a2 use a broadcast frequency point P; c1 cells use C1 different slots, C2 cells use C2 different slots; the C1 different slots may be the same as the C2 different slots.
Further, as another embodiment, one co-frequency broadcast group uses one broadcast frequency point, and the broadcast frequency points used by different co-frequency broadcast groups are different.
The beneficial effect that this application realized is as follows:
(1) in the networking method and the networking system of the tree-shaped multi-hop network, one honeycomb selects different fixed time slots of a time frame with a fixed time period to transmit broadcast signals, and the conflict of the broadcast signals transmitted by a base station node and a relay node related to the base station node is avoided.
(2) According to the networking method and the networking system of the tree-shaped multi-hop network, the C different cells in the same group of the same-frequency broadcast group are arranged to send the same-frequency broadcast signals on the C different time slots, so that a cellular network formed by a plurality of cell groups avoids mutual interference while broadcasting by using a single frequency point through frequency distribution and multiplexing, the broadcast signal searching power consumption when a terminal node accesses the network is reduced, and the full utilization of limited spectrum resources is realized.
(3) The networking method of the tree-shaped multi-hop network ensures that the network can well support ad hoc network and self recovery, and supports bidirectional communication between the base station node and the terminal node.
(4) The transceiving unit in the networking system of the tree-shaped multi-hop network controls the self and the awakening or sleeping time of the transceiving unit according to the networking method of the tree-shaped multi-hop network, so that the battery energy consumption of the whole network is reduced.
While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, the scope of protection of the present application is intended to be interpreted to include the preferred embodiments and all variations and modifications that fall within the scope of the present application. It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the present application and their equivalents, the present application is intended to include such modifications and variations as well.
Claims (10)
1. A networking method of a tree-like multi-hop network is characterized by comprising the following steps:
forming a base station node, one or more relay nodes associated with the base station node, and a terminal node into a cell;
c, dividing adjacent different cells into the same group of same-frequency broadcast groups;
c different cells in the same group of same-frequency broadcast groups are arranged to transmit same-frequency broadcast signals on C different time slots.
2. The networking method of tree-like multi-hop network according to claim 1, wherein in a time frame, the base station node and all the relay nodes in a cell use the same frequency and select different fixed time slots to transmit the broadcast signal, and the time period β of the fixed time slots for the base station node and the relay nodes to transmit the broadcast signal satisfies:
wherein β is the time period, the crystal oscillator clock drift parameter of the relay/terminal node, and g is the time slot guard interval.
3. The networking method of tree multi-hop network according to claim 2, wherein one co-frequency broadcasting group uses one broadcasting frequency point, and the broadcasting frequency points used by different co-frequency broadcasting groups are the same.
4. The networking method of tree multi-hop network according to claim 3, wherein cells in non-identical frequency broadcast groups broadcast using the same broadcast frequency point in the same time slot.
5. The networking method of tree multi-hop network according to claim 2, wherein one co-frequency broadcasting group uses one broadcasting frequency point, and the broadcasting frequency points used by different co-frequency broadcasting groups are different.
6. The networking method of tree-like multi-hop network according to claim 1 or 4, wherein a plurality of relay nodes form relay sub-trees, the number of levels of each relay sub-tree is limited to n levels, wherein n is greater than or equal to 0; when n is 0, the network topology is a star structure without a relay subtree; when n is greater than 0, the network topology contains a relay sub-tree, and the limited number of next-level relay nodes which can be accessed by the relay node of the ith level of the relay sub-tree is m (i), wherein i is 0,1, n; when n is more than or equal to 1, the number of the time slots of the same-frequency broadcast allocated to the base station node and the relay nodes at each level in the relay sub-tree in the same honeycomb meets the following conditions:
wherein C represents the number of different cells in a same frequency broadcast group, β is a time period, m (i) is the limit number of the next-stage relay nodes which can be accessed by the relay node of the i-th stage of the relay sub-tree, t is a fixed time slot length, t-g is satisfied, the residual time after t-g is sent to a complete data frame according to the current link rate, g is a time slot guard interval, and l is the maximum relay layer number of a cell.
7. The networking method of a tree-like multi-hop network according to claim 6, wherein when n > 1, the relay nodes in the first-level relay nodes in the relay sub-tree are directly connected to the base station node, the second-level relay nodes are connected to the first-level relay nodes, and so on, the n-level relay nodes are connected to the n-1-level relay nodes, and the relay nodes in the n-level relay nodes are connected to the terminal node.
8. A networking system for a tree-like multi-hop network, comprising: three logic nodes and a wireless communication device; the three logical nodes include: a base station node, a relay node and a terminal node; the wireless communication device is used for realizing the networking method of the tree-shaped multi-hop network of any one of claims 1 to 7 and is used for bearing communication with a base station node, a relay node and a terminal node;
wherein the terminal node and the base station node communicate by establishing a direct connection or an indirect connection; the indirect connection comprises that one relay node is connected between the terminal node and the base station node, or a relay sub-tree consisting of a plurality of relay nodes is connected.
9. The networking system of claim 8, wherein the wireless communication device comprises K independent communication modules, wherein K ≧ 1; when K is more than 1, a plurality of independent communication modules are connected with each other; and each independent communication module simultaneously undertakes communication with the base station node, the relay node and the terminal node, and comprises data sending and data receiving.
10. The networking system of a tree-like multi-hop network according to claim 8 or 9, wherein fn working frequency points are used by the base station node, the relay node and the terminal node in total, and the working frequency points are calculated from configurable basic frequency points, and the calculation formula is as follows:
Fx＝FB+(Fh+Fz*Ft)*G；
wherein Fx is a working frequency point, and x is 1,2,3,4,5, … …, fn; FB is a basic frequency point; fh is a frequency point number; fz is a frequency hopping group number; ft is the frequency of each group of hop; g is the channel spacing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010229984.6A CN111432351B (en) | 2020-03-27 | 2020-03-27 | Method and system for networking tree-shaped multi-hop network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010229984.6A CN111432351B (en) | 2020-03-27 | 2020-03-27 | Method and system for networking tree-shaped multi-hop network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111432351A true CN111432351A (en) | 2020-07-17 |
| CN111432351B CN111432351B (en) | 2021-09-14 |
Family
ID=71549486
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010229984.6A Active CN111432351B (en) | 2020-03-27 | 2020-03-27 | Method and system for networking tree-shaped multi-hop network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111432351B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114257969A (en) * | 2021-11-26 | 2022-03-29 | 珠海格力电器股份有限公司 | Mesh network-based communication interaction method and device, storage medium and electronic equipment |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101646260A (en) * | 2008-08-06 | 2010-02-10 | 展讯通信（上海）有限公司 | Method for converging wireless networks at same frequency point and related networks |
| CN101795458A (en) * | 2010-01-11 | 2010-08-04 | 西南交通大学 | Method for eliminating uplink span time slot interference of time division duplex cellular system |
| US20140229519A1 (en) * | 2012-02-22 | 2014-08-14 | Ether-2 Corp. | Network communications |
| CN105072659A (en) * | 2015-08-18 | 2015-11-18 | 高尚 | Multi-hop wireless sensor network with high transmission rate |
| CN106102017A (en) * | 2016-05-31 | 2016-11-09 | 厦门纵行信息科技有限公司 | The network-building method of a kind of tree-shaped multihop network and Wireless Telecom Equipment |
| CN106131923A (en) * | 2016-06-30 | 2016-11-16 | 厦门纵行信息科技有限公司 | A kind of network-building method mixing access module multihop network and Wireless Telecom Equipment |
| CN106385701A (en) * | 2016-12-14 | 2017-02-08 | 武汉博思创信息科技有限公司 | Method for determining optimal route based on transmission time length |
-
2020
- 2020-03-27 CN CN202010229984.6A patent/CN111432351B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101646260A (en) * | 2008-08-06 | 2010-02-10 | 展讯通信（上海）有限公司 | Method for converging wireless networks at same frequency point and related networks |
| CN101795458A (en) * | 2010-01-11 | 2010-08-04 | 西南交通大学 | Method for eliminating uplink span time slot interference of time division duplex cellular system |
| US20140229519A1 (en) * | 2012-02-22 | 2014-08-14 | Ether-2 Corp. | Network communications |
| CN105072659A (en) * | 2015-08-18 | 2015-11-18 | 高尚 | Multi-hop wireless sensor network with high transmission rate |
| CN106102017A (en) * | 2016-05-31 | 2016-11-09 | 厦门纵行信息科技有限公司 | The network-building method of a kind of tree-shaped multihop network and Wireless Telecom Equipment |
| CN106131923A (en) * | 2016-06-30 | 2016-11-16 | 厦门纵行信息科技有限公司 | A kind of network-building method mixing access module multihop network and Wireless Telecom Equipment |
| CN106385701A (en) * | 2016-12-14 | 2017-02-08 | 武汉博思创信息科技有限公司 | Method for determining optimal route based on transmission time length |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114257969A (en) * | 2021-11-26 | 2022-03-29 | 珠海格力电器股份有限公司 | Mesh network-based communication interaction method and device, storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111432351B (en) | 2021-09-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108235437B (en) | Wireless mobile self-organizing network channel time slot scheduling and distributing method | |
| EP2280517B1 (en) | Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation | |
| CN101409660B (en) | Channel access control method for wireless sensor network | |
| CN106102017A (en) | The network-building method of a kind of tree-shaped multihop network and Wireless Telecom Equipment | |
| CN106131923B (en) | Networking method of multi-hop network in hybrid access mode and wireless communication equipment | |
| Xue et al. | Data preservation in intermittently connected sensor networks with data priority | |
| CN104185280A (en) | Method of determining scheduling priority of link in distributive wireless network and device | |
| CN102386991B (en) | Timeslot interchange operating method for time division multiple address access system in wireless mobile self-organized network | |
| CN111432351B (en) | Method and system for networking tree-shaped multi-hop network | |
| Jovanovic et al. | Multi-channel media access control for wireless sensor networks: A survey | |
| CN105049356B (en) | Monitor the data multihop routing acquisition method based on QoS in network | |
| CN111757414B (en) | A Networking Method of SDMANET Network Based on Multimode Radio | |
| Diab et al. | Hybrid multi-channel mac protocol for wireless sensor networks: Interference rate evaluation | |
| Zhao et al. | A cluster-dynamic tdma slot assignment protocol for large-scale mobile ad hoc networks | |
| Hahm et al. | A case for time slotted channel hopping for ICN in the IoT | |
| Kamruzzaman et al. | Dynamic TDMA slot reservation protocol for cognitive radio ad hoc networks | |
| Lanjewar et al. | Comparative study of MAC layer protocols in wireless sensor networks: a survey | |
| Kojima et al. | Superframe division multi-hop data collection with aggregation on Wi-SUN profile for ECHONET Lite | |
| CN101257439B (en) | Multi-jumping relay time division duplexing self-adapting transmission method and apparatus in mobile communication network | |
| CN103731835A (en) | Multiple input multiple output medium access control (MIMO MAC) protocol method for achieving singlecast and broadcast | |
| Ghazali et al. | Adaptive tree-based routing for multi-channel wireless sensor network | |
| JP2006157637A (en) | Radio communication method and system | |
| Wang et al. | Improved Sequential Vertex Colouring Algorithm for the TDMA Dynamic Time Slot Allocation Protocol. | |
| Singh et al. | A energy efficient tdma scheduling scheme for large-scale wsan | |
| Hamid et al. | Multi-channel MAC protocol for wireless sensor networks: A schedule-based approach |
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 |