CN101188535A - Method for identifying the section energy balance route of wireless sensor network based on 2-child tree - Google Patents
Method for identifying the section energy balance route of wireless sensor network based on 2-child tree Download PDFInfo
- Publication number
- CN101188535A CN101188535A CNA2007101718014A CN200710171801A CN101188535A CN 101188535 A CN101188535 A CN 101188535A CN A2007101718014 A CNA2007101718014 A CN A2007101718014A CN 200710171801 A CN200710171801 A CN 200710171801A CN 101188535 A CN101188535 A CN 101188535A
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- leader cluster
- network
- head
- 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.)
- Granted
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 fractional-bunch energy balance route defining method for a binary-tree-based wireless sensor network. The method adopts a binary-tree structure in a data structure and the backward sequence traverse of the binary-tree structure, and combines the energy balance mechanism of a sensing-network nodal point to provide the route defining method. During the fractional-bunch network-organized procedure of a wireless sensing network, the energy consumption of the nodal points of the integral wireless sensor network is effectively reduced and balanced, and the existence period of the integral network is prolonged. In the route building stage, according to the energy balance mechanism and the previous circumstance of the nodal point, the probability that the nodal point which has a bigger surplus energy and a less elected times becomes a bunch head is greatly increased, in the T D M A time interval distribution, when a multi-jump communication is made inside the bunch, the member nodal points successively join the bunch head according to the signal intensity, the bunch head builds the binary-tree according to the sequence of the arriving time, and distributes the operation time interval for every nodal point according to the backward sequence traverse of the binary-tree, the minimum communication distance is realized, the energy consumption of the nodal points which have a relevant long distance to the bunch head is effectively reduced. The method of the invention is simpler, and is easy to be realized, thereby being suitable for various application occasions for the wireless sensor network with data as the center.
Description
Technical field
The route that the present invention relates to a kind of wireless sensor network is determined method, and particularly a kind of wireless sensor network sub-clustering balancing energy route based on binary tree is determined method.
Background technology
Wireless sensor network be by one group of sensor node with the wireless network that the self-organizing mode constitutes, its objective is the information of monitored target in the geographic area of perception collaboratively, collection and the processing network coverage, and be distributed to the observer.It combines sensor technology, embedded technology, distributed information processing and the communication technology, in all many-sides such as military affairs, industry, medical treatment, traffic, environmental protection huge using value is arranged.Because the wireless sensor network node number is numerous, the finite energy of each node, disposal ability, storage capacity and wireless communication ability are relatively limited.How efficiently to utilize these energy and resource, set up suitable route, prolong network life cycle as much as possible, become one of focus of wireless sense network research.Correlative study shows, progress along with integrated circuit technology, it is very low that the power consumption of processor and sensor assembly becomes, overwhelming majority energy consumption is on wireless communication module, therefore the number of times of radio communication and the route that communication distance has directly influenced whole network have also determined the energy consumption and the life cycle of whole network.
Wireless sensor network uses the multi-hop technology usually, the data that each node monitoring is gathered are transmitted along other node hop-by-hop ground, a plurality of node processing, storage and forwarding during data may be routed in transmission course, be routed to aggregation node through behind the multi-hop, convey to the user by aggregation node at last.Select route like this, must cause part of nodes to lose efficacy in advance, thereby whole network division is become several mutual disjunct isolated islands, shortened the life cycle of whole sensor network because load is overweight.Therefore, the design sensing network by in, proposed sub-clustering and determined method, its basic thought be network be divided into non-overlapping copies several portions (bunch), make data communication form bunch in communication with bunch between the different levels of communicating by letter, each bunch selected the management of responsible bunch an of node, and forms the skeleton of the whole network, periodically dynamic clustering, produce bunch head at random, make each node serve as a bunch head equiprobably, make node relative equilibrium ground consumed energy in the network to prolong network life cycle.Present representational sub-clustering determines that method has Leach (Low EnergyAdaptive Clustering Hierarchy) method etc.
Although the design original intention of Leach method is to make each node share a bunch task equiprobably, share to relative equilibrium load.But in fact so design route, still can cause the part of nodes energy to exhaust in advance.This is because produce inhomogeneous that the randomness of bunch head causes that bunch head distributes in the whole network, perhaps because when selecting at random bunch, only considered probability factor, be chosen as the situation of leader cluster node so the dump energy that might have an a certain node is very little, and since bunch in carry out single-hop communication, at a distance single-hop communication can cause that energy is the fastest can be with quadruplicate speed by approach exhaustion fast.
Summary of the invention
The objective of the invention is at the deficiencies in the prior art, binary tree structure in the data structure and its postorder traversal have been adopted, balancing energy mechanism in conjunction with sensing net node, propose a kind of sensing net sub-clustering balancing energy route and determine method based on binary tree, this method can reduce effectively with balanced whole wireless sensor network in the energy consumption of node, prolong the life cycle of whole network.
For achieving the above object, design of the present invention is as follows:
In the balancing energy mechanism, node is adjusted the random number that produces according to self dump energy and the node situation that is chosen as bunch head in the past, like this, each node can both consider the capacity factor of self and be chosen as a bunch head adaptively, avoids occurring the very little node of dump energy and is bunch head by election at random.
Tree is a kind of of simulating reality trunk in the computer science and branch, and as the tree root of tree, tree structure all has a root node, as the branch of tree, can have 0 to n child node, the just branch of root node under the root node.The kind of tree structure is very many, and most popular is exactly binary tree,, the node of a binary tree can only have 2 child nodes at most.As seen, the relation between each node and its tubercle point is very similar as the hierarchical relationship between bunch head and its member node, so the clustering and multi-hop that binary tree structure is used in the wireless sensor network route determines that method has good advantages.
In the method that the present invention proposes, bunch in adopt multi-hop communication, avoided because the situation that the telecommunication that single-hop communication causes consumes node energy greatly, alleviated the energy consumption burden of node farthest, simple interchange by each other makes whole network colony reach complicated optimum, is applicable to large-scale wireless sense network.
According to the foregoing invention design, the technical solution adopted in the present invention is as follows:
A kind of wireless sensor network sub-clustering balancing energy route based on binary tree is determined method, and its feature is as follows in operating procedure:
(1) during the stage of a certain therein formation of taking turns bunch, each node all is in wait state earlier, and generates a stochastic variable R, R=rand (0,1); Dump energy E according to each node this moment self in the network
Now, the ceiling capacity E when each node is initial
Initial, in the past all are taken turns in the number this node and were elected to the number of times Times_Head of bunch head, and the percentage P of the shared total interstitial content of leader cluster node and current wheel are counted r in the network, and the cycle-index that experienced till the epicycle of whole sensor network
Generate each node (n) at the threshold value T ' of epicycle,
If the R that certain node produces less than the T ' of this node (n) then is elected as bunch head of epicycle; If the R that certain node produces greater than the T ' of this node (n) then becomes the member node of bunch head of epicycle.
(2) Dang Xuan leader cluster node other node broadcasts bunch advertisement packets separately in network, it is the E that is used for preserving bunch head that a cost territory is arranged in advertisement packets
Now, select the bunch used of oneself for non-bunch of head.In the process of whole advertisement, other non-leader cluster node all is in receive status, is used for receiving the data from bunch head.Non-leader cluster node might be received the advertisement packets from different leader cluster nodes, and according to the dump energy cost of leader cluster node, non-leader cluster node is received the strong and weak S_intensity of a bunch signal, obtains the COST of different leader cluster nodes,
Select the leader cluster node of the leader cluster node of COST maximum as oneself.
(3) behind the selected own bunch head of member node, the random back timer of a weighting of setting, the power that the setting of weights depends on bunch signal that node receives just and between member node and bunch head apart from d
CommunicationCommunication radius D with each node
Max, can obtain timing Delay,
Timing arrives, and each member node goes out response packet to a selected bunch hair, will comprise the sign ID of member node in the frame format of packet.
(4) leader cluster node can be received the response packet from the different members node according to time order and function, based on the member node number, can produce a tdma slot table.The foundation of time slot table is relevant with the sequencing that response packet arrives.Set up the data structure of a binary tree, arrange the ID of member node to put into each node of binary tree.The pairing member node of the response packet of first more arrival will be the closer to root node leader cluster node just in whole binary tree, 2 child nodes of the i.e. member node of 2 response packet correspondences that arrive at first conduct bunch head are 2 child nodes of root node just, the member node conduct of 4 response packet correspondences of arriving soon after is the child node of 2 child nodes just now, by that analogy, all assign up to member node all response packet correspondences.
(5) after binary tree is set up and to finish, it is carried out postorder traversal, with the result of traversal as putting into the tdma slot table successively, and all member node in the structure of tdma slot table and binary tree is broadcast to bunch.
(6) after each member node is received the tdma slot table, in the time slot table, search the sign ID of oneself.In one's own time slot scope, send the data to father node in the binary tree data structure according to the structure of the binary tree of receiving.When not one's own time slot scope, close radio-frequency module to reduce energy consumption.
(7) last node of binary tree postorder traversal sequence must be a root node bunch head just, so when tdma slot runs to last time slot, bunch head sends to aggregation node with the data of receiving in the some time slots in front, and the epicycle loop ends enters next round.
The present invention compared with prior art, has following advantage: at every route establishment stage of taking turns, according to the balancing energy mechanism and the situation in node past, make the bigger and probability that node that elected number of times is less becomes bunch head of dump energy improve greatly, make each node share network load relatively fifty-fifty, the dump energy of having avoided a certain node is very little but still be chosen as the situation of leader cluster node.Simultaneously at the route establishment stage, each non-leader cluster node select oneself bunch the time, also non-fully according to the signal power, but according to balancing energy mechanism and communication distance, select the bigger bunch head of COST, guaranteed in communication distance and dump energy, to obtain better balance.At last bunch in when carrying out multi-hop communication, in the tdma slot of route establishment stage distributes, according to adding bunch head with the far and near priority of the distance of bunch head, bunch head distributes binary tree according to the priority of the time of advent, and according to the time slot that the postorder traversal of binary tree is distributed each node work, realized minimizing on the communication distance, reduced a part of relative energy consumption effectively from bunch head node far away.
The present invention can the internodal energy consumption of overall balancing network, avoided occurring because part of nodes premature failure and whole network is divided into the situation of several mutual disjunct isolated islands, prolonged the life cycle of whole sensor network, and this method is comparatively simple, be easy to realize, can be used for the application scenario of various data-centered wireless sensor networks, have good social benefit and economic benefit.
Description of drawings
The present invention will be further described below in conjunction with accompanying drawing and example.
Fig. 1 is a certain also schematic diagram of cluster not of network of taking turns;
Fig. 2 is the schematic diagram of network after cluster;
Fig. 3 be bunch in the schematic diagram of multi-hop communication;
Fig. 4 be bunch in tdma slot distribute the binary tree schematic diagram of setting up;
Fig. 5 for whole network form several multi-hops bunch, carry out the schematic diagram of transfer of data.
Embodiment
Details are as follows in conjunction with the accompanying drawings for a preferred embodiment of the present invention:
In the present embodiment, when selecting route, determine method, realized the effective reduction and the equilibrium of network system energy consumption, prolonged the life cycle of whole network based on the wireless sensor network sub-clustering balancing energy route of binary tree.
At first whole network system satisfies following supposition:
(1) each node all has unique sign (unique ID), and initial energy is all identical.
(2) each node all has identical wireless coverage radius, and is symmetric channel.Radio signal energy consumption on all directions is identical, and adopts the single order wireless mode.
The concrete grammar of setting up route is as follows:
(1) during the stage of a certain therein formation of taking turns bunch, each node all is in wait state earlier, and generates a stochastic variable R,
R＝rand(0，1)
(2) at this moment, referring to Fig. 1, the dump energy of Node B is E
B, the dump energy of node C is E
CAnd can be according to formula
Calculate the threshold value that this takes turns C and D.
Wherein: E
NowBe the node dump energy of this moment, E
InitialBe the primary power of each node, Times_Head is that in the past all are taken turns the number of times that this node in the number was elected to bunch head.Formula
Not only considered the capacity factor of node, adopt direct proportion function to reduce the probability that the node that energy is too small becomes bunch head, also consider simultaneously the cycle-index that number of times that this node was elected to bunch head in the past and whole network are experienced till the epicycle, increased the probability that the node of also not being elected to bunch head in this circulation becomes epicycle bunch head.
(3) the stochastic variable R of Node B
BStochastic variable R with node C
CAll, all be elected as epicycle bunch head less than their threshold value.And node A causes R because energy is crossed low or served as a bunch head in this circulation
ADo not become bunch head of epicycle greater than threshold value.
(4) Node B and C also have other leader cluster node in the network, other node broadcasts bunch advertisement packets separately in network.In the process of whole advertisement, the mac-layer protocol among the utilization CSMA, all leader cluster nodes all use same transmitting power to send advertisement packets.It is the E that is used for preserving bunch head that a cost territory is arranged in advertisement packets
Now, select the bunch used of oneself for non-bunch of head.
(5) in step (4), the radio-frequency module of other non-leader cluster nodes is in accepting state all the time, is used to receive the advertisement information from leader cluster node.Each non-leader cluster node all might be received the advertisement packets from different leader cluster nodes.In Fig. 1, node A is in the communication radius of a bunch B and a bunch C, has therefore all received this advertisement packets.
(6) node A is according to formula
Obtain COST, and select bigger that bunch head of COST to add from different bunch heads.Wherein, cost is the dump energy of leader cluster node, S_intensity is that non-leader cluster node is received bunch power of a signal, because all bunch heads send advertisement packets with same transmitting power, so S_intensity has also represented the distance of non-leader cluster node distance bunch head.Formula
Not only considered the signal power, also considered the leader cluster node dump energy simultaneously, obtained the equilibrium between bunch head distance and the energy, become the probability of this node cluster head but reduced from getting very near energy bunch head on the low side.Node A receives the COST of a bunch B and C altogether, though from the more close B of the last A of distance, but calculated after the COST, select C to add as bunch head of oneself, can on energy and distance, obtain better balanced like this, balance the energy consumption between bunch head, each bunch that this moment, whole network system formed is as shown in Figure 2.
(7) behind the selected bunch head of node A, set the random back timer of a weighting, the power that the setting of weights depends on bunch signal that node A received just and the distance between bunch head.
Wherein: d
CommunicationBe the distance between node and bunch head of oneself, D
MaxIt is the communication radius of each node.This shows the near more node of distance bunch head, timing is short more.After timing arrival separately, each node all goes out response packet to a bunch hair in bunch, will comprise the ID of node in the frame format of packet.
(8) bunch head is in resting state always in step (6) and step (7), so that reduce energy consumption.But after receiving the response packet of first non-leader cluster node, can a timing be set according to the dump energy of bunch head, wherein timing and dump energy are directly proportional, and promptly its timing of the node that dump energy is big more can be long more.In timing, can receive from bunch in the response packet of each node.According to the time order and function order, these response packets are deposited in the buffer of oneself.After timing has arrived, close the Receiver Module of bunch head, also directly abandon response packet even if receive this moment, and do not deposit buffer in.
(9) bunch head based on the member node number, can produce a tdma slot table after receiving the message of reporting for work of bunch interior nodes, tells what the member constantly can send data at, and what enters resting state constantly to reduce energy consumption.The sequencing that response packet in the foundation of tdma slot table and (8) arrives is relevant.Need set up the data structure of a binary tree, the pairing node of the response packet of first more arrival will be the closer to root node in binary tree in the buffer, 2 child nodes of bunch head of the node of 2 response packet correspondences that arrive at first conduct just are 2 child nodes of root node just, the node conduct of 4 response packet correspondences of arriving soon after is the child node of 2 child nodes just now, by that analogy, the node of all response packet correspondences all assigns in buffer.
(10) after binary tree is set up and to finish, it is carried out postorder traversal, with the result of traversal as the tdma slot table, all nodes in being broadcast to bunch.In the transmission stage, in the one's own time slot, member node sends to a bunch head to data, and in not one's own time slot, closes radio-frequency module with conserve energy.And leader cluster node is in accepting state in step (10) always, is used to receive the data from the different members node.After a transfer of data of taking turns finishes, enter the route establishment stage of next round, come back to step (1).
As shown in Figure 3, node A and node D are the member node of node C, and their response packet such as step (8) successively arrive a bunch C.Because the communication distance of A distance C is nearer, according to step (7), the time-delay of generation is shorter, so C earlier receives the response packet from A, receives the response packet from D subsequently soon again.According to step (9), because the response packet of A is early than the response packet of D, so A can be used as the father node of D in binary tree, the binary tree of generation is referring to Fig. 4.
Binary tree is carried out postorder traversal, the number of plies is big in each road branch, just the closer to the words of leaf node, its time slot allocation is forward more during traversal, D is the child node of A, therefore the position of D in the time slot table of whole TDMA is more forward than A certainly, and just D sends data to A earlier, and then A sends to a bunch C with the data of self with the data of D.
Distance between node C and the node D is x, distance between node C and the node A is y, and the distance between node A and the node D is z, adopts the single order wireless mode, if according to the mode of original jumping communication, it is as follows to send the energy that the stage consumed in data:
The energy that D transmission kbit data are consumed is: E
Send=k * E
Static+ k * ε
Amp* x
2
The energy that A transmission kbit data are consumed is: E
Send=k * E
Static+ k * ε
Amp* y
2
The energy that data consumed that C receives 2kbit is: E
Recv=2k * E
Static
Three nodes have consumed energy altogether: E
Total=4k * E
Static+ k * ε
Amp* (x
2+ y
2)
Wherein: k * E
Static＜＜k * ε
Amp* d
2, so E
Total=k * ε
Amp* (x
2+ y
2)
If adopt multi-hop communication and according to binary tree distribution T DMA time slot, it is as follows to send the energy that the stage consumed in data:
The energy that D transmission kbit data are consumed is: E
Send=k * E
Static+ k * ε
Amp* z
2
The energy that A transmission 2kbit data are consumed is: E
Send=2k * E
Static+ 2k * ε
Amp* y
2
The energy that data consumed that C receives 2kbit is: E
Recv=2k * E
Static
Three nodes have consumed energy altogether: E
Total=5k * E
Static+ k * ε
Amp* (z
2+ 2y
2)
Wherein: k * E
Static＜＜k * ε
Amp* d
2, so E
Total=k * ε
Amp* (z
2+ 2y
2) as shown in Figure 2, apparent, x
2＞y
2+ z
2, therefore adopt multi-hop communication and distribute time slot according to binary tree, no matter be the leaf node of distal-most end or whole bunch, the energy of consumption all greatly reduces.In addition, during single-hop communication, transmission range is increased to certain-length, transmit leg also needs consume additional power to remedy the weak influence of multipath, this moment need be the biquadratic that square becomes of distance, and this has more embodied and has adopted multi-hop communication and utilize the reasonable utilization of binary tree distribution T DMA time slot for energy consumption.
Claims (1)
1. the wireless sensor network sub-clustering balancing energy route based on binary tree is determined method, it is characterized in that operating procedure is as follows:
During stage of a. a certain therein formation of taking turns bunch, each node all is in wait state earlier, and generates a stochastic variable R=rand (0,1); Dump energy E according to each node this moment self in the network
Now, the ceiling capacity E when each node is initial
Initial, in the past all are taken turns in the number this node and were elected to the number of times Times_Head of bunch head, and the percentage P of the shared total interstitial content of leader cluster node and current wheel are counted r in the network, and the cycle-index that experienced till the epicycle of whole sensor network
Generate each node (n) at the threshold value T ' of epicycle,
If the R that certain node produces less than the T ' of this node (n) then is elected as bunch head of epicycle; If the R that certain node produces greater than the T ' of this node (n) then becomes the member node of bunch head of epicycle;
B. Dang Xuan leader cluster node other node broadcasts bunch advertisement packets separately in network, it is the E that is used for preserving bunch head that a cost territory is arranged in advertisement packets
Now, select the bunch used of oneself for non-bunch of head; In the process of whole advertisement, other non-leader cluster node all is in receive status, is used for receiving the data from bunch head; Non-leader cluster node might be received the advertisement packets from different leader cluster nodes, and according to the dump energy cost of leader cluster node, non-leader cluster node is received the strong and weak S_intensity of a bunch signal, obtains the COST of different leader cluster nodes,
Select the leader cluster node of the leader cluster node of COST maximum as oneself;
C. behind the selected own bunch head of member node, the random back timer of a weighting of setting, the power that the setting of weights depends on bunch signal that node receives just and between member node and bunch head apart from d
CommunicationCommunication radius D with each node
Max, obtain timing Delay,
Timing arrives, and each member node goes out response packet to a selected bunch hair, will comprise the ID of member node in the frame format of packet;
D. leader cluster node can be received the response packet from the different members node according to time order and function, based on the member node number, can produce a tdma slot table; The foundation of time slot table is relevant with the sequencing that response packet arrives; Set up the data structure of a binary tree, arrange the sign ID of member node to put into each node of binary tree; The pairing member node of the response packet of first more arrival will be the closer to root node leader cluster node just in whole binary tree, 2 child nodes of the i.e. member node of 2 response packet correspondences that arrive at first conduct bunch head are 2 child nodes of root node just, the member node conduct of 4 response packet correspondences of arriving soon after is the child node of 2 child nodes just now, by that analogy, all assign up to member node all response packet correspondences; In corresponding bunch of the binary tree that generates during multi-hop communication, the direction that data send, data are always sent to father node by child node;
E. after binary tree is set up and to finish, it is carried out postorder traversal, with the result of traversal as putting into the tdma slot table successively, and all member node in the structure of tdma slot table and binary tree is broadcast to bunch;
F. after each member node is received the tdma slot table, in the time slot table, search the sign ID of oneself; In one's own time slot scope, send the data to father node in the binary tree data structure according to the structure of the binary tree of receiving; When not one's own time slot scope, close radio-frequency module to reduce energy consumption;
G. last node of binary tree postorder traversal sequence must be a root node bunch head just, so when tdma slot ran to last time slot, bunch head sent to aggregation node with the data of receiving in the some time slots in front, epicycle finishes, and enters next round.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101718014A CN101188535B (en) | 2007-12-06 | 2007-12-06 | Method for determining clustering energy balance route of wireless sensor network based on binary tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101718014A CN101188535B (en) | 2007-12-06 | 2007-12-06 | Method for determining clustering energy balance route of wireless sensor network based on binary tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101188535A true CN101188535A (en) | 2008-05-28 |
| CN101188535B CN101188535B (en) | 2010-06-02 |
Family
ID=39480734
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101718014A Expired - Fee Related CN101188535B (en) | 2007-12-06 | 2007-12-06 | Method for determining clustering energy balance route of wireless sensor network based on binary tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101188535B (en) |
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101959244A (en) * | 2010-09-29 | 2011-01-26 | 浙江工业大学 | Method for controlling hierarchical type route suitable for wireless sensor network |
| CN101360051B (en) * | 2008-07-11 | 2011-07-20 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
| CN102196420A (en) * | 2011-06-02 | 2011-09-21 | 河海大学常州校区 | Secure clustering routing management method for wireless sensor network |
| CN101800692B (en) * | 2009-12-10 | 2012-03-21 | 浙江工业大学 | Wireless sensor network geographic location route addressing method based on Hull tree |
| CN102395181A (en) * | 2011-11-07 | 2012-03-28 | 华为技术有限公司 | Method and device for scheduling resources |
| CN102740474A (en) * | 2011-04-12 | 2012-10-17 | 无锡物联网产业研究院 | Distribution method of time slot and channel and wireless sensor network |
| CN103024814A (en) * | 2013-01-09 | 2013-04-03 | 中国人民解放军理工大学 | Wireless sensor network energy conservation method based on redundancy controlling and clustering routing |
| TWI393385B (en) * | 2008-12-19 | 2013-04-11 | Univ Nat Taiwan | The wireless sensor uses a decentralized balanced tree algorithm to plan the method of data transmission |
| CN103068073A (en) * | 2013-01-31 | 2013-04-24 | 王福娟 | Method for ceaseless transmission of data in wireless sensor network |
| CN103095598A (en) * | 2012-12-17 | 2013-05-08 | 华中科技大学 | Monitoring data aggregate method under large-scale cluster environment |
| CN103188825A (en) * | 2011-12-31 | 2013-07-03 | 中国科学院上海微***与信息技术研究所 | Networking method of wireless sensor network |
| CN103269500A (en) * | 2013-04-19 | 2013-08-28 | 西安电子科技大学 | Communication method in wireless sensor network cluster based on average loading and energy balance |
| CN103634870A (en) * | 2013-12-10 | 2014-03-12 | 辽宁工业大学 | Wireless medical sensor network dynamic clustering method |
| CN104411000A (en) * | 2014-12-15 | 2015-03-11 | 南昌航空大学 | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network |
| CN104602313A (en) * | 2015-01-20 | 2015-05-06 | 上海海事大学 | Environment-adapted routing method of wireless sensor network for maritime search and rescue |
| CN104853398A (en) * | 2015-06-01 | 2015-08-19 | 苏州博联科技有限公司 | Route optimization method for tree shape wireless sensor network |
| CN105072663A (en) * | 2015-08-21 | 2015-11-18 | 北京岩与科技有限公司 | Self-organized networking method based on low-rate wireless network |
| CN105575092A (en) * | 2016-01-19 | 2016-05-11 | 王迅 | Networking method of wireless sensor network |
| CN106961708A (en) * | 2017-05-04 | 2017-07-18 | 山东浪潮商用***有限公司 | A kind of cluster-leader selected method and device of wireless sensor network |
| CN107835175A (en) * | 2017-11-09 | 2018-03-23 | 深圳市云盾科技有限公司 | Using the network connection tracing method of balanced binary tree algorithm |
| CN109101065A (en) * | 2018-11-08 | 2018-12-28 | 广州益牛科技有限公司 | Smart home temperature and humidity ambient intelligence regulating system |
| CN109115499A (en) * | 2018-10-19 | 2019-01-01 | 广州益牛科技有限公司 | Equipment bearing vibration data intelligence is capable of real-time acquisition and analysis system |
| CN110932758A (en) * | 2019-11-28 | 2020-03-27 | 国网福建省电力有限公司漳州供电公司 | Low-voltage power line layered ant colony routing method based on non-overlapping clustering |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2531329A (en) | 2014-10-17 | 2016-04-20 | Ibm | Managing power consumption in tree-based TDMA multi-hop wireless networks |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100428742C (en) * | 2006-04-10 | 2008-10-22 | 北京交通大学 | Method for realizing energy perception medium access control protocol |
| CN100373886C (en) * | 2006-05-18 | 2008-03-05 | 上海交通大学 | Wireless-sensor network distribution type cluster-dividing method based on self-adoptive retreating strategy |
| CN100466857C (en) * | 2007-02-02 | 2009-03-04 | 南京邮电大学 | Network reprogramming method of wireless sensor network based on priority cluster |
-
2007
- 2007-12-06 CN CN2007101718014A patent/CN101188535B/en not_active Expired - Fee Related
Cited By (36)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360051B (en) * | 2008-07-11 | 2011-07-20 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
| TWI393385B (en) * | 2008-12-19 | 2013-04-11 | Univ Nat Taiwan | The wireless sensor uses a decentralized balanced tree algorithm to plan the method of data transmission |
| CN101800692B (en) * | 2009-12-10 | 2012-03-21 | 浙江工业大学 | Wireless sensor network geographic location route addressing method based on Hull tree |
| CN101959244A (en) * | 2010-09-29 | 2011-01-26 | 浙江工业大学 | Method for controlling hierarchical type route suitable for wireless sensor network |
| CN101959244B (en) * | 2010-09-29 | 2013-03-27 | 浙江工业大学 | Method for controlling hierarchical type route suitable for wireless sensor network |
| CN102740474A (en) * | 2011-04-12 | 2012-10-17 | 无锡物联网产业研究院 | Distribution method of time slot and channel and wireless sensor network |
| CN102740474B (en) * | 2011-04-12 | 2015-04-01 | 无锡物联网产业研究院 | Distribution method of time slot and channel and wireless sensor network |
| CN102196420B (en) * | 2011-06-02 | 2014-01-15 | 河海大学常州校区 | Secure clustering routing management method for wireless sensor network |
| CN102196420A (en) * | 2011-06-02 | 2011-09-21 | 河海大学常州校区 | Secure clustering routing management method for wireless sensor network |
| CN102395181B (en) * | 2011-11-07 | 2014-11-05 | 华为技术有限公司 | Method and device for scheduling resources |
| CN102395181A (en) * | 2011-11-07 | 2012-03-28 | 华为技术有限公司 | Method and device for scheduling resources |
| CN103188825A (en) * | 2011-12-31 | 2013-07-03 | 中国科学院上海微***与信息技术研究所 | Networking method of wireless sensor network |
| CN103095598A (en) * | 2012-12-17 | 2013-05-08 | 华中科技大学 | Monitoring data aggregate method under large-scale cluster environment |
| CN103095598B (en) * | 2012-12-17 | 2015-07-29 | 华中科技大学 | Monitor data polymerization under a kind of large-scale cluster environment |
| CN103024814A (en) * | 2013-01-09 | 2013-04-03 | 中国人民解放军理工大学 | Wireless sensor network energy conservation method based on redundancy controlling and clustering routing |
| CN103024814B (en) * | 2013-01-09 | 2015-06-24 | 中国人民解放军理工大学 | Wireless sensor network energy conservation method based on redundancy controlling and clustering routing |
| CN103068073A (en) * | 2013-01-31 | 2013-04-24 | 王福娟 | Method for ceaseless transmission of data in wireless sensor network |
| CN103269500A (en) * | 2013-04-19 | 2013-08-28 | 西安电子科技大学 | Communication method in wireless sensor network cluster based on average loading and energy balance |
| CN103269500B (en) * | 2013-04-19 | 2016-01-06 | 西安电子科技大学 | Based on communication means in the wireless sensor network cluster of average load and balancing energy |
| CN103634870A (en) * | 2013-12-10 | 2014-03-12 | 辽宁工业大学 | Wireless medical sensor network dynamic clustering method |
| CN103634870B (en) * | 2013-12-10 | 2016-06-15 | 辽宁工业大学 | wireless medical sensor network dynamic clustering method |
| CN104411000A (en) * | 2014-12-15 | 2015-03-11 | 南昌航空大学 | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network |
| CN104602313A (en) * | 2015-01-20 | 2015-05-06 | 上海海事大学 | Environment-adapted routing method of wireless sensor network for maritime search and rescue |
| CN104602313B (en) * | 2015-01-20 | 2017-09-19 | 上海海事大学 | A kind of environment self-adaption method for routing of maritime search and rescue wireless sense network |
| CN104853398A (en) * | 2015-06-01 | 2015-08-19 | 苏州博联科技有限公司 | Route optimization method for tree shape wireless sensor network |
| CN105072663B (en) * | 2015-08-21 | 2018-09-25 | 北京岩与科技有限公司 | A kind of ad hoc network method based on low rate wireless network |
| CN105072663A (en) * | 2015-08-21 | 2015-11-18 | 北京岩与科技有限公司 | Self-organized networking method based on low-rate wireless network |
| CN105575092A (en) * | 2016-01-19 | 2016-05-11 | 王迅 | Networking method of wireless sensor network |
| CN106961708A (en) * | 2017-05-04 | 2017-07-18 | 山东浪潮商用***有限公司 | A kind of cluster-leader selected method and device of wireless sensor network |
| CN107835175A (en) * | 2017-11-09 | 2018-03-23 | 深圳市云盾科技有限公司 | Using the network connection tracing method of balanced binary tree algorithm |
| CN107835175B (en) * | 2017-11-09 | 2020-09-22 | 深圳市云盾科技有限公司 | Network connection tracking method adopting balanced binary tree algorithm |
| CN109115499A (en) * | 2018-10-19 | 2019-01-01 | 广州益牛科技有限公司 | Equipment bearing vibration data intelligence is capable of real-time acquisition and analysis system |
| CN109101065A (en) * | 2018-11-08 | 2018-12-28 | 广州益牛科技有限公司 | Smart home temperature and humidity ambient intelligence regulating system |
| CN109101065B (en) * | 2018-11-08 | 2020-11-27 | 王锐 | Intelligent household temperature and humidity environment intelligent adjusting system |
| CN110932758A (en) * | 2019-11-28 | 2020-03-27 | 国网福建省电力有限公司漳州供电公司 | Low-voltage power line layered ant colony routing method based on non-overlapping clustering |
| CN110932758B (en) * | 2019-11-28 | 2022-03-29 | 国网福建省电力有限公司漳州供电公司 | Low-voltage power line layered ant colony routing method based on non-overlapping clustering |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101188535B (en) | 2010-06-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101188535B (en) | Method for determining clustering energy balance route of wireless sensor network based on binary tree | |
| Tang et al. | A chain-cluster based routing algorithm for wireless sensor networks | |
| Abad et al. | Modify LEACH algorithm for wireless sensor network | |
| CN100373886C (en) | Wireless-sensor network distribution type cluster-dividing method based on self-adoptive retreating strategy | |
| Sarang et al. | A QoS MAC protocol for prioritized data in energy harvesting wireless sensor networks | |
| CN105072656A (en) | Multi-level heterogeneous wireless sensor network clustering routing method based on K-means clustering and ant colony optimization | |
| Kumar et al. | Energy efficient clustering and cluster head rotation scheme for wireless sensor networks | |
| CN104994020A (en) | Predictive energy-efficient clustering routing method based on bee colony optimization algorithm model | |
| CN101640944B (en) | Clustering and multi-hop communication method of wireless sensor | |
| Wang et al. | Grid-based data aggregation for wireless sensor networks | |
| Nema et al. | Energy efficient adaptive routing algorithm in MANET with sleep mode | |
| Kumar et al. | Prolonging Network Lifetime and Data Accumulation in Heterogeneous Sensor Networks. | |
| Lakshmi et al. | A survey on energy efficient routing protocol for IoT based precision agriculture | |
| Meenakshi et al. | Energy efficient hierarchical clustering routing protocol for wireless sensor networks | |
| Li et al. | Quantum Genetic Energy Efficient Iteration Clustering Routing Algorithm for Wireless Sensor Networks. | |
| Agrawal et al. | Layered clustering routing protocol with overlapping cluster heads in WSN | |
| Alla et al. | Hierarchical adaptive balanced routing protocol for energy efficiency in heterogeneous wireless sensor networks | |
| Jun et al. | A modified LEACH algorithm in wireless sensor network based on NS2 | |
| Hwang et al. | Energy efficient clustering technique for multicast routing protocol in wireless adhoc networks | |
| Vahabi et al. | Geographic and clustering routing for energy saving in wireless sensor network with pair of node groups | |
| Kodali | Energy efficient routing in multi-level LEACH for WSNs | |
| El Khediri et al. | A novel connectivity algorithm based on shortest path for wireless sensor networks | |
| Bhat et al. | Effective cluster head selection based on EDM for WSN | |
| Tamilselvi et al. | Traffic-aware reliability enhanced cluster head selection based routing for heterogeneous WSNs | |
| Wang et al. | An efficient grid-based data aggregation scheme for wireless sensor 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 | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20081212 Address after: No. 99, Da Dao, Baoshan District, Shanghai, China: 200444 Applicant after: Shanghai University Co-applicant after: Huarui Scientific Instrument (Shanghai) Co., Ltd. Address before: No. 99, Da Dao, Baoshan District, Shanghai, China: 200444 Applicant before: Shanghai University |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100602 Termination date: 20161206 |