CN106412935B - A kind of network topology structure method for building up based on Complex Networks Theory - Google Patents
A kind of network topology structure method for building up based on Complex Networks Theory Download PDFInfo
- Publication number
- CN106412935B CN106412935B CN201610974871.2A CN201610974871A CN106412935B CN 106412935 B CN106412935 B CN 106412935B CN 201610974871 A CN201610974871 A CN 201610974871A CN 106412935 B CN106412935 B CN 106412935B
- Authority
- CN
- China
- Prior art keywords
- node
- sink
- ordinary
- ordinary node
- select probability
- 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
- 238000000034 method Methods 0.000 title claims abstract description 17
- 238000004891 communication Methods 0.000 claims abstract description 33
- 238000005265 energy consumption Methods 0.000 description 6
- 230000005540 biological transmission Effects 0.000 description 4
- 238000011160 research Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 238000003012 network analysis Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000000306 recurrent effect Effects 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
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
- 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 kind of network topology structure method for building up based on Complex Networks Theory, comprising: 1, find all ordinary nodes of the sink node in self communication radius and calculate its select probability；2, several maximum ordinary nodes of select probability value are connected with sink node from the select probability of ordinary node, form initial primary topology；3, pre-add ingress is selected, in the communication radius for finding pre-add ingress, and all ordinary nodes in initial primary topology is existed simultaneously, calculates its select probability；4, the maximum ordinary node of select probability value is connected with pre-add ingress from the select probability of ordinary node, forms updated topological structure；5, using updated topological structure as initial primary topology, and return step 3 executes, until whole ordinary nodes are added in the topological structure of wireless sensor network.The present invention can establish a kind of energy efficient network topology structure, to extend the capacity usage ratio and Network morals for improving node.
Description
Technical field
The invention belongs to fields of communication technology, and in particular to a kind of wireless sensor network based on Complex Networks Theory is opened up
Flutter structure method for building up.
Background technique
Wireless sensor network is a kind of self-organizing being made of sink node and a large amount of sensor node, distributed
Network system can be used for the fields such as military surveillance, environment measuring, medical monitoring, urban traffic control, warehousing management.Sensor
The volume of node is small, is generally battery powered, and the energy for causing it to carry is very limited, while sensor node is often by cloth
It sets in rugged environment or no man's land, is difficult to replace node after sensor node energy consumption, thus save
Point is easy to cause to fail because of depleted of energy and environmental disruption.Wireless sensor network is related to multidisciplinary height intersection, current
It is concerned in the world, how to construct network topology structure, improve the fault-tolerance and life cycle of network, be always the heat of research
Point.
Due to the topological structure of wireless sensor network and the similitude of complex network, many researchs divide complex network
Analysis method is applied in network topology structure of wireless sensor.When Barabasi et al. studies WWW topological structure
It was found that power law distribution is obeyed in node degree (connection number) distribution, i.e., node only a small number of possesses extremely more connections in network, mostly
Several sections of points only have minimal amount of connection, and this characteristic for being referred to as uncalibrated visual servo has very strong fault-tolerance to random fault, sees text
Barabasi A L, Albert R.Emergence of Scaling in Random Networks [J] .Science is offered,
1999,286(5439):509-512；On this basis, Jian et al. constructs energy efficient wireless sensor network topology
Structure, the probability that the node being newly added is connected with node already existing in network is other than depending on the degree of node, also
Dump energy including node is shown in document JianY, Liu E, WangY, et al.Scale-free model for
wireless sensor networks[J].2013:2329-2332；Peng et al. gives the wireless biography based on complex network
Sensor network cluster dividing scheme combines the characteristic of sensor network while schemes synthesis considers the degree and dump energy of node,
The capacity usage ratio of node is further increased, Network morals are improved, sees document Peng H, Si S, Shen X S,
et al.Energy-efficient and scalable clustering scheme for wireless sensor
networks[C].International Conference on Wireless Communications&Signal
Processing.IEEE,2015。
For constructing the topological structure of wireless sensor network, the existing research method based on complex network can be effective
Ground improves the capacity usage ratio of node, but in the distant scene of distance between sensor node, energy consumption due to
Becoming larger for data transmission distance sharply increases, and the life cycle of node can greatly shorten, and existing research approach is in this scene
Lower effect is no longer obvious.
Summary of the invention
The present invention is the shortcoming overcome in the presence of the above-mentioned prior art, is proposed a kind of based on Complex Networks Theory
Network topology structure method for building up, the wireless sensor network to establish energy efficient in the case of a kind of telecommunication are opened up
Structure is flutterred, to improve the capacity usage ratio and Network morals of node.
In order to achieve the above objectives, the technical solution adopted by the present invention are as follows:
A kind of the characteristics of network topology structure method for building up based on Complex Networks Theory of the invention, is applied to by one
In the wireless sensor network that sink node and the ordinary node of N number of random distribution are constituted, with the wireless sensor network
Any one vertex of boundary rectangle is established as origin O, two sides adjacent with the origin O respectively as X-axis and Y-axis
Coordinate system XOY；The network topology structure method for building up is to carry out as follows:
Step 1, the coordinate position according to the sink node in the coordinate system XOY find the sink node and exist
All n ordinary nodes in self communication radius, and any i-th in sink node communication radius is calculated using formula (1)
The select probability ∏ of a ordinary nodei-sink, to obtain the select probability { ∏ of n ordinary node1-sink,П2-sink...,
∏i-sink..., ∏n-sink}:
In formula (1), EjIndicate the residual energy of any j-th ordinary node of the sink node in self communication radius
Amount；EiIndicate the dump energy of any i-th ordinary node of the sink node in self communication radius；DjIndicate any
J-th of ordinary node is at a distance from the coordinate position of the sink node；DiIndicate any i-th of ordinary node and the sink
The distance of the coordinate position of node；A and b respectively indicates the weight of dump energy and distance, and has a+b=1；1≤i≤n < N, 1
≤ j≤n < N；
Step 2, from the select probability { ∏ of the n ordinary node1-sink,∏2-sink..., ∏i-sink..., Пn-sink}
Ordinary node corresponding to the middle maximum preceding m select probability of select probability value is attached with the sink node, thus shape
At initial primary topology；
Step 3 randomly chooses first of ordinary node in the initial primary topology, in first of ordinary node
Select any k-th of ordinary node as pre-add ingress in communication radius, in the communication radius for finding the pre-add ingress,
And all s ordinary nodes in the initial primary topology are existed simultaneously, and obtain the logical of pre-add ingress using formula (2)
Believe the select probability ∏ of c-th of ordinary node in radiusk-c, to obtain the select probability { ∏ of s ordinary nodek-1,
∏k-2..., ∏k-c..., ∏k-s}:
In formula (2), EfIn the communication radius for indicating the pre-add ingress, and exist simultaneously in the initial primary topology
In any f-th of ordinary node dump energy；EcIndicate that the s node in self communication radius, and exists simultaneously
The dump energy of any c-th of ordinary node in the initial primary topology；DfIndicate any f-th of ordinary node and institute
State the distance of the coordinate position of pre-add ingress；DcIndicate the coordinate bit of any c-th of ordinary node Yu the pre-add ingress
The distance set；dfIndicate the degree of any f-th of ordinary node；dcIndicate the degree of any c-th of ordinary node；A ', b ' and c ' are respectively
It indicates dump energy, the weight away from divergence factor, and has+c '=1 a '+b '；1≤k≤N-m, 1≤s≤m, 1≤l≤m, 1≤c≤
S, 1≤f≤s；
Step 4, from the select probability { ∏ of the s ordinary nodek-1,∏k-2..., ∏k-c..., ∏k-sIn selection most
Ordinary node corresponding to greatest is connected with the pre-add ingress, to form updated topological structure；
Step 5, using the updated topological structure as initial primary topology, and m value increase by 1 after, return step 3
It executes, until N number of ordinary node is added in the topological structure of wireless sensor network.
Compared with the prior art, the invention has the advantages that:
1, the present invention is based on BA models, have comprehensively considered wireless sensor network during natural increase and optimum selecting
Node communication radius is limited, and suitable for the foundation of wireless sensor topological structure, and section can be improved in the characteristics such as energy constraint
The capacity usage ratio and Network morals of point.
2, the select probability formula that the present invention provides joined distance factor, in the identical feelings of other conditions when node connects
Preferentially selection avoids node energy because the increase of communication distance consumes excessively, therefore can apart from relatively closer node under condition
With larger for node communication radius, apart from farther away scene.
3, it the invention belongs to self-organizing network, realizes that simple and effect is obvious, can be used for military surveillance, environment measuring, doctor
Treat the building of the dual-use sensor networks such as monitoring, urban traffic control, warehousing management.
Detailed description of the invention
Fig. 1 is network topology structure Establishing process figure of the invention；
Fig. 2 is that network development process schematic diagram is added in pre-add ingress of the invention.
Specific embodiment
In the present embodiment, a kind of network topology structure method for building up based on Complex Networks Theory is applied to by one
In the wireless sensor network that sink node and the ordinary node of N number of random distribution are constituted, to the ordinary node of N number of random distribution
Number, label is from 1,2 ..., N, and the primary power of ordinary node is E, with any one of the boundary rectangle of wireless sensor network
Coordinate system XOY is established respectively as X-axis and Y-axis as origin O, two sides adjacent with origin O in a vertex；Referring to Fig. 1, net
Network topological structure method for building up is to carry out as follows:
Step 1, the coordinate position according to sink node in coordinate system XOY find sink node in self communication radius
Interior all n ordinary nodes, node of the sink node into communication radius send a small request signal, receive and ask
Ask the ordinary node of signal that itself number, dump energy, co-ordinate position information are sent to sink node by feedback signal,
Sink node is ranked up ordinary node according to the size of number from small to large, and is calculated using formula (1) and led in sink node
Believe the select probability ∏ of any i-th of ordinary node in radiusi-sink, to obtain the select probability of n ordinary node
{∏1-sink,∏2-sink..., ∏i-sink..., Пn-sink}:
In formula (1), EjIndicate the dump energy of any j-th ordinary node of the sink node in self communication radius；Ei
Indicate the dump energy of any i-th ordinary node of the sink node in self communication radius；DjIndicate any j-th it is common
Node at a distance from the coordinate position of sink node；DiIndicate the coordinate position of any i-th of ordinary node and sink node
Distance；A and b respectively indicates the weight of dump energy and distance, and has a+b=1；1≤i≤n < N, 1≤j≤n < N；It utilizes
The transmission energy consumption for calculating separately node of formula (1-1) and formula (1-2) and reception energy consumption:
ERx(K)=KEelec (1-2)
In formula (1-1) and formula (1-2), K indicates bit number, EelecIndication circuit energy consumption, εfsAnd εmpRespectively indicate two kinds
Amplifier energy consumption under mode.
Step 2, from the select probability { ∏ of n ordinary node1-sink,∏2-sink..., ∏i-sink..., ∏n-sinkIn choosing
It selects ordinary node corresponding to the maximum preceding m select probability of probability value to be attached with sink node, initially be opened up to be formed
Flutter structure；
Step 3, referring to fig. 2, initial primary topology is formed by numbering the ordinary node for being 2,16,22, according to number by small
Sort to big sequence, first of ordinary node randomly choosed in initial primary topology, l is equal to 1 herein, selection it is common
Node is the ordinary node that number is equal to 2, and any k-th of ordinary node is selected to make in the communication radius of first of ordinary node
For pre-add ingress, k is equal to 2 herein, and pre-add ingress is the node that number is 23, finds the communication radius of pre-add ingress
It is interior, and all s ordinary nodes in initial primary topology are existed simultaneously, refer herein to two common sections that number is 2,16
Point, and utilize the select probability ∏ of c-th of ordinary node in the communication radius of formula (2) acquisition pre-add ingressk-c, to obtain s
Select probability { the ∏ of a ordinary nodek-1,∏k-2..., Πk-c..., ∏k-s}:
In formula (2), EfIn the communication radius for indicating pre-add ingress, and exist simultaneously any in initial primary topology
The dump energy of f-th of ordinary node；EcS node of expression exists simultaneously in self communication radius in initial topology knot
The dump energy of any c-th of ordinary node in structure；DfIndicate the coordinate bit of any f-th of ordinary node and pre-add ingress
The distance set；DcIndicate any c-th of ordinary node at a distance from the coordinate position of pre-add ingress；dfIndicate any f-th it is general
The degree of logical node；dcIndicate the degree of any c-th of ordinary node；A ', b ' and c ' respectively indicate dump energy, the power away from divergence factor
Weight, and have+c '=1 a '+b '；1≤k≤N-m, 1≤s≤m, 1≤l≤m, 1≤c≤s, 1≤f≤s；
Step 4, from the select probability { ∏ of s ordinary nodek-1,∏k-2..., ∏k-c..., Пk-sIn selection it is most general
Ordinary node corresponding to rate value is connected with pre-add ingress, to form updated topological structure；
Step 5, using updated topological structure as initial primary topology, the value of m increases by 1, and return step 3 executes,
Until N number of ordinary node is added in the topological structure of wireless sensor network；
Primary network topological structure is established after completion, merges the transmission stage into data collection, each connection number is big
Ordinary node in 1 distributes time slot for all ordinary nodes being attached as pre-add ingress with it, and sensor node is adopted
The data collected are eventually sent to sink node by data fusion in the form of multi-hop, to the data of transmission in need all arrive
Up to after sink node, all connections are disconnected, recurrent network topological structure establishment process carries out network reconfiguration, maximizes and extends
Network lifecycle.
Claims (1)
1. a kind of network topology structure method for building up based on Complex Networks Theory, it is characterized in that being applied to by a sink node
In the wireless sensor network constituted with the ordinary node of N number of random distribution, with the boundary rectangle of the wireless sensor network
Any one vertex as origin O, coordinate system is established respectively as X-axis and Y-axis in two sides adjacent with the origin O
XOY；The network topology structure method for building up is to carry out as follows:
Step 1, the coordinate position according to the sink node in the coordinate system XOY find the sink node at itself
All n ordinary nodes in communication radius, and any i-th for utilizing formula (1) to calculate in sink node communication radius is general
The select probability ∏ of logical nodei-sink, to obtain the select probability { ∏ of n ordinary node1-sink,∏2-sink...,
∏i-sink..., ∏n-sink}:
In formula (1), EjIndicate the dump energy of any j-th ordinary node of the sink node in self communication radius；Ei
Indicate the dump energy of any i-th ordinary node of the sink node in self communication radius；DjIt indicates any j-th
Ordinary node is at a distance from the coordinate position of the sink node；DiIndicate any i-th of ordinary node and the sink node
Coordinate position distance；A and b respectively indicates the weight of dump energy and distance, and has a+b=1；1≤i≤n < N, 1≤j
≤ n < N；
Step 2, from the select probability { ∏ of the n ordinary node1-sink,∏2-sink..., ∏i-sink..., ∏n-sinkIn choosing
It selects ordinary node corresponding to the maximum preceding m select probability of probability value to be attached with the sink node, to be formed just
Beginning topological structure；
Step 3 randomly chooses first of ordinary node in the initial primary topology, in the communication of first of ordinary node
Select any k-th of ordinary node as pre-add ingress in radius, in the communication radius for finding the pre-add ingress, and it is same
When be present in all s ordinary nodes in the initial primary topology, and the communication half of pre-add ingress is obtained using formula (2)
The select probability ∏ of c-th of ordinary node in diameterk-c, to obtain the select probability { Π of s ordinary nodek-1,∏k-2...,
∏k-c..., ∏k-s}:
In formula (2), EfIn the communication radius for indicating the pre-add ingress, and exist simultaneously in the initial primary topology
The dump energy of any f-th of ordinary node；EcIndicate that the s node in self communication radius, and is existed simultaneously in institute
State the dump energy of any c-th of ordinary node in initial primary topology；DfIndicate any f-th of ordinary node with it is described pre-
The distance of the coordinate position of node is added；DcIndicate the coordinate position of any c-th of ordinary node and the pre-add ingress
Distance；dfIndicate the degree of any f-th of ordinary node；dcIndicate the degree of any c-th of ordinary node；A ', b ' and c ' are respectively indicated
Dump energy, the weight away from divergence factor, and have+c '=1 a '+b '；1≤k≤N-m, 1≤s≤m, 1≤l≤m, 1≤c≤s, 1≤
f≤s；
Step 4, from the select probability { П of the s ordinary nodek-1,Пk-2..., Пk-c..., Пk-sIn selection it is most general
Ordinary node corresponding to rate value is connected with the pre-add ingress, to form updated topological structure；
Step 5, using the updated topological structure as initial primary topology, and m value increase by 1 after, return step 3 is held
Row, until N number of ordinary node is added in the topological structure of wireless sensor network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610974871.2A CN106412935B (en) | 2016-11-07 | 2016-11-07 | A kind of network topology structure method for building up based on Complex Networks Theory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610974871.2A CN106412935B (en) | 2016-11-07 | 2016-11-07 | A kind of network topology structure method for building up based on Complex Networks Theory |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106412935A CN106412935A (en) | 2017-02-15 |
| CN106412935B true CN106412935B (en) | 2019-07-19 |
Family
ID=58014972
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610974871.2A Active CN106412935B (en) | 2016-11-07 | 2016-11-07 | A kind of network topology structure method for building up based on Complex Networks Theory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106412935B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109803291B (en) * | 2018-12-25 | 2023-06-20 | 天津大学 | Robust topology generation method based on underwater acoustic sensor network |
| CN112434437B (en) * | 2020-12-02 | 2023-08-25 | 大连大学 | Method for constructing equipment support super-network dynamic evolution model by considering node recombination |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7555951B2 (en) * | 2006-05-24 | 2009-07-07 | Honeywell International Inc. | Determination of remaining useful life of gas turbine blade |
| CN102123473A (en) * | 2011-01-06 | 2011-07-13 | 山东大学 | Dynamic clustering mechanism-based target tracking method for wireless sensor network |
| CN102185916A (en) * | 2011-04-27 | 2011-09-14 | 西安电子科技大学 | Method for establishing sensor network with small world and scale-free properties |
| CN102970723A (en) * | 2012-10-26 | 2013-03-13 | 合肥工业大学 | Non-uniform clustering routing algorithm with local cluster reconstruction |
| CN103078793A (en) * | 2012-12-27 | 2013-05-01 | 河海大学 | Improved directed diffusion routing protocol based on network coding |
| CN104994020A (en) * | 2015-05-06 | 2015-10-21 | 天津理工大学 | Predictive energy-efficient clustering routing method based on bee colony optimization algorithm model |
-
2016
- 2016-11-07 CN CN201610974871.2A patent/CN106412935B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7555951B2 (en) * | 2006-05-24 | 2009-07-07 | Honeywell International Inc. | Determination of remaining useful life of gas turbine blade |
| CN102123473A (en) * | 2011-01-06 | 2011-07-13 | 山东大学 | Dynamic clustering mechanism-based target tracking method for wireless sensor network |
| CN102185916A (en) * | 2011-04-27 | 2011-09-14 | 西安电子科技大学 | Method for establishing sensor network with small world and scale-free properties |
| CN102970723A (en) * | 2012-10-26 | 2013-03-13 | 合肥工业大学 | Non-uniform clustering routing algorithm with local cluster reconstruction |
| CN103078793A (en) * | 2012-12-27 | 2013-05-01 | 河海大学 | Improved directed diffusion routing protocol based on network coding |
| CN104994020A (en) * | 2015-05-06 | 2015-10-21 | 天津理工大学 | Predictive energy-efficient clustering routing method based on bee colony optimization algorithm model |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106412935A (en) | 2017-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106304234A (en) | A kind of wireless sensor network energy consumption optimization method based on clustering routing agreement | |
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| Li et al. | An adaptive clustering algorithm based on improved particle swarm optimisation in wireless sensor networks | |
| CN104284386A (en) | Vertex-betweenness-based cluster head selection method in wireless sensor networks | |
| CN104411000A (en) | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network | |
| John et al. | Energy saving cluster head selection in wireless sensor networks for internet of things applications | |
| CN107969008B (en) | Centralized routing calculation method for software defined sensor network | |
| Chaudhary et al. | Review paper on energy-efficient protocols in wireless sensor networks | |
| CN106412935B (en) | A kind of network topology structure method for building up based on Complex Networks Theory | |
| Mehta et al. | A comparative analysis of energy efficient hierarchical routing protocols for wireless sensor networks | |
| Chen et al. | A clustering protocol for wireless sensor networks based on energy potential field | |
| CN105392176B (en) | A kind of calculation method of actuator node executive capability | |
| CN105682170A (en) | Clustering-type wireless sensor network data collection method based on energy consumption balance | |
| Delavar et al. | CRCWSN: Presenting a routing algorithm by using re-clustering to reduce energy consumption in WSN | |
| CN104768124B (en) | The wireless sensor network routing method of sub-clustering and data fusion is clustered based on double cluster heads | |
| CN104065580A (en) | M2M network topology control method and system | |
| Liu et al. | Correlation-model-based data aggregation in wireless sensor networks | |
| Kumar et al. | Improved data gathering protocol for WSN | |
| Bhavana et al. | Spatial correlation based clustering algorithm for random and uniform topology in WSNs | |
| Jain et al. | Performance analysis of hierarchical agglomerative clustering in a wireless sensor network using quantitative data | |
| CN105722173A (en) | Large-scale WSNs topology control method based on two-way attraction mechanism | |
| Ren | Massive Collaborative Wireless Sensor Network Structure Based on Cloud Computing. | |
| Xiong et al. | Fault-tolerant topology evolution and analysis of sensing systems in IoT based on complex networks | |
| Yadav et al. | Cluster based routing schemes in wireless sensor networks: A comparative study | |
| Uikey et al. | Zigbee cluster tree performance improvement technique |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220117 Address after: 230001 floor 6, block B, blue diamond Shangjie, No. 335, Suixi Road, Bozhou road street, Luyang District, Hefei City, Anhui Province Patentee after: Hefei Luyang Technology Innovation Group Co.,Ltd. Address before: Tunxi road in Baohe District of Hefei city of Anhui Province, No. 193 230009 Patentee before: Hefei University of Technology |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220915 Address after: Huangshan Future Science and Technology City, No. 59, Meilin Avenue, Huangshan High-tech Industrial Development Zone, Huangshan City, Anhui Province, 245000 Patentee after: Huangshan Science and Technology Innovation Center Co.,Ltd. Address before: 230001 floor 6, block B, blue diamond Shangjie, No. 335, Suixi Road, Bozhou road street, Luyang District, Hefei City, Anhui Province Patentee before: Hefei Luyang Technology Innovation Group Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230324 Address after: 230001 Gujing Baihua mansion, 156 Shou Chun Road, Hefei, Anhui Patentee after: HEFEI HUIZHONG INTELLECTUAL PROPERTY MANAGEMENT Co.,Ltd. Address before: Huangshan Future Science and Technology City, No. 59, Meilin Avenue, Huangshan High-tech Industrial Development Zone, Huangshan City, Anhui Province, 245000 Patentee before: Huangshan Science and Technology Innovation Center Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230831 Address after: 230001 floor 6, block B, blue diamond Shangjie, No. 335, Suixi Road, Bozhou road street, Luyang District, Hefei City, Anhui Province Patentee after: Hefei Luyang Technology Innovation Group Co.,Ltd. Address before: 230001 Gujing Baihua mansion, 156 Shou Chun Road, Hefei, Anhui Patentee before: HEFEI HUIZHONG INTELLECTUAL PROPERTY MANAGEMENT Co.,Ltd. |