CN102413509A - Construction method of time-delay-constrained energy consumption balance data acquisition tree in WSN (Wireless Sensor Network) - Google Patents
Construction method of time-delay-constrained energy consumption balance data acquisition tree in WSN (Wireless Sensor Network) Download PDFInfo
- Publication number
- CN102413509A CN102413509A CN2011103531437A CN201110353143A CN102413509A CN 102413509 A CN102413509 A CN 102413509A CN 2011103531437 A CN2011103531437 A CN 2011103531437A CN 201110353143 A CN201110353143 A CN 201110353143A CN 102413509 A CN102413509 A CN 102413509A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- energy consumption
- tree
- topology
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a construction method of a time-delay-constrained energy consumption balance data acquisition tree in a WSN (Wireless Sensor Network). The construction method comprises the following steps: a data sink node calculates a weight of a node pair subjected to symmetrical network communication according to network topology information; the data sink node calculates shortest weighted paths from all nodes in the network to the data sink node, wherein a set of the shortest weighted paths forms a minimum weighted energy consumption generation tree; finding out the nodes in the minimum weighted energy consumption generation tree, which do not meet network time-delay limit, and calculating a corresponding topology adjusting scheme for each node as a candidate topology adjusting scheme; finding out one scheme with minimum adjustment on node transmission power from all the candidate topology adjusting schemes, and reconstructing the generation tree; and judging whether the nodes which do not meet hop count limit exist in the network, if so, continuously adjusting, and if not, ending the algorithm, wherein the generated generation tree is the final network topology result. According to the construction method disclosed by the invention, data effectiveness requirement is met, and energy consumptions of the nodes in the network are balanced.
Description
Technical field
The present invention relates to the radio sensing network technical field, particularly relate to the limited energy consumption balance data acquisition of the time delay tree constructing method among a kind of WSN.
Background technology
The Self-organizing Communication Networks that wireless sensor network intelligent node limited by significant amount of energy, that possess data acquisition process ability and wireless communication ability constitutes.Wireless sensor network is applicable in application scenarioss such as fire supervision, disaster alarm and uses; And the time delay that these application targets are often collected data have must demand; Data must be sent to the convergence node in an official hour; The freshness that could keep data makes the convergence node to make timely reliable treatment to the information in the network.Because of the wireless sensor network node energy constraint, so how to reduce the network energy consumption, prolong the network work time again, effectively accomplish the data acquisition task simultaneously, be subject under discussion important in the wireless sensor network always.
Data acquisition is the main target that wireless sense network is laid, and the difference according to the corresponding topological structure of algorithm can be divided into three types:
One is based on the topology constructing of clustering architecture; Two are based on the topology constructing of chain structure; Three are based on the topology constructing of tree structure.In the tree topology structure, all nodes are the root node structure of tree with the convergence node, and each node is allocated to leaf node, roles such as via node.Each node has and only has a fixed path to lead to the convergence node.Because the uniqueness in path, so in case topology is established, the path is just established.
In fact, from the design feature angle of network, network topology can be more general is divided into mesh topology and two kinds of forms of tree topology.In the cancellated topology, for the source node in the network, the Path selection of multiple arrival convergence node can be arranged, its transmission path possesses not uniqueness, and this kind situation is prone to cause occur in the network route loop, route cavity etc.And the node in the network need be according to the situation of current network, sends the control information of pathfinding, though that network seems is more flexible, the MAC layer that it attracts is congested, and problems such as collision solve also thorny relatively.And after the tree network struction, can confirm that arbitrary node is to the route of convergence node in the network, network topology is stablized easy to control.Therefore the tree network has great using value at the sensing netting index in gathering, in occupation of independence and important position.That but existing tree network is not time delay is limited, the tree topology of energy consumption balance, so has Communication Jamming between each node, even can not accurately be sent to the convergence node to information, and network lifecycle is shorter.
Summary of the invention
Technical problem to be solved by this invention provides the limited energy consumption balance data acquisition of the time delay tree constructing method among a kind of WSN, is implemented in when minimizing network gross energy cost, satisfies the effective requirement of data, node energy consumption in the equalizing network.
The technical solution adopted for the present invention to solve the technical problems is: the tree constructing method of the limited energy consumption balance data acquisition of time delay among a kind of WSN is provided, may further comprise the steps:
(1) the convergence node is according to the network topological information that has obtained, and calculating can be carried out the right weights of symmetrical network nodes in communication;
(2) the convergence node uses the solving the shortest path algorithm, in the computing network all nodes to the shortest weight path of convergence node, all the set of short weight path promptly constitute the minimum weight energy consumption and generate and set;
(3) find out the minimum weight energy consumption and generate the node that does not satisfy the network delay restriction in the tree, and each this category node is calculated a corresponding topological adjustment scheme, as candidate's topology adjustment scheme;
(4) find out in all candidate topology adjustment scheme the minimum scheme of node transmitting power adjustment, carry out reconstruct generating tree;
(5) judge in the network whether still have the node that does not satisfy jumping limit, then return step (3) if exist, if do not exist, then algorithm stops, and this moment, corresponding generation tree promptly was final network topology result.
When calculating the right weights of symmetrical network communication node, using residue energy of node, the euclidean distance between node pair information constructing variable as the limit weights in the said step (1), is that target make up to total energy consumption with the maximization node life-span to minimize node.
All nodes are to the shortest weight path of convergence node in the middle convergence node use of said step (2) the dijkstra's algorithm computing network.
The node that when calculating topological adjustment scheme, is not only satisfying the network delay restriction in the said step (3) is adjusted to the shortest path between the convergence node.
When calculating a corresponding topological adjustment scheme in the said step (3), with two factors of present load amount of the adjusted limit of node weights amplification and node as index.
Beneficial effect
Owing to adopted above-mentioned technical scheme; The present invention compared with prior art; Have following advantage and good effect: the present invention is applicable to all node periodic report data application of converging (being called for short Sink) node towards forms data; Use the mode simplified characterization data transmission delay of jumping figure, simultaneously the right dump energy characteristic of node is considered that this provides simple and reliable evaluation criteria for the actual enforcement of algorithm.This method is to generate on the basis of tree in the minimum weight energy consumption simultaneously, carries out topology reconstruction with the mode of least energy consumption increment, can keep the low energy consumption characteristic of overall situation topology all the time as possible.The present invention is centralized topological construction method, and especially for the bigger network scenarios of node layout density, this method more can be brought into play the characteristics of its equalizing network energy consumption.
Description of drawings
Fig. 1 is a flow chart of the present invention;
Fig. 2 is a network design situation sketch map;
Fig. 3 is candidate's topology adjustment scheme sketch map.
Embodiment
Below in conjunction with specific embodiment, further set forth the present invention.Should be understood that these embodiment only to be used to the present invention is described and be not used in the restriction scope of the present invention.Should be understood that in addition those skilled in the art can do various changes or modification to the present invention after the content of having read the present invention's instruction, these equivalent form of values fall within the application's appended claims institute restricted portion equally.
Execution mode of the present invention relates to the limited energy consumption balance data acquisition of the time delay tree constructing method among a kind of WSN; The non-fused data that this method is adapted in the wireless sensor network converges application; The low-power consumption sensor network that can be used for the zonule yardstick; Also can expand the sensor network that the high speed that is used for big regional scale is mixed with low-power consumption, also be suitable for simultaneously and the M2M application down of these two kinds of yardsticks.This method is the tree network topology of root through making up with the aggregation node; Data packet transmission path in the planning network; Thereby save the energy of sensor node to greatest extent, the equalizing network energy consumption reduces internodal Communication Jamming; When promptly and accurately being sent to aggregation node to information, reach the purpose that prolongs network lifecycle.Its concrete steps are as shown in Figure 1.
With single Sink convergence type network is example, and the Sink node location can be in the edge or the center of network, and is as shown in Figure 2 when the Sink node is in network edge, and each node periodically produces data in the network, and data transmit with nonfused mode.Sensor node adjustable power in the network has the qualification of maximum transmission power.
Before network topology is set up; Each node has an ID who pre-sets number in the network, supposes convergence node in the network, is called for short the Sink node; Known in advance the positional information of other nodes in the network; Each node primary power is identical in the network, and node attaches the current remaining information of self in the frame payload in uploading the process of data.Every operation a period of time of network, is carried out reconstruct to network topology, and issues the whole network according to the whole network energy information of collecting by the Sink node.
In the present embodiment topological initialization is made up the Sink node enforcement behavior of period and topology reconstruction period and describe, this moment, the Sink node existed with centralized Control Node form, and whole enforcement behavior comprises four parts:
1) make up initial topology: the Sink node is created the set of arrays intersection, comprises S set, null set H
T+1Being used for storage networking middle distance Sink node jumping figure is the node of T+1, and null set A is used to store the candidate and adjusts node; Null set P={P
i| i ∈ S}, wherein P
iRepresent the node set of i sensor node unit of transfer data to the required process of Sink; Set L={L
i| i ∈ S}, wherein L
iRepresent the load of i sensor node, neighbor node collection F={f
i| i ∈ S}, wherein f
iIt is neighbours' set of i sensor node.
If comprised above-mentioned aggregate information in the Sink node memory; Explain that the current period is the topology reconstruction stage; The Sink node has obtained the position and the energy information of node in the network in the process of data acquisition, this moment, the current set of arrays intersection that has existed capable of using need not be created again; If no above-mentioned aggregate information in the Sink node memory explains that then the current period is that topological initialization makes up the period, need to create above-mentioned set of arrays intersection, and know each node location coordinate in the network with the mode of active flooded broadcast.
After obtaining position and energy information; Must upgrade neighbor node collection F, the while defines its corresponding sides weights for
and is:
E wherein
i, e
jThe dump energy of representing node i, j respectively, W
I, jThe expression node i, the weights of communication link that j constitutes are called for short the limit weights;
The expression node i, the α power of distance between the j; α is a constant, and value is 2.
e
I, jActual is assessment to current link health degree.Use dijkstra's algorithm based on this weights, all nodes upgrade set P and set L to the shortest weight path of Sink in the computing network, all the set of short weight path promptly be the initial topology of network, correspond to the minimum weight energy consumption and generate and set.
2) calculate topological adjustment scheme: find out the minimum weight energy consumption and generate the node that does not satisfy the restriction of network hop number in the tree, record set H
T+1In, and each this category node calculated a corresponding topological adjustment scheme, as candidate's topology adjustment scheme; If H
T+1Be sky, then jump to step 4).
In conjunction with Fig. 3, concrete topological adjustment scheme is described below:
To each node that need adjust, only to the least energy consumption path of Sink, adjust at it, establishing needs the node of adjustment to be m, right
As satisfy h
i>=3, then find out i at P
mOn adjacent node j and k, be stored among the corresponding set of node the adjusted f, wherein j is the father node of i, k is the father node of j, storage format does<i, j, k>When satisfying d
I, k＜d
ComThe time (d
ComBe node maximum communication radius), calculate
Δlp
i＝l(i)×ΔW
ΔW＝W
i，k-W
i，j-W
j，k
Δ W is the variation of the local topology adjustment back corresponding sides weights of node i; L (i) representes the flow load of node i, equals whole child node numbers of node i; Δ lp
iThe product of load and the change of corresponding sides weights on the expression node i.
Path m is gone up all can adjust its corresponding LP={ Δ lp of node calculating
p| p ∈ P
i, minimum delta lp corresponding nodes is right among the taking-up set LP, and it is right to adjust node as the candidate, stores in the set A.
When the preferred version of finding out the node that does not satisfy network delay restriction, with the jumping figure of this nodal distance Sink node simple and easy appraisal procedure as time delay, and with this building network time delay standard.
This shows that the preferred version of calculated candidate topology adjustment scheme is mainly considered two factors: a) the adjusted limit of node weights amplification in this step; B) the present load amount of node.These two factor actings in conjunction, the weights index of formation candidate topology adjustment scheme.
3) topology reconstruction: find out in the set A node transmitting power is adjusted minimum scheme, carry out reconstruct, upgrade simultaneously and gather P, L, empty set H to generating tree
T+1, f, LP, A, return step 2);
4) topology issue: the Sink node can be inferred the final topology of network according to the final set P that obtains, and outwards issues with the form of multicast or clean culture.
The present invention is from energy efficient, and the energy consumption balance self adaptation topology constructing algorithm that the limited angle of time delay produced under the data cases whole node cycle is studied, and it is limited to have proposed a time delay, and the sensing netting index of energy consumption balance is according to gathering tree constructing method.This method is that parameter makes up the weights function with the dump energy and the euclidean distance between node pair of node at first, uses dijkstra's algorithm to calculate a minimum weight energy consumption then and generates tree.On this basis, along minimum-weight path, set the local adjustment that circulates to generating.This shows that the present invention is applicable to that high speed, low-power consumption sensing net mixing application scene and the corresponding M2M of whole node cycles generation data use, can be when satisfying delay requirement, the equalizing network energy consumption.
Claims (5)
1. the limited energy consumption balance data acquisition of the time delay tree constructing method among the WSN is characterized in that, may further comprise the steps:
(1) the convergence node is according to the network topological information that has obtained, and calculating can be carried out the right weights of symmetrical network nodes in communication;
(2) the convergence node uses the solving the shortest path algorithm, in the computing network all nodes to the shortest weight path of convergence node, all the set of short weight path promptly constitute the minimum weight energy consumption and generate and set;
(3) find out the minimum weight energy consumption and generate the node that does not satisfy the network delay restriction in the tree, and each this category node is calculated a corresponding topological adjustment scheme, as candidate's topology adjustment scheme;
(4) find out in all candidate topology adjustment scheme the minimum scheme of node transmitting power adjustment, carry out reconstruct generating tree;
(5) judge in the network whether still have the node that does not satisfy jumping limit, then return step (3) if exist, if do not exist, then algorithm stops, and this moment, corresponding generation tree promptly was final network topology result.
2. the limited energy consumption balance data acquisition of the time delay tree constructing method among the WSN according to claim 1; It is characterized in that; In the said step (1) when calculating the right weights of symmetrical network communication node; Using residue energy of node, the euclidean distance between node pair information constructing variable as the limit weights, is that target make up to total energy consumption with the maximization node life-span to minimize node.
3. the limited energy consumption balance data acquisition of the time delay tree constructing method among the WSN according to claim 1; It is characterized in that all nodes are to the shortest weight path of convergence node in the middle convergence node use of said step (2) the dijkstra's algorithm computing network.
4. the limited energy consumption balance data acquisition of the time delay tree constructing method among the WSN according to claim 1; It is characterized in that, when calculating topological adjustment scheme, only do not satisfying the node of network delay restriction in the said step (3) and to the shortest path between the convergence node, adjusting.
5. the limited energy consumption balance data acquisition of the time delay tree constructing method among the WSN according to claim 1; It is characterized in that; When calculating a corresponding topological adjustment scheme in the said step (3), with two factors of present load amount of the adjusted limit of node weights amplification and node as index.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103531437A CN102413509A (en) | 2011-11-09 | 2011-11-09 | Construction method of time-delay-constrained energy consumption balance data acquisition tree in WSN (Wireless Sensor Network) |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103531437A CN102413509A (en) | 2011-11-09 | 2011-11-09 | Construction method of time-delay-constrained energy consumption balance data acquisition tree in WSN (Wireless Sensor Network) |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102413509A true CN102413509A (en) | 2012-04-11 |
Family
ID=45915281
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011103531437A Pending CN102413509A (en) | 2011-11-09 | 2011-11-09 | Construction method of time-delay-constrained energy consumption balance data acquisition tree in WSN (Wireless Sensor Network) |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102413509A (en) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102665253A (en) * | 2012-04-20 | 2012-09-12 | 山东大学 | Event detection method on basis of wireless sensor network |
| CN102781063A (en) * | 2012-08-03 | 2012-11-14 | 武汉科技大学 | Method for establishing WSN (wireless sensor network) energy equalizing routing based on local network betweenness |
| CN103096412A (en) * | 2013-01-10 | 2013-05-08 | 上海交通大学 | Data fusion method with time delay restriction in delay tolerant network |
| CN103209452A (en) * | 2013-01-06 | 2013-07-17 | 南昌大学 | Wireless-route-oriented optimal selection method for Dijkstra and power-efficient gathering in sensor (PEGASISI) distance defining |
| CN103516792A (en) * | 2013-09-16 | 2014-01-15 | 合肥工业大学 | Data deploying method based on network delay, network transmission energy consumption and server energy consumption |
| CN103744399A (en) * | 2014-01-10 | 2014-04-23 | 上海交通大学 | Dynamic network control method used for vehicle participatory sensing system |
| CN105376157A (en) * | 2015-11-22 | 2016-03-02 | 东北大学 | Method and device for routing path selection |
| CN103701705B (en) * | 2013-12-20 | 2017-02-22 | 河海大学常州校区 | Mobile sink data acquisition method based on binary tree inquiry in wireless sensor network |
| CN106507426A (en) * | 2016-11-23 | 2017-03-15 | 西安电子科技大学 | A kind of new energy consumption sensor network topological evolution method in a balanced way |
| CN107040961A (en) * | 2017-06-15 | 2017-08-11 | 吉林大学 | A kind of wireless sensor network jamming control method |
| CN107241746A (en) * | 2017-07-04 | 2017-10-10 | 中国联合网络通信集团有限公司 | The equalization methods and device of sensor node dump energy in sensor network |
| CN109388490A (en) * | 2017-08-07 | 2019-02-26 | 杭州华为数字技术有限公司 | A kind of memory allocation method and server |
| WO2019100355A1 (en) * | 2017-11-25 | 2019-05-31 | 华为技术有限公司 | Network stream transmission control method, and relevant apparatus and device |
| CN109889440A (en) * | 2019-02-20 | 2019-06-14 | 哈尔滨工程大学 | A kind of correcting and eleting codes failure node reconstruct routing resource based on maximum spanning tree |
| CN109889376A (en) * | 2019-01-28 | 2019-06-14 | 东莞理工学院 | A kind of network topology generation method of equilibrium |
| CN111050375A (en) * | 2019-11-08 | 2020-04-21 | 中国电子科技集团公司第三十研究所 | High real-time data broadcast distribution method for wireless self-organizing network |
| CN111241348A (en) * | 2019-12-31 | 2020-06-05 | 浙江华云信息科技有限公司 | Method for dynamically adjusting Tree spacing based on Walker's Tree |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101562862A (en) * | 2009-05-15 | 2009-10-21 | 湖南大学 | Routing method for balancing energy of wireless sensor network |
| CN101715243A (en) * | 2009-10-21 | 2010-05-26 | 南京邮电大学 | Wireless sensor network hierarchical cluster-based routing method |
-
2011
- 2011-11-09 CN CN2011103531437A patent/CN102413509A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101562862A (en) * | 2009-05-15 | 2009-10-21 | 湖南大学 | Routing method for balancing energy of wireless sensor network |
| CN101715243A (en) * | 2009-10-21 | 2010-05-26 | 南京邮电大学 | Wireless sensor network hierarchical cluster-based routing method |
Non-Patent Citations (1)
| Title |
|---|
| 张帅等: "《时延受限能耗均衡的无线传感网数据采集树》", 《计算机工程与应用》 * |
Cited By (33)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102665253B (en) * | 2012-04-20 | 2014-08-06 | 山东大学 | Event detection method on basis of wireless sensor network |
| CN102665253A (en) * | 2012-04-20 | 2012-09-12 | 山东大学 | Event detection method on basis of wireless sensor network |
| CN102781063A (en) * | 2012-08-03 | 2012-11-14 | 武汉科技大学 | Method for establishing WSN (wireless sensor network) energy equalizing routing based on local network betweenness |
| CN102781063B (en) * | 2012-08-03 | 2014-08-13 | 武汉科技大学 | Method for establishing WSN (wireless sensor network) energy equalizing routing based on local network betweenness |
| CN103209452A (en) * | 2013-01-06 | 2013-07-17 | 南昌大学 | Wireless-route-oriented optimal selection method for Dijkstra and power-efficient gathering in sensor (PEGASISI) distance defining |
| CN103096412A (en) * | 2013-01-10 | 2013-05-08 | 上海交通大学 | Data fusion method with time delay restriction in delay tolerant network |
| CN103096412B (en) * | 2013-01-10 | 2015-07-01 | 上海交通大学 | Data fusion method with time delay restriction in delay tolerant network |
| CN103516792A (en) * | 2013-09-16 | 2014-01-15 | 合肥工业大学 | Data deploying method based on network delay, network transmission energy consumption and server energy consumption |
| CN103516792B (en) * | 2013-09-16 | 2016-08-24 | 合肥工业大学 | A kind of based on network delay, network transmission energy consumption and the data deployment method of server energy consumption |
| CN103701705B (en) * | 2013-12-20 | 2017-02-22 | 河海大学常州校区 | Mobile sink data acquisition method based on binary tree inquiry in wireless sensor network |
| CN103744399A (en) * | 2014-01-10 | 2014-04-23 | 上海交通大学 | Dynamic network control method used for vehicle participatory sensing system |
| CN103744399B (en) * | 2014-01-10 | 2016-01-06 | 上海交通大学 | Dynamic network control method in a kind of vehicle participatory sensory perceptual system |
| CN105376157B (en) * | 2015-11-22 | 2018-06-26 | 东北大学 | A kind of method and apparatus of routed path selection |
| CN105376157A (en) * | 2015-11-22 | 2016-03-02 | 东北大学 | Method and device for routing path selection |
| CN106507426A (en) * | 2016-11-23 | 2017-03-15 | 西安电子科技大学 | A kind of new energy consumption sensor network topological evolution method in a balanced way |
| CN106507426B (en) * | 2016-11-23 | 2019-10-25 | 西安电子科技大学 | A kind of sensor network topological evolution method of novel energy consumption balance |
| CN107040961A (en) * | 2017-06-15 | 2017-08-11 | 吉林大学 | A kind of wireless sensor network jamming control method |
| CN107241746B (en) * | 2017-07-04 | 2020-03-13 | 中国联合网络通信集团有限公司 | Method and device for balancing residual energy of sensor nodes in sensor network |
| CN107241746A (en) * | 2017-07-04 | 2017-10-10 | 中国联合网络通信集团有限公司 | The equalization methods and device of sensor node dump energy in sensor network |
| CN109388490A (en) * | 2017-08-07 | 2019-02-26 | 杭州华为数字技术有限公司 | A kind of memory allocation method and server |
| US11042412B2 (en) | 2017-08-07 | 2021-06-22 | Huawei Technologies Co., Ltd. | Memory allocation method and server |
| CN109388490B (en) * | 2017-08-07 | 2020-11-17 | 华为技术有限公司 | Memory allocation method and server |
| WO2019100355A1 (en) * | 2017-11-25 | 2019-05-31 | 华为技术有限公司 | Network stream transmission control method, and relevant apparatus and device |
| CN111373697A (en) * | 2017-11-25 | 2020-07-03 | 华为技术有限公司 | Network stream transmission control method and related device and equipment |
| CN111373697B (en) * | 2017-11-25 | 2021-10-22 | 华为技术有限公司 | Network stream transmission control method and related device and equipment |
| CN109889376A (en) * | 2019-01-28 | 2019-06-14 | 东莞理工学院 | A kind of network topology generation method of equilibrium |
| CN109889376B (en) * | 2019-01-28 | 2021-12-31 | 东莞理工学院 | Balanced network topology generation method |
| CN109889440B (en) * | 2019-02-20 | 2021-02-02 | 哈尔滨工程大学 | Erasure code failure node reconstruction path selection method based on maximum spanning tree |
| CN109889440A (en) * | 2019-02-20 | 2019-06-14 | 哈尔滨工程大学 | A kind of correcting and eleting codes failure node reconstruct routing resource based on maximum spanning tree |
| CN111050375A (en) * | 2019-11-08 | 2020-04-21 | 中国电子科技集团公司第三十研究所 | High real-time data broadcast distribution method for wireless self-organizing network |
| CN111050375B (en) * | 2019-11-08 | 2022-03-18 | 中国电子科技集团公司第三十研究所 | High real-time data broadcast distribution method for wireless self-organizing network |
| CN111241348A (en) * | 2019-12-31 | 2020-06-05 | 浙江华云信息科技有限公司 | Method for dynamically adjusting Tree spacing based on Walker's Tree |
| CN111241348B (en) * | 2019-12-31 | 2024-03-01 | 浙江华云信息科技有限公司 | Method for dynamically adjusting Tree spacing based on Walker's Tree |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102413509A (en) | Construction method of time-delay-constrained energy consumption balance data acquisition tree in WSN (Wireless Sensor Network) | |
| Zhang et al. | A novel multicast routing method with minimum transmission for WSN of cloud computing service | |
| US9647942B2 (en) | Content centric and load-balancing aware dynamic data aggregation | |
| Chen et al. | A scalable context-aware objective function (SCAOF) of routing protocol for agricultural low-power and lossy networks (RPAL) | |
| CN102158938B (en) | Power-adjustable zonal sensor network topology control method | |
| CN105959987A (en) | Data fusion algorithm for improving energy utilization rate and service performance of wireless sensor network | |
| CN103228023A (en) | Wireless sensor network clustering routing method based on particle swarm optimization and ant colony optimization | |
| CN103200616A (en) | Energy-saving deployment method of building internet of things network model | |
| CN106102075A (en) | The cluster-dividing method divided based on hierarchical region in radio sensing network and system | |
| CN103686922A (en) | Optimization method for survival time of multi-Sink-node movement wireless sensor network | |
| CN105246097A (en) | Lifetime optimization method of mobile Sink-based wireless sensor network | |
| Yang et al. | Path planning of unmanned aerial vehicles for farmland information monitoring based on WSN | |
| Moghadam et al. | Multi-class multipath routing protocol for low power wireless networks with heuristic optimal load distribution | |
| Abusaimeh et al. | Energy-aware optimization of the number of clusters and cluster-heads in wsn | |
| Erim et al. | Optimized mobility models for disaster recovery using UAVs | |
| Sivakumar et al. | Cluster-Factors of Mobile Sensor Network Technology for Security Enhanced PEGASIS. | |
| CN103179631B (en) | A kind of choose the method that optimal angle carries out sub-clustering | |
| CN103228020A (en) | Mobile ad-hoc network routing system and method based on intelligent water drop | |
| Raghunandan et al. | Hierarchical agglomerative clustering based routing algorithm for overall efficiency of wireless sensor network | |
| Ahir et al. | Energy efficient clustering algorithm for data aggregation in wireless sensor network | |
| Kumar et al. | Cross-Layer based Energy Efficient Wireless Sensor Network for Large Farms. | |
| Matsuura | New routing framework for RPL: Constructing power-efficient wireless sensor network | |
| Pitchai et al. | Game theoretical computation based energy efficient routing for wireless sensor networks | |
| Ramanan et al. | Sparse Long Short-Term Memory Approach for Energy-Efficient Adaptive Cluster Fuzzy-based Controller in Wireless Sensor Network | |
| Meka et al. | ROMAN: routing and opportunistic management of airborne networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120411 |