CN111405489A - Multicast tree construction method applied to wireless network - Google Patents
Multicast tree construction method applied to wireless network Download PDFInfo
- Publication number
- CN111405489A CN111405489A CN202010146145.8A CN202010146145A CN111405489A CN 111405489 A CN111405489 A CN 111405489A CN 202010146145 A CN202010146145 A CN 202010146145A CN 111405489 A CN111405489 A CN 111405489A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- cluster
- link
- degree
- 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
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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a multicast tree construction method applied to a wireless network, and provides a cluster head selection method and a node reconnection strategy aiming at application scenes of node movement and unstable transmission links in the wireless mesh network so as to effectively improve the stability of a multicast tree in the network. Wherein the cluster head is selected according to the mobility attribute, the out-degree, the transmission delay and the like of the node. The node reconnection strategy can restore the function of the multicast system when the function of the multicast system is damaged due to network movement. The invention is simple and effective, the algorithm complexity is low, and the interaction overhead between nodes is small.
Description
Technical Field
The invention relates to the technical field of wireless network transmission, in particular to a multicast tree construction method applied to a wireless network.
Background
Multicast is also called multicast, is a one-to-many and many-to-many network transmission service, and is an extension of a one-to-one unicast model on the internet. The data in the multicast is sent to the members in the multicast by a transmission mode of replication forwarding, and the transmission mode of replication forwarding data packets can effectively reduce the waste of network transmission resources and simultaneously reduce the burden of a network and a server, so the multicast forms the basis of a plurality of applications.
In a network environment where nodes are mobile, the stability of the multicast service system is difficult to be guaranteed. The influence caused by the movement of the nodes is rarely specially considered in the existing multicast algorithm. Therefore, it is urgent to provide a multicast tree construction method applied to a wireless network in order to address application scenarios of node mobility and transmission link instability of a wireless mesh network.
Disclosure of Invention
The present invention is directed to solve the above-mentioned defects in the prior art, and provides a multicast tree construction method applied to a wireless network, so as to improve the stability of a multicast system in a communication network, especially in a scenario where a node in a wireless mesh network moves and a transmission link is unstable.
The purpose of the invention can be achieved by adopting the following technical scheme:
a multicast tree construction method applied to a wireless network aims at the following application scenes: the nodes or part of nodes in the wireless network have mobility, each node is divided into a certain cluster according to the area or the set relationship, each cluster has a cluster head, the multicast tree is constructed among the cluster heads, and the multicast tree construction method comprises the following steps:
s1, calculating the instability of the nodes, and selecting a cluster head and a standby cluster head for each cluster;
s2, establishing connection by sending handshake information by the cluster nodes, and constructing a cluster transmission path;
s3, selecting cluster heads to construct a multicast tree according to one or more parameters of hop count, time delay, bandwidth, security and error rate of a transmission path among the cluster heads in a weighted or item-by-item parameter matching mode according to requirements;
s4, according to the connectivity of the topology, adopting a node reconnection strategy to improve the stability of the multicast tree;
s5, in the running process of the wireless network, exchanging the state information between the network and the node, and dynamically adjusting and maintaining the connection relation.
Further, the step S1 is as follows:
and calculating the instability of the node according to the movement attribute, the out-degree and the transmission delay of the node, and then selecting the cluster head and the standby cluster head based on the instability of the node. In the existing multicast algorithm, some methods for selecting a cluster head and a standby cluster head only consider the distance between nodes in a cluster, and some methods only consider the out-degree and the transmission delay of the nodes, or only consider the mobility of the nodes, but do not comprehensively consider the influence of the mobility, the out-degree and the transmission delay of the nodes on the multicast service. In a network scenario in which nodes are movable, if the mobility of the nodes is not considered, the cluster heads are probably very unstable nodes; however, only the mobility of the node is considered, and the out-degree and the transmission delay of the node are not considered, in which case the forwarding capability and the transmission efficiency of the elected cluster head may not meet the requirements. The method for selecting the cluster head fully considers the factors of mobility, data forwarding capability, transmission delay and the like of the node, and ensures the reliability and the high efficiency of data transmission under the condition that the node is movable.
Further, the instability is defined as:
where V is the node set of the topology map and α is [0,1 ]]Coefficient of equilibrium between, degadj(i) Is the sum of the degrees of node i and its neighbors, deg (j) is the degree of node j, NS (j) is the sum of the link failure times of all links on node j, NS (i) is the sum of the link failure times of all links on node i, i.e.:
a link failure time is L ET for short, and is defined based on the moving attributes of nodes at two ends of the link and the effective communication distance between the node i and the adjacent node j, and is used for predicting the remaining effective time of the link, wherein the moving attributes comprise moving speed, moving direction and coordinates, L ET (i, j) is calculated according to the following formula:
wherein, b ═ xi-xj，d＝yi-yj，a＝vicosθi-vjcosθj，c＝visinθi-vjsinθj，(xi,yi)、(xj,yj) Two-dimensional space coordinates, v, of nodes i, j, respectivelyi、vjThe moving velocity values, theta, of the nodes i, j, respectivelyi、θjRespectively the moving directions of the nodes i and j, theta is more than or equal to 0i,θjR is less than or equal to 2 pi, R is the effective communication distance of the node, NS (j) is the sum of the link failure time of all links on the node j, and (i) is the sum of the transmission time delay of a transmission path d (i, j) taking the node i as a source node and the rest nodes as destination nodes, namely:
(j) the sum of the transmission delays of the transmission paths d (j, k) using the node j as a source node and the other nodes as destination nodes is as follows:
further, if there are multiple transmission paths between two nodes, the average value of the time delays of all transmission paths between two nodes is taken as the transmission time delay.
Furthermore, the multicast tree includes a branch point to reduce redundant paths of the multicast tree.
Further, the rule of the node reconnection strategy includes: if the nodes in the cluster find that a certain or some neighbor nodes are unreachable, the nodes send handshake messages to the neighbor nodes to request for establishing a link; the node receiving the handshake message judges whether a link can be established with the node according to the maximum node degree and the output degree of the node, and the following conditions are adopted:
(1) if the out-degree of the node receiving the handshake message is smaller than the maximum node degree, responding the handshake message to the node sending the handshake message to indicate that a link can be established;
(2) if the out-degree of the node receiving the handshake message is equal to the maximum node degree, trying to disconnect a certain link of the node, which does not affect the node communication, so that the out-degree of the node is smaller than the maximum node degree, and if the link is successfully disconnected, responding to the handshake message to the node sending the handshake message and building the link;
after receiving the handshake message, the node needs to respond to the handshake message to the node sending the message, then a link is established with the node, if the node does not receive the response within the time T, the node continues to send the handshake message to the node in the cluster, and if the preset number of attempts fails, reconnection is abandoned; if the link is successfully built, judging whether the link can reach all other nodes in the same cluster, and dividing into the following conditions:
(1) the node can communicate with all other nodes in the same cluster, the node reconnection is successful, and the node reconnection process is finished;
(2) the node still can not communicate with all other nodes in the same cluster, and at the moment, the node should inform the node establishing a new link thereof to adopt a node reconnection strategy, and the process is repeated until the node reconnection is successful.
The multicast tree constructed based on the invention improves the stability of the multicast tree and reduces the transmission delay of the multicast tree under the condition that the nodes of the wireless network move. The method for electing the cluster head takes the mobility of the node into consideration, so the influence of the mobility of the node on the stability of the multicast service is reduced, and the node reconnection strategy of the invention can recover the multicast service function as much as possible when the multicast service is influenced by the movement of the node, thereby improving the stability of the multicast tree. The invention hierarchically clusters the nodes in the network, thereby improving the forwarding efficiency of the multicast data; meanwhile, the out-degree and the transmission delay of the nodes are considered in the method for electing the cluster head, so that the transmission delay of the multicast tree is reduced.
Compared with the prior art, the invention has the following advantages and effects:
1. the invention improves the stability of the multicast tree by ensuring the stability of the cluster head in the communication network, especially in the application scene of the node movement and the unstable transmission link in the wireless mesh network.
2. In the application scene of the dynamic wireless mesh network, the invention designs the node reconnection strategy and further improves the stability of the multicast tree.
3. The invention is simple and effective, the algorithm complexity is low, and the interaction overhead between nodes is small.
Drawings
Fig. 1 is a schematic flow chart of a multicast tree construction method applied to a wireless network according to the present disclosure;
fig. 2 is a schematic diagram of a multicast tree constructed in an embodiment of the present invention;
FIG. 3 is a schematic diagram of case 1 in which a detached node attempts reconnection in an embodiment of the present invention;
fig. 4 is a schematic diagram of case 2 in which a detached node attempts reconnection in an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be 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, but 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.
Examples
A multicast tree construction method applied to a wireless network is characterized in that wireless nodes in the wireless network are self-organized to form a wireless mesh network, and all the nodes are hierarchically clustered according to regions or set relations. And calculating the instability of the node according to the movement attribute, the out-degree and the transmission delay of the node. And selecting a cluster head and a standby cluster head for each cluster based on the instability of the node. The intra-cluster nodes establish connection by sending handshake information, thereby constructing an intra-cluster transmission path. The transmission path in the cluster forms the first layer transmission network, and the cluster head sends information to the members in the cluster in a broadcasting or traditional multicast mode. All cluster heads form a second layer transmission network, any one cluster head is selected as a multicast source in the network according to rules or special control nodes, virtual links are built among the cluster heads, and a multicast tree is constructed. And by adopting a node reconnection strategy, the stability of the multicast tree is improved. The method comprises the following concrete steps:
and calculating the instability degree P (i) of the node i based on the movement attribute, the out-degree, the transmission delay and the like of the node i, wherein the smaller the value is, the more stable the description is. And the node with the minimum instability degree is elected as a cluster head, and the small node is elected as a standby cluster head.
The instability is defined as:
where V is the node set of the topology map and α is [0,1 ]]Coefficient of equilibrium between, degadj(i) Is the sum of the degrees of node i and its neighbors, deg (j) is the degree of node j, NS (j) is the sum of the link failure times of all links on node j, NS (i) is the sum of the link failure times of all links on node i, i.e.:
a link failure time is L ET for short, and is defined based on the moving attributes of nodes at two ends of the link and the effective communication distance between the node i and the adjacent node j, and is used for predicting the remaining effective time of the link, wherein the moving attributes comprise moving speed, moving direction and coordinates, L ET (i, j) is calculated according to the following formula:
wherein, b ═ xi-xj，d＝yi-yj，a＝vicosθi-vjcosθj，c＝visinθi-vjsinθj，(xi,yi)、(xj,yj) Two-dimensional space coordinates, v, of nodes i, j, respectivelyi、vjThe moving velocity values, theta, of the nodes i, j, respectivelyi、θjRespectively the moving directions of the nodes i and j, theta is more than or equal to 0i,θjR is less than or equal to 2 pi, R is the effective communication distance of the node, NS (j) is the sum of the link failure time of all links on the node j, and (i) is the sum of the transmission time delay of a transmission path d (i, j) taking the node i as a source node and the rest nodes as destination nodes, namely:
(j) the sum of the transmission delays of the transmission paths d (j, k) using the node j as a source node and the other nodes as destination nodes is as follows:
if there are multiple transmission paths between two nodes, the transmission delay may be defined in a weighted sum manner, and in this embodiment, the average value of the transmission path delays is taken.
Because the nodes in the cluster can obtain corresponding data in an information interaction mode, the self-promotion of the cluster head can be determined through calculation in each node; the determination of the cluster head may also be computationally specified by a control node dedicated to the network. And after the cluster head is pushed or designated, starting to construct the multicast tree. A special control node in the network selects a certain cluster head as a multicast source, and a virtual link is built between the cluster heads to form a multicast tree. In practical cases, in order to reduce redundant paths in the multicast tree, some branching points may exist in the multicast tree, where the branching points are nodes that experience more than two multicast information ports (ingress/egress) but are not the head of a cluster during the inter-cluster multicast information propagation process. As shown in fig. 2, the dotted line indicates the transmission path between cluster heads, and the node k of a cluster head is not a branch point.
Because the network is in a dynamic state at any moment, links between nodes may change channel characteristics due to the movement of the node positions, or the distance between nodes is too large and exceeds the effective communication distance of the nodes to be disconnected, thereby affecting the normal communication between clusters. Meanwhile, considering that the bandwidth of the nodes is limited, degree constraint needs to be added to each node, and the method for realizing the degree constraint in the invention is to set a maximum out degree for each node. The degree constraints of the nodes also affect the normal communication between the nodes. Furthermore, nodes may leave or join the network, and the leaving of the nodes may cause some nodes that are working properly to fail to communicate with each other. The newly joined node needs to establish communication with surrounding nodes.
The above factors all affect the stability of the multicast tree, even cause the multicast tree not to be constructed or the originally constructed multicast tree to be invalid, and affect the normal communication between the nodes. In order to further improve the stability of the multicast tree, the present embodiment makes a node reconnection strategy. The node reconnection strategy is described as follows:
in order to know whether the nodes are in a working state and whether the nodes are in a communicable state, all the nodes need to periodically send heartbeat packets to one-hop neighbors thereof. The node detects whether to be unreachable with a certain node or certain nodes in the same cluster according to the condition (including receiving or not receiving) of receiving the heartbeat packet. If the nodes in the cluster find that a certain or some neighbor nodes are unreachable (no heartbeat packet is received within preset time), a handshake message is sent to the neighbor nodes to request for establishing a link. The node receiving the handshake message judges whether a link can be established with the node according to the maximum node degree and the out degree of the node, and the following conditions are adopted:
(1) and if the out degree of the node receiving the handshake message is smaller than the maximum node degree, sending a handshake response message to the node sending the handshake message, and indicating that a link can be established.
(2) If the out-degree of the node receiving the handshake message is equal to the maximum node degree, a disconnection strategy is adopted, and a certain link of the node which does not affect the communication of the node is tried to be disconnected, so that the out-degree of the node is smaller than the maximum node degree. And if the link is successfully disconnected, responding the handshake message to the node sending the handshake message, and building the link.
After receiving the handshake message, the node also needs to respond to the handshake message to the node sending the message, and then builds a link with the node. And if the node does not receive the response within the time T, continuing to send the handshake message to the nodes in the cluster. If the preset number of attempts fails, the reconnection is abandoned. If the link is successfully built, judging whether the link can reach all other nodes in the same cluster, and dividing into the following conditions:
(1) the node can communicate with all other nodes in the same cluster, the node reconnection is successful, and the node reconnection process is finished.
(2) The node still cannot communicate with all other nodes in the same cluster, and at this time, the node should inform the node with which the new link is built to adopt a node reconnection strategy. And repeating the processes until the nodes are successfully reconnected.
As described above, in the node reconnection process, the degree constraint of the node may be affected, and at this time, the following disconnection strategy should be adopted to ensure the development of the node reconnection process, and the disconnection strategy is mainly used in the following two cases:
case 1: node n of a cluster depends on node m to keep a communicable state with other nodes in the cluster, but the degree of node m is already the maximum value.
And (3) processing strategies:
(1) and trying to disconnect a certain link between the node m and other nodes in the cluster, and if the disconnection of the link does not affect the normal communication between the node m and other nodes in the cluster, confirming to disconnect the link. If node m does not have such a link, policy (2) is employed.
(2) An attempt is made to disconnect some inter-cluster link of node m. And if the node m has a plurality of inter-cluster links and the disconnection of a certain inter-cluster link does not affect the normal communication between the clusters, disconnecting the link. If node m does not have such a link, or if node m has only one inter-cluster link, the link is disconnected regardless of whether inter-cluster communication is affected. This is done to preferentially ensure normal communication between nodes in the cluster.
As shown in fig. 3, node n can only try to establish a link with node m due to an excessively large distance from other nodes, that is, node n relies on the link with node m to maintain its communication with the rest of nodes in the cluster, and if the maximum degree of node m is 3, node m cannot establish a link with node n because of degree constraint, and at this time, node m should disconnect the link with node k and then establish a link with node n. The link with the node k is disconnected, and the normal communication of the node n and other nodes in the cluster cannot be influenced.
Case 2: the node n needs to be connected with the node m of the adjacent cluster to ensure normal communication between the clusters, and the degree of the node m reaches the maximum value.
And (3) processing strategies: the node m should try to disconnect a certain link (intra-cluster or inter-cluster link), and if the normal communication among the node m, other nodes in the cluster and the cluster is not affected after the link is disconnected, the link is confirmed to be disconnected, and the link is established with the node n.
As shown in fig. 4, if node n needs to establish a link with node m to ensure normal communication between clusters, and node m reaches a maximum degree of 3, node k should disconnect the link with node k and establish a link with node n. Disconnecting the link from node k does not affect the normal communication of node m and the rest of the nodes in the cluster.
Because the node may send the handshake packet for applying reconnection to multiple nodes, multiple nodes may respond to the handshake packet, and the node may have multiple states when receiving the handshake packet:
(1) and if the node successfully builds a new link with a certain node in the cluster when receiving the handshake message for receiving reconnection, discarding the message.
(2) And if the node builds a new link with a certain node in the cluster when receiving the handshake message for receiving reconnection, discarding the message.
(3) And if the node is in an idle state when receiving the reconnected handshake message, responding the handshake message to the node and building a new link.
So far, the flow of the multicast tree construction method applied to the wireless network disclosed in this embodiment is ended.
The above embodiments are preferred embodiments of the present invention, but the present invention is not limited to the above embodiments, and any other changes, modifications, substitutions, combinations, and simplifications which do not depart from the spirit and principle of the present invention should be construed as equivalents thereof, and all such changes, modifications, substitutions, combinations, and simplifications are intended to be included in the scope of the present invention.
Claims (6)
1. A multicast tree construction method applied to a wireless network aims at the following application scenes: the nodes or part of nodes in the wireless network have mobility, each node is divided into a certain cluster according to the area or the set relationship, each cluster has a cluster head, and the multicast tree is constructed among the cluster heads, which is characterized in that the multicast tree construction method comprises the following steps:
s1, calculating the instability of the nodes, and selecting a cluster head and a standby cluster head for each cluster;
s2, establishing connection by sending handshake information by the cluster nodes, and constructing a cluster transmission path;
s3, selecting cluster heads to construct a multicast tree according to one or more parameters of hop count, time delay, bandwidth, security and error rate of a transmission path among the cluster heads in a weighted or item-by-item parameter matching mode according to requirements;
s4, according to the connectivity of the topology, adopting a node reconnection strategy to improve the stability of the multicast tree;
s5, in the running process of the wireless network, exchanging the state information between the network and the node, and dynamically adjusting and maintaining the connection relation.
2. The method as claimed in claim 1, wherein the step S1 comprises the following steps:
and calculating the instability of the node according to the movement attribute, the out-degree and the transmission delay of the node, and then selecting the cluster head and the standby cluster head based on the instability of the node.
3. The method according to claim 2, wherein the non-stability is defined as:
where V is the node set of the topology map and α is [0,1 ]]Coefficient of equilibrium between, degadj(i) Is the sum of the degrees of node i and its neighbors, deg (j) is the degree of node j, NS (j) is the sum of the link failure times of all links on node j, NS (i) is the sum of the link failure times of all links on node i, i.e.:
a link failure time is L ET for short, and is defined based on the moving attributes of nodes at two ends of the link and the effective communication distance between the node i and the adjacent node j, and is used for predicting the remaining effective time of the link, wherein the moving attributes comprise moving speed, moving direction and coordinates, L ET (i, j) is calculated according to the following formula:
wherein, b ═ xi-xj，d＝yi-yj，a＝vicosθi-vjcosθj，c＝visinθi-vjsinθj，(xi,yi)、(xj,yj) Two-dimensional space coordinates, v, of nodes i, j, respectivelyi、vjThe moving velocity values, theta, of the nodes i, j, respectivelyi、θjRespectively the moving directions of the nodes i and j, theta is more than or equal to 0i,θjR is less than or equal to 2 pi, R is the effective communication distance of the node, NS (j) is the sum of the link failure time of all links on the node j, and (i) is the sum of the transmission time delay of a transmission path d (i, j) taking the node i as a source node and the rest nodes as destination nodes, namely:
(j) a transmission path d (with node j as a source node and the other nodes as destination nodes)j, k), i.e.:
4. the method according to claim 3, wherein if there are multiple transmission paths between two nodes, the average of the delays of all transmission paths between two nodes is taken as the transmission delay.
5. The method of claim 1, wherein the multicast tree comprises branch points to reduce redundant paths of the multicast tree.
6. The method as claimed in claim 1, wherein the rule of the node reconnection strategy comprises: if the nodes in the cluster find that a certain or some neighbor nodes are unreachable, the nodes send handshake messages to the neighbor nodes to request for establishing a link; the node receiving the handshake message judges whether a link can be established with the node according to the maximum node degree and the output degree of the node, and the following conditions are adopted:
(1) if the out-degree of the node receiving the handshake message is smaller than the maximum node degree, responding the handshake message to the node sending the handshake message to indicate that a link can be established;
(2) if the out-degree of the node receiving the handshake message is equal to the maximum node degree, trying to disconnect a certain link of the node, which does not affect the node communication, so that the out-degree of the node is smaller than the maximum node degree, and if the link is successfully disconnected, responding to the handshake message to the node sending the handshake message and building the link;
after receiving the handshake message, the node needs to respond to the handshake message to the node sending the message, then a link is established with the node, if the node does not receive the response within the time T, the node continues to send the handshake message to the node in the cluster, and if the preset number of attempts fails, reconnection is abandoned; if the link is successfully built, judging whether the link can reach all other nodes in the same cluster, and dividing into the following conditions:
(1) the node can communicate with all other nodes in the same cluster, the node reconnection is successful, and the node reconnection process is finished;
(2) the node still can not communicate with all other nodes in the same cluster, and at the moment, the node should inform the node establishing a new link thereof to adopt a node reconnection strategy, and the process is repeated until the node reconnection is successful.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010146145.8A CN111405489B (en) | 2020-03-05 | 2020-03-05 | Multicast tree construction method applied to wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010146145.8A CN111405489B (en) | 2020-03-05 | 2020-03-05 | Multicast tree construction method applied to wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111405489A true CN111405489A (en) | 2020-07-10 |
| CN111405489B CN111405489B (en) | 2021-03-30 |
Family
ID=71413213
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010146145.8A Active CN111405489B (en) | 2020-03-05 | 2020-03-05 | Multicast tree construction method applied to wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111405489B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114466081A (en) * | 2021-12-23 | 2022-05-10 | 东莞市李群自动化技术有限公司 | Node control method, system, equipment and storage medium of real-time channel group |
| WO2023206697A1 (en) * | 2022-04-29 | 2023-11-02 | 青岛海尔科技有限公司 | Reconnection method and apparatus for node interruption in mesh network, and device |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101094189A (en) * | 2007-08-10 | 2007-12-26 | 中控科技集团有限公司 | System of wireless sensor network, and cluster routing method based on the system |
| WO2010045019A2 (en) * | 2008-10-14 | 2010-04-22 | Motorola, Inc. | Method to quiet consecutive narrow band channels |
| CN102158983A (en) * | 2011-05-04 | 2011-08-17 | 常熟理工学院 | Method for constructing 6LoWPAN wireless sensor network |
| CN103179628A (en) * | 2013-02-06 | 2013-06-26 | 中国科学院上海微系统与信息技术研究所 | Clustering routing method based on wireless sensor network node middleware |
| CN103945487A (en) * | 2014-05-08 | 2014-07-23 | 国家电网公司 | Reliability node clustering method in power communication network |
| CN104284386A (en) * | 2014-02-22 | 2015-01-14 | 湖南科技大学 | Vertex-betweenness-based cluster head selection method in wireless sensor networks |
| CN104540173A (en) * | 2015-01-04 | 2015-04-22 | 河海大学常州校区 | Wireless sensor network mobile data collecting method based on arborescence cluster structure |
| CN104684041A (en) * | 2015-02-06 | 2015-06-03 | 中国科学院上海微系统与信息技术研究所 | Real-time wireless sensor network routing method supporting large-scale node application |
| CN106211258A (en) * | 2016-07-21 | 2016-12-07 | 河南工业大学 | A kind of bunch tree route method based on bunch great wheel system of changing planes and device |
| CN109041127A (en) * | 2018-09-26 | 2018-12-18 | 北航（四川）西部国际创新港科技有限公司 | The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network |
-
2020
- 2020-03-05 CN CN202010146145.8A patent/CN111405489B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101094189A (en) * | 2007-08-10 | 2007-12-26 | 中控科技集团有限公司 | System of wireless sensor network, and cluster routing method based on the system |
| WO2010045019A2 (en) * | 2008-10-14 | 2010-04-22 | Motorola, Inc. | Method to quiet consecutive narrow band channels |
| CN102158983A (en) * | 2011-05-04 | 2011-08-17 | 常熟理工学院 | Method for constructing 6LoWPAN wireless sensor network |
| CN103179628A (en) * | 2013-02-06 | 2013-06-26 | 中国科学院上海微系统与信息技术研究所 | Clustering routing method based on wireless sensor network node middleware |
| CN104284386A (en) * | 2014-02-22 | 2015-01-14 | 湖南科技大学 | Vertex-betweenness-based cluster head selection method in wireless sensor networks |
| CN103945487A (en) * | 2014-05-08 | 2014-07-23 | 国家电网公司 | Reliability node clustering method in power communication network |
| CN104540173A (en) * | 2015-01-04 | 2015-04-22 | 河海大学常州校区 | Wireless sensor network mobile data collecting method based on arborescence cluster structure |
| CN104684041A (en) * | 2015-02-06 | 2015-06-03 | 中国科学院上海微系统与信息技术研究所 | Real-time wireless sensor network routing method supporting large-scale node application |
| CN106211258A (en) * | 2016-07-21 | 2016-12-07 | 河南工业大学 | A kind of bunch tree route method based on bunch great wheel system of changing planes and device |
| CN109041127A (en) * | 2018-09-26 | 2018-12-18 | 北航（四川）西部国际创新港科技有限公司 | The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114466081A (en) * | 2021-12-23 | 2022-05-10 | 东莞市李群自动化技术有限公司 | Node control method, system, equipment and storage medium of real-time channel group |
| CN114466081B (en) * | 2021-12-23 | 2024-04-12 | 东莞市李群自动化技术有限公司 | Method, system, equipment and storage medium for managing and controlling nodes of real-time channel group |
| WO2023206697A1 (en) * | 2022-04-29 | 2023-11-02 | 青岛海尔科技有限公司 | Reconnection method and apparatus for node interruption in mesh network, and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111405489B (en) | 2021-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7911978B1 (en) | Adaptive topology discovery in communication networks | |
| EP1654613B1 (en) | System and method for exchanging awareness information in a network environment | |
| Reddy et al. | SMORT: Scalable multipath on-demand routing for mobile ad hoc networks | |
| JP4807701B2 (en) | Mobile terminal device, control method, and mobile communication system | |
| CN111556550B (en) | Routing method for unmanned aerial vehicle network communication | |
| KR20050033948A (en) | Route path setting method according to route discovery of mobile ad hoc network using partial route discovery | |
| CN111405489B (en) | Multicast tree construction method applied to wireless network | |
| CN109586966B (en) | Unmanned system network topology connectivity recovery method and system | |
| Hsu et al. | Bandwidth routing in multi-hop packet radio environment | |
| Sun et al. | Delay constraint multipath routing for wireless multimedia ad hoc networks | |
| US10972310B2 (en) | Link state packet transmission method and routing node | |
| CN113727415A (en) | Method for dynamically sensing unmanned aerial vehicle ad hoc network to improve AODV routing protocol | |
| CN113411118A (en) | Mesh-based virtual routing method for unmanned aerial vehicle ad hoc network | |
| CN111447091B (en) | Network loop detection method, device, equipment and storage medium | |
| CN103037436A (en) | Network coding perception wireless mesh routing protocol based on hybrid wireless mesh protocol (HWMP) | |
| Yang et al. | Multi-path routing protocol for mobile ad hoc network | |
| CN110267322A (en) | One kind being based on the improved unmanned plane ad hoc network fast reaction routing algorithm of DSR agreement | |
| CN110943926A (en) | MPR backup method based on link lifetime | |
| KR101371651B1 (en) | A method for constructing a tree in mobile ad hoc network | |
| Liu et al. | Advanced Fast Recovery OLSR Protocol for UAV Swarms in the Presence of Topological Change | |
| CN110972206B (en) | Multi-hop routing method for realizing routing path of 5G Internet of things network | |
| Su et al. | An efficient multi-source multicast routing protocol in mobile ad hoc networks | |
| Hu | A novel topology control for multihop packet radio networks | |
| Young et al. | UCDS: Unifying connected dominating set with low message complexity, fault tolerance, and flexible dominating factor | |
| AU2020102837A4 (en) | A method and system for improving wireless sensor network using fault mitigation technology |
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 |