CN109495944B - Wireless sensor network double-cluster-head communication method and device - Google Patents
Wireless sensor network double-cluster-head communication method and device Download PDFInfo
- Publication number
- CN109495944B CN109495944B CN201811584741.3A CN201811584741A CN109495944B CN 109495944 B CN109495944 B CN 109495944B CN 201811584741 A CN201811584741 A CN 201811584741A CN 109495944 B CN109495944 B CN 109495944B
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- cluster head
- information
- time
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- 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
- 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)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a wireless sensor network double-cluster-head communication method and a wireless sensor network double-cluster-head communication device. Generally speaking, the increase of the transmission distance will cause the increase of the propagation loss, and at the same time, if the delay time of the cluster head node path is longer than that of the direct path, the longer delay waiting at the sink node will be caused, and the efficiency of cooperative transmission will be affected, so the cluster head node with the smallest time delay is selected as the cooperative cluster head node of the source node, and under the condition that cluster heads are selected by the HEED algorithm and the LEACH algorithm respectively, the transmission efficiency is compared respectively, and the selectable cluster heads in the cluster area are dynamically selected for network transmission, thereby prolonging the service life of the whole network. The transmission balance is obtained in the angles of the physical position and the logical position, the transmission efficiency of the network is improved, the service life of the cluster head node is prolonged, and the selection of the routing path is improved.
Description
Technical Field
The disclosure relates to the technical field of sensor network communication, in particular to a wireless sensor network double-cluster-head communication method and device.
Background
In a wireless sensor network, the number of various sensor nodes is continuously increased, new requirements are put forward on the complexity of a communication system, a lot of important real-time data are exchanged through routing paths of the sensor network, once the connection of the sensor network is in a problem or a certain sensor node is in a fault, the data of the whole sensor network cannot be exchanged and transmitted due to the fact that no corresponding data standby path exists, the sensor network cannot work normally, and when the wireless sensor network is initialized, clustering optimization is carried out on the routing of an initial topology by running a LEACH algorithm and a HEED algorithm. Once the optimized network topology is established in the topology construction stage, the topology maintenance stage must start working to balance the energy consumption in the network, so that the topology formed by the new cluster heads becomes the current optimal state or the state close to the current optimal state, and finally the life cycle of the network is prolonged.
In the node communication of the cluster head node in the cluster area, the data transmission task is heavy, the energy consumption is high, and the service life is short, so that some technologies are needed to prolong the service life of the cluster head node. The sensor nodes, the cluster head nodes and the sink nodes are main components of a wireless sensor network, each node is provided with an independent energy storage and energy management system, and the node cannot be reused after energy consumption, so that the use frequency of each node needs to be balanced to reasonably manage the use frequency of the node, and the cluster head nodes are prevented from prematurely consuming energy.
Disclosure of Invention
The disclosure provides a wireless sensor network double-cluster-head communication method and device, wherein the time delay of path transmission directly corresponds to the distance between nodes. Generally speaking, the increase of the transmission distance will cause the increase of the propagation loss, and at the same time, if the delay time of the cluster head node path is longer than that of the through path, the longer delay waiting at the sink node will be caused, and the cooperative transmission efficiency will be affected, so the cluster head node with the minimum time delay is selected as the cooperative cluster head node of the source node, and the effective cooperative transmission is realized.
In order to achieve the above object, according to an aspect of the present disclosure, there is provided a wireless sensor network dual cluster head communication method, the method including:
step 1, initializing a sensor network;
step 2, dividing cluster regions according to an HEED algorithm and selecting a first cluster head node in each cluster region;
step 3, selecting a second cluster head node in each cluster area according to an LEACH algorithm in the cluster area;
step 4, initializing cluster areas of double cluster heads;
and 5, dynamically selecting the cluster head node to communicate with the sink node.
Further, in step 1, the method for initializing the sensor network includes that N common nodes with the same initial energy and ID numbers from 0 to N are randomly deployed in the monitoring area, and the sink node is deployed at a random point on the edge of the network.
Further, in step 2 or step 3, according to the HEED algorithm or according to the LEACH algorithm, after clustering is performed according to the HEED algorithm, cluster head nodes are selected in each cluster region, and according to the LEACH algorithm, cluster head nodes are selected in each cluster region without re-dividing the cluster region.
Further, in step 4, the method for initializing the cluster area with two cluster heads is that, first, the source node sends information to the surrounding cluster head nodes and the sink node in the form of broadcast, and the time when the source node directly transmits to the sink node is set as T1The method comprises the steps that a source node sorts surrounding cluster head nodes from small to large according to ID serial numbers of the cluster head nodes, the sequence of forwarding information of the cluster head nodes is determined, delta is an artificially set propagation time interval, the default is 500 milliseconds, in order to avoid mutual interference and channel blockage when multiple cluster head nodes are simultaneously transmitted to a sink node, a time-sharing transmission method is adopted, and a first cluster head node sends information to the sink node after receiving source node information through the delta time interval; and after receiving the source node information, the second cluster head node sends the information to the sink node after 2 delta intervals, the source node directly sends the information to the sink node after 3 delta intervals, and all the nodes send the information to the sink node in sequence.
Further, in step 5, the method for dynamically selecting the cluster head node to communicate with the sink node is that, the times when the information of the first cluster head node, the second cluster head node and the source node reaches the sink node are respectively assumed to be T21，T22，T23The time when each cluster head node information reaches the sink node comprises path propagation time and node processing time, T21The time T when the information of the first cluster head node reaches the sink node22T is the time when the information of the second cluster head node reaches the sink node23When the information of the source node reaches the sink node, the time when the information reaches the sink node is expressed as follows:
T21＝T1+t1，T22＝T1+δ+t2，T23＝T1+2δ+t3，
in the formula, t1The difference between the time taken for the propagation path through the first cluster head node and the time taken for the direct propagation of the source node and the sink node, t2The difference between the time taken for the second cluster head node to propagate the path and the time taken for the sink node to propagate the path and the sink node is obtained when the sink node receives the cluster head node information in sequence and arrives at the sink nodeAnd (3) comparing the intercropping differences:
T22-T21＝δ+t2-t1the difference result is compared to δ:
while leaving the first cluster head node to continue the comparison: t is23-T21＝2δ+(t3-t1) The difference result obtained is compared with 2 δ:
and when the second cluster head node is left to continue comparison:
T23-T22＝δ+(t3-t2)，
the difference results obtained are compared with δ:
by analogy, comparing the previous receiving time with the subsequent receiving time until the cluster head node with the minimum delay time is found, namely dynamically selecting the cluster head node to communicate with the sink node, the formula is as follows:
T2p-T2q＝(p-q)δ+(tp-tq)，
the difference results obtained are compared with (p-q) δ:
after the sequential comparison is finished, selecting the node n with the minimum delay time0The sink node feeds back the selected result to the source node, so as to delay the node n of the time0As the best cooperative cluster head node, performing cooperation as the transmission path to transmit dataAnd transmitting to the sink node.
The invention also provides a wireless sensor network double-cluster-head communication device, which comprises: a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor executing the computer program to operate in the units of:
the network initialization unit is used for initializing the sensor network;
the first cluster head election unit is used for dividing cluster regions according to an HEED algorithm and electing first cluster head nodes in each cluster region;
the second cluster head election unit is used for electing a second cluster head node in each cluster area according to an LEACH algorithm in the cluster area;
a cluster area initialization unit for initializing a cluster area of a dual cluster head;
and the dynamic selection cluster head unit is used for dynamically selecting the cluster head nodes to communicate with the sink node.
The beneficial effect of this disclosure does: the invention provides a wireless sensor network double-cluster-head communication method and device, which respectively compare the transmission efficiency of a HEED algorithm and an LEACH algorithm under the condition that cluster heads are respectively selected by the HEED algorithm and the LEACH algorithm, dynamically select optional cluster heads in a cluster area for network transmission, and prolong the service life of the whole network. The transmission balance is obtained in the angles of the physical position and the logical position, the transmission efficiency of the network is improved, the service life of the cluster head node is prolonged, and the selection of the routing path is improved.
Drawings
The foregoing and other features of the present disclosure will become more apparent from the detailed description of the embodiments shown in conjunction with the drawings in which like reference characters designate the same or similar elements throughout the several views, and it is apparent that the drawings in the following description are merely some examples of the present disclosure and that other drawings may be derived therefrom by those skilled in the art without the benefit of any inventive faculty, and in which:
fig. 1 is a flowchart illustrating a method for dual cluster head communication in a wireless sensor network;
fig. 2 is a diagram of a wireless sensor network dual cluster head communication device.
Detailed Description
The conception, specific structure and technical effects of the present disclosure will be clearly and completely described below in conjunction with the embodiments and the accompanying drawings to fully understand the objects, aspects and effects of the present disclosure. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
Fig. 1 is a flowchart illustrating a wireless sensor network dual cluster head communication method according to the present disclosure, and a wireless sensor network dual cluster head communication method according to an embodiment of the present disclosure is described below with reference to fig. 1.
The utility model provides a wireless sensor network double cluster head communication method, which comprises the following steps:
step 1, initializing a sensor network;
step 2, dividing cluster regions according to an HEED algorithm and selecting a first cluster head node in each cluster region;
step 3, selecting a second cluster head node in each cluster area according to an LEACH algorithm in the cluster area;
step 4, initializing cluster areas of double cluster heads;
and 5, dynamically selecting the cluster head node to communicate with the sink node.
Further, in step 1, the method for initializing the sensor network includes that N common nodes with the same initial energy and ID numbers from 0 to N are randomly deployed in the monitoring area, and the sink node is deployed at a random point on the edge of the network.
Further, in step 2 or step 3, according to the HEED algorithm or according to the LEACH algorithm, after clustering is performed according to the HEED algorithm, cluster head nodes are selected in each cluster region, and according to the LEACH algorithm, cluster head nodes are selected in each cluster region without re-dividing the cluster region.
Further, in step 4, the method of initializing the cluster region of the dual cluster heads is that, first, the source node broadcasts to the surrounding cluster headsThe node and the sink node send information, and the time when the source node directly transmits to the sink node is T1The method comprises the steps that a source node sorts surrounding cluster head nodes from small to large according to ID serial numbers of the cluster head nodes, the sequence of forwarding information of the cluster head nodes is determined, delta is an artificially set propagation time interval, the default is 500 milliseconds, in order to avoid mutual interference and channel blockage when multiple cluster head nodes are simultaneously transmitted to a sink node, a time-sharing transmission method is adopted, and a first cluster head node sends information to the sink node after receiving source node information through the delta time interval; and after receiving the source node information, the second cluster head node sends the information to the sink node after 2 delta intervals, the source node directly sends the information to the sink node after 3 delta intervals, and all the nodes send the information to the sink node in sequence.
Further, in step 5, the method for dynamically selecting the cluster head node to communicate with the sink node is that, the times when the information of the first cluster head node, the second cluster head node and the source node reaches the sink node are respectively assumed to be T21，T22，T23The time when each cluster head node information reaches the sink node comprises path propagation time and node processing time, T21The time T when the information of the first cluster head node reaches the sink node22T is the time when the information of the second cluster head node reaches the sink node23When the information of the source node reaches the sink node, the time when the information reaches the sink node is expressed as follows:
T21＝T1+t1，T22＝T1+δ+t2，T23＝T1+2δ+t3，
in the formula, t1The difference between the time taken for the propagation path through the first cluster head node and the time taken for the direct propagation of the source node and the sink node, t2When the sink node receives the information of each cluster head node in sequence, the difference between the time taken by the second cluster head node to propagate the path and the time taken by the sink node to propagate directly is compared with the difference between the respective arrival times:
T22-T21＝δ+t2-t1the difference result is compared to δ:
while leaving the first cluster head node to continue the comparison: t is23-T21＝2δ+(t3-t1) The difference result obtained is compared with 2 δ:
and when the second cluster head node is left to continue comparison:
T23-T22＝δ+(t3-t2)，
the difference results obtained are compared with δ:
by analogy, comparing the previous receiving time with the subsequent receiving time until the cluster head node with the minimum delay time is found, namely dynamically selecting the cluster head node to communicate with the sink node, the formula is as follows:
T2p-T2q＝(p-q)δ+(tp-tq)，
the difference results obtained are compared with (p-q) δ:
after the sequential comparison is finished, selecting the node n with the minimum delay time0The sink node feeds back the selected result to the source node, so as to delay the node n of the time0And the cluster head nodes which are the best cooperative cluster head nodes cooperate as transmission paths to transmit data to the sink nodes.
An embodiment of the present disclosure provides a wireless sensor network dual-cluster-head communication device, as shown in fig. 2, which is a diagram of a wireless sensor network dual-cluster-head communication device according to the present disclosure, and a wireless sensor network dual-cluster-head communication device according to the embodiment includes: a processor, a memory and a computer program stored in the memory and executable on the processor, the processor implementing the steps in one of the above described wireless sensor network dual cluster head communication device embodiments when executing the computer program.
The device comprises: a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor executing the computer program to operate in the units of:
the network initialization unit is used for initializing the sensor network;
the first cluster head election unit is used for dividing cluster regions according to an HEED algorithm and electing first cluster head nodes in each cluster region;
the second cluster head election unit is used for electing a second cluster head node in each cluster area according to an LEACH algorithm in the cluster area;
a cluster area initialization unit for initializing a cluster area of a dual cluster head;
and the dynamic selection cluster head unit is used for dynamically selecting the cluster head nodes to communicate with the sink node.
The wireless sensor network double-cluster-head communication device can be operated in computing equipment such as desktop computers, notebooks, palm computers and cloud servers. The wireless sensor network dual-cluster-head communication device can be operated by a device comprising, but not limited to, a processor and a memory. Those skilled in the art will appreciate that the example is merely an example of a wireless sensor network dual cluster head communication device, and does not constitute a limitation of a wireless sensor network dual cluster head communication device, and may include more or less components than a proportion, or some components in combination, or different components, for example, the wireless sensor network dual cluster head communication device may further include an input-output device, a network access device, a bus, etc.
The Processor may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. The general purpose processor may be a microprocessor or the processor may be any conventional processor or the like, the processor is a control center of the wireless sensor network dual cluster head communication device operation device, and various interfaces and lines are used for connecting various parts of the whole wireless sensor network dual cluster head communication device operation device.
The memory may be used to store the computer programs and/or modules, and the processor may implement the various functions of the wireless sensor network dual cluster head communication device by running or executing the computer programs and/or modules stored in the memory and invoking the data stored in the memory. The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, a phonebook, etc.) created according to the use of the cellular phone, and the like. In addition, the memory may include high speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.
While the present disclosure has been described in considerable detail and with particular reference to a few illustrative embodiments thereof, it is not intended to be limited to any such details or embodiments or any particular embodiments, but it is to be construed as effectively covering the intended scope of the disclosure by providing a broad, potential interpretation of such claims in view of the prior art with reference to the appended claims. Furthermore, the foregoing describes the disclosure in terms of embodiments foreseen by the inventor for which an enabling description was available, notwithstanding that insubstantial modifications of the disclosure, not presently foreseen, may nonetheless represent equivalent modifications thereto.
Claims (5)
1. A wireless sensor network double-cluster-head communication method is characterized by comprising the following steps:
step 1, initializing a sensor network;
step 2, dividing cluster regions according to an HEED algorithm and selecting a first cluster head node in each cluster region;
step 3, selecting a second cluster head node in each cluster area according to an LEACH algorithm in the cluster area;
step 4, initializing cluster areas of double cluster heads;
step 5, dynamically selecting a cluster head node to communicate with a sink node;
the method for initializing the cluster area of the double cluster heads comprises the steps that firstly, a source node sends information to surrounding cluster head nodes and a sink node in a broadcasting mode, and the time when the source node directly transmits to the sink node is set as T1The method comprises the steps that a source node sorts surrounding cluster head nodes from small to large according to ID serial numbers of the cluster head nodes, the sequence of forwarding information of the cluster head nodes is determined, delta is an artificially set propagation time interval, the default is 500 milliseconds, in order to avoid mutual interference and channel blockage when multiple cluster head nodes are simultaneously transmitted to a sink node, a time-sharing transmission method is adopted, and a first cluster head node sends information to the sink node after receiving source node information through the delta time interval; and after receiving the source node information, the second cluster head node sends the information to the sink node after 2 delta intervals, the source node directly sends the information to the sink node after 3 delta intervals, and all the nodes send the information to the sink node in sequence.
2. The dual-cluster-head communication method of the wireless sensor network according to claim 1, wherein in step 1, the method for initializing the sensor network is that N common nodes with the same initial energy and ID numbers from 0 to N are randomly deployed in the monitoring area, and the sink node is deployed at a random point on the edge of the network.
3. The dual-cluster-head communication method of the wireless sensor network as claimed in claim 1, wherein in step 2 or step 3, after clustering according to the HEED algorithm, a first cluster head node is elected in each cluster region, and a second cluster head node is elected in each cluster region according to the LEACH algorithm without re-partitioning the cluster region.
4. The method of claim 1, wherein in step 5, the cluster nodes are dynamically selected to communicate with the sink node by assuming that the arrival time of the information of the first cluster node, the second cluster node and the source node at the sink node is T21，T22，T23The time when each cluster head node information reaches the sink node comprises path propagation time and node processing time, T21The time T when the information of the first cluster head node reaches the sink node22T is the time when the information of the second cluster head node reaches the sink node23When the information of the source node reaches the sink node, the time when the information reaches the sink node is expressed as follows:
T21＝T1+t1，T22＝T1+δ+t2，T23＝T1+2δ+t3，
in the formula, t1The difference between the time taken for the propagation path through the first cluster head node and the time taken for the direct propagation of the source node and the sink node, t2When the sink node receives the information of each cluster head node in sequence, the difference between the time taken by the second cluster head node to propagate the path and the time taken by the sink node to propagate directly is compared with the difference between the respective arrival times:
T22-T21＝δ+t2-t1the difference result is compared to δ:
while leaving the first cluster head node to continue the comparison: t is23-T21＝2δ+(t3-t1) The difference result obtained is compared with 2 δ:
and when the second cluster head node is left to continue comparison:
T23-T22＝δ+(t3-t2)，
the difference results obtained are compared with δ:
by analogy, comparing the previous receiving time with the subsequent receiving time until the cluster head node with the minimum delay time is found, namely dynamically selecting the cluster head node to communicate with the sink node, the formula is as follows:
T2p-T2q＝(p-q)δ+(tp-tq)，
the difference results obtained are compared with (p-q) δ:
after the sequential comparison is finished, selecting the node n with the minimum delay time0The sink node feeds back the selected result to the source node, so as to delay the node n of the time0And the cluster head nodes which are the best cooperative cluster head nodes cooperate as transmission paths to transmit data to the sink nodes.
5. A wireless sensor network dual-cluster-head communication device, the device comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor executing the computer program to operate in the units of:
the network initialization unit is used for initializing the sensor network;
the first cluster head election unit is used for dividing cluster regions according to an HEED algorithm and electing a first cluster head node in each cluster region;
the second cluster head election unit is used for electing a second cluster head node in each cluster area according to an LEACH algorithm in the cluster area;
a cluster area initialization unit for initializing a cluster area of a dual cluster head;
the dynamic selection cluster head unit is used for dynamically selecting cluster head nodes to communicate with the sink node;
the method for initializing the cluster area of the double cluster heads comprises the steps that firstly, a source node sends information to surrounding cluster head nodes and a sink node in a broadcasting mode, and the time when the source node directly transmits to the sink node is set as T1The method comprises the steps that a source node sorts surrounding cluster head nodes from small to large according to ID serial numbers of the cluster head nodes, the sequence of forwarding information of the cluster head nodes is determined, delta is an artificially set propagation time interval, the default is 500 milliseconds, in order to avoid mutual interference and channel blockage when multiple cluster head nodes are simultaneously transmitted to a sink node, a time-sharing transmission method is adopted, and a first cluster head node sends information to the sink node after receiving source node information through the delta time interval; and after receiving the source node information, the second cluster head node sends the information to the sink node after 2 delta intervals, the source node directly sends the information to the sink node after 3 delta intervals, and all the nodes send the information to the sink node in sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811584741.3A CN109495944B (en) | 2018-12-24 | 2018-12-24 | Wireless sensor network double-cluster-head communication method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811584741.3A CN109495944B (en) | 2018-12-24 | 2018-12-24 | Wireless sensor network double-cluster-head communication method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109495944A CN109495944A (en) | 2019-03-19 |
| CN109495944B true CN109495944B (en) | 2021-07-23 |
Family
ID=65711639
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811584741.3A Active CN109495944B (en) | 2018-12-24 | 2018-12-24 | Wireless sensor network double-cluster-head communication method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109495944B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114466081B (en) * | 2021-12-23 | 2024-04-12 | 东莞市李群自动化技术有限公司 | Method, system, equipment and storage medium for managing and controlling nodes of real-time channel group |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101616064A (en) * | 2008-06-24 | 2009-12-30 | 华为技术有限公司 | Data managing method, mesh network system and relevant apparatus |
| CN103269507A (en) * | 2013-03-05 | 2013-08-28 | 江苏科技大学 | Routing method of double-cluster head wireless sensor network |
| CN105744585A (en) * | 2016-04-08 | 2016-07-06 | 南京邮电大学 | Energy balancing routing computation method based on three-dimensional cube |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101681094B1 (en) * | 2010-06-29 | 2016-12-01 | 삼성전자주식회사 | Method and apparatus for controlling transmit power in wireless network |
-
2018
- 2018-12-24 CN CN201811584741.3A patent/CN109495944B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101616064A (en) * | 2008-06-24 | 2009-12-30 | 华为技术有限公司 | Data managing method, mesh network system and relevant apparatus |
| CN103269507A (en) * | 2013-03-05 | 2013-08-28 | 江苏科技大学 | Routing method of double-cluster head wireless sensor network |
| CN105744585A (en) * | 2016-04-08 | 2016-07-06 | 南京邮电大学 | Energy balancing routing computation method based on three-dimensional cube |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109495944A (en) | 2019-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10936533B2 (en) | GPU remote communication with triggered operations | |
| CN110275680B (en) | Double-control double-active storage system | |
| CN108509615B (en) | Consensus establishing method and device based on drawing mechanism and readable storage medium | |
| CN110730449B (en) | Wireless sensor network communication method and system based on multiple block chains | |
| CN104335273A (en) | Adjusting audio beamforming settings based on system state | |
| CN108540568A (en) | Computing capability sharing method and smart machine | |
| US11468329B2 (en) | Techniques to manage training or trained models for deep learning applications | |
| CN113656176B (en) | Cloud equipment distribution method, device and system, electronic equipment, medium and product | |
| CN109495944B (en) | Wireless sensor network double-cluster-head communication method and device | |
| CN108924203B (en) | Data copy self-adaptive distribution method, distributed computing system and related equipment | |
| CN111418187A (en) | Scalable statistics and analysis mechanism in cloud networks | |
| CN109451557B (en) | Dynamic clustering routing method and device for wireless sensor network | |
| CN116366565A (en) | Speed limiting mode switching method and device, electronic equipment and storage medium | |
| CN116185599A (en) | Heterogeneous server system and method of use thereof | |
| CN109495585B (en) | Hierarchical control method for edge network and cloud | |
| CN107329801A (en) | A kind of node administration method and device, many component servers | |
| CN107273187A (en) | Reading position acquisition methods and device, computer installation, readable storage medium storing program for executing | |
| CN111163485B (en) | Active sensing method and system for sensor network fault | |
| TWI827603B (en) | Systems and methods for designing a distributed mimo network | |
| CN104536926A (en) | Control method and device of serial devices | |
| US10628342B1 (en) | System and method for accelerating performance of non-volatile memory RAID stacks | |
| CN109005115B (en) | Intelligent topology method and device of distributed sensor network | |
| CN105939242B (en) | Realize the method and device of virtual system | |
| US11907591B1 (en) | Method and system for storage management, storage medium and device | |
| CN105183666A (en) | Scheduling control method, device and system |
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 |