CN101917750B - Cross-district virtual cluster multi-hop routing method for minimum effort delivery - Google Patents
Cross-district virtual cluster multi-hop routing method for minimum effort delivery Download PDFInfo
- Publication number
- CN101917750B CN101917750B CN2010102415862A CN201010241586A CN101917750B CN 101917750 B CN101917750 B CN 101917750B CN 2010102415862 A CN2010102415862 A CN 2010102415862A CN 201010241586 A CN201010241586 A CN 201010241586A CN 101917750 B CN101917750 B CN 101917750B
- Authority
- CN
- China
- Prior art keywords
- node
- leader cluster
- bunch
- cluster node
- distance
- 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
- 238000000034 method Methods 0.000 title claims abstract description 15
- 238000005265 energy consumption Methods 0.000 claims abstract description 22
- 230000002776 aggregation Effects 0.000 claims description 52
- 238000004220 aggregation Methods 0.000 claims description 52
- 230000009191 jumping Effects 0.000 claims description 18
- 230000005540 biological transmission Effects 0.000 claims description 13
- 230000004927 fusion Effects 0.000 claims description 9
- 238000012546 transfer Methods 0.000 claims description 5
- 238000004891 communication Methods 0.000 abstract description 14
- 241000854291 Dianthus carthusianorum Species 0.000 abstract description 7
- 230000008569 process Effects 0.000 abstract description 6
- 230000004083 survival effect Effects 0.000 abstract description 6
- 230000001105 regulatory effect Effects 0.000 abstract 1
- 238000004088 simulation Methods 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 4
- 238000012544 monitoring process Methods 0.000 description 3
- 238000011160 research Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000002474 experimental method Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000002035 prolonged effect Effects 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000003321 amplification Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000033228 biological regulation Effects 0.000 description 1
- 238000013016 damping Methods 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000009792 diffusion process Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000003199 nucleic acid amplification method Methods 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000003442 weekly effect Effects 0.000 description 1
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
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a cross-regional virtual cluster multi-hop routing method for minimum effort delivery, and belongs to the field of computer communication networks. According to the characteristics of a clustering multi-hop routing algorithm in a wireless sensor network, on the basis of an LEACH protocol, a concept of 'region' is introduced, a control message is broadcast to the whole network by a sink node, each node determines the region to which the node belongs according to the received signal strength, and the direction of the multi-hop routing is regulated through the limitation of the region. In the process of network round circulation, when a certain area fails to select a cluster head, the network generates a supplementary cluster head in the area, and when a route is established, the cluster is virtualized into a node, so that direct communication among cluster heads far away is avoided, and the least effort delivery is carried out. The invention can improve the survival time of the network, better balance the node energy consumption of the network, even the distribution of dead nodes and enlarge the network scale suitable for the protocol.
Description
Technical field
The present invention relates to the method for routing of load balancing in a kind of wireless sensor network, belong to the technical field of the multi-hop route selection method of computer communication network.
Background technology
The multi-hop wireless network that wireless sensor network is made up of the sensor node miniature in a large number, low-cost, low-power consumption that is deployed in the monitored area.Because sensor node energy, disposal ability and storage capacity are limited, the most Routing Protocol in traditional MANET network all can not be applicable to sensor network environment well.In Research on sensor networks and design, the energy efficient of realizing Routing Protocol is one of key problem of paying close attention to of people.Along with going deep into of research, reported multiple Routing Protocol algorithm in the document, mainly comprise two types of plane Routing Protocol and level Routing Protocols.In the Routing Protocol of plane, all nodes equal do not exist grade and level difference, has advantage simple, that be prone to expansion, need not safeguard.Typical plane routing algorithm has DD (Directed Diffusion), SAR (SequentialAssignment Routing) and SPIN (Sensor Protocols for Information via Negotiation) etc.But adopt the network of this type route not have management node, lack optimum management the communication resource.The level route remedied plane road by some shortcomings.The level route is divided into bunch (cluster) with network usually, and bunch head management bunch interior nodes is carried out data collection and fusion treatment, and is forwarded to aggregation node (sink).LEACH (Low Energy AdaptiveClustering Hierarchy) be a kind of relatively more classical, based on the Energy Efficient Routing Protocol of sub-clustering.
But the LEACH algorithm is not considered the energy of node, and the randomness of election of cluster head possibly cause bunch head far away apart from aggregation node too much because of the telecommunication energy consumption, and very fast dead, influences the life span of whole network.To this, many researchers have carried out further investigation and have proposed the improvement algorithm of some LEACH.But improve in the algorithm at these, the introducing of some complex parameters makes the operand of node and computational complexity increase.In the subregion location algorithm, self-defining WSN trans-regional and multi-hop route LEACH-CS (LEACH-Customizable Zone-Spanned) is a kind of fairly simple high usage route algorithm.Therefore; The present invention proposes the transregional virtual cluster multi-hop routing algorithm LECSVCR (Least Effort Delivering CustomizableZone-Spanned Virtual Cluster Multi-hop Router) that a kind of minimal effort is paid on the basis of LEACH and LECSVCR.Algorithm comes the location node position through judging the power that receives signal; The multi-hop routing mechanism that between bunch head, adopts minimal effort to pay; Effectively avoided the unbalanced problem that node energy consumes in the network; Prolonged network life, made its suitable scale expand the four corner that aggregation node can cover to.
Summary of the invention
The present invention seeks to improve the following deficiency of LEACH agreement:
At first, election of cluster head is because the unsteadiness that random number produces possibly cause a bunch irrational distribution and number to depart from desired value;
The second, bunch head and aggregation node direct communication, bigger away from a bunch energy consumption of aggregation node, death is morning, dead skewness;
The 3rd, the communication range of node is limited, and the single-hop mode of bunch head and aggregation node has limited network coverage, the network of inapplicable large scale deployment;
The 4th, simulation result repeatedly shows, has experienced one long period from first node death to network failure, and this a part of energy can use better.
The present invention adopts following technical scheme for realizing above-mentioned purpose:
The transregional virtual cluster multi-hop routing method that minimal effort of the present invention is paid comprises the steps:
(1) the netinit stage, aggregation node is to control messages of whole Web broadcast, and each node is judged the signal strength signal intensity RSSI that receives this message, and the distance of estimation and aggregation node identifies each node affiliated area according to preset area difference radius r 0;
(2) bunch the election stage; When node produce 0～1 between random number during less than threshold value T (n); The elected bunch head of this node and to broadcast oneself be the message of bunch head, non-leader cluster node based on the broadcast of receiving calculate self to each bunch head that can communicate by letter with it apart from and charge to apart from list item;
(3) the cluster stage, non-leader cluster node is checked own list item, judges whether non-leader cluster node affiliated area has produced a bunch head; If do not have; Then returning step (2) becomes a bunch head automatically, and broadcast, and the non-leader cluster node of receiving message is compute distance values and recording apart from list item separately; If have, then adopt nearby principle to select nearest leader cluster node to transmit into a bunch request, that duplicates oneself simultaneously gives bunch head apart from list item, informs leader cluster node oneself can also be communicated by letter and distance with which leader cluster node of two ways; Leader cluster node is set up the TDMA timetable after receiving bunch request, constitutes a virtual cluster with non-leader cluster node, and confirms each application of broadcasting radius answer based on bunch member farthest;
(4) route establishment stage; Do not communicate by letter each other with a zone bunch head; Bunch head in the X zone is by bunch the Data transmission of nearest principle in the Y zone, the arbitrary node in wherein X ≠ Y, and X zone to the distance of aggregation node all greater than the distance of the arbitrary node in the Y zone to aggregation node;
(5) data transfer phase; Non-leader cluster node is collected data; Send to the leader cluster node of place virtual cluster: leader cluster node is given next after to the data fusion treatment and is jumped virtual cluster; Be transmitted to the leader cluster node of oneself after the fringe node reception data of next jumping virtual cluster, jump virtual cluster head by leader cluster node to next and transmit, up to aggregation node; Circulation (2) to (4) goes on foot to network failure.
The said Data transmission of step (4) is based on area difference radius r 0 and confirms that next jumps virtual cluster: all leader cluster nodes are at first checked the list item of oneself; When not having optional next to jump leader cluster node; Each non-leader cluster node relatively apart from list item; The non-leader cluster node of the nearer direction of chosen distance aggregation node is jumped as next; Have in the list item of this non-leader cluster node apart from the aggregation node next-hop node of near field more, and the leader cluster node that does not have next optional jumping with apart from aggregation node more the next-hop node of near field not in same zone; If can not find such member node, then epicycle abandons transmitting the data of oneself, does not receive route requests simultaneously; When optional next jumped, leader cluster node was selected next jumping, sends route requests;
Receive that bunch head of route requests judges the distance between two bunches of heads,, directly reply acknowledge message, with the broadcasting radius of actual range as the requestor when distance during smaller or equal to d0/2; When distance during greater than d0/2; Check that next non-leader cluster node of jumping the leader cluster node region is apart from list item; Search and to reach this route requests person and arrive the member who asks the leader cluster node distance apart from jumping leader cluster node self less than next; Select to ask the nearest non-leader cluster node of leader cluster node as the recipient with this; Inform selected also forwarding of non-leader cluster node reception packet, next jumping leader cluster node answer acknowledge message is informed and is asked leader cluster node to broadcast radius apart from conduct with virtual cluster farthest.
Leader cluster node selected described in step (3) the cluster stage is not necessarily regional together with non-leader cluster node.
The present invention has following beneficial effect:
1, all node abstraction of one true bunch is become a node, reduce by last one communication distance of jumping;
2, each node maintenance is reported and is given leader cluster node separately apart from list item, is convenient to select best routed path;
3, bunch set up the multi-hop route between, algorithm is simple, balanced energy consumption, and dead node is evenly distributed;
4, prolonged network effective time, shortened time from first node death to network failure;
5, keep whether autonomous decision becomes the characteristics of bunch head about node among the former LEACH, thereby do not need global information, reduce the communication energy consumption.
Description of drawings
Fig. 1 bunch of head striden district's multi-hop route sketch map;
Fig. 2 MATLAB generates the network node topological diagram at random;
Fig. 3 LEACH the 100th takes turns dead node distribution map;
Fig. 4 LECSVCR the 100th takes turns dead node distribution map;
Fig. 5 network lifetime curve;
Fig. 6 network total energy consumption curve.
Embodiment
Below in conjunction with accompanying drawing technical scheme of the present invention is elaborated:
1. self-defining trans-regional and multi-hop routing algorithm LECSVCR
1.1LEACH algorithm brief introduction
LEACH is a kind of level type low power consumption adaptive cluster Routing Protocol by people such as the Heinzelman design of MIT.Its implementation has been introduced the notion of " wheel ", whenever takes turns establishment stage and the data communication phase that circulation is divided into bunch.Bunch establishment stage, the random number between each survival node produces 0～1, if this number less than threshold value T (n), then issuing it is the message of bunch head.Take turns in the circulation every, if node has become a bunch head, then T (n) is made as 0, this node can be at the elected once more bunch head of epicycle like this.T (n) is expressed as:
Wherein, P is bunch head shared percentage in all nodes, and r is an election wheel number, and rmod (1/p) takes turns the node number of being elected to bunch head in the circulation for this, and G is that this takes turns the node set of not being elected to bunch head in the circulation.In data communication phase, bunch interior nodes sends to a bunch head to data, and bunch head carries out after the data fusion result being sent to aggregation node.Therefore the energy of bunch head consumption is more than bunch interior nodes.LEACH serves as a bunch head equiprobably through each node of wheel endless form assurance, makes node relative equilibrium ground consumed energy.But some defectives are still arranged, are mainly reflected in following aspect:
(1) first node death early.Find that from document [9] and follow-up relevant improvement it is dead until whole network that first dead node appears in LEACH, experienced long time.This a part of energy can use better;
(2) randomness of election of cluster head can cause every bunch skewness of taking turns.Part bunch head and bunch interior nodes distance possibly occur too closely or too far away, and the topological structure that makes bunch is undesirable, and over-burden for a part bunch head, reduces the energy consumption balance property of network;
(3) the dead inhomogeneities of node.Simulation result repeatedly shows; Node apart from sink node node far away is nearer than distance is dead sooner; The data that sense in the network later stage have lost Significance of monitoring in advance in fact only near the zone the sink node, reduce the practical application effect of network;
(4) be not suitable for the node large scale deployment.Bunch head is a single-hop to the communication mode of sink node among the LEACH, and present node covering power is generally about 200 meters, and this can not be monitored apart from the deployment scope of meeting restriction sensing node on a large scale.
1.2LEACH-CS brief introduction
At first, introduce energy model.In the Algorithm Analysis process, the Channel Transmission model that LEACH-CS adopts the people such as presenter Heinzelman W of LEACH to use, i.e. free space model and multipath decline model.Between sending node and receiving node, be worth d less than certain apart from d
0The time, adopting the free space model, transmitting power is d
2Decay; Otherwise adopt the multipath attenuation model, transmitting power is d
4Decay.Model definition radio-circuit transmission range is that the energy of the 1bit messages consume of dm is:
Correspondingly, the energy that receives these consumption of information is:
E
Rx(l，d)＝E
Rx-elec(l，d)＝lE
elec (3)
The energy of data fusion consumption is:
E
Gx(l，d)＝lE
gather (4)
In following formula, E
ElecIndication circuit sends or receives the energy that the 1bit data are consumed; ε
Fsd
2And ε
Mpd
4Energy for the consumption of every amplification 1bit data amplifier; E
GatherEnergy for every 1bit Data Fusion consumption; The energy that n * 1bit data fusion become 1bit data consumed of formula (4) for the n that a receives node is sended over.D in the formula (2)
0Determine by following formula:
LECSVCR is on the basis of LEACH, introduces the notion in " zone " and " area difference ", when certain zone election bunch head failure, produces and replenishes bunch head, between setting up bunch during route with the next self-defined suitable multi-hop routing plan of the constraint of transregional distance." zone (zone) " refers to the aggregation node to be the center of circle in the algorithm, is each ring belt (like Fig. 1) that surrounds between the adjacent circumferential line of radius with a plurality of different lengths; " area difference radius (zone difference radius) ", finger-type becomes the absolute value of difference of two radiuses of adjacent circumferential, is designated as r
0(like Fig. 1).
LECSVCR has stipulated node distribution density ρ and area difference radius r
0Relation (formula 2, formula 3), bring into play better efficiency for network in theory reference be provided.
In the formula, ch is included in apart from aggregation node d
0Bunch head sum that is produced in j the zone in the scope, these bunches head are shared the data volume that the regional intra-cluster head of other aggregation node far away transmits, and the value of ch can be self-defined according to actual conditions.The ch of nearly aggregation node bunch head receives the energy of being sent here by other bunch hair that data consumed, be equal to this ch node newly accepted bunch in the member, but must the quantity of acceptance be limited.Whole network mean cluster number of members is (1-p)/p, establishes this ch the newly-increased member of bunch head and must not surpass its 1/v, and the border situation is self-defined factually for v, then can obtain formula 3:
Formula (6) provides r
0With the relation of ρ, formula (7) provides r
0With the relation of v, make network bring into play better usefulness with reference to two formulas in the actual environment.It is exactly trans-regional and multi-hop that LEACH-CS selects the method for transmission range suitable between bunch head, and its concrete scheme is following:
(1) the netinit stage, aggregation node is to control messages of whole Web broadcast, and each node is judged the signal strength signal intensity RSSI that receives this message, and the distance of estimation and aggregation node is according to preset r
0Identify own affiliated area;
(2) bunch establishment stage, when node produce 0～1 between random number during less than threshold value T (n), the elected bunch head of this node and to broadcast oneself be the message of bunch head, non-leader cluster node judges according to the broadcast of receiving whether own affiliated area has produced a bunch head.If do not have, then own to bunch head, and broadcast; As if having, then adopt nearby principle to select nearest bunch hair to send into a bunch request (selected bunch head is not necessarily with own regional together).Set up the TDMA timetable and reply each member after bunch head is received bunch request;
(3) route establishment stage is not communicated by letter with a zone bunch head each other, send route requests by nearest principle to bunch hair apart from the aggregation node immediate area than bunch head in territory, far field apart from aggregation node, receives that bunch head of request message is replied acknowledge message.When bunch head apart from aggregation node d
0In the scope, just directly communicate by letter with aggregation node.
(4) data transfer phase, non-leader cluster node is collected data, sends to the leader cluster node at place bunch.Bunch head is given next-hop node after to the data fusion treatment, up to aggregation node.Circulation (2) to (4) goes on foot to network failure.
LEACH-CS selects typical sub-clustering formula Routing Protocol LEACH as research object, has proposed self-defining trans-regional and multi-hop routing mechanism.This mechanism is the basis with the zone, carries out bunch head and replenishes, transregionally goes into bunch and new process such as self-defined trans-regional and multi-hop route, has improved the performance of aspects such as network lifetime, energy consumption speed and dead node distribution.But in true environment, after circulating for a long time, the node of that lateral edges of aggregation node far away will be early dead than the node in other orientation in the zone in the zone, forms the detection blind area gradually.
The main narration of next joint LECSVCR agreement of the present invention.
1.3 the multi-hop routing algorithm that minimal effort is paid
In general, the communication less energy consumption between the node closely, communication quality is also relatively good.The LECSVCR agreement is exactly to save energy through the distance that shortens between communication node.In wireless transmission, the decay of transmitting power is exponential damping along with the increase of transmission range.In the Algorithm Analysis process, the Channel Transmission model that the present invention adopts the people such as presenter Heinzelman W of LEACH to use equally.Its concrete scheme is following:
(1) the netinit stage, aggregation node is to control messages of whole Web broadcast, and each node is judged the signal strength signal intensity RSSI that receives this message, and the distance of estimation and aggregation node identifies own affiliated area according to preset r0;
(2) bunch establishment stage; When node produce 0～1 between random number during less than threshold value T (n); The elected bunch head of this node and to broadcast oneself be the message of bunch head, non-leader cluster node according to the broadcast of receiving calculate self to each bunch head that can communicate by letter with it apart from and charge to apart from form.After accomplishing this process, network begins to replenish bunch head.Ordinary node is checked own list item, judges whether own affiliated area has produced a bunch head, if do not have, then becomes a bunch head automatically, and broadcast, and the node of receiving message is compute distance values and recording apart from form separately; If have; After then waiting for very short time; The employing nearby principle selects nearest bunch hair to send into a bunch request (selected bunch head is not necessarily with own regional together), duplicates the form of oneself simultaneously and gives bunch head, informs bunch head oneself can also be communicated by letter and distance with which bunch head of two ways.Set up the TDMA timetable after bunch head is received bunch request, and confirm that according to farthest bunch member the broadcasting radius replys each application;
(3) route establishment stage is not communicated by letter with a zone bunch head each other, presses nearest principle to bunch Data transmission apart from the aggregation node immediate area apart from aggregation node than bunch head in territory, far field.Confirm the next-hop node region according to area difference radius r 0 in the algorithm.After getting into the route establishment stage; All bunches head is at first checked the list item of oneself, when not having optional next to jump, and the member's relatively apart from list item; The a certain member of the nearer direction of chosen distance aggregation node jumps as next, should have in this member's the list item apart from more next jumping of near field of aggregation node.If can not find such member, then epicycle abandons transmitting the data of oneself, does not receive route requests simultaneously.After accomplishing this process, bunch head is selected next jumping, sends route requests.Receive that bunch head of request message judges the distance between two bunches of heads,, directly reply acknowledge message, with the broadcasting radius of actual range as the requestor when distance during smaller or equal to d0/2.When distance during greater than d0/2; Check that the member is apart from list item; Search can reach this requestor and distance less than bunch head self to the member of requestor's distance, select with the nearest several members of this requestor as the recipient, inform that selected node receives packet and transmits.Reply acknowledge message and inform that the requestor will broadcast radius apart from conduct with recipient farthest.Like this, for last one jumped, it was a big virtual bunch head that next whole bunch of jumping that institute will arrive is abstracted into for a last jumping, has realized the minimal effort payment.When bunch head apart from aggregation node d0 scope in, just directly communicate by letter with aggregation node.(time slot 5)
It should be noted that bunch selection of next jumping of head can be adjacent region, stride a district or stride more nearest bunch of head of multi-region that this depends on the relation of r0 and d0.Ordinary circumstance, as when r0 equals d0, transmit the adjacent area; When d0 is the twice of r0, strides a district and transmit; When d0 is three times of r0, strides two districts and transmit etc.Transregional one side provides bunch head in the nearly aggregation node d0 of the multiple spurs scope more to share the transfer of data energy consumption, dwindles the blind area band that edges of regions possibly form on the other hand.Like Fig. 1, set Zone1 and Zone2 and be combined into the α district, Zone3 and Zone4 are combined into the β district; Zone5 and Zone6 are combined into the γ district, and do not adopt transregional route, and then β, γ district set up route according to the nearest principle in adjacent area; The original like this data by among a Zone1 and the Zone3 bunch of relaying will be respectively by among a Zone2 and the Zone4 bunch of relaying; Bunch energy consumption in Zone2 and the Zone4 district will increase like this, and the node death that causes α, β subregion one side early forms the blind area band.
(4) data transfer phase, non-leader cluster node is collected data, sends to the leader cluster node at place bunch.Bunch head is given next after to the data fusion treatment and is jumped virtual cluster, and the fringe node of next jumping is transmitted to own bunch head after receiving data, by own bunch head to next jumping virtual cluster head forwarding, up to aggregation node.Circulation (2) to (4) goes on foot to network failure.
Visible from above-mentioned steps; Because each node does not need periodically to report affiliated area; Only judge also and only inform own self-position, so such location energy consumption is brought significant burden not only can not for whole network but also can be ignored basically at initial phase.And transmit control message by aggregation node, can expand network size to scope that the aggregation node signal covers.In the algorithm, election of cluster head is taked regional autonomy, and promptly when certain zone did not produce bunch, this zone node can become a bunch head automatically, a bunch homogenizing is distributed play supplementary function; And when cluster, non-leader cluster node is broken the constraint in zone, seeks a nearest bunch head and goes into bunch, the saving energy; Route adopts the trans-regional and multi-hop mode of minimal effort payment to the greatest extent between bunch, saves a bunch energy consumption, postpones the whole network node death time, is evenly distributed dead node.2.1 simulated environment and parameter configuration
Suppose 500 nodes of random distribution in the square of 200m * 200m, aggregation node is positioned at the foursquare upper right corner (like Fig. 2).Concrete simulation parameter is as shown in table 1.
Table 1 simulation parameter
| Parameter type | Parameter value |
| The transducer number | 500 |
| Sensor location coordinates scope (unit: m) | (0，0)～(200，200) |
| Data packet length | 4000bit |
| Controlling packet length | 100bit |
| Electronics emission consumed energy E Tx | 50nJ/bit |
| Electronics receives consumed energy E Rx | 50nJ/bit |
| Emission amplifier parameter ε closely fs | 10pJ/bit/m 2 |
| Remote emission amplifier parameter ε mp | 0.0013pJ/bit/m 4 |
| Data are integrated energy E DA | 5nJ/bit/signal |
| Bunch optimum number percentage p | 5％ |
| Transducer primary power E 0 | 1J |
| Distance threshold d 0 | 87.7m |
| The area difference radius r o | 45m |
Known that by table 1 every bunch number of taking turns is about 25 in whole network, existing data with these 25 bunches of heads transmission are shared on 3 or 4 nearly aggregation node bunch heads, i.e. ch=3 or ch=4.In relevant parameter substitution formula (6), calculate table 2.
R when table 2ch=3 and ch=4
0Value condition
| p＝0.05ρ＝0.0125 | ch＝3 | ch＝4 |
| Adjacent area/j=1/45＜r 0≤90 | r 0＝79 | r 0＝90 |
| Stride one district/j=2/30＜r 0≤45 | r 0＝39 | r 0＝45 |
| Stride two districts/j=3/23＜r 0≤30 | r 0＝26 | r 0＝30 |
If calculate with formula (7), then be equivalent to v=2 or v=3, promptly must not surpass 1/2 or 1/3 of mean cluster number of members.R in the table 2
0But value all be value, get r in the experiment
0=45.
Emulation setting network operation wheel cycle period is 20s, and the every 2s of ordinary node collects a data forwarding and gives bunch head, and promptly the phase ordinary node sends 10 secondary data weekly, and leader cluster node receives, merges and send 10 secondary data.Network node primary power, the topological structure of setting LEACH and LECSVCR are the same, and regulation is worked as in the network 80% node and can't be worked and think that promptly this network is unavailable.
2.2 Performance evaluation criterion
Emulation experiment is tested with former LEACH improved routing algorithm under identical simulated environment and network parameter configuration.Compare from the route performance of many aspects, specifically comprise trans-regional and multi-hop and original mode:
The ■ network life;
Dead number of ■ node and distribution;
The time that first node death to network of ■ is invalid;
The situation of change of ■ network accumulative total energy consumption;
Simulation result contrasts the death time of the network life of two kinds of agreements, the distribution of dead node and specific quantity node etc. respectively shown in Fig. 3 to Fig. 6 and table 3.
The node death state statistics of table 3LECSVCR and two kinds of agreements of LEACH
2.3 experimental performance analysis
Fig. 3 and Fig. 4 are respectively LEACH agreement and LECSVCR agreement dead distribution of node when the 100th takes turns.Apart from aggregation node node death (like Fig. 3) basically far away, this meets with the direct bigger analysis of consumed energy of communicating by letter with aggregation node of LEACH protocol family head basically in the LEACH agreement.And the LECSVCR agreement adopts the minimum trans-regional and multi-hop virtual cluster routing mechanism of paying, and makes that most of nodes are still survived in many wheel circulation backs, and guarantees be evenly distributed (like Fig. 4) of dead node basically.Can in one long period, guarantee the data monitoring scope like this.Simultaneously, Fig. 4 also shows, near the node aggregation node is many than other zone survival still, and this is because this regional node is few, during cluster bunch in the member less relatively, saved a bunch energy, thereby the node of survival is more.
Fig. 5 and Fig. 6 are respectively the curve charts of two kinds of agreements at each round survival interstitial content and network total energy consumption.In Fig. 5, bunch added machinery that LECSVCR inherits LEACH-CS makes that bunch head is evenly distributed, the minimum virtual cluster multi-hop of paying makes energy consumption even, so the death time of first node is later than LEACH far away.In addition, the interstitial content that LECSVCR is survived at any time is more than LEACH, and life cycle is long.Associative list 2, first node death time of LECSVCR is 3.14 times of LEACH, and As time goes on, multiple reduces gradually, and 80 percent node death time is merely 1.36 times of LEACH.This also is reflected among Fig. 5, and along with round increases, the LECSVCR curve is gradually near the LEACH curve.This is that in the later stage of network survivability, each node energy remains little because the LECSVCR agreement has increased the route control information, and these control information meetings obviously increase energy consumption, and it is dead to accelerate node.The effective survival period of tendency explanation LECSVCR of curve is more concentrated than LEACH, and it is short that the time of large tracts of land monitoring blind area appears in network.Fig. 6 is the summation curve figure of network total energy consumption, from figure, finds out, LECSVCR total energy consumption rate of change changes little than LEACH, explains that the every energy consumption of taking turns of LECSVCR is balanced more.Associative list 3, LECSVCR do not weaken the serviceability of whole network when reducing energy consumption.
Claims (3)
1. the transregional virtual cluster multi-hop routing method that minimal effort is paid is characterized in that comprising the steps:
(1) the netinit stage, aggregation node is to control messages of whole Web broadcast, and each node is judged the signal strength signal intensity RSSI that receives this message, and the distance of estimation and aggregation node identifies each node affiliated area according to preset area difference radius r 0;
(2) bunch the election stage; When node produce 0～1 between random number during less than threshold value T (n); The elected bunch head of this node and to broadcast oneself be the message of bunch head, non-leader cluster node based on the broadcast of receiving calculate self to each bunch head that can communicate by letter with it apart from and charge to apart from list item;
(3) the cluster stage; Non-leader cluster node is checked own list item; Judge whether non-leader cluster node affiliated area has produced a bunch head, if do not have, then returning step (2) becomes a bunch head automatically; And broadcast, the non-leader cluster node of receiving message calculates between the leader cluster node of self and this message of broadcasting distance value separately and records apart from list item; If have, then adopt nearby principle to select nearest leader cluster node to transmit into a bunch request, that duplicates oneself simultaneously gives bunch head apart from list item, informs leader cluster node oneself can also be communicated by letter and distance with which leader cluster node of two ways; Leader cluster node is set up the TDMA timetable after receiving bunch request, constitutes a virtual cluster with non-leader cluster node, and confirms each application of broadcasting radius answer based on bunch member farthest;
(4) route establishment stage; Do not communicate by letter each other with a zone bunch head; Bunch head in the X zone is by bunch the Data transmission of nearest principle in the Y zone, the arbitrary node in wherein X ≠ Y, and X zone to the distance of aggregation node all greater than the distance of the arbitrary node in the Y zone to aggregation node;
(5) data transfer phase; Non-leader cluster node is collected data; Send to the leader cluster node of place virtual cluster: leader cluster node is given next after to the data fusion treatment and is jumped virtual cluster; Be transmitted to the leader cluster node of oneself after the fringe node reception data of next jumping virtual cluster, jump virtual cluster head by leader cluster node to next and transmit, up to aggregation node; Circulation (2) to (5) goes on foot to network failure.
2. the transregional virtual cluster multi-hop routing method that minimal effort according to claim 1 is paid; It is characterized in that the said Data transmission of step (4) confirms that according to area difference radius r 0 next jumps virtual cluster: all leader cluster nodes are at first checked the list item of oneself; When not having optional next to jump leader cluster node; Each non-leader cluster node relatively apart from list item; The non-leader cluster node of the nearer direction of chosen distance aggregation node is jumped as next, have in the list item of this non-leader cluster node apart from the aggregation node next-hop node of near field more, and the leader cluster node that does not have next optional jumping with apart from aggregation node more the next-hop node of near field not in same zone; If can not find such member node, then epicycle abandons transmitting the data of oneself, does not receive route requests simultaneously; When optional next jumped, leader cluster node was selected next jumping, sends route requests; Receive that bunch head of route requests judges the distance between two bunches of heads,, directly reply acknowledge message, with the broadcasting radius of actual range as the requestor when distance during smaller or equal to d0/2; When distance during greater than d0/2; Check that next non-leader cluster node of jumping the leader cluster node region is apart from list item; Search and can reach this route requests person and distance is jumped the member of leader cluster node self to request leader cluster node distance less than next, select with the nearest non-leader cluster node of this request leader cluster node as the recipient, inform that selected non-leader cluster node receives packet and transmits; Next is jumped leader cluster node answer acknowledge message and informs the request leader cluster node; To broadcast radius apart from conduct with request leader cluster node virtual cluster farthest, wherein, the distance threshold value of said d0 for calculating according to the wireless transmission energy consumption.
3. the transregional virtual cluster multi-hop routing method that minimal effort according to claim 1 is paid is characterized in that leader cluster node selected described in step (3) the cluster stage is not necessarily regional together with non-leader cluster node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102415862A CN101917750B (en) | 2010-07-30 | 2010-07-30 | Cross-district virtual cluster multi-hop routing method for minimum effort delivery |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102415862A CN101917750B (en) | 2010-07-30 | 2010-07-30 | Cross-district virtual cluster multi-hop routing method for minimum effort delivery |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101917750A CN101917750A (en) | 2010-12-15 |
| CN101917750B true CN101917750B (en) | 2012-12-05 |
Family
ID=43325105
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102415862A Expired - Fee Related CN101917750B (en) | 2010-07-30 | 2010-07-30 | Cross-district virtual cluster multi-hop routing method for minimum effort delivery |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101917750B (en) |
Families Citing this family (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102244658B (en) * | 2011-06-28 | 2013-11-06 | 南京工业大学 | Partitioned dynamic secure routing method for wireless sensor network based on hash chain |
| CN102497615A (en) * | 2011-11-30 | 2012-06-13 | 清华大学 | Location-information-based clustering method for node mobile network |
| CN102711210A (en) * | 2012-06-04 | 2012-10-03 | 广州市香港科大***研究院 | Data collecting method based on wireless sensor network adopting dynamic clustering routing algorithm |
| CN103987100A (en) * | 2014-03-27 | 2014-08-13 | 南京邮电大学 | Sensor network energy-saving low energy adaptive clustering hierarchy improved method based on region division |
| CN104780507A (en) * | 2015-05-07 | 2015-07-15 | 广州大学 | High-precision AOA clustering and locating method |
| CN104796332B (en) * | 2015-05-15 | 2018-05-01 | 河海大学常州校区 | Heterogeneous wireless sensor network Uneven Cluster method based on node energy equilibrium |
| CN105898679B (en) * | 2016-03-31 | 2019-09-20 | 中南大学 | It is a kind of based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer |
| US10524101B2 (en) * | 2016-05-26 | 2019-12-31 | Theo Kanter | Distributed context-sharing networks |
| CN107748825A (en) * | 2017-11-06 | 2018-03-02 | 四川大学 | A kind of Seam Mining crack field gas pressure measurement system |
| CN109041158A (en) * | 2018-06-30 | 2018-12-18 | 沈阳师范大学 | A kind of the wireless sensor neural network intelligent control method and system of the hierarchical routing based on data aggregate |
| CN110049465B (en) * | 2019-04-23 | 2021-11-30 | 贵州大学 | WSN-based water area monitoring communication method |
| CN110972229A (en) * | 2019-11-28 | 2020-04-07 | 佛山科学技术学院 | Routing method and system of wireless sensor network in bridge environment |
| CN113490250B (en) * | 2021-07-09 | 2022-05-06 | 中国人民解放军国防科技大学 | Routing protocol of multi-hop wireless sensor network for raw data acquisition |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1643698A2 (en) * | 2004-10-02 | 2006-04-05 | Hewlett-Packard Development Company, L.P. | A method and apparatus for assembling data packet fragments in a network of nodes |
| CN1917460A (en) * | 2006-09-07 | 2007-02-21 | 上海交通大学 | Distribution type structuring method for virtual backbone network in network of wireless sensor |
| CN101267391A (en) * | 2008-03-27 | 2008-09-17 | 上海交通大学 | Wireless sensor network topology control method based on non-uniform sections |
-
2010
- 2010-07-30 CN CN2010102415862A patent/CN101917750B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1643698A2 (en) * | 2004-10-02 | 2006-04-05 | Hewlett-Packard Development Company, L.P. | A method and apparatus for assembling data packet fragments in a network of nodes |
| CN1917460A (en) * | 2006-09-07 | 2007-02-21 | 上海交通大学 | Distribution type structuring method for virtual backbone network in network of wireless sensor |
| CN101267391A (en) * | 2008-03-27 | 2008-09-17 | 上海交通大学 | Wireless sensor network topology control method based on non-uniform sections |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101917750A (en) | 2010-12-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101917750B (en) | Cross-district virtual cluster multi-hop routing method for minimum effort delivery | |
| Gherbi et al. | An adaptive clustering approach to dynamic load balancing and energy efficiency in wireless sensor networks | |
| Huang et al. | A low-latency communication scheme for mobile wireless sensor control systems | |
| Lin et al. | A game theory based energy efficient clustering routing protocol for WSNs | |
| CN101854666B (en) | Self-defined cross-zone multi-hop routing method for wireless sensor network | |
| CN105323818B (en) | Energy saving cluster routing method based on network area division and distance | |
| Gao et al. | Energy-efficient cluster head selection scheme based on multiple criteria decision making for wireless sensor networks | |
| Zytoune et al. | A uniform balancing energy routing protocol for wireless sensor networks | |
| CN103298032A (en) | Node energy consumption balancing method for wireless sensor network | |
| Mammu et al. | A novel cluster-based energy efficient routing in wireless sensor networks | |
| Guan et al. | A new load balancing and data collection algorithm for energy saving in wireless sensor networks | |
| CN103391555A (en) | Novel node distribution method for maximizing service lives of clustering wireless sensor networks | |
| CN104053206A (en) | Reliable energy-saving hierarchical routing implementation method used for wireless body area network or energy-limited small wireless sensor network | |
| CN103347288A (en) | Wireless sensor network different-width hierarchical routing protocol method | |
| Ghosh et al. | An efficient trajectory based routing scheme for delay-sensitive data in wireless sensor network | |
| CN106559731A (en) | A kind of sewage monitoring wireless sensor network | |
| Yalçın et al. | BTA-MM: Burst traffic awareness-based adaptive mobility model with mobile sinks for heterogeneous wireless sensor networks | |
| Raghavendra et al. | Energy efficient intra cluster gateway optimal placement in wireless sensor network | |
| Singh et al. | Augmenting network lifetime for heterogenous WSN assisted IoT using mobile agent | |
| Prusty et al. | Energy aware optimized routing protocols for wireless ad hoc sensor network | |
| Pitchai | Determination of energy efficient optimal sojourn location of mobile sinks in clustered corona-based wireless sensor networks | |
| Akber et al. | Data volume based data gathering in wsns using mobile data collector | |
| Yu et al. | An environment monitoring system architecture based on sensor networks | |
| Jafari et al. | Cooperative routing protocols in wireless body | |
| Gherbi et al. | Energy efficient with time synchronised and service coverage guarantee in 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20121205 Termination date: 20150730 |
|
| EXPY | Termination of patent right or utility model |