CN113347677B - Multi-node communication method based on particle swarm optimization - Google Patents
Multi-node communication method based on particle swarm optimization Download PDFInfo
- Publication number
- CN113347677B CN113347677B CN202110482222.1A CN202110482222A CN113347677B CN 113347677 B CN113347677 B CN 113347677B CN 202110482222 A CN202110482222 A CN 202110482222A CN 113347677 B CN113347677 B CN 113347677B
- Authority
- CN
- China
- Prior art keywords
- node
- path
- nodes
- fitness
- 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.)
- Active
Links
- 238000004891 communication Methods 0.000 title claims abstract description 37
- 238000000034 method Methods 0.000 title claims abstract description 24
- 239000002245 particle Substances 0.000 title claims abstract description 16
- 238000005457 optimization Methods 0.000 title abstract description 9
- 230000005540 biological transmission Effects 0.000 claims abstract description 28
- 208000003443 Unconsciousness Diseases 0.000 abstract description 2
- 238000005516 engineering process Methods 0.000 abstract description 2
- 238000004364 calculation method Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 238000012546 transfer Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000011664 nicotinic acid Substances 0.000 description 1
- 238000011002 quantification Methods 0.000 description 1
- 238000013139 quantization Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Computing Systems (AREA)
- Biomedical Technology (AREA)
- Biophysics (AREA)
- Computational Linguistics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Evolutionary Computation (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Artificial Intelligence (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Health & Medical Sciences (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a multi-node communication method based on a particle swarm algorithm, which solves the problems that the prior multi-node communication network increases channel load and competition risk due to randomness and unconscious information transmission modes. The method comprises the following steps: 1) Loading preset parameters; 2) All nodes access the network and send broadcast messages; 3) Generating a starting node and a target node; 4) The starting node randomly designates a known node as a relay node and sends information; after the designated relay node receives the information, continuing to designate the next-stage relay node and sending the information to the next-stage relay node; the nodes are sequentially transmitted until reaching the target node; 5) Calculating path fitness; 6) Updating the path with high fitness to an individual optimal path; 7) And judging the path exploration capability. The invention optimizes the point-to-point information transmission path in the multi-node network by the path optimization technology of the particle swarm algorithm, reduces the channel occupation time on the premise of ensuring the transmission reliability, and improves the information transmission efficiency.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a multi-node communication method based on a particle swarm algorithm.
Background
Multi-node communication networks have become an effective solution for wireless access networks such as home, community, enterprise, and metropolitan area networks by virtue of their multi-hop interconnection and network topology characteristics. In multi-node communication network implementations, point-to-point information transfer path planning strategies directly affect channel utilization. The common multi-node communication network is mostly in a random or unintentional information transmission mode, so that the channel load and the competition risk are increased, the bandwidth utilization rate is reduced, and the higher performance and value are lacked. Therefore, how to reduce channel load, reducing bandwidth wasted by contention and backoff is a core concern for measuring network performance and value.
Disclosure of Invention
The invention provides a multi-node communication method based on a particle swarm algorithm, which aims to solve the technical problems that the channel load and the competition risk are increased and the bandwidth utilization rate is reduced due to the randomness or unconscious information transmission mode of the existing multi-node communication network.
In order to achieve the above purpose, the technical scheme provided by the invention is as follows:
the multi-node communication method based on the particle swarm algorithm is characterized by comprising the following steps of:
1) Initializing parameters
After the node equipment is started, loading preset parameters, wherein the preset parameters comprise an optimal path failure threshold T max Link quality weighting factor c 1 Path optimum weighting factor c 2 And fitness return time to live TIL;
2) Initializing node locations
All nodes access the network and sequentially send broadcast messages; each node records the positions of other nodes and the quality of communication links according to the received broadcast information; wherein the node number n in the network is more than or equal to 3;
3) Task publication
Generating a starting node and a target node according to the actual information transmission task; or randomly generating an initial node and a target node with exploration capability when the network is idle;
4) Path search
The initial node randomly designates other known nodes which are not designated as relay nodes and sends information; after the designated relay node receives the information, continuing to designate the next-stage relay node and sending the information to the next-stage relay node; the nodes are sequentially transmitted until reaching the target node;
5) Return path fitness
After receiving the information, the target node returns path information according to the original path; the originating node then calculates the fitness Fit of the path according to the fitness function:
wherein: q i I=3, …, n, which is a quantized value of link quality between two nodes;
m is the number of nodes through which the path passes;
if the initial node does not receive the path information returned by the target node in the TIL time, judging that the path communication fails, and returning to the step 4);
6) Updating individual optimal paths
The initial node records the current path and the corresponding fitness, compares the current path with the fitness of the individual historical optimal path, and updates the current path to be the individual optimal path if the current path fitness is higher than the individual historical optimal path fitness; if the current path fitness is equal to or lower than the individual history optimal path fitness, the original individual optimal path is maintained;
7) Decision path exploration capability
Judging whether the initial node finishes the operation of designating all known nodes as relay nodes, if so, temporarily canceling the path searching capability until the adaptability of the node is reduced to exceed the optimal path failure threshold T when the node transmits information according to the optimal path max The path searching capability of the node is reapplied; if the starting node still has a known node which is not designated as a relay node, maintaining the path searching capability of the node so as to explore whether other better paths exist;
returning to the step 3) after the judgment is finished; and stopping the path exploration until the equipment is required to be shut down or a stop command is received.
Further, in step 4), the principle of designating the relay node is:
a) The peer node which cannot select the upper node is the next-stage relay node;
b) The relay nodes independently select the next-stage relay node according to the individual optimal path;
c) When the relay node does not have an optimal path to the target node, a lower node with good communication quality is preferentially selected.
Further, in step 1), the link quality weight factor c 1 The ratio of the average value of the link quality quantification between nodes in the path is more than 0.5 and less than c 1 ＜2；
The path optimal weight factor c 2 The proportion of the number of nodes in the path is 0.5 < c 2 ＜2。
Further, in step 2), the broadcast message is sent in a time division manner.
Compared with the prior art, the invention has the advantages that:
1. the multi-node communication method optimizes the point-to-point information transmission path in the multi-node network by the path optimization technology of the particle swarm algorithm, reduces collision probability and improves channel utilization rate.
2. The optimal path searched by the multi-node communication method considers the quality of a transmission link, ensures the reliability of transmission and reduces the retransmission probability; meanwhile, the number of nodes on the path is considered, and fewer relay nodes can enable information to reach a target node more quickly, so that information transmission efficiency among the nodes is improved, and information transmission time delay is reduced.
3. The multi-node communication method adds a path optimization algorithm under the existing node access and collision avoidance mechanism, so that the method can be directly used for determining the optimal transmission path without modifying the original transmission scheme.
4. The adaptability calculation formula of the multi-node communication method is simple and effective, and compared with other conventional calculation functions, the method has the advantages of small calculated amount and easiness in implementation.
Drawings
FIG. 1 is a flow chart of a multi-node communication method based on a particle swarm algorithm of the present invention;
fig. 2 is a flow chart of information transfer path optimization in an embodiment of the invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and specific embodiments.
The particle swarm algorithm is a bionic algorithm which generates intelligent optimization search through cooperation among particles in the swarm. In a multi-node communication network, each node can be regarded as a particle in the network, and the optimal path for information transmission between any two nodes is searched through information interaction between the nodes. Therefore, the invention provides a multi-node communication method based on the particle swarm algorithm idea on the basis of the multi-node communication network with the existing node access and collision back-off mechanisms.
The multi-node communication method of the present invention includes the steps of:
1) Initializing parameters
Starting node equipment, loading preset parameters immediately once the node equipment is in a starting state, wherein the preset parameters comprise an optimal path failure threshold T max Link quality weighting factor c 1 Path optimum weighting factor c 2 And fitness return time to live TIL;
optimal path failure threshold T max : when the node finishes the path searching and transmits information according to the optimal path, the path adaptability allows the maximum value to be reduced;
link quality weight factor c 1 : the ratio of the link quality quantization average value between nodes in the path. The larger the value, the more important the link quality is in path searching, in this embodiment, 0.5 < c 1 ＜2；
Path optimum weighting factor c 2 : the number of nodes in the path is the proportion. The larger the value, the more important the number of nodes the path passes through, in this embodiment, 0.5 < c 2 ＜2。
2) Initializing node locations
Initializing the network (the number of nodes n in the network is more than or equal to 3). All nodes enter the network according to the access rule, and broadcast messages containing the self-position information are sequentially sent in a time division mode, so that all nodes in the network can acquire the positions of other nodes communicating with the nodes. Each node records the positions of other nodes and the quality of communication links according to the received broadcast information.
3) Task publication
Generating a starting node and a target node according to an actual information transmission task, and recording path information in the effective information transmission process; or randomly generating an initial node and a target node with exploring capability for searching paths when the network is idle, and trying whether other paths exist or not.
4) Path search
In the information transmission process, the initial node randomly designates other known nodes which are not designated (other nodes capable of normally communicating) as relay nodes, sends information, and transmits point-to-point information; after the designated relay node receives the information, continuing to designate the next-stage relay node and sending the information to the next-stage relay node; and sequentially transmitting among the nodes until reaching the target node.
The principle to be complied with in selecting the next-stage relay node is as follows:
a) The peer node which cannot select the upper node is the next-stage relay node, so that redundant paths are avoided; taking the node position in fig. 2 as an example, assuming that the starting node of the current task is node 1, the target node is node 8, and the distance between node 1 and node 2 is defined as a unit transmission distance, each node can communicate with an adjacent node approximating the unit transmission distance. The information transmission path is transmitted from the originating node 1 to the node 2 and then to the node 5. The node 5 is a node 2 at the upper level, and both the node 2 and the node 4 can be used as the next level node of the node 1, and both belong to peer nodes, so as to avoid generating redundant routes, the node 5 is allowed to transmit to the node 7 or the node 6, but the peer node 4 of the upper level node 2 cannot be selected as the next level relay node.
b) In order to realize information sharing of all nodes, the relay nodes independently select the next-stage relay node according to the individual optimal path.
c) The link quality is an important index for evaluating the fitness, and when the relay node does not have an optimal path to the target node, the next node with better notification quality should be preferentially selected, and the next node with better communication quality should be preferentially selected, so as to improve the transmission reliability.
5) Return path fitness
And after receiving the information, the target node returns path information according to the original path. The originating node then calculates the fitness of the path according to the fitness function. In the path, the fewer the number of nodes transmitted by the starting node to the target node, the higher the communication quality, and the higher the adaptability of the path; conversely, the lower the fitness of the node. The path fitness is calculated by the current speed, the number of passing nodes and the quantized value of the link quality, and the fitness Fit calculation formula is as follows:
wherein q i I=3, …, n, which is a quantized value of link quality between two nodes; m is the number of nodes through which the path passes.
If the initial node does not receive the path information returned by the target node in the TIL time, judging that the path communication fails, and returning to the step 4);
6) Updating individual optimal paths
The initial node records the current path and the corresponding fitness, and compares the fitness with the fitness (pbest) of the individual historical optimal path:
if the current path fitness is higher than the individual historical optimal path fitness, updating the current path to be an individual optimal path;
if the current path fitness is lower than the historical optimal path fitness of the individual, the current path fitness is not updated, and the original optimal path of the individual is maintained.
7) Decision path exploration capability
Judging whether the starting node finishes the operation of designating all known nodes as relay nodes, and temporarily canceling the path searching capability if the starting node has designated all the known nodes; until the node transmits information according to the optimal path, the adaptability change (reduction) exceeds the optimal path failure threshold T max When the node is reassignedPath search capability. If the starting node still has unspecified known nodes, maintaining the path searching capability of the node, and trying whether other paths are better paths or not;
after the judgment is finished (the failure node fairly competes with other nodes, the fewer the nodes with reserved exploration capacity are along with the exploration, the higher the probability that the failure node becomes an initial node at random), and the step 3) is returned; and stopping the path exploration until the equipment is required to be shut down or a stop command is received.
The method of the invention adds a point-to-point information transmission path optimization method to the multi-node communication network, and searches the unique optimal path in a plurality of disordered transmission paths, thereby avoiding the occurrence of the inefficient channel occupation condition and improving the communication efficiency.
In fig. 2, the network contains 9 nodes, the current transmission task is node 1 to node 8, and 3 paths marked in the figure are more effective transmission paths after unreasonable paths are removed. Wherein, path 1 passes through 4 nodes, path 2 passes through 2 nodes, path 3 passes through 3 nodes, if the quality of the communication links of 3 paths is assumed to be similar, and the number of the nodes passed by path 2 is the minimum, so path 2 is the optimal path.
The method adds the path optimization algorithm under the existing node access and collision avoidance mechanism, so that the original transmission scheme is not required to be modified, and the method can be used only by adding the method.
The above description is only of the preferred embodiments of the present invention, and the technical solution of the present invention is not limited thereto, and any modifications made by those skilled in the art based on the main technical concept of the present invention are included in the technical scope of the present invention.
Claims (3)
1. The multi-node communication method based on the particle swarm algorithm is characterized by comprising the following steps of:
1) Initializing parameters
After the node equipment is started, loading preset parameters, wherein the preset parameters comprise an optimal path failure threshold T max Link quality weighting factor c 1 Path optimum weighting factor c 2 And fitness return time to live TIL;
wherein the link quality weight factor c 1 The ratio of the quantized average value of the link quality among the nodes in the path is larger, and the more important the link quality is in path searching; the path optimal weight factor c 2 The larger the value is, the more important the number of nodes the path passes through is for the proportion of the number of nodes in the path;
2) Initializing node locations
All nodes access the network and sequentially send broadcast messages; each node records the positions of other nodes and the quality of communication links according to the received broadcast information; wherein the node number n in the network is more than or equal to 3;
3) Task publication
Generating a starting node and a target node according to the actual information transmission task; or randomly generating an initial node and a target node with exploration capability when the network is idle;
4) Path search
The initial node randomly designates other known nodes which are not designated as relay nodes and sends information; after the designated relay node receives the information, continuing to designate the next-stage relay node and sending the information to the next-stage relay node; the nodes are sequentially transmitted until reaching the target node;
the principle of designating the relay node is as follows:
a) The peer node which cannot select the upper node is the next-stage relay node;
b) The relay nodes independently select the next-stage relay node according to the individual optimal path;
c) When the relay node does not have an optimal path to the target node, a lower node with good communication quality is preferentially selected;
5) Return path fitness
After receiving the information, the target node returns path information according to the original path; the originating node then calculates the fitness Fit of the path according to the fitness function:
wherein: q i I=3, …, n, which is a quantized value of link quality between two nodes;
m is the number of nodes through which the path passes;
if the initial node does not receive the path information returned by the target node in the TIL time, judging that the path communication fails, and returning to the step 4);
6) Updating individual optimal paths
The initial node records the current path and the corresponding fitness, compares the current path with the fitness of the individual historical optimal path, and updates the current path to be the individual optimal path if the current path fitness is higher than the individual historical optimal path fitness; if the current path fitness is equal to or lower than the individual history optimal path fitness, the original individual optimal path is maintained;
7) Decision path exploration capability
Judging whether the initial node finishes the operation of designating all known nodes as relay nodes, if so, temporarily canceling the path searching capability until the adaptability of the node is reduced to exceed the optimal path failure threshold T when the node transmits information according to the optimal path max The path searching capability of the node is reapplied; if the starting node still has a known node which is not designated as a relay node, maintaining the path searching capability of the node so as to explore whether other better paths exist;
returning to the step 3) after the judgment is finished; and stopping the path exploration until the equipment is required to be shut down or a stop command is received.
2. The multi-node communication method based on the particle swarm algorithm according to claim 1, wherein: in step 1), 0.5 < c 1 ＜2；0.5＜c 2 ＜2。
3. The multi-node communication method based on the particle swarm algorithm according to claim 2, wherein: in step 2), the broadcast message is sent in a time division manner.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110482222.1A CN113347677B (en) | 2021-04-30 | 2021-04-30 | Multi-node communication method based on particle swarm optimization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110482222.1A CN113347677B (en) | 2021-04-30 | 2021-04-30 | Multi-node communication method based on particle swarm optimization |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113347677A CN113347677A (en) | 2021-09-03 |
| CN113347677B true CN113347677B (en) | 2023-12-08 |
Family
ID=77469324
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110482222.1A Active CN113347677B (en) | 2021-04-30 | 2021-04-30 | Multi-node communication method based on particle swarm optimization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113347677B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115086229B (en) * | 2022-04-29 | 2023-07-11 | 珠海高凌信息科技股份有限公司 | SDN network multipath calculation method based on evolutionary algorithm |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105430706A (en) * | 2015-11-03 | 2016-03-23 | 国网江西省电力科学研究院 | WSN (Wireless Sensor Networks) routing optimization method based on improved PSO (particle swarm optimization) |
| CN106792963A (en) * | 2016-12-06 | 2017-05-31 | 淮阴工学院 | A kind of car networking sub-clustering car car multi-hop routing method based on particle group optimizing |
| CN108156613A (en) * | 2017-11-26 | 2018-06-12 | 南京邮电大学 | A kind of relay node distribution method in unmanned plane relay multi-hop communication system |
| CN108183860A (en) * | 2018-01-19 | 2018-06-19 | 东南大学 | Two-dimentional network-on-chip adaptive routing method based on particle cluster algorithm |
| CN111065147A (en) * | 2019-12-29 | 2020-04-24 | 高小翎 | Method for improving routing transmission quality of wireless distributed sensor network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| IL256934B (en) * | 2015-07-27 | 2022-07-01 | Genghiscomm Holdings Llc | Airborne relays in cooperative-mimo systems |
-
2021
- 2021-04-30 CN CN202110482222.1A patent/CN113347677B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105430706A (en) * | 2015-11-03 | 2016-03-23 | 国网江西省电力科学研究院 | WSN (Wireless Sensor Networks) routing optimization method based on improved PSO (particle swarm optimization) |
| CN106792963A (en) * | 2016-12-06 | 2017-05-31 | 淮阴工学院 | A kind of car networking sub-clustering car car multi-hop routing method based on particle group optimizing |
| CN108156613A (en) * | 2017-11-26 | 2018-06-12 | 南京邮电大学 | A kind of relay node distribution method in unmanned plane relay multi-hop communication system |
| CN108183860A (en) * | 2018-01-19 | 2018-06-19 | 东南大学 | Two-dimentional network-on-chip adaptive routing method based on particle cluster algorithm |
| CN111065147A (en) * | 2019-12-29 | 2020-04-24 | 高小翎 | Method for improving routing transmission quality of wireless distributed sensor network |
Non-Patent Citations (3)
| Title |
|---|
| An Energy aware Routing Mechanism in WSNs using PSO and GSO Algorithm;Asha G.R.;《2018 5th International Conference on Signal Processing and Integrated Networks》;全文 * |
| Relay Node Deployment for Wireless Sensor Networks Based on PSO;Bao yu;《2015 IEEE International Conference on Computer and Information Technology》;全文 * |
| 基于支持向量机的移动无线传感器网络可靠性研究;单蓉;李涛;;工业仪表与自动化装置(06);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113347677A (en) | 2021-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111200856A (en) | Multi-hop optimal path selection method of wireless sensor | |
| US20130010621A1 (en) | Control Apparatus and Control Method | |
| CN110446184B (en) | Multi-mode switching Internet of vehicles routing method | |
| CN111385201A (en) | RPL routing method based on bidirectional father node decision | |
| Hassan et al. | Integrating African Buffalo optimization algorithm in AODV routing protocol for improving the QoS of MANET | |
| CN113347677B (en) | Multi-node communication method based on particle swarm optimization | |
| CN114374721A (en) | Power line and wireless communication fusion method and system for power internet of things | |
| CN108462983B (en) | Multi-robot communication networking method based on improved ant colony AODV protocol | |
| CN108684065B (en) | Ant colony optimization-based relay selection method in Internet of vehicles | |
| CN110932969B (en) | Advanced metering system AMI network anti-interference attack routing algorithm for smart grid | |
| Li et al. | A reliable and efficient forwarding strategy in vehicular named data networking | |
| Wang et al. | ECCO: A novel end-to-end congestion control scheme in multi-hop cognitive radio ad hoc networks | |
| CN109257830A (en) | In-vehicle networking self-adoptive retreating method based on QoS | |
| CN116528313A (en) | Unmanned aerial vehicle low-energy-consumption rapid routing method for task collaboration | |
| CN114785728A (en) | Power communication network routing method based on path and node heat | |
| KR20080086112A (en) | Routing method of ad-hoc network | |
| Li et al. | Research on Power Line Carrier Communication Routing Adapted to the Internet of Things | |
| CN115442313B (en) | Online scheduling system for wide area deterministic service flow | |
| CN113709036B (en) | Route improvement method of Spray and Wait based on node history encounter information | |
| Kaneko et al. | A greedy stable time via LEACH-based 2-hop trees in wireless sensor networks | |
| Allahverdi Mamaghani et al. | An Energy-Efficient Fuzzy Logic-based Fault-Tolerant Routing Protocol for Wireless Sensor Networks | |
| Sefati et al. | A novel routing protocol based on prediction of energy consumption and link stability in mobile Internet of Thing (MIoT) | |
| CN115209504B (en) | Mobile social network routing method based on preference communities and energy consumption factors | |
| CN116437493B (en) | Data back-off transmission method, device and equipment for offshore ad hoc network and storage medium | |
| CN108650697B (en) | Data routing method in long-distance linear wireless sensor network |
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 |