CN104661273A - Routing method of wireless sensor network - Google Patents
Routing method of wireless sensor network Download PDFInfo
- Publication number
- CN104661273A CN104661273A CN201410715779.5A CN201410715779A CN104661273A CN 104661273 A CN104661273 A CN 104661273A CN 201410715779 A CN201410715779 A CN 201410715779A CN 104661273 A CN104661273 A CN 104661273A
- Authority
- CN
- China
- Prior art keywords
- node
- wireless sensor
- sensor network
- subregion
- neighbors
- 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
- 238000000034 method Methods 0.000 title claims abstract description 71
- 238000004891 communication Methods 0.000 claims abstract description 62
- 238000005265 energy consumption Methods 0.000 abstract description 12
- 238000000638 solvent extraction Methods 0.000 abstract 1
- 238000007726 management method Methods 0.000 description 17
- 238000002474 experimental method Methods 0.000 description 8
- 230000005540 biological transmission Effects 0.000 description 6
- 238000000205 computational method Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000005192 partition Methods 0.000 description 4
- 206010004542 Bezoar Diseases 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000013316 zoning Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 238000004134 energy conservation Methods 0.000 description 2
- 230000002028 premature Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
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 provides a routing method of a wireless sensor network. The wireless sensor network comprises a plurality of sensor nodes and a base station. The routing method comprises the following steps: partitioning the area of the wireless sensor network, thereby forming a plurality of sub-areas with different area radiuses; enabling nodes in sub-areas with the minimum area radiuses to be in data communication with the base station directly; for nodes in other sub-areas, taking nodes with the minimum communication cost, of all adjacent nodes of the node as relay nodes according to the size of the area radiuses from small to large. By adopting the routing method provided by the invention, the area numbers and the communication cost of the relay nodes are taken into account in the routing process of the nodes, and the overall energy consumption of the routing method is relatively small.
Description
Technical field
The present invention relates to wireless communication technology field, particularly relate to a kind of method for routing of wireless sensor network.
Background technology
Wireless sensor network (Wireless Sensor Networks, WSN) be usually made up of thousands of sensor node self-organizings, because sensor node is very little, can perception, process information and with other node communications, people design wireless sensor network to monitor all kinds of phenomenon or event, and the data that node is collected are transferred to terminal use.But the finite energy of sensor node in actual applications, although WSN preserves energy as much as possible by the routing policy applying excellent network topology structure and the best, but due to the difference with legacy network, Ad hoc ad hoc multihop networks, the route in WSN receives increasing concern.
Adopt traditional CR method for routing, after network node detects event, event broadcast can be given all nodes (these nodes are called as neighbors) in its communication range, these neighborss can broadcast again this information to other nodes in its communication range, this process can be carried out always, until event arrives base station (BS), this can cause the energy of nodes to consume excessively, and increases the collision in wireless transmission.
In order to improve the utilance of network energy, propose the method for routing of many improvement in recent years.Such as, open source literature " Oh; H.; Bahn, H., & Chae; K.J..An energy-efficient sensor routingscheme for home automation networks [J] .IEEE Transactions on ConsumerElectronics; 2005,51 (3), 836-839 " proposes RDSR method for routing.Open source literature " Chien-ErhWeng; Tsung-Wen Lai.An Energy-Efficient Routing Algorithm Based on RelativeIdentification and Direction for Wireless Sensor Networks [J] .Wireless PersonalCommunications; 2013; 69,253-268 " proposes another kind of ERIDSR method for routing.
But above-mentioned network route method all fails effectively to reduce the network node energy-consumption of wireless sensor network, and router efficiency is also lower.
Summary of the invention
In order to save the energy of node, improve the router efficiency of wireless sensor network, the embodiment of the present invention proposes a kind of method for routing of the wireless sensor network based on partition management node.
The embodiment provides a kind of method for routing of wireless sensor network, described wireless sensor network comprises multiple sensor node and a base station, and the method comprises:
Region dividing is carried out to form multiple subregion with zones of different radius to described wireless sensor network;
For the node of subregion being arranged in Minimum Area radius, described node directly carries out data communication with described base station;
For the node being arranged in other subregions, according to zone radius order from small to large, select node that in all neighborss of described node, communication cost is minimum as via node;
Describedly Region dividing carried out to described wireless sensor network comprise:
Calculate the zone radius of subregion;
Centered by described base station, according to the zone radius determined, Region dividing is carried out to described wireless sensor network;
Wherein, the computing formula of described zone radius is:
Rg represents the zone radius of g subregion in network, and g is positive integer, and 1≤g≤tt, tt represents the zone radius sum in described wireless sensor network, and d1 is the communication threshold of node, c1 and c2 is variable element.
Compared with prior art, adopt the method for routing of wireless sensor network disclosed by the invention, node can the neighbors of prioritizing selection distance base station more near field as via node, and then reduce the communication cost of node, save the energy of node, this for energy constraint wireless senser be vital.By determining that best subregion radius carries out subregion to network, realize the object reducing node communication power consumption, in addition, the method considers area code, the communication cost of via node in node-routing process, communication cost then considers energy, distance two factors in calculating, stronger to the directivity of destination node when this makes node data send, therefore, compared with prior art, the entirety power consumption of method for routing of the present invention is less.
Accompanying drawing explanation
Fig. 1 is the wireless sensor network topology figure provided according to the embodiment of the present invention;
Fig. 2 is the topological diagram that the network provided according to the embodiment of the present invention carries out after Region dividing;
Network energy consumption condition contrast schematic diagram when Fig. 3 is value different from embodiment of the present invention c2;
Network energy consumption condition contrast schematic diagram when Fig. 4 is value different from embodiment of the present invention c1;
Fig. 5 consumes energy according to the network route method of the embodiment of the present invention and the network of prior art to contrast schematic diagram;
Fig. 6 is the flow chart of the method for routing of wireless sensor network according to the embodiment of the present invention.
Embodiment
Set forth a lot of detail in the following description so that fully understand the present invention, but the present invention can also adopt other to be different from alternate manner described here to implement, therefore the present invention is not by the restriction of following public specific embodiment.
The method for routing of the wireless sensor network that the embodiment of the present invention provides, described wireless sensor network comprises multiple sensor node and a base station, and described method for routing comprises:
Region dividing is carried out to form multiple subregion with zones of different radius to described wireless sensor network;
For the node of subregion being arranged in Minimum Area radius, described node directly carries out data communication with described base station;
For the node being arranged in other subregions, according to zone radius order from small to large, select node that in all neighborss of described node, communication cost is minimum as via node;
Describedly Region dividing carried out to described wireless sensor network comprise:
Calculate the zone radius of subregion;
Centered by described base station, according to the zone radius determined, Region dividing is carried out to described wireless sensor network;
Wherein, the computing formula of described zone radius is:
Rg represents the zone radius of g subregion in network, and g is positive integer, and 1≤g≤tt, tt represents the zone radius sum in described wireless sensor network, and d1 is the communication threshold of node, c1 and c2 is variable element.
By describing technology contents of the present invention in detail, being realized object and effect, be described in detail below in conjunction with accompanying drawing 6 pairs of the specific embodiment of the present invention.
Step S1, generates the topological structure of wireless sensor network.
All need to carry out topological initialization to all wireless sensor networks.In this stage, initial topology is set up in its maximum transmission power transmitting of each node.After initial phase, by running different algorithms or agreement is optimized initial topology, and finally build one and optimize topology.
For the ease of the needs that follow-up explanation network area divides, described wireless sensor network comprises multiple sensor node and a base station that mutually can carry out data communication.The embodiment of the present invention provides network topology structure as shown in Figure 1, comprises 200 sensor nodes, and those node random placements are in the 2 dimensional region of 200m*200m, and base station is positioned at lower left, monitored area, and after all node deployments, position no longer changes.Transverse axis (X-axis) in Fig. 1, the longitudinal axis (Y-axis) are in order to the geographical position of identification nodes, and sensor node is as shown in circle "○" in figure, and base station is positioned at two-dimensional coordinate initial point place, sees shown in figure intermediate cam shape " Δ ".
Step S2, carries out Region dividing to form multiple subregion with zones of different radius to described wireless sensor network.
Described multiple subregions after Region dividing form whole described wireless sensor network, and the node in described wireless sensor network can dynamic sensing node self rest energy and position, and can calculate its distance to base station or other nodes.
Below, the present invention will introduce the method for Region dividing in step S2 in detail.
S21, calculates the zone radius of subregion;
In network, the zone radius Rg of g subregion, g are positive integer, and 1≤g≤tt, tt represents the zone radius sum in described wireless sensor network, and computing formula is such as formula (1):
In formula (1), d1 is the communication threshold of node, is the neighbors of node i with all nodes within the scope of node i distance d1.
Parameter c1 can change the Region dividing situation of network flexibly with c2 by the different value of setting.Concrete, parameter c1 is in order to determine the size of first zone radius R1, and the remote-effects size of other zone radius, finally can affect the area of each subregion.Parameter c2 affects the value of R1 other zone radius outer.
Parameter c1 be 0.2 and parameter c2 is 3 time, as shown in Figure 2, in network, the value of maximum region radius depends on network middle distance base station node farthest to Rg value.It is minimum subregion that first above-mentioned subregion refers to its zone radius R1, in other words, refers to the subregion near base station.
Below introduce the computational methods of zone radius sum tt and maximum subregion radius R max.
First, about the computational methods of tt:
About the computational methods of above-mentioned tt, the 1. row be used for variable initializer show; The 2.-7. row is in order to the distance of general sensor nodes in computing network to base station, wherein s (k) .disToBS represents the distance of ordinary node k to base station, k is the identifier of ordinary node, 1≤k≤n, k is positive integer, n is sensor node number in network, s (k) .xd, s (k) .yd is the abscissa of representation node k in two-dimensional network and ordinate respectively, s (n+1) .xd, s (n+1) .yd represents the abscissa of base station in two-dimensional network and ordinate respectively, and wherein the identifier of base station is n+1; The
row carrys out the total tt in computation partition region according to network middle distance base station node farthest to the computing formula of the distance of base station, subregion radius.Certainly, described zone radius sum tt also can adopt other computational methods of prior art to realize, and repeats no more herein.
After obtaining tt according to said method, in network, the computational methods of maximum subregion radius R max are:
Rmax＝R(tt)＝((tt-1)^2/tt^2)*c2*d1+R(tt-1)
According to the method described above after subregion, whole sensor network disposition is in the first quartile be made up of X-axis and Y-axis as shown in Figure 1, and zone radius is quarter circular arc radius, as i > 2 and Rg≤max (X
m, Y
m) time, wherein X
m, Y
mrepresent monitored area scope, the area S of i-th subregion is:
From formula (2), the value of parameter c2 have impact on the size of other Division areas except the first subregion.
S22, centered by base station, carries out Region dividing according to the zone radius determined to described wireless sensor network.
Still shown in composition graphs 2, according to the zone radius Rg that aforementioned S21 determines, centered by base station, generate many virtual circular arcs in a network, each circular arc is the zone radius Rg of this subregion to the distance of base station (i.e. the origin of coordinates).For convenience of explanation, be represented by dotted lines subregion circular arc in fig. 2, base station can be divided into several fanned partitions according to these circular arcs network.By the node broadcasts information of base station to deployment region after subregion, the area code of self after node receives, can be calculated according to the distance to base station.
Below, the present invention will describe network zoning of the present invention process in detail according to specific embodiment.
(1) nodes i broadcast bag HELLO (IDi, (N (i) .xd, N (i) .yd), d1), containing the identifier ID i of node i, coordinate (N (i) .xd of node i in bag, N (i) .yd) and communication threshold d1, calculate the distance absolute value d of node i after other nodes j receives bag
i → jif, d
i → j≤ d
1then j also stores in its routing table as neighbors by node i;
(2) base station initiates a message using R1 as communication radius and wraps Message (n+1, (N (n+1) .xd, N (n+1) .yd), Rg), the computing formula Rg of the identifier (n+1) of base station, base station coordinates and zone radius is comprised respectively in message, calculate it to the distance absolute value of base station according to base station coordinates after receiving message from the region 1 interior joint i that base station is nearest and store Rg, packet Messagel (i will be sent afterwards to its neighbors, n+1, (N (n+1) .xd, N (n+1) .yd), d1);
(3) after the neighbors j of node i receives, calculate the distance absolute value of base station according to message, and message Messagel interior joint identifier i changed to j, backward its neighbors forward;
(4) step (3) is repeated, until all nodes all calculate the distance of base station;
(5) base station is according to the distance absolute value MAX_Dis (d to its node farthest
i → BS) and compare with zone radius, if R
tt-1< MAX_Dis≤R
tt, then base station obtains zoning in network and adds up to tt;
(6) node i is then according to the distance absolute value to base station, and calculate regional number N (i) .Z of self, account form is:
If d
i → BS≤ R
1, then N (i) .Z=1;
Otherwise, if R
g-1< d
i → BS≤ R
g, (g>=2), then N (i) .Z=g.
Then, according to above step to network configuration behind network zoning as shown in Figure 2, after subregion, network is divided into multiple sector region, and the subregion nearest from base station is the first subregion Z1, because this part area is less, does not indicate in Fig. 2, Z in figure
grepresent g subregion (2≤g≤tt, g ∈ Z
+), Z
+represent positive integer.R1 on transverse axis---R5 represents the zone radius of each subregion determined in step S21.
After completing Region dividing, described method also comprises, and arranges a management node in described each subregion.As shown in " * " node in Fig. 2, the position of described management node in subregion fixes and energy is unrestricted.
Step S3, for the node of subregion being arranged in Minimum Area radius, described node directly communicates with base station; For the node being arranged in other subregions, according to zone radius order from small to large, select node that in all neighborss of this node, communication cost is minimum as via node.
The method for routing of wireless sensor network disclosed by the invention, take into full account the subregion area code of node, energy, the node distance to management node or base station, node i will select routing node according to area code, communication cost size from its all neighbors j (1≤j≤n, j ≠ i).Different subregion area codes represents this subregion diverse location in the network, and the distance of distance base station is also different, and in the present embodiment, subregion area code is little, and the zone radius of this subregion is just little.
Particularly, for the node of subregion being arranged in Minimum Area radius, that is, be arranged in the node of first subregion nearest from base station, directly will send data to base station.That is, for the node being arranged in first subregion nearest from base station, without the need to adopting the routing mode of multi-hop.
For the node in other subregions except the first subregion, then need the routing mode adopting multi-hop to send data, specifically comprise:
S31, calculates the communication cost of all neighborss of this node;
S32, the neighbors selecting communication cost minimum in all neighborss that zone radius is less than the zone radius of this subregion is as via node;
S33, if the neighbors not having described in step S32, then equals according to zone radius, order that zone radius is greater than this partitioned area radius respectively, and the neighbors selecting communication cost minimum from all neighborss of above-mentioned corresponding subregion is as via node.
Particularly, for the node in other subregions except the first subregion, first can communication cost be selected minimum as down hop routing node in all neighborss that area code is less than this subregion; If there is not such node, then equal it according to area code respectively, be greater than the node that its order selects communication cost minimum from corresponding subregion.
According to embodiments of the invention, communication cost N (j) .cost of the neighbors j of described node i can obtain according to formula (3):
N (j) .cost in formula (3) represents the communication cost of the neighbors j of node i, described neighbors j in the subregion of Minimum Area radius, j ≠ i, 1≤i≤n, 1≤j≤n, i, j are positive integer, n represents described sensor nodes in wireless sensor network number, d
i → jrepresent the distance between node i and neighbors j, d
j→ N (j) .head represents the distance between neighbors j and the management node of node i, and N (j) .re represents the dump energy of neighbors j.
Communication cost N (j) .cost of the neighbors j of described node i can also obtain according to formula (4)
N (j) .cost in formula (4) represents the communication cost of the neighbors j of node i, described neighbors j is in the subregion of non-minimum zone radius, j ≠ i, 1≤i≤n, 1≤j≤n, i, j are positive integer, and n represents described sensor nodes in wireless sensor network number, d
i → jrepresent the distance between node i and neighbors j, d
j → BSrepresent the distance between neighbors j and described base station, N (j) .re represents the dump energy of neighbors j.
The energy of described node j is larger, distance management node or base station nearer, have larger probability and carry out forwarding data as next-hop node.
In order to ensure the validity of method for routing, the node near base station directly can send the data to base station, and the node near described base station refers to the node of the subregion being arranged in Minimum Area radius.The routing procedure of node i (i ≠ n+1) is as follows:
In said method 1.-4. row be the initialization procedure to parameter, wherein MNnum represents the number of management node in network, because the identifier of base station is defined as n+1, therefore, the identifier of management node is from n+2, and whether N (i) .flag_multiHop is used for mark node i and adopts multi-hop mode to carry out data transmission, and initial value is that 1 expression adopts multi-hop mode, N (i) .nexthop is then used for preserving the identifier of node i down hop routing node, and initial value is 0; In method 5.-9. row is in order to decision node i (1≤i≤n) area code size, if area code equals 1, then node i is without the need to via other node for data forwarding, but directly sends the data to base station, now, the multi-hop indexed variable of node i can be set to 0; The
row is in order to carry out adopting multi-hop mode to send the node i routing procedure of data, Qi Zhong
row is used for communication cost N (tempHeads (the j)) .cost of all neighbors j of computing node i, the
row is multihop routing strategy: the node j that first node i can select communication cost minimum in all neighborss that area code is less than him as down hop routing node, in square method
oK, if there is not such routing node, node i can equal it according to area code respectively, be greater than its order selects according to the principle that communication cost is minimum, in square method from the neighbors of corresponding region
oK; The
row is base station in order to the routing node of management node in defined range 1, and the multi-hop mark of this management node is set to 0, wherein in network the identifier of management node from n+2; The
row is in order to the routing node of other management nodes outside defined range 1, and MNnum represents management node total number in network, and the down hop of this category node is the management node of less than its area code 1.
According to the present invention, the classifying rationally of network area, for reducing to greatest extent, internodal communication energy consumption is most important.Below, the present invention is inquired into the best value of parameter c1, c2 in formula (1) subregion radius by emulation experiment.According to subregion radius optimal computed formula in the method for routing (being hereinafter referred to as I-ERGDSR again) of wireless sensor network of the present invention, and by the RDSR of I-ERGDSR method and prior art, ERGDSR method compares analysis, in experiment, hypothesis has 200 general sensor nodes to be randomly dispersed in 200m*200m two dimensional surface region, node primary power is 0.5J, data package size is 400bits, it is 30m that communication threshold d1 tests value, in experiment, other variable-values of part please refer to document " Fan Shuping, Gao Wei, horse bezoar English. Routing Protocol [J] energy-conservation in a kind of radio temperature sensor network. Agriculture of Anhui science .2011, 39 (2), 1126-1128 ".
In order to reasonably divide network area, reduce internodal communication energy consumption to a greater extent, below, the present invention is discussed the value of parameter c1, c2 in formula (1) subregion radius by emulation experiment.According to the routing procedure of this paper algorithm interior joint, region 1 interior joint by directly and base station carry out data transmission, namely the value of parameter c1 will ensure that in the communication range of base station all nodes in zone 1, therefore, the value of c1 is no more than 1.Directly affects other region area sizes except region 1 according to the value of formula (2) parameter c2, when c2 value is too small, the region divided in network is more, the region area causing area code little is little, node is relatively less, and these nodes often need the data forwarding the larger node transmission of area code, therefore, the power consumption of these nodes can be more, death comparatively early, causes the interior joint power consumption of each region unbalanced, the overall performance of network is declined; And when c2 value is excessive, in network, number of partitions is very few, the number of management node is few, when node outside all regions 1 sends data, need to send to management node few in number, the roundabout forwarding of data can be caused, consume energy in network also more, therefore, the value of parameter c2 is discussed, and to reduce network energy consumption to a greater extent most important.
In emulation experiment, when considering that c2 gets 1,2,3,4,5 five different value respectively, parameter c1 gets 0.1,0.2 ..., each round nodes catabiotic mean value during 10 values.Experiment has carried out 50 times, and each algorithm runs 10 and takes turns.Experimental result is shown in Fig. 3, therefrom can find out when c2 is between 13 during value, the overall power consumption often taking turns nodes is on a declining curve, as c2=3, the power consumption of overall network power consumption minimum and each round is relatively more balanced, as can be seen from figure also, when c2 value more greatly 4 or 5 time, although in indivedual round, network power consumption is with close during c2=3, but the overall energy consumption that rear network is taken turns in operation ten is more, therefore, in order to save the energy that nodes consumes further, under routing algorithm experimental situation in this paper, the value of c2 is set to 3.
Fig. 4 gives c2=3, and c1 gets 0.1,0.2 respectively ..., during 0.8 5 different values, in each round network, all node energies consume trend.Experimental result shows when c2=3, when c1 gets 0.1,0.2, energy and the fluctuation of often taking turns nodes consumption are less, show that each minor node of taking turns totally consumes energy more balanced, then along with the increase of c1 value, overall network power consumption is in rising trend, this is mainly because c1 value is larger, region 1 interior joint is more, and these nodes are owing to carrying out single-hop communication with base station, causes network to consume energy more.Although when c1 gets 0.1, often take turns energy that node consumes and less and more balanced, but in this case, the subregion (region 1) of neighbor base station is minimum, the minimum number of region interior joint, and these node neighbor base stations burden is heavier, meeting is premature death due to big energy-consuming, cause " blind spot " in this subregion, please refer to open source literature " Fan Shuping; Gao Wei; horse bezoar English. Routing Protocol [J] energy-conservation in a kind of radio temperature sensor network. Agriculture of Anhui science .2011,39 (2), 1126-1128 ".In order to better solve " hot-zone " problem near base station, please refer to open source literature " Zhang Dan, Yao Nianmin, horse bezoar English, etc. based on the Research of Routing Algorithm [J] of key node in wireless sensor network.Small-sized microcomputer system .2014,31 (5): 1037-1040 ", under routing algorithm experimental situation in this paper, the value of c1 is 0.2.
From Fig. 3, Fig. 4 also can find out, I-ERGDSR algorithm often when operation the 2nd is taken turns the energy of network consumption more, this is because when algorithm operation the 1st is taken turns, primary power due to all nodes is equal is 0.5J, in node-routing process, main consideration communication distance factor, and according to the minimum node of the result of calculation chosen distance of communication cost as routing node, because node cost energy is directly proportional to communication distance, therefore, network in general less energy intensive, and algorithm takes turns from the 2nd, because the dump energy of each node has difference, communication cost then will consider energy and distance two factors on calculating, therefore, the down hop routing node of each sensor selection problem may not be the minimum node of communication distance, so overall network power consumption can be larger.
In Fig. 5, RDSR, ERGDSR and I-ERGDSR tri-method for routing are run i (i=1,2 ... 10)) after wheel, the energy consumption condition of nodes compares, and emulation experiment has been carried out 10 and taken turns, and often takes turns interior joint and only carries out a secondary data transmission.Be not difficult to find out from Fig. 5, along with the increase of wheel number, the power consumption of RDSR method is maximum and the energy curve of correspondence is unsmooth, and all the other two kinds of method node energies grow steadily, and proposes method for routing I-ERGDSR energy consumption minimization herein.This be due to adopt RDSR method routing procedure interior joint can according to area code from each subregion Stochastic choice node as via node, the optimization of routing node can not be ensured, this can make some node transmitting range far away, node energy consumption is large, in addition, if in RDSR method node deployment at the larger subregion of area code and distance management node is far away time, node will produce Routing Loop in this region, these node energies are caused to exhaust premature death, therefore, adopt that RDSR method universe network energy consumption is large and node power consumption is unbalanced; Consider jumping figure, area code and euclidean distance between node pair three factors in application ERGDSR method trunk node selection process, compared with RDSR method, the entirety power consumption of ERGDSR method can be less; And I-ERGDSR method is determined by experiment subregion radius optimal computed formula to network carries out subregion, realize the object reducing node communication power consumption, in addition, the method considers area code, the communication cost of via node in node-routing process, communication cost then considers energy, distance two factors in calculating, directivity to destination node when this makes node data send is stronger, therefore, compared with RDSR, ERGDSR method, the entirety power consumption of the method for routing (I-ERGDSR method) of wireless sensor network of the present invention is less.
Although the present invention discloses as above, the present invention is not defined in this.Any those skilled in the art, without departing from the spirit and scope of the present invention, all can make various changes or modifications, and therefore protection scope of the present invention should be as the criterion with claim limited range.
Claims (8)
1. a method for routing for wireless sensor network, described wireless sensor network comprises multiple sensor node and a base station, it is characterized in that, comprising:
Region dividing is carried out to form multiple subregion with zones of different radius to described wireless sensor network;
For the node of subregion being arranged in Minimum Area radius, described node directly carries out data communication with described base station;
For the node being arranged in other subregions, according to zone radius order from small to large, select node that in all neighborss of described node, communication cost is minimum as via node;
Describedly Region dividing carried out to described wireless sensor network comprise:
Calculate the zone radius of subregion;
Centered by described base station, according to the zone radius determined, Region dividing is carried out to described wireless sensor network;
Wherein, the computing formula of described zone radius is:
Rg represents the zone radius of g subregion in described wireless sensor network, and g is positive integer, and 1≤g≤tt, tt represents the zone radius sum in described wireless sensor network, and d1 is the communication threshold of node, c1 and c2 is variable element.
2. the method for routing of wireless sensor network as claimed in claim 2, is characterized in that, 0 < c1≤1,1≤c2≤4.
3. the method for routing of wireless sensor network as claimed in claim 3, is characterized in that, the value of described parameter c1 be 0.2, parameter c2 value be 3.
4. the method for routing of wireless sensor network as claimed in claim 1, it is characterized in that, the described node for being arranged in other subregions, according to zone radius order from small to large, select the node that in all neighborss of described node, communication cost is minimum to comprise as via node:
Calculate the communication cost of all neighborss of described node, described communication cost is relevant with position with the energy of node;
In all neighborss that zone radius is less than the zone radius of described node place subregion, the neighbors selecting communication cost minimum is as via node;
When there is not described via node in the subregion being less than described node region radius, then equal in all neighborss of the zone radius of described node place subregion at zone radius, the neighbors selecting communication cost minimum is as via node;
When there is not described via node in the subregion equaling described node region radius, be then greater than in all neighborss of the zone radius of described node place subregion at zone radius, the neighbors selecting communication cost minimum is as via node.
5. the method for routing of wireless sensor network as claimed in claim 1, is characterized in that, also comprise:
After completing Region dividing, arrange a management node in described each subregion, the position of described management node in subregion fixes and energy is unrestricted.
6. the method for routing of wireless sensor network as claimed in claim 5, it is characterized in that, the energy of described node is larger, nearer apart from the distance of described management node or base station, and the communication cost of described node is less.
7. the method for routing of wireless sensor network as claimed in claim 5, it is characterized in that, described communication cost computing formula is:
N (j) .cost represents the communication cost of the neighbors j of node i, and described neighbors j is in the subregion of Minimum Area radius, and j ≠ i, 1≤i≤n, 1≤j≤n, i, j are positive integer, and n represents described sensor nodes in wireless sensor network number, d
i → jrepresent the distance between node i and neighbors j, d
j→ N (j) .head represents the distance between neighbors j and the management node of node i, and N (j) .re represents the dump energy of neighbors j.
8. the method for routing of wireless sensor network as claimed in claim 5, it is characterized in that, described communication cost computing formula is:
N (j) .cost represents the communication cost of the neighbors j of node i, described neighbors j in the subregion of non-minimum zone radius, j ≠ i, 1≤i≤n, 1≤j≤n, i, j are positive integer, n represents described sensor nodes in wireless sensor network number, d
i → jrepresent the distance between node i and neighbors j, d
j → BSrepresent the distance between neighbors j and described base station, N (j) .re represents the dump energy of neighbors j.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410715779.5A CN104661273B (en) | 2014-11-22 | 2014-11-22 | The method for routing of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410715779.5A CN104661273B (en) | 2014-11-22 | 2014-11-22 | The method for routing of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104661273A true CN104661273A (en) | 2015-05-27 |
| CN104661273B CN104661273B (en) | 2017-09-15 |
Family
ID=53251852
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410715779.5A Expired - Fee Related CN104661273B (en) | 2014-11-22 | 2014-11-22 | The method for routing of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104661273B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105101229A (en) * | 2015-07-01 | 2015-11-25 | 广东工业大学 | Routing node layout method for ad-hoc network of traffic signal controller |
| CN106304185A (en) * | 2016-08-18 | 2017-01-04 | 国网天津市电力公司 | A kind of electric power Internet of Things method for routing based on sensing node energy harvesting |
| WO2017214814A1 (en) * | 2016-06-13 | 2017-12-21 | 深圳天珑无线科技有限公司 | Distributed network neighbour processing method, node and system |
| CN108650137A (en) * | 2018-05-17 | 2018-10-12 | 辽宁大学 | Wireless sensor network node is made decisions on one's own formula Routing Protocol |
| CN110366227A (en) * | 2019-07-04 | 2019-10-22 | 太原理工大学 | A kind of anycast's method for routing of wireless sensor network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090046630A1 (en) * | 2007-08-14 | 2009-02-19 | Cheng-Fa Tsai | Data-Transmitting Method for Wireless Sensor Network |
| CN102300281A (en) * | 2011-09-14 | 2011-12-28 | 长安大学 | Routing method for monitoring bridge state based on wireless sensor network |
| CN102572996A (en) * | 2012-02-24 | 2012-07-11 | 重庆大学 | Annulus-based node energy consumption balancing method in heterogeneous sensor network |
-
2014
- 2014-11-22 CN CN201410715779.5A patent/CN104661273B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090046630A1 (en) * | 2007-08-14 | 2009-02-19 | Cheng-Fa Tsai | Data-Transmitting Method for Wireless Sensor Network |
| CN102300281A (en) * | 2011-09-14 | 2011-12-28 | 长安大学 | Routing method for monitoring bridge state based on wireless sensor network |
| CN102572996A (en) * | 2012-02-24 | 2012-07-11 | 重庆大学 | Annulus-based node energy consumption balancing method in heterogeneous sensor network |
Non-Patent Citations (1)
| Title |
|---|
| 张丹，姚念民，马宝英，范书平，杨治秋: "无线传感器网络中基于关键节点的路由算法研究", 《小型微型计算机系统》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105101229A (en) * | 2015-07-01 | 2015-11-25 | 广东工业大学 | Routing node layout method for ad-hoc network of traffic signal controller |
| CN105101229B (en) * | 2015-07-01 | 2018-09-25 | 广东工业大学 | A kind of routing node layout method of traffic signal control ad hoc network |
| WO2017214814A1 (en) * | 2016-06-13 | 2017-12-21 | 深圳天珑无线科技有限公司 | Distributed network neighbour processing method, node and system |
| CN106304185A (en) * | 2016-08-18 | 2017-01-04 | 国网天津市电力公司 | A kind of electric power Internet of Things method for routing based on sensing node energy harvesting |
| CN106304185B (en) * | 2016-08-18 | 2020-03-06 | 国网天津市电力公司 | Electric power Internet of things routing method based on sensing node energy acquisition |
| CN108650137A (en) * | 2018-05-17 | 2018-10-12 | 辽宁大学 | Wireless sensor network node is made decisions on one's own formula Routing Protocol |
| CN108650137B (en) * | 2018-05-17 | 2021-03-02 | 辽宁大学 | Autonomous decision-making type routing protocol for wireless sensor network node |
| CN110366227A (en) * | 2019-07-04 | 2019-10-22 | 太原理工大学 | A kind of anycast's method for routing of wireless sensor network |
| CN110366227B (en) * | 2019-07-04 | 2022-07-12 | 太原理工大学 | Anycast routing method of wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104661273B (en) | 2017-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104661273A (en) | Routing method of wireless sensor network | |
| CN104394566B (en) | A kind of low power consumption adaptive clustering and multi-hop wireless sensor network topology control method based on fuzzy decision | |
| Kumar et al. | Position-based beaconless routing in wireless sensor networks | |
| Tripathi et al. | Comparison of reactive and proactive routing protocols for different mobility conditions in WSN | |
| CN105393596A (en) | Optimizing communication for mesh routing protocols using directional beam forming | |
| Modekurthy et al. | Distributed graph routing for wirelesshart networks | |
| CN103200643A (en) | Distributed fault-tolerant topology control method based on dump energy sensing | |
| Jardosh et al. | A survey: Topology control for wireless sensor networks | |
| Khan et al. | Performance improvement in wireless sensor and actor networks based on actor repositioning | |
| CN103701705A (en) | Mobile sink data acquisition method based on binary tree inquiry in wireless sensor network | |
| Ortiz et al. | Intelligent route discovery for ZigBee mesh networks | |
| Feyzi et al. | Application of fuzzy logic for selecting the route in AODV routing protocol for vehicular ad hoc networks | |
| CN103826282B (en) | Set based on dump energy divides multi-hop routing method | |
| CN103260206A (en) | Mixing dynamic wireless router effective search convergence method based on influence degree factors | |
| Lee et al. | Radio-disjoint geographic multipath routing for reliable data transfer in lossy WSNs | |
| AU2018101627A4 (en) | An apparatus and method based on trust index of wireless node for multiple / best route discovery in the wireless sensor network platform. | |
| Mitton et al. | Hector is an energy efficient tree-based optimized routing protocol for wireless networks | |
| Rahman et al. | An efficient position based power aware routing algorithm in mobile ad-hoc networks | |
| Kumar et al. | An on demand routing protocol AODV with end to end reliability and backward route information | |
| Jung et al. | Localized disjoint multipath routing protocol in irregular wireless sensor networks | |
| Kouassi et al. | Performance study of an improved routing algorithm in wireless sensor networks | |
| Jawad et al. | Network lifetime enhancement in wireless sensor networks using secure alternate path | |
| Gelal et al. | Topology control to simultaneously achieve near-optimal node degree and low path stretch in ad hoc networks | |
| Amirshahi et al. | Modeling geographical anycasting routing in vehicular networks | |
| Sarasvathi et al. | A Multi Route Rank Based Routing Protocol for Industrial Wireless Mesh 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170915 |