CN105101233A - Construction and maintainence method of energy-saving wireless sensor network - Google Patents
Construction and maintainence method of energy-saving wireless sensor network Download PDFInfo
- Publication number
- CN105101233A CN105101233A CN201510560399.3A CN201510560399A CN105101233A CN 105101233 A CN105101233 A CN 105101233A CN 201510560399 A CN201510560399 A CN 201510560399A CN 105101233 A CN105101233 A CN 105101233A
- Authority
- CN
- China
- Prior art keywords
- node
- hypergraph
- wireless sensor
- energy saving
- saving type
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
- H04W52/0212—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave
- H04W52/0216—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave using a pre-established activity schedule, e.g. traffic indication frame
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a construction and maintainence method of an energy-saving wireless sensor network, and in particular relates to a construction method of an energy-saving wireless sensor network by use of a hypergraph theory. The construction and maintainence method comprises a graph theory, algorithm design, statistics and mathematical modeling and provides a new technology for the construction and optimization of the wireless sensor network.
Description
Technical field
The present invention relates to a kind of structure and maintaining method of energy saving type wireless sensor network, especially relate to a kind of building method utilizing the energy saving type wireless sensor network of Hypergraph Theory.This programme comprises graph theory, algorithm design, statistics and mathematical modeling, for the structure of wireless sensor network and optimization propose a kind of new technology.
Background technology
Wireless sensor network (WSN): WSN is a kind of distributed sensor networks, and its tip is can perception and the transducer checking the external world.Transducer in WSN wirelessly communicates, and therefore network settings are flexible, and device location can be changed fast, can also carry out the connection of wired mode or wireless mode with the Internet.
Hypergraph Theory: hypergraph is the extensive of common figure, the nodal point number that its limit (super limit) can comprise is no less than 2.Hypergraph be commonly defined as H=(V, E), wherein V is the set of all nodes, and E is the set on all super limits, and the element of E is the nonvoid subset of V; Have the hypergraph of weight to be defined as H=(V, E, w), the new parameter w added represents that each the super limit in hypergraph H has all been assigned with weight w.In addition, also have a kind of hypergraph type to be k average hypergraph, the size (being comprised nodal point number) that it is characterized by each the super limit in hypergraph is k.The object that hypergraph divides is, is the roughly equal part of k by the node division of hypergraph, and occurs that the situation that same hypergraph connects the node of multiple part is minimized.
Modularity: modularity is used to the structure weighing network, and the node contacts of this network internal of the higher explanation of modularity of a network is tightr.Correspondingly, these nodes are more sparse with the node contacts of other modules.Modularity is often used to the optimization strategy finding tectonic network.
Summary of the invention
The present invention mainly solves the deficiency existing for existing wireless sensor network formation scheme; Provide a kind of energy saving type wireless sensor network building method using hypergraph as theoretical foundation, from global planning's programming wireless sensing device topology of networks, each sensor node is dispatched, thus realize a kind of rational in infrastructure, the network topology structure of wireless sensor of energy consumption economizing type.Hypergraph Theory by reference, compensate for the defect of traditional simple graph in information display and partitioning algorithm, wireless sensor network is divided into multiple bunches by it, makes whole network topology structure have level, and the wireless sensor network of gained has the characteristic of high cohesion and low coupling.
Technical solution of the present invention is:
The structure of energy saving type wireless sensor network and a maintaining method,
By Hypergraph Theory being applied to the topological structure planning of global network, the topological structure of wireless sensor network being converted into hypergraph, and hypergraph division and cluster are carried out to it, completing the structure of high cohesion and low coupling;
The positional information of each sensor node is collected by navigation system, under the effect of navigation system, each node can receive a time point T, this means that they will send oneself positional information to navigation system simultaneously at time point T, thus realizes these positional informations roughly synchronous;
Realize optimization to sub-clustering by finding optimum modularity, these cocooning tools being divided out have the characteristic of high cohesion and low coupling, and therefore perform a random walk, its scope of activities is probably limited in one bunch, and occur across bunch possibility smaller;
Controlling whole network by minimizing the backbone network be made up of leader cluster node and base station, while they are responsible for communication, are also responsible for the connectedness of maintaining network, the network coverage and reduce the energy ezpenditure of whole wireless sensor network;
By reducing the energy ezpenditure of network to the scheduling of sensor nodes in wireless sensor network.Be in the unnecessary energy ezpenditure that dormant node can be avoided causing because of your idle listening, after them, the leader cluster node belonging to it waken up, thus enter operating state.The object introducing idle condition is, make the buffering of its process changed to operating state as sleep state, namely when an in running order node will be converted to sleep state, all are in dormant candidate node and will enter idle condition, then the leader cluster node belonging to them decides which candidate node final and enters operating state, and those do not have selected node will reenter sleep state;
By controlling to realize the power of communications of all sensor nodes to narrow down to and can communicate with its neighbor node farthest based on the power of RNG, thus under the prerequisite ensureing network connectivty, reduce the energy ezpenditure caused that communicates as far as possible.
The structure of a kind of energy saving type wireless sensor network utilizing Hypergraph Theory to realize and maintaining method, concrete constitution step is:
Step 1: a kind of structure of energy saving type wireless sensor network and the realization of maintaining method depend on the positional information that can obtain all sensor nodes, so need a navigation system to collect all node locations, and these information are stored among base station.The quantity of base station may more than one, but building method can only be run in a base station wherein, and other base station just stores the information identical with dominant base, as copy or the candidate of dominant base;
Step 2: dominant base sends a time point T to each node, this means that all sensor nodes will send oneself positional information to navigation system simultaneously at time point T, thus realizes these positional informations roughly synchronous;
Step 3: by controlling based on the power of RNG the power of communications regulating each node, power of communications is narrowed down to and can communicate with its neighbor node farthest, thus under the prerequisite ensureing network connectivty and coverage rate, reduce the energy ezpenditure caused that communicates as far as possible;
Step 4: sensor node is mapped to the summit in hypergraph, then forms super limit according to the type of sensor node image data, thus the data type that nodes all in a super limit gathers is identical, and each node has a neighbor node at least;
Step 5: be that weights are distributed on each super limit according to the quantity of super limit inner vertex;
Step 6: divide and cluster based on the hypergraph of Hypergraph Theory to wireless sensor network;
Step 7: select a bunch of head by Wc in each bunch, the expression formula of Wc is specially:
Wherein, Er is the dump energy of sensor node; Pc is when this node is chosen as leader cluster node, the power of the operation of this node; Pa is when this node is chosen as leader cluster node, the power summation of the operation of all nodes; Ct and Cp is the factor of Er/Pc and Pa respectively.
Step 8: sensor node is being slept, dispatched between free time and work three states, thus is avoiding unnecessary energy ezpenditure.During initialization, all nodes are in running order, and node is dispatched by affiliated leader cluster node, and the frequency of the image data of network coverage redundancy and sensor node considered wherein.So, if node need not work always or for current network coverage rate be redundancy, then this node will be scheduled to sleep state, and periodically wake image data up;
Step 9: when a node is about to be converted to sleep state from operating state, the leader cluster node belonging to this node will select suitable replacement node, and the state of these nodes is switched to idle condition from sleep state.A node is finally selected as replacing node to be needed to judge according to weights W, and weights W is calculated by node oneself, and its expression formula is specially:
Wherein, Er is the dump energy of sensor node; P is the power of communications of this node.
The segmentation utilizing Hypergraph Theory to realize and cluster, concrete constitution step is:
Step 1: hypergraph is iterated two points, ground, and each two points are all carried out according to multi-level hypergraph partitioning algorithm;
Step 2: multi-level hypergraph partitioning algorithm, primarily of three part compositions, is respectively alligatoring stage, initial division stage and elaboration phase;
Step 3: in the alligatoring stage, initial hypergraph carries out based on MHEC algorithm, and this algorithm is employed the whole process with the alligatoring stage, so hypergraph all can be carried out sub-clustering in each level in alligatoring stage;
Step 4: in the initial division stage, initial division is carried out on the hypergraph that coarsening rate is the highest.Its detailed process is, according to BFS algorithm search node from a node v at random, until the value that the ratio that the node searched accounts for whole hypergraph is ρ, ρ then adjusts between 0 to 100 according to actual conditions, its default value is 50;
Step 5: because initial division stage interior joint v is random selecting, so the result drawn is not necessarily optimum, and along with the continuous refinement of hypergraph, also can divide initial hypergraph and have impact, so preserve the best initial division of ten effects in the initial division stage, screen according to their respective effects in elaboration phase;
Step 6: individual node will be quoted at elaboration phase and move, its concrete meaning be by mobile initial division around node obtain optimum modularity Q, thus obtain optimum partition strategy.Calculate the △ Q value of the node near each cut-off rule, now the state of these nodes is what do not pin.The maximum node of mobile △ Q value is to other one side of cut-off rule, and the state arranging this node is what pin.Then upgrade the △ Q value of the node near all cut-off rules, repeat an operation, until the state of node near all cut-off rules be all pin or their △ Q value be all not more than 0.
After having built energy saving type wireless sensor network, node may leave, add network, also likely moves in a network, and therefore the parameter of node is dynamically changeable.Divide and cluster so need periodically to run hypergraph on dominant base, make the optimum structure continuous and effective of network.
Accompanying drawing explanation
Fig. 1 is the topological structure schematic diagram of wireless sensor network.
Fig. 2 is that the network simplified divides schematic flow sheet.
Fig. 3 is the hypergraph two points of schematic flow sheets simplified.
Fig. 4 is the false code schematic diagram of elaboration phase in hypergraph two points.
Fig. 5 is the schematic diagram of individual node movement.
Embodiment
Fig. 1 is the topological structure schematic diagram of wireless sensor network, and it comprises a base station 101 and some bunches 102 (1-3).Each bunch 102 (1-3) is by the sensor node 104 (1-3) of bunch 103 (1-3) and some, and 105 (1-4), 106 (1-3) forms.
Its concrete constitution step is:
Step 1: a kind of structure of energy saving type wireless sensor network and the realization of maintaining method depend on and can obtain all sensor nodes 103 (1-3), 104 (1-3), 105 (1-4), the positional information of 106 (1-3), so need a navigation system to collect all nodes 103 (1-3), 104 (1-3), 105 (1-4), 106 (1-3) position, and these information are stored among base station 101.The quantity of base station 101 may more than one, but building method can only be run in a base station 101 wherein, and other base station 101 just stores the information identical with dominant base, as copy or the candidate of dominant base 101;
Step 2: dominant base 101 sends a time point T to each node, this means all sensor nodes 103 (1-3), 104 (1-3), 105 (1-4), 106 (1-3) will send oneself positional information to navigation system simultaneously at time point T, thus realize these positional informations roughly synchronous;
Step 3: by controlling to regulate each node 103 (1-3) based on the power of RNG, 104 (1-3), 105 (1-4), the power of communications of 106 (1-3), power of communications is narrowed down to and can communicate with its neighbor node farthest, thus under the prerequisite ensureing network connectivty and coverage rate, reduce the energy ezpenditure caused that communicates as far as possible;
Step 4: by sensor node 103 (1-3), 104 (1-3), 105 (1-4), 106 (1-3) are mapped to the summit in hypergraph, then according to node 103 (1-3), and 104 (1-3), 105 (1-4), the type of 106 (1-3) image data forms super limit, thus the data type that nodes all in a super limit gathers is identical, and each node has a neighbor node at least;
Step 5: be that weights are distributed on each super limit according to the quantity of super limit inner vertex;
Step 6: divide and cluster based on the hypergraph of Hypergraph Theory to wireless sensor network, thus formed in a network multiple bunches 102 (1-3);
Step 7: select one bunch 103 (1-3) by Wc in each bunch 102 (1-3), the expression formula of Wc is specially:
Wherein, Er is the dump energy of sensor node; Pc is when this node is chosen as leader cluster node, the power of the operation of this node; Pa is when this node is chosen as leader cluster node, the power summation of the operation of all nodes; Ct and Cp is the factor of Er/Pc and Pa respectively.
Fig. 2 is that the network simplified divides schematic flow sheet, and it is shown by with the form of binary tree 201, and wherein original hypergraph 202 is by multi-level hypergraph partitioning algorithm two points iteratively.Original hypergraph 202 is divided into two parts 203 (1-2) by two, and these two parts 203 (1-2) are further divided into four parts 204 (1-4).So, division is carried out iteratively, until arrive the condition of certain setting.
Hypergraph divides and implements based on modularity, so iteration stops when meeting any one condition following:
Condition 1: optimum summit is found;
Condition 2: all summits finally all belong to one bunch.
Fig. 3 is the hypergraph two points of schematic flow sheets simplified, and it illustrates the three phases 301,302,303 that hypergraph divides.This three phases is respectively: alligatoring stage 301, initial division stage 302 and elaboration phase 303, and their concrete implementation is as follows:
Step 1: in the alligatoring stage 301, initial hypergraph carries out based on MHEC algorithm, and this algorithm is employed the whole process with the alligatoring stage, so hypergraph all can be carried out sub-clustering in each level in alligatoring stage;
Step 2: in the initial division stage 302, initial division 304 (1) is carried out on the hypergraph that coarsening rate is the highest.Its detailed process is, according to BFS algorithm search node from a node v at random, until the value that the ratio that the node searched accounts for whole hypergraph is ρ, ρ then adjusts between 0 to 100 according to actual conditions, its default value is 50;
Step 3: because initial division stage interior joint v is random selecting, so the result drawn is not necessarily optimum, and along with the continuous refinement of hypergraph, also can divide initial hypergraph and have impact, so preserve the best initial division of ten effects in the initial division stage, screen according to their respective effects in elaboration phase 303;
Step 4: individual node will be quoted at elaboration phase 303 and move, its concrete meaning be by mobile initial division around node obtain optimum modularity Q, thus obtain optimum partition strategy.Calculate the △ Q value of the node near each cut-off rule, now the state of these nodes is what do not pin.The maximum node of mobile △ Q value is to other one side of cut-off rule, and the state arranging this node is what pin.Then upgrade the △ Q value of the node near all cut-off rules, repeat an operation, until the state of node near all cut-off rules be all pin or their △ Q value be all not more than 0.
Fig. 4 is the false code schematic diagram of elaboration phase in hypergraph two points, wherein calculates and upgrade △ Q will play vital effect in the algorithm.In fact, △ Q completes in subrange, so may not have what impact to the value of Q to the movement of individual node.A given node v, then have expression formula △ Qv=△ T-△ ED, wherein △ ED can be obtained by the weight computing on the super limit belonging to same bunch, and △ T represents the degree of coupling of bunch.
Fig. 5 is the schematic diagram of individual node movement.
A given division, hypergraph partitioning is super limit E1501 and super limit E2502 by it, and summit B503 belongs to first part, and other summits 504,505,506 belong to the second part.If say that summit A504 and summit B505 moves to Part I, super limit E1501 will be no longer divided, and super limit E2502 is by divided.Correspondingly, Q value will change, but if only move a node A504, Q value can not change.
There are two possible states on super limit around cut-off rule, is respectively stable state and critical condition.Before summit A504 is moved, super limit E1501 belongs to stable state, and after moving summit A504 and summit C505, super limit E2502 belongs to connection status.Therefore, the value of △ Q can be obtained by calculating the super limit being in critical condition, by calculating to the summit in same super limit the value upgrading △ Q.
Claims (14)
1. the structure of energy saving type wireless sensor network and a maintaining method, is characterized in that:
By building a navigation system, monitor the positional information of each sensor node;
By Hypergraph Theory, wireless sensor network is divided and cluster;
The object of power control is reached by the through-put power adjusting each sensor node;
By bunch head belonging to node, the state of sensor node is dispatched, thus reach the object of conserve energy.
2. the structure of energy saving type wireless sensor network according to claim 1 and maintaining method, is characterized in that: by building a navigation system, monitor the positional information of each sensor node,
This navigation system for each sensor node provide place information inquiry mechanism, so base station, leader cluster node and other ordinary nodes can obtain the positional information of each node in network at any time.
3. the structure of energy saving type wireless sensor network according to claim 1 and maintaining method, is characterized in that:
Each sensor node, by four part compositions, is respectively sensing module, processing module, energy module and communication module;
Between sensor node, in processing speed and memory capacity, difference is huge, so those processing speeds are fast, the node that memory capacity is large more likely becomes leader cluster node.
4. the structure of energy saving type wireless sensor network according to claim 1 and maintaining method, is characterized in that:
This wireless sensor network is isomery, and between node, in hardware aspect and operational environment, all likely difference is huge;
Wireless sensor network is after division and cluster, and it will by one or more base station, the leader cluster node of some and other general sensor nodes composition.
5. the structure of energy saving type wireless sensor network according to claim 1 and maintaining method, is characterized in that: reach by the through-put power adjusting each sensor node the object that power controls,
Reduce the power of communications of each sensor node, until it can communicate with from oneself neighbor node farthest, therefore while reduction sensor node power of communications, also ensure that connectedness and the coverage of network.
6. the structure of energy saving type wireless sensor network according to claim 1 and maintaining method, is characterized in that: by bunch head belonging to node, dispatch the state of sensor node, thus reach the object of conserve energy,
The node state scheduling of sensor node can make node state in sleep, periodically switch between work and free time;
Sleep state enables node avoid because of the waste of idle listening for energy;
Idle condition, as a buffering, especially when multiple node will switch to the candidate of dormant node as one simultaneously, so can avoid the energy loss because multiple node repeated work causes.
7. the structure of energy saving type wireless sensor network according to claim 4 and maintaining method, is characterized in that: base station and leader cluster node,
They all have vital effect in the network architecture, and wherein, the positional information of all the sensors node is preserved in base station, and leader cluster node be from each be divided out based on Hypergraph Theory bunch choose;
When there is multiple base station in sensor network, only have a base station to serve as the role of generating network framework, although and other nodes also preserve the positional information of nodes, they are just as the candidate of this base station.
8. the structure of energy saving type wireless sensor network according to claim 7 and maintaining method, is characterized in that: based on division and the cluster of Hypergraph Theory,
Hypergraph partitioning can be divided into three phases, is respectively the alligatoring stage, initial division stage and elaboration phase;
Hypergraph partitioning is iterated execution, thus constantly carries out two points to network, until reach modularity optimum;
Cluster is performed in the alligatoring stage of hypergraph partitioning, and each sensor node is fused to a bunch the inside by MHEC algorithm by it.
9. the structure of energy saving type wireless sensor network according to claim 8 and maintaining method, is characterized in that:
The size of modularity illustrates the cohesion of bunch;
By finding optimum modularity, just can search out the optimal dividing number k based on Hypergraph Theory automatically, thus avoid the artificial work calculating optimal dividing number.
10. the structure of energy saving type wireless sensor network according to claim 8 and maintaining method, is characterized in that: based on division and the cluster of Hypergraph Theory,
The selection of bunch head obtains based on the weights Wc of sensor node, and the expression formula of Wc is specially:
Wherein, Er is the dump energy of sensor node; Pc is when this node is chosen as leader cluster node, the power of the operation of this node; Pa is when this node is chosen as leader cluster node, the power summation of the operation of all nodes; Ct and Cp is the factor of Er/Pc and Pa respectively.
The structure of 11. energy saving type wireless sensor networks according to claim 8 and maintaining method, is characterized in that: the alligatoring stage that hypergraph divides,
Can generate a hypergraph sequence by MHEC algorithm iteration in the alligatoring stage, the coarsening rate of hypergraph is constantly in increasing trend in the sequence.
The structure of 12. energy saving type wireless sensor networks according to claim 8 and maintaining method, is characterized in that: the initial division stage that hypergraph divides,
The initial division stage is divided into two steps to complete, one, by BFS algorithm search node from a node v at random, until the ratio that the node searched accounts for whole hypergraph is ρ;
Its two, retain ten and divide the best partition strategy of effect, to select final partition strategy at elaboration phase.
The structure of 13. energy saving type wireless sensor networks according to claim 8 and maintaining method, is characterized in that: hypergraph divides,
The elaboration phase that hypergraph divides comprises single node and moves, and its object is to the value being increased modularity Q by mobile node near cut-off rule, thus reaches the object obtaining optimum modularity.
The structure of 14. energy saving type wireless sensor networks according to claim 12 and maintaining method, is characterized in that: the elaboration phase that hypergraph divides,
Elaboration phase is made up of three parts, one, and calculate the Δ Q value of the node near each cut-off rule, now the state of these nodes is what do not pin;
Its two, other to cut-off rule of the maximum node of mobile Δ Q value, and the state arranging this node is what pin;
Its three, upgrade the Δ Q value of the node near all cut-off rules, then repeat second step operation, until the state of node near all cut-off rules be all pinning or their Δ Q value be all not more than 0.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510560399.3A CN105101233A (en) | 2015-09-02 | 2015-09-02 | Construction and maintainence method of energy-saving wireless sensor network |
| PCT/CN2015/089234 WO2017035853A1 (en) | 2015-09-02 | 2015-09-09 | Method for constructing and maintaining energy-saving wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510560399.3A CN105101233A (en) | 2015-09-02 | 2015-09-02 | Construction and maintainence method of energy-saving wireless sensor network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105101233A true CN105101233A (en) | 2015-11-25 |
Family
ID=54580552
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510560399.3A Pending CN105101233A (en) | 2015-09-02 | 2015-09-02 | Construction and maintainence method of energy-saving wireless sensor network |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN105101233A (en) |
| WO (1) | WO2017035853A1 (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106209390A (en) * | 2016-06-30 | 2016-12-07 | 武汉大学深圳研究院 | Network device management and power-economizing method and resource management apparatus, route energy saver |
| CN109633532A (en) * | 2018-12-21 | 2019-04-16 | 青岛安然物联网科技有限公司 | A kind of wireless beacon positioning system and its localization method |
| CN111800751A (en) * | 2020-05-13 | 2020-10-20 | 江苏华东新能源勘探有限公司（江苏省有色金属华东地质勘查局八一三队） | Groundwater quality of water monitored control system |
| CN111836282A (en) * | 2020-06-28 | 2020-10-27 | 中南大学 | Three-dimensional WSN node scheduling method and storage medium |
| CN112188518A (en) * | 2020-09-07 | 2021-01-05 | 北京燧昀科技有限公司 | Sensor node communication optimization method and device and readable storage medium |
| CN113567910A (en) * | 2021-07-22 | 2021-10-29 | 青岛安然物联网科技有限公司 | Wireless beacon positioning system and positioning method thereof |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110645988B (en) * | 2019-10-11 | 2023-08-29 | 广州大学 | Unmanned aerial vehicle path planning method based on optimal service life |
| US11057818B1 (en) * | 2020-01-07 | 2021-07-06 | Rockwell Collins, Inc. | Stealth position-location information for high value nodes |
| CN111698656B (en) * | 2020-05-21 | 2023-02-07 | 江苏海洋大学 | Multi-target dynamic scheduling method for underwater mobile wireless sensor network |
| CN112055322B (en) * | 2020-08-04 | 2022-08-23 | 江苏海洋大学 | Underwater wireless sensor network scheduling optimization method based on interval multi-target |
| CN113472573B (en) * | 2021-06-30 | 2022-06-28 | 三峡大学 | High-dimensional multi-objective collaborative optimization method for wireless sensor network resource scheduling |
| CN116232921B (en) * | 2023-05-08 | 2023-09-12 | 中国电信股份有限公司四川分公司 | Deterministic network data set construction device and method based on hypergraph |
| CN116600366B (en) * | 2023-06-02 | 2023-10-27 | 中国通信建设第三工程局有限公司 | Data acquisition method and system based on wireless communication network |
| CN116456372B (en) * | 2023-06-12 | 2023-08-11 | 合肥工业大学 | Wireless monitoring network scheduling method and system based on dynamic reduction policy space |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103701647B (en) * | 2013-12-31 | 2016-08-31 | 武汉大学 | A kind of wireless network topology optimization generates method |
-
2015
- 2015-09-02 CN CN201510560399.3A patent/CN105101233A/en active Pending
- 2015-09-09 WO PCT/CN2015/089234 patent/WO2017035853A1/en active Application Filing
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106209390A (en) * | 2016-06-30 | 2016-12-07 | 武汉大学深圳研究院 | Network device management and power-economizing method and resource management apparatus, route energy saver |
| CN106209390B (en) * | 2016-06-30 | 2021-04-13 | 武汉大学深圳研究院 | Network equipment management and energy-saving method, resource management device and routing energy-saving device thereof |
| CN109633532A (en) * | 2018-12-21 | 2019-04-16 | 青岛安然物联网科技有限公司 | A kind of wireless beacon positioning system and its localization method |
| CN111800751A (en) * | 2020-05-13 | 2020-10-20 | 江苏华东新能源勘探有限公司（江苏省有色金属华东地质勘查局八一三队） | Groundwater quality of water monitored control system |
| CN111800751B (en) * | 2020-05-13 | 2023-06-02 | 江苏华东新能源勘探有限公司（江苏省有色金属华东地质勘查局八一三队） | Groundwater quality of water monitored control system |
| CN111836282A (en) * | 2020-06-28 | 2020-10-27 | 中南大学 | Three-dimensional WSN node scheduling method and storage medium |
| CN112188518A (en) * | 2020-09-07 | 2021-01-05 | 北京燧昀科技有限公司 | Sensor node communication optimization method and device and readable storage medium |
| CN112188518B (en) * | 2020-09-07 | 2024-02-13 | 北京燧昀科技有限公司 | Sensor node communication optimization method and device and readable storage medium |
| CN113567910A (en) * | 2021-07-22 | 2021-10-29 | 青岛安然物联网科技有限公司 | Wireless beacon positioning system and positioning method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2017035853A1 (en) | 2017-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105101233A (en) | Construction and maintainence method of energy-saving wireless sensor network | |
| Cui et al. | Optimal LEACH protocol with modified bat algorithm for big data sensing systems in Internet of Things | |
| Wang et al. | A PSO based energy efficient coverage control algorithm for wireless sensor networks. | |
| Shi et al. | Exploring connected dominating sets in energy harvest networks | |
| EP3441920A1 (en) | Operation planning system, operation planning device and operation planning method | |
| CN103269507A (en) | Routing method of double-cluster head wireless sensor network | |
| Esnaashari et al. | Deployment of a mobile wireless sensor network with k-coverage constraint: a cellular learning automata approach | |
| CN110351754A (en) | Industry internet machinery equipment user data based on Q-learning calculates unloading decision-making technique | |
| CN105228159B (en) | Wireless sense network coverage enhancement algorithm based on gridding and improvement particle swarm algorithm | |
| CN106026084B (en) | A kind of AGC power dynamic allocation methods based on virtual power generation clan | |
| CN104537178A (en) | Electric power system joint simulation modeling method based on Matlab and Netlogo | |
| Manzoor et al. | Enhanced TL-LEACH routing protocol for large-scale WSN applications | |
| John et al. | Energy saving cluster head selection in wireless sensor networks for internet of things applications | |
| CN103746384A (en) | Electrical load dispatching control method and system thereof | |
| CN113110057A (en) | Heating power station energy-saving control method based on artificial intelligence and intelligent decision system | |
| CN106451415A (en) | Microgrid power transaction system based on distributed coordination method | |
| CN103702384B (en) | Application-oriented clustering routing method of wireless sensor network | |
| Abbasi et al. | Online server and workload management for joint optimization of electricity cost and carbon footprint across data centers | |
| Zhang et al. | Clustering model based on node local density load balancing of wireless sensor network | |
| CN103701647A (en) | Wireless network topology optimizing and generating method | |
| CN103987102A (en) | Topology control method of underwater wireless sensor network based on non-cooperative game | |
| CN103596203B (en) | Local self-maintenance wireless sensor network energy-saving clustering topology control method | |
| Alvarado-Alcon et al. | Carbon Footprint vs Energy Optimization in IoT Network Deployments | |
| CN110867902A (en) | Power generation prediction-based micro-grid distributed power supply de-centering optimized operation method | |
| CN108683599A (en) | One kind determining method and system based on pretreated distribution network max-flow |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| AD01 | Patent right deemed abandoned | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20190628 |