CN100373886C - Wireless-sensor network distribution type cluster-dividing method based on self-adoptive retreating strategy - Google Patents
Wireless-sensor network distribution type cluster-dividing method based on self-adoptive retreating strategy Download PDFInfo
- Publication number
- CN100373886C CN100373886C CNB2006100266848A CN200610026684A CN100373886C CN 100373886 C CN100373886 C CN 100373886C CN B2006100266848 A CNB2006100266848 A CN B2006100266848A CN 200610026684 A CN200610026684 A CN 200610026684A CN 100373886 C CN100373886 C CN 100373886C
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- nodes
- bunch head
- cluster
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a wireless sensor network distribution type cluster division method based on a self-adoptive retreat strategy. From the residual energy of nodes, each node sets a timer in a self-adaptive mode according to residual battery energy. When the definite time is reached, each node automatically becomes a cluster head and broadcasts messages; adjacent nodes choose to join the cluster as ordinary nodes. When the formation time of a maximal cluster is reached, all nodes not determining own roles automatically become cluster heads. Thereby, the whole network is divided into the cluster heads and the ordinary nodes to form a layered management system. The present invention utilizes the residual battery energy of the nodes to equalize the load of the system, and ensures that generated cluster heads are uniformly distributed by adjusting the relevant parameters of an algorithm. Simulation results show that the present invention can decrease the times of the nodes forced to communicate with a base station and can prolong the life of networks and enhance energy consumption efficiency.
Description
Technical field
The present invention relates to a kind of wireless-sensor network distribution type cluster-dividing method, be specially adapted to self-organizing, layering routing management and the constructing network topology of wireless sensor network based on self-adoptive retreating strategy.
Background technology
Along with the develop rapidly of the communication technology, embedded computing technique and sensor technology and increasingly mature, the microsensor with perception, computing capability and communication capacity begins worldwide to occur.The sensor network that is made of these microsensors has caused people's very big concern.This sensor network combines sensor technology, embedded computing technique, distributed information processing and the communication technology, the various environment in monitoring in real time collaboratively, perception and the collection network distributed areas or the information of monitoring target, and these information are handled, obtain detailed and information accurately, be sent to the user who needs these information.Sensor network can make people obtain a large amount of accurate and reliable information at any time and place with under any environmental condition.Therefore, this network system can be widely used in national defense and military, national security, environmental monitoring, traffic administration, health care, manufacturing industry, anti-terrorism and the field such as combat a natural disaster.Sensor network is a revolution of information perception and collection.Sensor network has proposed a large amount of challenge research topic in basic theory and two aspects of engineering to the scientific worker as a brand-new research field.
Wireless sensor network is not because rely on fixing infrastructure, so network node requires to have the ability of self-organizing.A node enters after the working region, and an information of jumping (one-hop) neighbours will be known nothing the topology information of the whole network around the limited mechanism that it can only depend on medium Access Layer and physical layer can provide obtains.At this time need a method node of these dispersions is organized effectively, be that the operation of whole system makes up the topology basis, harmoniously finish some specific tasks.The sub-clustering algorithm is a kind of effective self-organizing method of generally acknowledging at present: the agreement of node by agreement elects " bunch head " separately, thereby network is divided cluster, ordinary node in bunch first management bunch is finished the structure of full mesh topology by information interaction between bunch head.Simultaneously, the sub-clustering algorithm can also help through functions such as Route Selection, resource management and data fusion.Present representational sub-clustering algorithm has LEACH (Low Energy AdaptiveClustering Hierarchy) and HEED (Hybrid Energy-Efficient Distributed Clustering) etc.
The LEACH algorithm is a kind of distributed clustering algorithm at the wireless sensor network characteristics (" AnApplication-specific Protocol Architecture for Wireless Microsensor Networks ", W.B.Heinzelman, A.P.Chandrakasan, H.Balakrishnan, IEEE Tran.On WirelessCommunications, Vol.1, No.4, pp.660-670, Oct.2002.).LEACH is distributed fully, and node only relies on " role " of local information decision self: be bunch head or ordinary node, algorithm has the time complexity of O (1).Bunch first election method at random of LEACH is simple, is easy to realize.It has also considered problem of load balancing simultaneously, and the node that has become bunch head in nearest round will have no chance to become a bunch head once more in this work period (cycle).Exactly because LEACH has above characteristics, it becomes the wireless sensor network sub-clustering algorithm that is most widely used at present, also is simultaneously the benchmark of other sub-clustering algorithm of check.
Although the original intention of LEACH is the load of the system of sharing equally, simulation result shows that LEACH can cause some node to exhaust the energy content of battery prematurely.By analysis, have two reasons can explain this phenomenon:
● because the first randomness that produces of LEACH algorithm bunch, can cause producing the skewness of bunch head, make some node near do not have bunch first the existence and be forced to base station direct communication with a distant place.The communication of long distance will greatly consume the limited energy content of battery of node, thereby causes some node to exhaust the energy content of battery too quickly and " death ".
● " role " of LEACH decision node do not consider the remaining power energy of node, and such load balancing strategy is incomplete.
The HEED algorithm is another wireless sensor network sub-clustering algorithm (" Distributed Clustering inAd-hoc Sensor Networks:A Hybrid; Energy-efficient Approach ", O.Younis, and S.Fahmy, Proc.of IEEE INFOCOM2004, USA).HEED points out to prolong life span and load balance is two most important demands in the sensor network, and prolongs network lifetime by energy consumption is distributed on the whole network.Select bunch head according to two parameters of primary and secondary, principal parameter depends on the remaining power energy, is used for choosing randomly the first set of initial cluster, and communication cost in subparameter depends on bunch is used to determine which bunch the node that drops in a plurality of bunches of scopes belongs to.The improvement of this agreement mainly is, has considered the dump energy of node in bunch first-selection is selected, and has introduced the selection course that a plurality of constraintss act on bunch head with master slave relation.
Although the HEED algorithm has remedied some deficiency of LEACH algorithm, but it can bring extra system energy consumption: in a bunch first election stage, algorithm require each sensor node must broadcast bunch in communication cost, the system capacity that this process will consume significant for a large-scale network, thus the life of network shortened.
Summary of the invention
The objective of the invention is at the deficiencies in the prior art, propose a kind of wireless-sensor network distribution type cluster-dividing method, can realize the load balancing of network effectively, prolong system's life and improve the energy consumption efficiency of system based on self-adoptive retreating strategy.
In order to realize this purpose, in the distributed clustering method based on self-adoptive retreating strategy of the present invention, utilize the load of node remaining power balancing energy system, and guarantee that by the relevant parameter of regulating algorithm a bunch head who is produced is evenly distributed.At first start with from the dump energy of node, each node is provided with timer adaptively according to the remaining power energy, and when regularly arriving, node becomes " bunch head " and broadcast automatically, and its adjacent node selects this bunch of adding to become " ordinary node ".When maximum bunch formation time arrived, all did not determine own role's node to become " bunch head " automatically.Thus, whole network is divided into " bunch head " and " ordinary node ", forms the management system of level.
Method of the present invention comprises following concrete steps:
1, in a bunch formation stage, all nodes at first are in " wait " state, safeguard one in interval [0,1] last equally distributed stochastic variable.By the preset parameters λ of system
Max(maximum wake-up rates), λ
Min(minimum wake-up rates) and E
Max(node most battery power) and present node remaining power ENERGY E
i ResidwalGenerate the wake-up rates λ of node
i
2, get current time in system t
Current, and by the wake-up rates λ of node
iThe timer t of node is set according to the negative exponent distribution
i, and self adaptation adjustment timing length, promptly
t
i＝t
current+min(-(1/λ
i)ln(x
i/λ
i)，T
CF)
T wherein
CFIt is system's predefined maximum bunch formation time.
3, when the timing of certain node arrives, electing oneself becomes " bunch head " and broadcasting " bunch head " status message notice adjacent node.When regularly not arriving, node is kept " wait " state.
4, node if receive " bunch head " status message of adjacent node, just stops timing when " wait " state, and mark oneself is for " ordinary node " and join this bunch, broadcasts " adding " message simultaneously, informs the selection of adjacent node oneself.If receive a plurality of " bunch head " status message simultaneously, then use node identification or select to add some bunch with the distance of bunch head.If do not receive " bunch head " status message, node continues to keep " wait " state;
5, node if receive " adding " message of adjacent node, is then noted this message when " wait " state.If all adjacent nodes are at maximum bunch formation time T
CFAll determined oneself " role " before arriving, then stopped timing, mark oneself is a bunch head, and broadcasting " bunch head " status message notice adjacent node;
6) as maximum bunch formation time T
CFDuring arrival, all do not have to determine oneself node of " role " to become a bunch head automatically.Final whole network is divided into " bunch head " and " ordinary node ", forms the management system of level, finishes the distributed clustering of wireless sensor network.
The present invention adjusts " waking up " time of node adaptively according to node remaining power energy, has effectively realized the load balancing of system and has guaranteed the even distribution of bunch head that produces.Simulation result shows, the present invention can reduce node and be forced to number of times with base station communication, prolongs network life, and has improved energy consumption efficiency.Method is simple, is easy to realize, and strict time upper limit and linear message complexity are arranged, and these good performances have increased its range of application greatly.
Description of drawings
The flow chart that Fig. 1 realizes for the inventive method.
Fig. 2 is the contrast to the embodiment of the same network topology that produces at random of the present invention and LEACH algorithm.Wherein Fig. 2 (a) is the result of LEACH algorithm, and Fig. 2 (b) is result of the present invention.
Fig. 3 is the present invention and other two kinds of algorithm simulating results' contrast.Wherein Fig. 3 (a) is the contrast of system's life, Fig. 3 (b) be the valid data grouping of transmitting with system in the relation of survival number of nodes, Fig. 3 (c) is the relation of effective packet count of system energy consumption and transmission.
Embodiment
Below in conjunction with drawings and Examples technical scheme of the present invention is further described.
Method of the present invention is undertaken by flow chart shown in Figure 1.Provided " role " deterministic process of node among the figure.
At first system satisfies following supposition: (1) each node has unique sign (ID), and knows its all neighbours' ID, and this can periodically be broadcasted " hello " message by the MAC layer and knows.(2) node has identical wireless coverage radius and channel is symmetrical.
1) in a bunch formation stage, all nodes at first are in " wait " state, generate one at interval [0,1] last equally distributed stochastic variable x by the Random function
i,
x
i＝Random(0，1)，
Generate the wake-up rates λ of node
i
E wherein
MaxBe the most battery power of node, E
Residual iBe the remaining power energy of present node i, λ
MinAnd λ
MaxBe predefined minimum and maximum wake-up rates.
2) get current time in system t
Current, by the wake-up rates λ of node
iThe timer t of node is set according to the negative exponent distribution
i, and self adaptation adjustment timing length, promptly have
t
i＝t
current+min(-(1/λ
i)ln(x
i/λi)，T
CF)?(1)
T wherein
CFIt is system's predefined maximum bunch formation time.
The parameter that negative exponent distributes among the present invention is according to the remaining power energy control of node, and self adaptation adjustment timing length, can make the node with more remaining power energy that the short stand-by period is arranged.
3) when the timing of certain node u arrived, just electing oneself became " bunch head ", and broadcasting " bunch head " status message (ADV_CH message) notice adjacent node.The role of node u is defined as " bunch head " at this point.When the timing of node u does not arrive, still keep " wait ", state.
4) node u if receive the ADV_CH message of adjacent node broadcasting, just stops timing when wait state, and mark oneself is for " ordinary node " and join this bunch, and broadcasting simultaneously adds the selection that message (JOIN message) is informed adjacent node oneself.At this moment, the role of node u is defined as " ordinary node ".
If node u receives a plurality of bunches of first broadcasts simultaneously, then can use node identification or select to add some bunch with the distance of bunch head.Can judge by the power of received signal power with the distance of bunch head.If node u does not receive the ADV_CH message of adjacent node, node u continues to keep " wait " state.
5) node u if receive " JOIN " message of some adjacent node v, illustrates node v when wait state, has joined in some bunch, then notes the decision of v.
It is node u " set of all adjacent nodes " that variable r is set, and the node v that determines the role is removed from set Γ, promptly
Γ=Γ-v，
At predefined maximum bunch formation time T
CFBefore the arrival, if all adjacent nodes of node u have all determined oneself " role ", promptly
The adjacent node of this explanation node u has all added corresponding bunch, and then node u stops timing, and mark oneself is a bunch head, and broadcasting AD_CH message, and the role who finishes node u determines.
6) as maximum bunch formation time T
CFDuring arrival, all are decision own " role " not, node also just mean there is not a bunch first generation in the neighborhood.In order to finish and normal network function such as base station communication, these nodes become a bunch head automatically.Final whole network is divided into " bunch head " and " ordinary node ", forms the management system of level, finishes the distributed clustering of wireless sensor network.
In the inventive method, system parameters λ
Max, λ
MinAnd T
CFBe before algorithm is carried out, to determine according to different application backgrounds.Be desirably in 1 minute intra-cluster forming process such as some application scenarios and finish, be i.e. T
CF=60 seconds.
Below come method more of the present invention and LEACH and HEED by emulation experiment performance.Experimental model is made up of 100 nodes, and they are evenly distributed at random, and (x=0 is y=0) to (x=100, y=100) in this square area, the initial cells energy of each node is 2 joules, and the wireless coverage radius all is 25 long measures, the base station is positioned at the position of (50,175).
For the energy consumption of analytical system, the present invention introduces a kind of simple wireless channel model: a sensor node receives, sends the grouping of a k bit, and receiver and transmitter consume E respectively
ElecThe energy of * k joule, the energy of short haul connection transmit amplifier consumption is ε
Fs* k*d
2Joule and long haul communication consumes ε
Amp* k*d
2The energy of joule; The energy of data fusion consumption is E
Fusion* k* signal number.Here establish E
Fusion=5nJ/bit/signal, E
Elec=50nJ/bit, ε
Fs=10pJ/bit/m
2, ε
Mp=0.0013pJ/bit/m
4, packet bit length L=10000bit.For LEACH, a bunch first number of establishing expectation is k=5, for the HEED algorithm, establishes p
MinBe 0.0005 and CH
ProbBe 5%.For algorithm of the present invention, establish λ
Min=2.8 and λ
Max=5, the remaining power energy of node is quantized into 20 level.
In each stationary operational phase, each ordinary node collects that environmental parameter generates an original packet and to bunch first sending, bunch first will bunch in all packets of member's (comprising bunch head itself) carry out data fusion, new grouping of encapsulation generation is sent to the base station more again.If there is not the generation of bunch head near the node, it will directly pass to original data packet the base station in a distant place.Here the original data packet of transmitting is called " effectively grouping ".
Fig. 2 is the result's contrast to the embodiment of the same network topology that produces at random of method of the present invention and LEACH algorithm.Wherein Fig. 2 (a) is the result of LEACH algorithm, and Fig. 2 (b) is result of the present invention.Among the figure, bunch head that the triangle representative produces, round dot is represented ordinary node, and the cross representative is forced to the ordinary node with the base station direct communication.Under the same situation that produces 9 bunches of head, can see that compare with the LEACH algorithm, bunch head that the inventive method produced is evenly distributed, thereby significantly reduce the quantity of being forced to the ordinary node of base station, distant place direct communication.
Fig. 3 is the present invention and LEACH algorithm and HEED algorithm simulating result's contrast.By system's life of emulation experiment test network, studied the relation of system's life and valid data grouping, and compared the energy consumption efficiency of two kinds of algorithms.Here " system's life " be defined as first because the node of running down of battery and " death " the work round of process.
Fig. 3 (a) is the contrast of system's life, from Fig. 3 (a) as can be seen, compares with other two kinds of algorithms, and algorithm of the present invention has prolonged system's life significantly.As previously mentioned, algorithm of the present invention has been considered the remaining power energy of each node, and the node that energy is many more might become a bunch head more, so proof load equilibrium better.In addition, the selection of algorithm parameter has guaranteed relatively evenly distributing of bunch head.
Fig. 3 (b) be the valid data grouping of transmitting with system in the relation of survival number of nodes, from the simulation result of Fig. 3 (b) as seen, when first node energy content of battery exhausted, algorithm of the present invention was compared with preceding two kinds of algorithms, and system will transmit more " effectively grouping ".This be because LEACH can cause node will limited energy content of battery consumption with the long haul communication of base station on, and algorithm of the present invention has been avoided this point, more effectively divides into groups thereby can transmit.Compare with the HEED algorithm, method of the present invention does not also require that node is communicated by letter work period and expends, thereby saved system energy consumption in each broadcasting bunch.
Fig. 3 (c) has provided the relation of system's power consumption with the valid data packet count of transmitting.Under the identical situation of power consumption, two kinds of algorithms of algorithm of the present invention and other are compared and can be transmitted more valid data grouping as can be seen, and this illustrates that algorithm of the present invention has higher energy consumption efficiency.
Claims (1)
1. the wireless-sensor network distribution type cluster-dividing method based on self-adoptive retreating strategy is characterized in that comprising the steps:
1) in a bunch formation stage, all nodes at first are in " wait " state, safeguard one at interval [0,1] last equally distributed stochastic variable x
iBy the predefined maximum wake-up rates λ of system
Max, minimum wake-up rates λ
Min, node most battery power E
MaxAnd present node remaining power ENERGY E
i Residual, the wake-up rates λ of generation node
i,
2) get current time in system t
Current, by the wake-up rates λ of node
iThe timer t of node is set according to the negative exponent distribution
i, and self adaptation adjustment timing length, i.e. t
i=t
Current+ min ((1/ λ
i) ln (x
i/ λ
i), T
CF), T wherein
CFIt is system's predefined maximum bunch formation time;
3) when the timing of certain node arrived, electing oneself became " bunch head ", and broadcasting " bunch head " status message notice adjacent node; When regularly not arriving, node is kept " wait " state;
4) node if receive " bunch head " status message of adjacent node, just stops timing when " wait " state, and mark oneself is for " ordinary node " and join this bunch, broadcasts " adding " message simultaneously, informs the selection of adjacent node oneself; If receive a plurality of " bunch head " status message simultaneously, then use node identification or select to add some bunch with the distance of bunch head; If do not receive " bunch head " status message, node continues to keep " wait " state;
5) node if receive " adding " message of adjacent node, is then noted this message when " wait " state; If all adjacent nodes are at maximum bunch formation time T
CFAll determined oneself " role " before arriving, then stopped timing, mark oneself is a bunch head, and broadcasting " bunch head " status message notice adjacent node;
6) as maximum bunch formation time T
CFDuring arrival, all do not have to determine oneself node of " role " to become a bunch head automatically, finish the distributed clustering of wireless sensor network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100266848A CN100373886C (en) | 2006-05-18 | 2006-05-18 | Wireless-sensor network distribution type cluster-dividing method based on self-adoptive retreating strategy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100266848A CN100373886C (en) | 2006-05-18 | 2006-05-18 | Wireless-sensor network distribution type cluster-dividing method based on self-adoptive retreating strategy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1852216A CN1852216A (en) | 2006-10-25 |
| CN100373886C true CN100373886C (en) | 2008-03-05 |
Family
ID=37133686
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100266848A Expired - Fee Related CN100373886C (en) | 2006-05-18 | 2006-05-18 | Wireless-sensor network distribution type cluster-dividing method based on self-adoptive retreating strategy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100373886C (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101184005B (en) * | 2007-03-16 | 2011-01-12 | 中国科学院嘉兴无线传感网工程中心 | Double cluster wireless sensor network based adaptive communication method |
| CN101179490B (en) * | 2007-11-21 | 2011-07-20 | 湖南大学 | Event perception based wireless sensor network anycast routing method |
| CN101188535B (en) * | 2007-12-06 | 2010-06-02 | 上海大学 | Method for determining clustering energy balance route of wireless sensor network based on binary tree |
| CN101217488B (en) * | 2008-01-16 | 2010-09-08 | 中南大学 | A reconstructible multiple mobile robot communication means |
| CN101237416B (en) * | 2008-03-05 | 2010-12-29 | 中国科学院嘉兴无线传感网工程中心 | Method for local topology reconstruction of wireless sensor network based on sector |
| CN101394321B (en) * | 2008-09-25 | 2010-12-15 | 重庆邮电大学 | Non-uniform clustering method for cluster wireless sensor network based on energy balance |
| US8190938B2 (en) * | 2009-01-29 | 2012-05-29 | Nokia Corporation | Method and apparatus for controlling energy consumption during resource sharing |
| CN102014455B (en) * | 2010-11-23 | 2013-07-03 | 北京航空航天大学 | Wireless sensor network clustering routing method based on correlation among nodes |
| CN103139834B (en) * | 2011-11-28 | 2015-08-19 | 赵洪钢 | A kind of wireless sensor network multi-velocity self-adapting back-off method |
| CN102497679B (en) * | 2011-12-20 | 2014-05-21 | 山东大学 | Static clustering algorithm for wireless sensor network |
| CN102685761B (en) * | 2012-05-11 | 2015-05-20 | 中国联合网络通信集团有限公司 | Cellular network architecture implementation method and device |
| CN108810046A (en) * | 2017-04-28 | 2018-11-13 | 华为技术有限公司 | A kind of method, apparatus and equipment of election leadership person Leader |
| CN109348442B (en) * | 2018-08-20 | 2023-02-21 | 洛阳国花新能源科技有限公司 | Wireless sensor clustering method based on timer |
| CN112583666A (en) * | 2020-12-08 | 2021-03-30 | 广州技象科技有限公司 | Sensor network data transmission method, device, system and storage medium |
| CN112584459A (en) * | 2020-12-08 | 2021-03-30 | 广州技象科技有限公司 | Path confirmation method, device and system based on residual energy and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020018448A1 (en) * | 2000-04-25 | 2002-02-14 | Amis Alan Dewayne | Clusterhead selection in wireless ad hoc networks |
| US6711409B1 (en) * | 1999-12-15 | 2004-03-23 | Bbnt Solutions Llc | Node belonging to multiple clusters in an ad hoc wireless network |
| CN1633098A (en) * | 2005-01-28 | 2005-06-29 | 北京邮电大学 | Wireless sensor network system and method supporting task reconfiguration |
| CN1640031A (en) * | 2002-01-10 | 2005-07-13 | 罗伯特·博施有限公司 | Protocol for reliable, self-organizing, low-power wireless network for security and building automation system |
| CN1719803A (en) * | 2005-07-28 | 2006-01-11 | 武汉大学 | Correcting method and application of multi-size router for extensible large-scale sensor network |
| CN1747446A (en) * | 2005-10-21 | 2006-03-15 | 清华大学 | Application layer group broadcasting method with integrated type and distributed type combination |
-
2006
- 2006-05-18 CN CNB2006100266848A patent/CN100373886C/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6711409B1 (en) * | 1999-12-15 | 2004-03-23 | Bbnt Solutions Llc | Node belonging to multiple clusters in an ad hoc wireless network |
| US20020018448A1 (en) * | 2000-04-25 | 2002-02-14 | Amis Alan Dewayne | Clusterhead selection in wireless ad hoc networks |
| CN1640031A (en) * | 2002-01-10 | 2005-07-13 | 罗伯特·博施有限公司 | Protocol for reliable, self-organizing, low-power wireless network for security and building automation system |
| CN1633098A (en) * | 2005-01-28 | 2005-06-29 | 北京邮电大学 | Wireless sensor network system and method supporting task reconfiguration |
| CN1719803A (en) * | 2005-07-28 | 2006-01-11 | 武汉大学 | Correcting method and application of multi-size router for extensible large-scale sensor network |
| CN1747446A (en) * | 2005-10-21 | 2006-03-15 | 清华大学 | Application layer group broadcasting method with integrated type and distributed type combination |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1852216A (en) | 2006-10-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100373886C (en) | Wireless-sensor network distribution type cluster-dividing method based on self-adoptive retreating strategy | |
| Katiyar et al. | Improvement in LEACH protocol for large-scale wireless sensor networks | |
| Jerbi et al. | O-LEACH of routing protocol for wireless sensor networks | |
| CN101895956B (en) | Data transmission method of multilayer distributed wireless sensor network | |
| Elbhiri et al. | Stochastic and Equitable Distributed Energy-Efficient Clustering (SEDEEC) for heterogeneous wireless sensor networks | |
| Yang et al. | An energy-efficient clustering algorithm for wireless sensor networks | |
| Munusamy et al. | Role of Clustering, Routing Protocols, MAC protocols and Load Balancing in Wireless Sensor Networks: An Energy-Efficiency Perspective | |
| Jin et al. | A distributed energy-efficient re-clustering solution for wireless sensor networks | |
| Li et al. | RECA: a ring-structured energy-efficient clustering architecture for robust communication in wireless sensor networks | |
| Basagni et al. | A comparative performance evaluation of wake-up radio-based data forwarding for green wireless networks | |
| Guo et al. | Centralized Clustering Routing Based on Improved Sine Cosine Algorithm and Energy Balance in WSNs | |
| Sedighimanesh et al. | Improving wireless sensor network lifetime using layering in hierarchical routing | |
| Jerbi et al. | A routing protocol orphan-leach to join orphan nodes in wireless sensor network | |
| Banerjee et al. | Energy efficient optimization in the LEACH architecture | |
| Luo et al. | Layered routing algorithm for wireless sensor networks based on energy balance | |
| Bhandari et al. | Energy-efficient routing-based clustering approaches and sleep scheduling algorithm for network lifetime maximization in sensor network: A survey | |
| Liang et al. | An energy-aware routing algorithm for heterogeneous wireless sensor networks | |
| Chourse et al. | A review on energy efficient of clustering-based routing protocol in wireless sensor network | |
| Yang et al. | Research of Wireless Sensor Routing Algorithm Based on Uneven Clustering | |
| Nie et al. | An Adaptive State-Aware Routing Algorithm for Data Aggregation in Wireless Sensor Networks. | |
| Nabi et al. | Performance improvement in leach protocol based on cluster head selection in wsn | |
| Yang et al. | Rotation and chain-based energy saving routing protocol of wireless sensor network | |
| Sharma et al. | Various hierarchical routing protocols in wireless sensor network: a survey | |
| Chen et al. | Efficient data gathering in wireless sensor networks with fixed-group method | |
| Wu et al. | A sensor network topology controlling algorithm with balancing energy consumption |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080305 Termination date: 20120518 |