CN116347558A - Multi-hop relay communication system and construction method of multi-hop relay communication network - Google Patents

Multi-hop relay communication system and construction method of multi-hop relay communication network Download PDF

Info

Publication number
CN116347558A
CN116347558A CN202211545036.9A CN202211545036A CN116347558A CN 116347558 A CN116347558 A CN 116347558A CN 202211545036 A CN202211545036 A CN 202211545036A CN 116347558 A CN116347558 A CN 116347558A
Authority
CN
China
Prior art keywords
node
network
cluster
management
information
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.)
Pending
Application number
CN202211545036.9A
Other languages
Chinese (zh)
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.)
722th Research Institute of CSIC
Original Assignee
722th Research Institute of CSIC
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 722th Research Institute of CSIC filed Critical 722th Research Institute of CSIC
Priority to CN202211545036.9A priority Critical patent/CN116347558A/en
Publication of CN116347558A publication Critical patent/CN116347558A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • 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
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/46—Cluster building
    • 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
    • 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
    • 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)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present disclosure provides a multi-hop relay communication system and a construction method of the multi-hop relay communication network. The system comprises a management node, a cluster head node and a cluster member node in at least one cluster network; the management node is used for sending network management information in a time slot corresponding to the management node, the network management information comprises time slot allocation information and cluster network indication information, the time slot allocation information is used for indicating a time slot which can be used by a target node, the target node is any one of a node in a system and a node to be accessed into the network, and the cluster network indication information is used for indicating the corresponding relation between a cluster head node and cluster member nodes in each cluster network; the cluster head node is used for sending network management information in a corresponding time slot and sending and receiving authentication information of the node to be accessed to the network; the management node is further configured to determine cluster indication information according to the network topology. The system uses management nodes as centers to spread network control information hop by hop, and establishes a multi-hop relay communication network in a clustering and layering way.

Description

Multi-hop relay communication system and construction method of multi-hop relay communication network
Technical Field
The disclosure relates to the technical field of communication, and in particular relates to a multi-hop relay communication system and a construction method of the multi-hop relay communication network.
Background
A wireless ad hoc network is a communication network that does not require a fixed infrastructure. Wireless ad hoc networks are typically multi-hop relay communication networks, i.e. a source node may transmit data to a target node over one or more hops. Here, the source node and the target node are any two nodes in the multihop relay communication network.
In the related art, the basic idea of multi-hop relay communication network establishment is to divide a large-scale node into a plurality of small-scale subnets, each subnet is provided with a cluster head node, and the cluster head node is responsible for managing each node in the subnet where the cluster head node is located. The cluster head nodes of each sub-network form a backbone network, and the sub-networks are interconnected through the backbone network.
Disclosure of Invention
The embodiment of the disclosure provides a multi-hop relay communication system and a construction method of the multi-hop relay communication network. The technical scheme is as follows:
at least one embodiment of the present disclosure provides a multi-hop relay communication system, the system including a plurality of nodes including a management node and a cluster head node and a cluster member node in at least one cluster network;
the management node is configured to send network management information in a time slot corresponding to the management node, where the network management information includes time slot allocation information, where the time slot allocation information is used to indicate a time slot that can be used by a target node, and the target node is any one of the management node, the cluster head node, the cluster member node, and a node to be network-accessed;
The cluster head node is used for receiving network management information sent by a previous-hop node, wherein the previous-hop node is the management node or the previous-hop cluster head node, sending the network management information in a time slot corresponding to the cluster head node according to the received network management information, and sending received authentication information of a node to be network-accessed, and the authentication information is sent by the node to be network-accessed in the time slot corresponding to the node to be network-accessed;
the management node is further configured to determine cluster indication information according to a network topology, where the network topology is determined based on the authentication information received by the management node, where the cluster indication information is used to indicate a correspondence between cluster head nodes and cluster member nodes in each cluster, the cluster head members indicated by the cluster indication information form a backbone network, and any node in the system is a node in the backbone network or is connected with one node in the backbone network.
Optionally, the time slot allocation information includes at least one of allocation information of a management time slot, allocation information of a backbone network time slot and allocation information of a cluster network time slot;
the management time slot is used for sending the network management information, the backbone network time slot is used for transmitting data between cluster head nodes, and the cluster network time slot is used for transmitting data between cluster members in the same cluster network.
Optionally, the management node is configured to determine the cluster network indication information in the following manner:
the management node clusters a plurality of nodes corresponding to the network topology by adopting a weight comparison clustering algorithm according to the network topology, and determines cluster head nodes in each cluster network.
Optionally, the cluster head node in the first cluster network is configured to perform data transmission with any cluster member node in the first cluster network in a cluster network time slot corresponding to the first cluster network, where the first cluster network is any cluster in the at least one cluster network; and/or the number of the groups of groups,
the cluster head nodes in the second cluster network are used for transmitting data between backbone network time slots corresponding to the cluster head nodes in the second cluster network and cluster head nodes in a third cluster network, wherein the second cluster network and the third cluster network are any two clusters in the at least one cluster network.
Optionally, the cluster head node in the first cluster network performs data transmission with any cluster member node in the first cluster network by adopting a multiple access SPMA mode based on statistical priority; and the cluster head node in the first cluster network performs data transmission with the cluster head node in the second cluster network by adopting a time division multiplexing multiple access (TDMA) mode.
At least one embodiment of the present disclosure provides a method for constructing a multihop relay communication network, the method including:
the method comprises the steps that a management node sends network management information in a time slot corresponding to the management node, wherein the network management information comprises time slot allocation information, the time slot allocation information is used for indicating a time slot which can be used by a target node, and the target node is any one of the management node and nodes except the management node;
the node to be accessed to the network receives the network management information and sends authentication information in the corresponding time slot according to the time slot allocation information;
the management node receives the authentication information;
the management node generates a network topology according to the authentication information;
the management node determines cluster network indication information according to the network topology, wherein the cluster network indication information is used for indicating the corresponding relation between cluster head nodes and cluster member nodes in each cluster network, the cluster head members indicated by the cluster network indication information form a backbone network, and any node in the network is a node in the backbone network or is communicated with one node in the backbone network.
Optionally, the method further comprises:
A first cluster head node receives network management information sent by a previous-hop node of the first cluster head node in the backbone network, wherein the previous-hop node is another cluster head node or the management node in the backbone network;
the first cluster head node is configured to send the network management information in a time slot corresponding to the first cluster head node according to the received network management information, and send the received authentication information of the node to be network-accessed, where the authentication information is sent by the node to be network-accessed in the time slot corresponding to the node to be network-accessed according to the network management information.
Optionally, the managing node clusters the nodes corresponding to the network topology according to the network topology, including:
the management node clusters a plurality of nodes corresponding to the network topology by adopting a weight comparison clustering algorithm according to the network topology, and determines cluster head nodes in each cluster network.
Optionally, the method further comprises:
a cluster head node in a first cluster network performs data transmission with any cluster member node in the first cluster network in a cluster network time slot corresponding to the first cluster network, wherein the first cluster network is any cluster in the network; and/or the number of the groups of groups,
And the cluster head nodes in the second cluster network perform data transmission between backbone network time slots corresponding to the cluster head nodes in the second cluster network and cluster head nodes in a third cluster network, wherein the second cluster network and the third cluster network are any two clusters in the network.
Optionally, the cluster head node in the first cluster network performs data transmission with any cluster member node in the first cluster network by adopting a multiple access SPMA mode based on statistical priority; and the cluster head node in the first cluster network performs data transmission with the cluster head node in the second cluster network by adopting a time division multiplexing multiple access (TDMA) mode.
The technical scheme provided by the embodiment of the disclosure has the beneficial effects that:
in an embodiment of the present disclosure, network management information is sent by a management node, where the network management information includes timeslot allocation information, where the timeslot allocation information is used to indicate timeslots that can be used by a target node, where the target node is any one of the management node, the cluster head node, the cluster member node, and a node to be network-accessed. Therefore, each node can orderly send data under the control of the management node, so that the network access of the nodes and the data transmission among the network-accessed nodes are realized, and the rapid network access of the nodes is facilitated.
And the cluster head node is used for receiving the network management information sent by the previous-hop node, wherein the previous-hop node is the management node or the previous-hop cluster head node, sending the network management information in a time slot corresponding to the cluster head node according to the received network management information, and sending the received authentication information of the nodes to be network-connected, so that the nodes to be network-connected, connected by the previous-hop cluster head node, are sequentially network-connected, and the communication network is built hop by taking the management node as a center.
In addition, the management node is further configured to determine cluster indication information according to a network topology, where cluster head members indicated by the cluster indication information form a backbone network, and any node in the system is a node in the backbone network or is connected with one node in the backbone network. Compared with the mode of unordered competition of each cluster node for electing the cluster head node in the related technology, the cluster head node can be rapidly determined, and a backbone network is constructed, so that the multi-hop relay communication network can be rapidly constructed.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings required for the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present disclosure, and other drawings may be obtained according to these drawings without inventive effort for a person of ordinary skill in the art.
Fig. 1 is a schematic diagram of a multihop relay communication system provided by an embodiment of the present disclosure;
fig. 2 is a flowchart of a method for constructing a multihop relay communication network according to an embodiment of the present disclosure;
fig. 3 to fig. 9 are process schematic diagrams of a method for constructing a plurality of relay communication networks according to an embodiment of the present disclosure;
fig. 10 is a block diagram of a communication device according to an embodiment of the present disclosure.
Detailed Description
For the purposes of clarity, technical solutions and advantages of the present disclosure, the following further details the embodiments of the present disclosure with reference to the accompanying drawings.
Unless defined otherwise, technical or scientific terms used herein should be given the ordinary meaning as understood by one of ordinary skill in the art to which this disclosure belongs. The terms "first," "second," "third," and the like in the description and in the claims, do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. Likewise, the terms "a" or "an" and the like do not denote a limitation of quantity, but rather denote the presence of at least one. The word "comprising" or "comprises", and the like, is intended to mean that elements or items that are present in front of "comprising" or "comprising" are included in the word "comprising" or "comprising", and equivalents thereof, without excluding other elements or items. "A and/or B" means to include three cases: A. b, or A and B.
Fig. 1 is a schematic diagram of a multihop relay communication system according to an embodiment of the present disclosure. As shown in fig. 1, the communication system includes a plurality of nodes, each circle in the graph representing a node. Each node is communicatively coupled to at least one other node via a wireless communication technology. The embodiments of the present disclosure do not limit the type of wireless communication technology, and may be selected according to actual needs, for example, wireless communication technology includes, but is not limited to, zigbee, bluetooth, and the like.
The node may be integrated in the electronic device or connected to the electronic device via a communication interface. The electronic device includes, but is not limited to, an unmanned aerial vehicle, an unmanned boat, etc.
In the disclosed embodiments, the nodes include a management node, a cluster head node in at least one cluster network, and a cluster member node. Each cluster network comprises a cluster head node and at least one member node. Wherein, cluster head nodes in all cluster networks form a backbone network. Nodes in the backbone network may completely cover the entire network. I.e. any node in the multi-hop relay communication system, either a cluster head node or a cluster head node in the backbone network.
For example, as shown in fig. 1, a node a is a management node, a node b, a node c, a node d, a node e and a node f are cluster head nodes, and the nodes a-f form a backbone network. Node b and node n belong to one cluster, node c and node o belong to one cluster, node d, node g and node h belong to one cluster, node e, node i and node j belong to one cluster, and node f, node k, node l and node m belong to one cluster.
In the embodiment of the present disclosure, a management node is configured to send network management information in a time slot corresponding to the management node, where the network management information includes time slot allocation information, where the time slot allocation information is used to indicate a time slot that can be used by a target node, and the target node is any one of the management node, the cluster head node, the cluster member node, and a node to be network-accessed. The cluster head node is configured to receive network management information sent by a previous-hop node, where the previous-hop node is the management node or the previous-hop cluster head node, send the network management information in a time slot corresponding to the cluster head node according to the received network management information, and send received authentication information of a node to be network-connected, where the authentication information is sent by the node to be network-connected in the time slot corresponding to the node to be network-connected. The management node is further configured to determine cluster indication information according to a network topology, where the cluster indication information is used to indicate a correspondence between cluster head nodes and cluster member nodes in each cluster, and cluster head members indicated by the cluster indication information form a backbone network. The network topology is determined based on the authentication information received by the management node.
In the embodiment of the disclosure, the wireless channel is divided into periodic frames, and each frame comprises a plurality of time slots with equal duration. The types of these slots include management slots, backbone slots, and cluster slots. Wherein the management time slot is used for security authentication, network management control, network topology sensing and the like. Backbone time slots are used for communication between backbone members. The cluster network time slot is used for communication among cluster members, wherein the cluster members comprise cluster head nodes and cluster member nodes.
Optionally, the types of the time slots may further include a topology maintenance time slot, where the topology maintenance time slot is used for a change of a network topology caused by a node movement or a channel change after the network construction is completed, and the management node needs to readjust the cluster head node. For example, if the management node does not receive data sent by a cluster head node in a set duration (for example, a plurality of time slots in succession), it is determined that the cluster head node is faulty, the cluster head node is recalculated according to the network topology, and new cluster network indication information is sent.
In the disclosed embodiments, the duty cycle of the various time slots in each frame may be dynamically updated by the management node according to the network size. In some examples, the management node may determine the duty cycle of the four time slots based on the number of clusters, the number of cluster member nodes in each cluster network, the node number, the traffic type, the channel quality, and connectivity information. For example, the larger the number of clusters and/or the larger the number of cluster member nodes in the cluster network, the larger the cluster network time slot occupancy. For another example, if the number of clusters is small and the number of cluster member nodes in the cluster network is small, which means that the cluster is still in the networking stage, the occupation of the management time slot is relatively large. For another example, a node corresponding to a channel with good channel quality may be allocated fewer time slots (including a cluster network time slot or a backbone network time slot), and a channel with poor channel quality may be allocated more time slots for data retransmission. For another example, if the connectivity information indicates that the number of hops of the network topology is large, the traffic data between the network management information and the nodes that need to be forwarded is large, so the management time slots and backbone time slots need to be allocated more, and if the connectivity information indicates that the number of hops of the network topology is small, the traffic data between the network management information and the nodes that need to be forwarded is small, so the management time slots and backbone time slots need to be allocated less.
Illustratively, the time slot allocation information includes at least one of allocation information of a management time slot, allocation information of a backbone network time slot, and allocation information of a cluster network time slot. The management time slot is used for sending the network management information, the backbone network time slot is used for transmitting data between cluster head nodes, and the cluster network time slot is used for transmitting data between cluster members in the same cluster network.
Optionally, the management node is configured to determine the cluster network indication information in the following manner: the management node clusters a plurality of nodes corresponding to the network topology by adopting a weight comparison clustering algorithm according to the network topology to obtain nodes in each cluster network, and determines cluster head nodes in each cluster network to obtain the cluster network indication information.
Optionally, the cluster head node in the first cluster network is configured to perform data transmission with any cluster member node in the first cluster network in a cluster network time slot corresponding to the first cluster network, where the first cluster network is any cluster in the at least one cluster network.
Illustratively, the cluster head node in the first cluster network performs data transmission with any cluster member node in the first cluster network by adopting a multiple access SPMA mode based on statistical priority.
Optionally, the cluster head node in the second cluster network is used for transmitting data between the backbone network time slot corresponding to the cluster head node in the second cluster network and the cluster head node in the third cluster network, where the second cluster network and the third cluster network are any two clusters in the at least one cluster network.
Illustratively, the cluster head node in the first cluster network performs data transmission with the cluster head node in the second cluster network by adopting a time division multiplexing multiple access TDMA mode.
In an embodiment of the present disclosure, network management information is sent by a management node, where the network management information includes timeslot allocation information, where the timeslot allocation information is used to indicate timeslots that can be used by a target node, where the target node is any one of the management node, the cluster head node, the cluster member node, and a node to be network-accessed. Therefore, each node can orderly send data under the control of the management node, so that the network access of the nodes and the data transmission among the network-accessed nodes are realized, and the rapid network access of the nodes is facilitated.
And the cluster head node is used for receiving the network management information sent by the previous-hop node, wherein the previous-hop node is the management node or the previous-hop cluster head node, sending the network management information in a time slot corresponding to the cluster head node according to the received network management information, and sending the received authentication information of the nodes to be network-connected, so that the nodes to be network-connected, connected by the previous-hop cluster head node, are sequentially network-connected, and the communication network is built hop by taking the management node as a center.
In addition, the management node is further configured to determine cluster indication information according to a network topology, where cluster head members indicated by the cluster indication information form a backbone network, and any node in the system is a node in the backbone network or is connected with one node in the backbone network. Compared with the mode of unordered competition of each cluster node for electing the cluster head node in the related technology, the cluster head node can be rapidly determined, and a backbone network is constructed, so that the multi-hop relay communication network can be rapidly constructed.
Fig. 2 is a flow chart of a method for constructing a multihop relay communication network according to an embodiment of the present disclosure. Referring to fig. 2, the method includes:
201: each node receives configuration information.
The configuration information is used for carrying out initialization configuration on the node. Illustratively, the configuration information of the node includes at least one of the following parameters: node number, network access frequency, security key related information, identity information, etc. Here, the identity information refers to the identity of a node in the communication network, for example, whether it is a management node and whether it is a cluster head node.
In the embodiments of the present disclosure, the node for which the identity information representation is a management node will be hereinafter referred to as management node. The management node can be a cluster head node or a cluster head node.
The configuration information may be received through an input device of the node after the node is powered on. In some examples, the input device may be integrated in the node, for example, a touch screen in the node. In other examples the input device is external and connected to the node by wire or wirelessly, e.g. a mouse and/or keyboard or the like connected to the node by wire, or a mobile terminal or the like connected to the node by wirelessly.
202: each node obtains the position information of the node through the positioning system and performs time synchronization with the positioning system. Alternatively, each node may obtain its own location information by a positioning system such as BDS (BeiDou Navigation Satellite System, beidou satellite navigation system) or GPS (Global Positioning System ), and perform time synchronization with the positioning system. In the embodiment of the disclosure, each node adopts a high-precision clock, so that the synchronization can be maintained for a longer time after one time of synchronization.
203: the management node transmits network management information in a management slot.
The management node transmits the network management information at the aforementioned network access frequency so that other nodes (including the node to be accessed and the node that has accessed the network) can receive the network management information.
The network management information includes at least one of slot allocation information, cluster indication information, connectivity information, and routing information.
The time slot allocation information includes attribute information of each time slot in the current frame, the attribute information includes an allocation object of the time slot and a usage mode, and the allocation object refers to which node the time slot can be used, and the usage mode is used for indicating a mode of using the time slot by the allocation object, such as a receiving or transmitting, a data transmitting rate, and the like. Optionally, the allocation object of a time slot may be represented by a node number of one or several nodes, where only a node corresponding to the node number may send data using the time slot; alternatively, the allocation object of a time slot may be empty, and the non-network-connected node may transmit data using the time slot. For example, in table 1 below, node 1 may transmit data using slot 1 and node 3 may transmit data using slot 2. Slot M may be used by non-network-entry nodes.
Table 1 is a slot allocation table
Time slot numbering Distributing objects Time slot type Mode of use
Time slot
1 Node 1 Managing time slots Transmitting
Time slot 2 Node 3 Managing time slots Transmitting
…… …… ……
Time slot M Empty space Managing time slots Transmitting
…… …… …… ……
Time slot N Node M Backbone network time slot Transmitting
…… …… …… ……
Time slot K Node N Cluster network time slot Transmitting
In the embodiments of the present disclosure, a management node may allocate one or more time slots to one node, and one time slot may also be allocated to one or more nodes.
The cluster indication information is used for indicating cluster head nodes and corresponding cluster member nodes. The cluster head node indication information may include a node number and an indicator of a node belonging to one cluster. For example, when the indicator is 1, the node representing the corresponding node number is the cluster head node, and when the indicator is 0, the node representing the corresponding node number is the member node. The node which receives the network control information can determine whether the node is a cluster head node or not according to the node number of the node, and determine the cluster head node of the cluster where the node is located under the condition that the node is not the cluster head node.
Connectivity information is used to indicate two nodes that have a connectivity relationship. For example, it may be expressed in the form of an array { a, b }, where a and b are node numbers of two nodes, respectively, that there is a communication relationship between the two nodes.
The routing information is used to indicate a data transmission path between the source node to the destination node. The source node and the destination node may be any two nodes among the nodes that have entered the network.
In the network management information first sent by the management node, the cluster indication information, the connectivity information and the routing information are null.
In this step 203, the management node transmits network management information in a broadcast manner. The network management information is received by a one-hop node of the management node (i.e., a node within the coverage area of the management node).
204: and the non-network-connected nodes in the one-hop nodes of the management node send authentication information according to the network management information.
The authentication information is used to request access to the network. Illustratively, the authentication information includes at least one of a node number, location information of the node, a coverage of the node, and an identification of a cluster head node of the node.
Wherein the node number is used to uniquely identify a node, i.e., the node numbers of different nodes are different. In other examples, node numbers may be assigned according to the importance of the node. For example, important nodes select node numbers in a first set of node numbers to assign, while non-important nodes select node numbers in a second set of node numbers to assign. The node numbers in the first set of node numbers are less than the node numbers in the second set of node numbers. In other examples, the node number may be an IP (Internet Protocol ) address or MAC (Media Access Control, media access control) address of the node, or the like. The embodiment of the present disclosure does not limit the type of node number as long as each node can be distinguished.
The location information of the node may be a location coordinate where the node is located. The coverage of the node is the range which can be reached by the transmitting signal of the node, and the radiation radius of the omni-directional antenna of the node can be used for representing. When the node does not have a cluster head node yet, the identifier of the corresponding cluster head node is null.
In this step, the non-network-connected node may randomly select one slot from the slots of the non-designated node number to broadcast authentication information. In the networking process, because a large number of nodes are not connected with the network, more idle time slots are allocated, so that the nodes which are not connected with the network randomly select the time slots, and the conflict can be reduced.
The authentication information also includes information of neighbor nodes. Before the non-network-access node sends the authentication information, the non-network-access node can receive the authentication information broadcast by other nodes, and the non-network-access node takes the node corresponding to the received authentication information as a neighboring node. And carrying the identification of the neighbor node in the authentication information for transmission. In this way, the management node can obtain the communication relation among the nodes after the nodes access the network, namely, the connectivity information.
After the connectivity information and the cluster indication information are obtained, the whole network routing information can be calculated according to the connectivity information and the cluster indication information.
If the one-hop node of the management node comprises an accessed network node, the method further comprises: and the network-accessed node in the one-hop node of the management node adopts the allocated cluster network time slot to send data to the destination node.
In some examples, when the network node and the destination node communicate, the cluster head node of the network node does not need to forward the data; when the network node is not communicated with the destination node, the cluster head node of the network node receives the data and forwards the data to the destination node.
In other examples, data is sent to a cluster head node of the network node, and forwarded by the cluster head node to the destination node, whether or not there is communication between the network node and the destination node. When the network node and the destination node belong to the same cluster, the cluster head node of the network node directly forwards the data to the destination node. When the network node and the destination node belong to different clusters, the cluster head node directly forwards the data to the cluster head node corresponding to the destination node, and then the cluster head node corresponding to the destination node forwards the data to the destination node.
In the embodiment of the disclosure, the cluster head nodes mutually exchange information in a TDMA (Time Division Multiple Access, time division multiplexing multiple access) mode at the time slots corresponding to the backbone network time slot table, and the members in each cluster mutually exchange information in an SPMA (Statistical Priority-based Multiple Access, multiple access based on statistical priority) mode at the time slots corresponding to the cluster network time slot table.
205: and the management node determines a one-hop cluster head node in the one-hop nodes according to the information of the one-hop nodes.
In some examples, the information of the one-hop node includes one or more of a node number, location information of the node, signal quality of the node, number of connected nodes of the node.
The management node can cluster the one-hop nodes by adopting a weight comparison clustering algorithm according to the information of the one-hop nodes, and calculates cluster head nodes in the one-hop nodes. Here, clustering the nodes and computing cluster head nodes is implemented based on a connected dominant set algorithm. That is, it is guaranteed that the cluster head node belongs to the connectivity distribution set, and that the cluster member node is adjacent to one node in the connectivity dominance set.
In the weight comparison clustering algorithm, if the information of a node of one hop includes X kinds of information, X is an integer and X > 1, the X kinds of information respectively correspond to one weight coefficient, and the sum of the weight coefficients corresponding to the X kinds of information is equal to 1; taking the sum of products of the parameter values corresponding to each type of information of the node and the corresponding weight coefficients as the weight value of the node; and determining Y nodes with the largest weights in the Y clusters as a cluster head node of one hop, wherein Y is a positive integer.
The parameter value corresponding to each type of information may be the information value, or the inverse of the information value. When the parameter value corresponding to the information is the information value, the weight of the node is in direct proportion to the information value, and when the parameter value corresponding to the information is the inverse of the information value, the weight of the node is in inverse proportion to the information value.
For example, assuming that the information of a node of one hop includes two kinds of node numbers and the number of connected nodes, the corresponding weight coefficient is 0.5, the weight of the node is inversely proportional to the node numbers, and is directly proportional to the number of connected nodes of the node, the smaller the node numbers, the more the number of connected nodes are the cluster head nodes.
For another example, it is assumed that the information of one node includes the number of connected nodes and the position information of the node, the corresponding weight coefficients are all 0.5, the weight value of the node is proportional to the number of connected nodes of the node, and is inversely proportional to the distance between the node and the management node (which can be calculated according to the position information of the node and the position information of the management node), and the node with more connected nodes is the cluster head node with smaller distance.
206: the management node allocates a first management time slot for a cluster head node in the one-hop nodes, and allocates a cluster network time slot for each one-hop node.
In some examples, the management node allocates different first management time slots for two cluster head nodes with overlapping coverage areas and allocates the same first management time slot for two cluster head nodes with non-overlapping coverage areas when allocating the first management time slots for the cluster head nodes. Thus, two cluster head nodes with non-overlapping coverage areas can forward network management information in the same first management time slot, so that the efficiency of forwarding the network management information can be improved.
Here, whether or not coverage areas overlap may be determined according to location information and coverage of any two cluster head nodes.
In other examples, the management node allocates different first management time slots to all cluster head nodes. To simplify the allocation algorithm.
207: the management node again transmits network management information including updated slot allocation information and updated cluster indication information.
The management node broadcasts the network management information again on the network access frequency, and a one-hop node of the management node receives the updated network management information. The updated network management information includes a management time slot allocated to the first cluster head node and a cluster network time slot allocated to a cluster in which the first cluster head node is located. The first cluster head node is any cluster head node in one-hop nodes of the management node.
The first node determines whether the network access is successful or not according to the cluster network indication information in the network management information. And if the cluster network indication information contains the identification of the first node, indicating that the first node is successful in network access. If the cluster network indication information does not contain the identification of the first node, the first node is not successfully accessed to the network. The first node is any node in one-hop nodes of the management node.
The updated cluster indication information is used for indicating a cluster head node and a corresponding cluster member node in the one-hop node.
208: the first cluster head node transmits network management information in the allocated first management time slot.
In step 208, the first cluster head node transmits the network management information in a broadcast manner.
Accordingly, the one-hop node of the first cluster head node receives the network management information.
And in the first-hop nodes of the first cluster head nodes, nodes belonging to the second-hop nodes of the management node send authentication information to the first cluster head nodes, wherein the authentication information is used for requesting to access the network.
One node can receive network management information forwarded by a plurality of cluster head nodes, and can select one of the cluster head nodes to send authentication information. The authentication information carries the node number of the selected cluster head node. The cluster head node can compare the node number of the cluster head node with the node number in the authentication information, if the node number is the same as the node number in the authentication information, the authentication information is forwarded, and if the node number is different from the node number in the authentication information, the node number is not forwarded to the authentication information. In this way, repeated transmission of the same information can be avoided, and network overhead is reduced. And the situation that the same node belongs to two cluster networks at the same time during cluster head calculation can be avoided.
209: and after the first cluster head node receives the authentication information of the first node, the authentication information of the first node is sent to the management node in the management time slot of the first cluster head node.
The first node is any node to be network-accessed in one-hop nodes of the first cluster head node.
210: the management node determines the network topology according to the received authentication information.
211: and the management node determines new cluster network indication information according to the network topology.
The cluster indication information is used for indicating the corresponding relation between cluster head nodes and cluster member nodes in each cluster network, the cluster head members indicated by the cluster indication information form a backbone network, and any node in the system is a node in the backbone network or is communicated with one node in the backbone network.
In some examples, cluster head nodes dynamically generated using a weight comparison clustering algorithm may act as network backbone nodes, which form a backbone network. The specific determination mode refers to the foregoing step 206, and a detailed description is omitted here.
In the embodiment of the disclosure, after receiving the network management information, the cluster head node calculates a routing path of a node in the cluster network according to connectivity information and routing information in the network management information, and sends the routing path to the cluster member node.
By repeating the foregoing steps 206 to 211, the network range can be gradually enlarged, and the network topology and the time slot allocation information can be periodically updated.
That is, for the I (I is a positive integer) hop node of the management node, the management node allocates a management time slot for the I hop node and a cluster head node in the network node that has entered before the I hop node, and allocates a cluster network time slot for each cluster. Then, the management node transmits network management information again, which includes updated slot allocation information and updated cluster indication information. And the cluster head node before the I-hop node of the management node sequentially forwards the network management information, and the cluster head node in the I-hop node receives the network management information sent by the previous-hop cluster head node and forwards the received network management time slot. Correspondingly, a first-hop node of the cluster head nodes in the I-hop nodes receives the network management information, wherein the non-network-access node sends authentication information to the cluster head nodes in the I-hop nodes in the corresponding management time slots so as to send the authentication information to the management nodes through the cluster head nodes in the I-hop nodes. The management node determines the network topology according to the received authentication information and determines new cluster indicating information according to the network topology.
The method further comprises the steps of: when the management node finds that the backbone link has an interruption, the network topology is updated, and a cluster head node is reselected according to the updated network topology, and then steps 206 to 211 are performed again. The selection mode is referred to in the foregoing step 205, and will not be described herein.
Optionally, in order to improve network performance, the cluster head nodes may negotiate the frequency used by the cluster by using the isolation of each cluster in space, so that each cluster may communicate concurrently. I.e. two clusters that are spatially non-overlapping, the same frequency can be used, whereas two clusters that are spatially overlapping, require the use of different frequencies.
Alternatively, in some examples, the cluster head node, like a gateway, may identify the destination address of the data packet sent by each node, then calculate a path to the destination node according to the backbone network topology, and transmit the data packet to the destination node through the path. In order to make the route not affected by encryption, the source node needs to add a destination address that can be identified outside the encrypted data packet. The destination address may be, for example, an identification of the destination node, such as a node number or an IP address.
The following describes an example of a method for constructing a multihop relay communication network according to an embodiment of the present disclosure with reference to fig. 3 to 9.
As shown in fig. 3, the configuration is initialized for each node.
One of the plurality of nodes is configured as a management node C0. The management node broadcasts first network management information. The first network management information includes slot allocation information and cluster indication information. Since only one management node is in the network, the number of nodes is small, and the time slot allocation information only comprises the time slots which can be used by the management node and the time slots which can be used by the nodes to be accessed to the network. For example, in order to ensure that the node to be logged in can access quickly, more time slots that can be used by the node to be logged in can be allocated, for example, 80% of time slots that can be used by the node to be logged in are allocated. Similarly, since no other node exists in the network, the cluster indication information is null.
As shown in fig. 4, one-hop nodes of the management node access the network, and determine cluster head nodes.
The first network management information is received by a one-hop node of the management node. And randomly selecting one time slot from the time slots which can be used by the node to be accessed to the network and indicated by the first network management information to send authentication information. The authentication information includes information of a geographical location, a coverage area, and neighbor nodes of the node to be network-accessed. The management node determines the network topology according to the authentication information sent by each node, and calculates the cluster head node in the one-hop node, such as the first cluster head node C1 in fig. 4, according to the information of the one-hop node.
As shown in fig. 5, two-hop nodes of the management node are networked.
The management node transmits second network management information. The second network management information includes slot allocation information and cluster indication information. The time slot allocation information in the second network management information includes a time slot that can be used by the management node, a time slot that can be used by the one-hop node, and a time slot that can be used by the node to be network-accessed. The time slots which can be used by the cluster head node in the one-hop node comprise management time slots, cluster network time slots and backbone network time slots. The time slots that can be used by non-cluster head nodes in a hop node include cluster network time slots. The cluster indication information is used for indicating a cluster head node and a corresponding cluster member node in the one-hop node. In fig. 5, one-hop nodes are divided into 3 clusters, each having one cluster head node and one cluster member node. Only 3 cluster head nodes and three cluster member nodes are shown in fig. 5, and their correspondence is not shown.
Illustratively, in order to ensure that the node to be network-accessed can quickly access, more timeslots that can be used by the node to be network-accessed can still be allocated, for example, 70% of timeslots that can be used by the node to be network-accessed are allocated. The cluster indicating information in the second network management information includes 3 cluster head nodes and an identifier of a cluster member node corresponding to each cluster head node.
The first cluster head node forwards the second network management information in the corresponding management time slot. The neighbor node of the first cluster head node receives the second network management information. If the neighbor node of the first cluster head node is the network-accessed node, no information is sent in the management time slot. And if the neighbor node of the first cluster head node is the node to be accessed to the network, sending authentication information in the management time slot corresponding to the node to be accessed to the network. After the first cluster head node receives the authentication information, the authentication information is sent to the management node in a management time slot of the first cluster head node, so that the two-hop node network access of the management node is completed.
As shown in fig. 6, after the two-hop node enters the network, the management node determines the cluster head node.
The management node updates the network topology according to the received authentication information, and calculates a cluster head node, such as a second cluster head node C2 in fig. 6, according to the updated network topology. As shown in fig. 6, the second cluster head node C2 has 3.
As shown in fig. 7, three-hop nodes of the management node are networked.
The management node transmits third network management information. The third network management information includes slot allocation information and cluster indication information. The time slot allocation information in the third network management information includes a time slot that can be used by the management node, a time slot that can be used by the network node that has been already entered, and a time slot that can be used by the network node to be entered. Wherein, the time slots which can be used by the cluster head node in the network node include a management time slot, a cluster network time slot and a backbone network time slot. The time slots that can be used by non-cluster head nodes in the network node include cluster network time slots. The cluster indication information is used for indicating cluster head nodes and corresponding cluster member nodes in the network-accessed nodes. In fig. 7, the network has been entered into is divided into 6 clusters.
Illustratively, in order to ensure that the node to be network-accessed can quickly access, more timeslots that can be used by the node to be network-accessed can still be allocated, for example, 50% of timeslots that can be used by the node to be network-accessed are allocated. Because the number of network nodes in the network is increased, the duty ratio of the cluster network time slot and the backbone network time slot needs to be increased so as to meet the data transmission requirement of the network nodes. The cluster indicating information in the second network management information comprises 6 cluster head nodes and the identification of the cluster member node corresponding to each cluster head node.
The first cluster head node forwards the third network management information in the corresponding management time slot. If the node which is still not connected to the network in the neighbor nodes of the first cluster head node is still connected to the network, the authentication information can be sent again in the management time slot corresponding to the node to be connected to the network.
And after receiving the third network management time slot forwarded by the first cluster head node, the second cluster head node forwards the third network management time slot in the corresponding management time slot. And the neighbor node of the second cluster head node receives the third network management information. If the neighbor node of the second cluster head node is the network-accessed node, no information is sent in the management time slot. And if the neighbor node of the second cluster head node is the node to be accessed to the network, sending authentication information in the management time slot corresponding to the node to be accessed to the network. After the second cluster head node receives the authentication information, the second cluster head node sends the authentication information to the first cluster head node in a management time slot of the second cluster head node, and the first cluster head node forwards the authentication information to the management node, so that the three-hop node network access of the management node is completed.
As shown in fig. 8, after the three-hop node enters the network, the management node determines the cluster head node.
The management node updates the network topology according to the received authentication information, and calculates a cluster head node, such as a third cluster head node C3 in fig. 8, according to the updated network topology. As shown in fig. 8, the third cluster head node C3 has 3.
As shown in fig. 9, three-hop nodes of the management node are networked.
The related process is described with reference to fig. 7, and a detailed description thereof is omitted.
Therefore, the embodiment of the disclosure uses the management node as a center, and adopts ordered hop-by-hop diffusion to construct the multi-hop relay communication network, so that the network construction time can be shortened, and the network maintenance is easy.
In order to verify the implementation effect of the multi-hop relay communication network construction method with the management node as the center, the embodiment of the disclosure simulates the construction time of a 6-hop lattice topology network comprising 32 nodes by using network simulation software (OPNET), simulation parameters are shown in table 2, and simulation results are shown in table 3.
Table 2 32 node 6-jumped lattice topology simulation parameters
Figure BDA0003979479640000161
Figure BDA0003979479640000171
Table 3 32 node 6-jumped lattice topology simulation results
Index (I) Numerical value
Average networking time 12.1297s
Maximum networking time 15.8209s
Routing overhead 263279Bytes
Routing overhead per unit time 2632.79Bytes/s
Average forwarding number of routing packets 2269.7
Routing packet average size 115.99Bytes
As can be seen from table 2, when the method provided by the embodiment of the present disclosure is used to construct a multi-hop relay communication network, the networking time is shorter, which illustrates that the method provided by the embodiment of the present disclosure can quickly construct the multi-hop relay communication network. The routing cost is small, the proportion of the cost for network maintenance and the like is small, and the multi-hop relay communication network is easy to maintain.
Fig. 10 is a block diagram of a communication device according to an embodiment of the present disclosure. Typically, the communication device may be any of the aforementioned nodes. As shown in fig. 10, the communication apparatus 400 includes: a processor 401 and a memory 402.
Processor 401 may include one or more processing cores such as a 4-core processor, an 8-core processor, etc. The processor 401 may be implemented in at least one hardware form of DSP (Digital Signal Processing ), FPGA (Field-Programmable Gate Array, field programmable gate array), PLA (Programmable Logic Array ). The processor 401 may also include a main processor, which is a processor for processing data in an awake state, also called a CPU (Central Processing Unit ), and a coprocessor; a coprocessor is a low-power processor for processing data in a standby state.
Memory 402 may include one or more computer-readable storage media, which may be non-transitory. Memory 402 may also include high-speed random access memory, as well as non-volatile memory, such as one or more magnetic disk storage devices, flash memory storage devices. In some embodiments, a non-transitory computer readable storage medium in memory 402 is used to store at least one instruction for execution by processor 401 to implement the steps provided by any node in the method embodiments herein.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program for instructing relevant hardware, where the program may be stored in a computer readable storage medium, and the storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The foregoing description of the preferred embodiments of the present disclosure is provided for the purpose of illustration only, and is not intended to limit the disclosure to the particular embodiments disclosed, but on the contrary, the intention is to cover all modifications, equivalents, alternatives, and alternatives falling within the spirit and principles of the disclosure.

Claims (10)

1. A multi-hop relay communication system, the system comprising a plurality of nodes including a management node and a cluster head node and a cluster member node in at least one cluster network;
the management node is configured to send network management information in a time slot corresponding to the management node, where the network management information includes time slot allocation information, where the time slot allocation information is used to indicate a time slot that can be used by a target node, and the target node is any one of the management node, the cluster head node, the cluster member node, and a node to be network-accessed;
the cluster head node is used for receiving network management information sent by a previous-hop node, wherein the previous-hop node is the management node or the previous-hop cluster head node, sending the network management information in a time slot corresponding to the cluster head node according to the received network management information, and sending received authentication information of a node to be network-accessed, and the authentication information is sent by the node to be network-accessed in the time slot corresponding to the node to be network-accessed;
the management node is further configured to determine cluster indication information according to a network topology, where the network topology is determined based on the authentication information received by the management node, where the cluster indication information is used to indicate a correspondence between cluster head nodes and cluster member nodes in each cluster, the cluster head members indicated by the cluster indication information form a backbone network, and any node in the system is a node in the backbone network or is connected with one node in the backbone network.
2. The system of claim 1, wherein the time slot allocation information comprises at least one of allocation information of a management time slot, allocation information of a backbone time slot, and allocation information of a cluster time slot;
the management time slot is used for sending the network management information, the backbone network time slot is used for transmitting data between cluster head nodes, and the cluster network time slot is used for transmitting data between cluster members in the same cluster network.
3. The system of claim 2, wherein the management node is configured to determine the cluster indication information by:
the management node clusters a plurality of nodes corresponding to the network topology by adopting a weight comparison clustering algorithm according to the network topology, and determines cluster head nodes in each cluster network so as to obtain the cluster network indication information.
4. A system according to claim 2 or 3, wherein a cluster head node in a first cluster network is configured to perform data transmission with any cluster member node in the first cluster network in a cluster network time slot corresponding to the first cluster network, where the first cluster network is any cluster in the at least one cluster network; and/or the number of the groups of groups,
the cluster head nodes in the second cluster network are used for transmitting data between backbone network time slots corresponding to the cluster head nodes in the second cluster network and cluster head nodes in a third cluster network, wherein the second cluster network and the third cluster network are any two clusters in the at least one cluster network.
5. The system of claim 4, wherein a cluster head node in the first cluster network performs data transmission with any cluster member node in the first cluster network by adopting a multiple access SPMA mode based on statistical priority; and the cluster head node in the first cluster network performs data transmission with the cluster head node in the second cluster network by adopting a time division multiplexing multiple access (TDMA) mode.
6. A method for constructing a multihop relay communication network, the method comprising:
the method comprises the steps that a management node sends network management information in a time slot corresponding to the management node, wherein the network management information comprises time slot allocation information, the time slot allocation information is used for indicating a time slot which can be used by a target node, and the target node is any one of the management node and nodes except the management node;
the node to be accessed to the network receives the network management information and sends authentication information in a time slot corresponding to the node to be accessed to the network according to the time slot allocation information;
the management node receives the authentication information;
the management node generates a network topology according to the authentication information;
the management node determines cluster network indication information according to the network topology, wherein the cluster network indication information is used for indicating the corresponding relation between cluster head nodes and cluster member nodes in each cluster network, the cluster head members indicated by the cluster network indication information form a backbone network, and any node in the network is a node in the backbone network or is communicated with one node in the backbone network.
7. The method of claim 6, wherein the method further comprises:
a first cluster head node receives network management information sent by a previous-hop node of the first cluster head node in the backbone network, wherein the previous-hop node is another cluster head node or the management node in the backbone network;
the first cluster head node is configured to send the network management information in a time slot corresponding to the first cluster head node according to the received network management information, and send the received authentication information of the node to be network-accessed, where the authentication information is sent by the node to be network-accessed in the time slot corresponding to the node to be network-accessed according to the network management information.
8. The method of claim 6, wherein the managing node clusters nodes corresponding to the network topology according to the network topology, comprising:
the management node clusters a plurality of nodes corresponding to the network topology by adopting a weight comparison clustering algorithm according to the network topology, and determines cluster head nodes in each cluster network.
9. The method according to claim 7 or 8, characterized in that the method further comprises:
A cluster head node in a first cluster network performs data transmission with any cluster member node in the first cluster network in a cluster network time slot corresponding to the first cluster network, wherein the first cluster network is any cluster in the network; and/or the number of the groups of groups,
and the cluster head nodes in the second cluster network perform data transmission between backbone network time slots corresponding to the cluster head nodes in the second cluster network and cluster head nodes in a third cluster network, wherein the second cluster network and the third cluster network are any two clusters in the network.
10. The method of claim 9, wherein a cluster head node in the first cluster network performs data transmission with any cluster member node in the first cluster network by adopting a multiple access SPMA mode based on statistical priority; and the cluster head node in the first cluster network performs data transmission with the cluster head node in the second cluster network by adopting a time division multiplexing multiple access (TDMA) mode.
CN202211545036.9A 2022-12-04 2022-12-04 Multi-hop relay communication system and construction method of multi-hop relay communication network Pending CN116347558A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211545036.9A CN116347558A (en) 2022-12-04 2022-12-04 Multi-hop relay communication system and construction method of multi-hop relay communication network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211545036.9A CN116347558A (en) 2022-12-04 2022-12-04 Multi-hop relay communication system and construction method of multi-hop relay communication network

Publications (1)

Publication Number Publication Date
CN116347558A true CN116347558A (en) 2023-06-27

Family

ID=86893566

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211545036.9A Pending CN116347558A (en) 2022-12-04 2022-12-04 Multi-hop relay communication system and construction method of multi-hop relay communication network

Country Status (1)

Country Link
CN (1) CN116347558A (en)

Similar Documents

Publication Publication Date Title
US11343817B2 (en) Multi-tier density-aware location-based channel assignment and adaptive power control method for mobile ad-hoc networks
Ergen et al. TDMA scheduling algorithms for wireless sensor networks
US7046639B2 (en) System and method for ad hoc network access employing the distributed election of a shared transmission schedule
US8307070B2 (en) Resource allocation method in wireless network
US7580382B1 (en) System and method for distributed channelized group formation in a mobile wireless communication network
US20090252102A1 (en) Methods and systems for a mobile, broadband, routable internet
Wu et al. Joint multi-radio multi-channel assignment, scheduling, and routing in wireless mesh networks
Zhang et al. Joint routing and channel assignment algorithms in cognitive wireless mesh networks
Lin et al. A dynamic slot assignment algorithm of TDMA for the distribution class protocol using node neighborhood information
Wu et al. Large-scale access scheduling in wireless mesh networks using social centrality
US8493943B1 (en) Geographical communications networking system and method
CN116347558A (en) Multi-hop relay communication system and construction method of multi-hop relay communication network
CN111491320B (en) Network resource processing method and device and electronic equipment
Tsao et al. An end‐to‐end channel allocation scheme for a wireless mesh network
Jembre et al. Beacon-based channel assignment and jammer mitigation for MANETs with multiple interfaces and multiple channels
AU2011347396B2 (en) A method for managing potentially disruptive nodes in a mobile ad-hoc network
CN113766601B (en) Self-organizing network cooperative transmission path construction method based on cooperative relay transmission
Mettali Gammar et al. JRCAP: a joint routing and channel assignment protocol for multi-radio multi-channel IEEE 802.11 s mesh networks
US20160373203A1 (en) Method for distributed interference coordination and small cell using the same
ITTO20090377A1 (en) METHOD OF FORMING A WIRELESS WIDE MULTICANAL BAND NETWORK WITH A TREE HIERARCHICAL STRUCTURE
Tinirello et al. Utility-based resource allocations in multi-hop wireless networks
Saurav et al. A Cluster Based Multi-Radio Multi-Channel Assignment Approach in Wireless Mesh Networks
Masilamani et al. Scheduled channel access using geographical classification
Garcia-Luna-Aceves et al. Using radio connectivity to define transmission schedules in multihop wireless networks
Wu et al. A distributed dynamic channel assignment and routing framework for cognitive sensor systems

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