CN107182091A - A kind of non-homogeneous route transmission method and its device based on wireless sensor network - Google Patents
A kind of non-homogeneous route transmission method and its device based on wireless sensor network Download PDFInfo
- Publication number
- CN107182091A CN107182091A CN201710561443.1A CN201710561443A CN107182091A CN 107182091 A CN107182091 A CN 107182091A CN 201710561443 A CN201710561443 A CN 201710561443A CN 107182091 A CN107182091 A CN 107182091A
- Authority
- CN
- China
- Prior art keywords
- cluster head
- mrow
- cluster
- msub
- base station
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
- H04W28/082—Load balancing or load distribution among bearers or channels
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of non-homogeneous route transmission method based on wireless sensor network and its device, including：Clustering operation is carried out to each sensor node in wireless sensor network, the cluster and cluster head residing for each sensor node is determined；Build between each cluster head and the two-way directed connected graph between cluster head and base station；According to default multi-path data transmission rule, the data transfer path between each cluster head and base station is selected, and carry out data transmission according to data transfer path.The present invention connects each cluster head using the structure of connected graph so that include mulitpath between cluster head and base station, the balanced data volume of each cluster head, reduces the consumption of additional energy and improves reliability of the network when there is cluster head failure.
Description
Technical field
It is more particularly to a kind of based on the non-of wireless sensor network the present invention relates to wireless sensor network technology field
Uniform route transmission method and its device.
Background technology
It is many at present using Uneven Cluster routing algorithm (i.e. signified layer in the narrow sense in wireless sensor network (WSN)
Secondary Routing Protocol), wireless sensor network node is divided into two levels in Uneven Cluster routing algorithm：Underlay nodes quantity
It is less, more undertake the task of forwarding data；Outer layer number of nodes is more, mainly undertakes data acquisition session.For multi-hop
Transmission mode, the groundwork of cluster head is：One is to merge the data that cluster member sends, and two are transferred data to from base station (BS)
Closer to cluster head.Therefore the cluster head close to BS not only will merge and send the data of other members of oneself cluster, also to merge and send out
Subordinate's data that cluster head transmission comes are sent, therefore the energy expenditure of such cluster head is bigger.
Shown in Figure 1, stain represents cluster head in Fig. 1, and circle represents the cluster around the formation of this cluster head, and arrow represents number
According to direction of transfer.The cluster head that the data of collection member node first in cluster is transmitted to respective cluster is merged, and is then passed to
Level (nearer from BS) cluster head is merged again, is finally transmitted to base station.
But, in the cluster-level routing stage, multi-hop transmission strategy is mostly used using base station as tree root, all cluster heads be limb or
The tree topology of leaf.There is following defect in itself in this tree construction：(1) forwarding tree structure is once completed, between cluster head
Relationship between superior and subordinate is that data transfer path is also determined that, is difficult to change again in the wheel that sub-clustering is completed；(2) it is near apart from base station
Cluster head, due to undertake more data forwarding tasks from its descendants's cluster head, therefore its energy expenditure is huge, easily causes
Data jamming and quick death；(3) in tree construction, once a limb cluster head failure, can cause entirely to associate limb work
Failure, forms chain rupture, it is necessary to continually executive board's portion's Clustering Routing, when wasting node energy and adding network transmission
Prolong；(4) when the subtree of some limb is more and it is frequent transmission data when, the local energy of the limb can be caused to consume excessively, with
And data jamming, add the delay of data transfer；(5) in different paths cluster head between need exchange data when, it is necessary to base
Stand forwarding, result in extra energy expenditure.
Therefore, how to provide it is a kind of can solve the problem that above mentioned problem caused by tree construction based on the non-of wireless sensor network
Uniform route transmission method and its device are the problem of those skilled in the art need solution at present.
The content of the invention
It is an object of the invention to provide a kind of non-homogeneous route transmission method based on wireless sensor network and its device,
Each cluster head is connected using the structure of connected graph so that include mulitpath between cluster head and base station, the balanced number of each cluster head
According to amount, reduce the consumption of additional energy and improve reliability of the network when there is cluster head failure.
In order to solve the above technical problems, the invention provides a kind of non-homogeneous route transmission based on wireless sensor network
Method, including：
Clustering operation is carried out to each sensor node in the wireless sensor network, each sensor node is determined
Residing cluster and cluster head；
Build between each cluster head and the two-way directed connected graph between cluster head and base station；
According to default multi-path data transmission rule, the data transmission route between each described cluster head and the base station is selected
Footpath, and carry out data transmission according to the data transfer path.
Preferably, the process of the two-way directed connected graph between described each cluster head of structure and between cluster head and base station is specific
For：
The distance of base station described in command range is not more than d0Cluster head and the base station between form link；If apart from described
Base station distance d0In the range of do not include cluster head, then several cluster heads nearest apart from base station are connected with the base station；d0For institute
State the energy consumption threshold value of the radio model of wireless sensor network；
In higher level's list that the base station is added to connected cluster head, the cluster head being connected with the base station adds described
In subordinate's list of base station；Data transfer direction is to be transmitted from subordinate's cluster head to the higher level of itself；
Cluster head i and cluster head j spacing and default spacing threshold are compared, if not less than the default spacing threshold,
Link is not then formed between two cluster heads, if less than the default spacing threshold, two are determined according to default link predicting relation formula
Whether link is formed between cluster head；Cluster head i and cluster head j is any two cluster head in the wireless sensor network；
The default spacing threshold is：
(q+di/dmax)×d0；
diVertical range for cluster head i relative to the base station, dmaxIt is relative for the whole wireless sensor network region
Farthest vertical range in the base station, q is density control constant；
The default link predicting relation formula is specially：
Wherein, djVertical range for cluster head j relative to the base station, RiIt is cluster head i cluster radius, RjFor cluster head j cluster
Radius；
It is empty isolated cluster head for higher level's list, screening is apart from described isolated after the completion of link is built between each cluster head
Cluster head distance most short several cluster heads, and the nearest cluster head in chosen distance base station from the distance most short several cluster heads
Added in higher level's list of the isolated cluster head；If not finding the cluster head for meeting above-mentioned condition, control the isolated cluster head with
The base station connection.
Preferably, described each sensor node in the wireless sensor network carries out the process tool of clustering operation
Body is：
The cluster radius R of each sensor node in the wireless sensor network is calculated according to competition radius relationship formulai；Institute
Stating competition radius relationship formula is：
d(vi, sink) and it is sensor node viTo the distance of the base station, c is 0
A constant coefficient between to 1, dminIt is minimum distance of each sensor node away from the base station, dmaxIt is each sensor node
Maximum distance away from the base station；
Clustering operation is periodically carried out, in each clustering operation cycle, is proceeded as follows：
Screen and do not include the sensor node of cluster head in presently described wireless sensor network in itself cluster radius as not
Capped node；
Sensor node v is determined according to ballot paper relational expressioniThrow and give its neighbor node vjBallot paper v (vi,vj), the ballot paper
Relational expression is：
Wherein, neighbor node refer to a sensor node using from as the center of circle, cluster radius be the circle that radius is constituted in covering
Sensor node；dikFor node viTo vkDistance, vkTravel through sensor node viAll neighbor nodes, ejFor node vj's
Dump energy；
Sensor node v is calculated according to summation relational expressioniNumber of ballot papers, the summation relational expression is：
Sensor node v is calculated according to weight relationship formulaiWeighted value Ii, the weight relationship formula is：
Wherein, PiIt is node viTo the average distance of its all neighbor node；
The maximum sensor node of selection weighted value is used as cluster head；
For not turning into the sensor node of cluster head in this cycle, if it is in the cluster radius of multiple cluster heads, foundation
Fitness relational expression calculates the fitness value of each cluster head, and makes the cluster of sensor node addition fitness value highest cluster head
It is interior；The fitness relational expression is：
Wherein, degreeiFor sensor node viDegree.
Preferably, the default multi-path data transmission rule is specially：
The cluster head of the base station is included in itself higher level's list, the base station is directly transferred data to；
The interior cluster head not comprising the base station of itself higher level's list is from itself in level list, and selection base element is optimal
Higher level as data transfer immediate superior；The base element is higher level's cluster head mark ID, the current residual energy of higher level's cluster head
Measure Enode, pass through higher level's cluster head to the minimum ENERGY E needed for base stationBS, pass through the minimal time delay T of higher level's cluster head to base stationdelay、
Higher level's cluster head transmission data volume N in any one.
Preferably, the default multi-path data transmission rule is specially：
The cluster head of the base station is included in itself higher level's list, the base station is directly transferred data to；
Do not include the cluster head of the base station in itself higher level's list, itself level row onto itself is calculated according to transitive relation formula
The delivery value TranV (i) of each higher level's cluster head in table, and by own data transmission to the maximum higher level's cluster head of the delivery value
It is interior；The transitive relation formula is：
Wherein, s is weight coefficient, and E (i) is higher level's cluster head i current remaining, EaveEnFor this week it is interim it is all not by
The average energy of overlay node.
In order to solve the above technical problems, present invention also offers a kind of non-homogeneous route biography based on wireless sensor network
Defeated device, including：
Sub-clustering module, for carrying out clustering operation to each sensor node in the wireless sensor network, it is determined that
Cluster and cluster head residing for each sensor node；
Connected graph builds module, for building the two-way directed connected graph between each cluster head and between cluster head and base station；
Path selection module, for according to default multi-path data transmission rule, selecting each described cluster head and the base
Data transfer path between standing, and carry out data transmission according to the data transfer path.
Preferably, the connected graph builds module and specifically included：
Base station connects control unit, and the distance for base station described in command range is not more than d0Cluster head and the base station it
Between form link；If apart from the base station distance d0In the range of do not include cluster head, then by several clusters nearest apart from base station
Head is connected with the base station；d0For the energy consumption threshold value of the radio model of the wireless sensor network；
List cell, for the base station to be added in higher level's list of connected cluster head, is connected with the base station
Cluster head add in subordinate's list of the base station；Data transfer direction is to be transmitted from subordinate's cluster head to the higher level of itself；
Link setting unit, for cluster head i and cluster head j spacing and default spacing threshold to be compared, if being not less than
The default spacing threshold, then do not form link between two cluster heads, if less than the default spacing threshold, sentencing according to default link
Determine relational expression determines whether form link between two cluster heads；Cluster head i and cluster head j is any two in the wireless sensor network
Individual cluster head；
The default spacing threshold is：
(q+di/dmax)×d0；
diVertical range for cluster head i relative to the base station, dmaxIt is relative for the whole wireless sensor network region
Farthest vertical range in the base station, q is density control constant；
The default link predicting relation formula is specially：
Wherein, djVertical range for cluster head j relative to the base station, RiIt is cluster head i cluster radius, RjFor cluster head j cluster
Radius；
Isolated processing unit, is empty isolated cluster for higher level's list after the completion of link is built between each cluster head
Head, is screened apart from the isolated cluster head distance most short several cluster heads, and is selected from the distance most short several cluster heads
The cluster head nearest apart from base station is selected to be added in higher level's list of the isolated cluster head；If not finding the cluster for meeting above-mentioned condition
Head, controls the isolated cluster head to be connected with the base station.
Preferably, the sub-clustering module is specifically included：
Cluster radius calculation unit, for calculating each sensing in the wireless sensor network according to competition radius relationship formula
The cluster radius R of device nodei；It is described competition radius relationship formula be：
d(vi, sink) and it is sensor node viTo the distance of the base station, c is 0
A constant coefficient between to 1, dminIt is minimum distance of each sensor node away from the base station, dmaxIt is each sensor node
Maximum distance away from the base station；
Periodicity sub-clustering unit, in each clustering operation cycle, screening in presently described wireless sensor network certainly
The sensor node not comprising cluster head is used as uncovered node in body cluster radius；Sensor node is determined according to ballot paper relational expression
viThrow and give its neighbor node vjBallot paper v (vi,vj), the ballot paper relational expression is：
Wherein, neighbor node refer to a sensor node using from as the center of circle, cluster radius be the circle that radius is constituted in covering
Sensor node；dikFor node viTo vkDistance, vkTravel through sensor node viAll neighbor nodes, ejFor node vj's
Dump energy；
Sensor node v is calculated according to summation relational expressioniNumber of ballot papers, the summation relational expression is：
Sensor node v is calculated according to weight relationship formulaiWeighted value Ii, the weight relationship formula is：
Wherein, PiIt is node viTo the average distance of its all neighbor node；
The maximum sensor node of selection weighted value is used as cluster head；For not turning into the sensor section of cluster head in this cycle
Point, if it is in the cluster radius of multiple cluster heads, the fitness value of each cluster head is calculated according to fitness relational expression, and order should
Sensor node is added in the cluster of fitness value highest cluster head；The fitness relational expression is：
Wherein, degreeiFor sensor node viDegree.
The invention provides a kind of non-homogeneous route transmission method based on wireless sensor network and its device, in sub-clustering
Afterwards, construct between each cluster head and the two-way directed connected graph between cluster head and base station.It is understood that using connected graph
Structure so that the path of many cluster heads to base station becomes not unique, i.e., the relationship between superior and subordinate between cluster head is not to determine, this
In the case of kind, the number that the balanced cluster head nearer apart from base station undertakes can be come by the default multi-path data transmission rule of adjustment
According to amount, the situation for reducing part cluster head energy charge excessive caused data jamming and quick death occurs；And due to connected graph
The situation of multipath, in the case where there is cluster head failure, also reduces the influence to other cluster heads, cluster associated with it as far as possible
Head can be carried out data transmission by other paths, and the situation that chain rupture is avoided as far as possible occurs, and using the structure of connected graph,
Also connection is had between cluster head in different paths substantially, is not directly connected in time, in most cases can also be by other
Cluster head is forwarded, and without being forwarded every time by base station, is simplified the path of data forwarding, is reduced extra energy and disappear
Consumption.
Brief description of the drawings
Technical scheme in order to illustrate the embodiments of the present invention more clearly, below will be to institute in prior art and embodiment
The accompanying drawing needed to use is briefly described, it should be apparent that, drawings in the following description are only some implementations of the present invention
Example, for those of ordinary skill in the art, on the premise of not paying creative work, can also be obtained according to these accompanying drawings
Obtain other accompanying drawings.
A kind of stream of the process for non-homogeneous route transmission method based on wireless sensor network that Fig. 1 provides for the present invention
Cheng Tu；
A kind of flow chart of the process for structure connected graph that Fig. 2 provides for the present invention；
A kind of flow chart of the process for clustering operation that Fig. 3 provides for the present invention；
A kind of structural representation for non-homogeneous route transmission device based on wireless sensor network that Fig. 4 provides for the present invention
Figure.
Embodiment
The core of the present invention is to provide a kind of non-homogeneous route transmission method based on wireless sensor network and its device,
Each cluster head is connected using the structure of connected graph so that include mulitpath between cluster head and base station, the balanced number of each cluster head
According to amount, reduce the consumption of additional energy and improve reliability of the network when there is cluster head failure.
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention
In accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is
A part of embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art
The every other embodiment obtained under the premise of creative work is not made, belongs to the scope of protection of the invention.
It is shown in Figure 1 the invention provides a kind of non-homogeneous route transmission method based on wireless sensor network, figure
A kind of flow chart of the process of the 1 non-homogeneous route transmission method based on wireless sensor network provided for the present invention；The party
Method includes：
Step s1：Clustering operation is carried out to each sensor node in wireless sensor network, each sensor is determined
Cluster and cluster head residing for node；
It is understood that cluster head turns into after cluster head, can broadcast itself turns into the message of cluster head, and other cluster heads receive this and disappeared
After breath, decided whether and cluster head formation link according to ad hoc rules using the message.
Step s2：Build between each cluster head and the two-way directed connected graph between cluster head and base station；
Step s3：According to default multi-path data transmission rule, the data transmission route between each cluster head and base station is selected
Footpath, and carry out data transmission according to data transfer path.
In a preferred embodiment, it is shown in Figure 2, a kind of stream of the process for structure connected graph that Fig. 2 provides for the present invention
Cheng Tu；Step s2 process is specially：
Step s21：The distance of command range base station is not more than d0Cluster head and base station between form link；If apart from base station
Apart from d0In the range of do not include cluster head (such case is less to be occurred, and is when occurring dead compared with multinode in a network mostly),
Then several cluster heads nearest apart from base station are connected with base station；d0For the energy consumption threshold of the radio model of wireless sensor network
Value；
It is understood that the cluster head near apart from base station will forward more data, energy consumption can be bigger, so allowing beside base station
Cluster head be joined directly together as far as possible with base station, can the balanced cluster head apart from the hop distance of base station one energy consumption.
Step s22：Base station is added in higher level's list of connected cluster head, the cluster head being connected with base station adds base station
Subordinate's list in；Data transfer direction is to be transmitted from subordinate's cluster head to the higher level of itself；
To reach cluster head from sensor node it is understood that because data transfer is directive, then by cluster head by
Level is transmitted to base station, therefore, it is necessary to which the direction of explicit data transmission, that is, determine that the superior and the subordinate of two nodes close after link is set up
System.
Step s23：Cluster head i and cluster head j spacing and default spacing threshold are compared, if not less than default spacing threshold
Value, then do not form link between two cluster heads, if less than default spacing threshold, two clusters are determined according to default link predicting relation formula
Whether link is formed between head；Cluster head i and cluster head j is any two cluster head in wireless sensor network；
Default spacing threshold is：
(q+di/dmax)×d0；
diVertical range for cluster head i relative to base station, dmaxIt is whole wireless sensor network region relative to base station
Farthest vertical range, q is density control constant；
Presetting link predicting relation formula is specially：
Wherein, djVertical range for cluster head j relative to base station, RiIt is cluster head i cluster radius, RjFor cluster head j cluster half
Footpath；
It is understood that above-mentioned relation formula ensures that how far of two cluster heads apart from base station exceedes (Ri+Rj)/2,
Link can be formed, data roundabout forwarding in a network is prevented.di/dmaxEnsure to form closeer between the cluster head nearer apart from base station
, because the cluster head near apart from base station will undertake more forwarding tasks, there is more selection on the side of collection in data transmission procedure
Path, so that the excessive energy consumption that balanced and reduction needs forwarding more data apart from the nearlyer cluster head in base station and produced.
Step s24：After the completion of link is built between each cluster head, it is empty isolated cluster head for higher level's list, screens distance
Isolated cluster head is apart from several most short cluster heads, and the nearest cluster head in chosen distance base station from apart from several most short cluster heads
Added in higher level's list of isolated cluster head；If not finding the cluster head for meeting above-mentioned condition, the isolated cluster head of control is connected with base station.
It is understood that between cluster head and cluster head or cluster head and base station formed link when, in order to do not make data because
It is roundabout and waste energy in connected graph transmitting procedure, two restraining factors need to be taken：(a) distance must be certain between two cluster heads
Within the scope of, it is typically limited to the energy consumption threshold values d of radio model0It is interior, the energy consumption of data transmission will be substantially reduced；(b) two
Relative vertical distance between cluster head and base station have to be larger than itself cluster radius, it is ensured that during data transfer along apart from base station more
Near direction forwarding.
Because the connected graph that cluster head and base station are constituted is two-way digraph, the connection is kept by the superior and the subordinate's neighbor list
The relation on side in figure, is ultimately formed using base station and all cluster heads as node set V, using the relation of the superior and the subordinate's neighbor list as side collection
Close E connected graph G (V, E).Each cluster head (including base station) is required for safeguarding higher level's neighbor list and a subordinate neighbours
List.Higher level's neighbor list is used for storing all immediate superiors (cluster head for having side to be connected with the cluster head, and apart from base of the cluster head
Stand closer to), each element therein is with five-tuple U (ID, an Enode,EBS,Tdelay, N) represent.Wherein, ID is higher level's cluster
Leader is known；EnodeFor the current remaining of higher level's cluster head；EBSFor by higher level's cluster head to the minimum energy needed for base station,
Represent Communication cost；Tdelay, to the minimal time delay of base station, to represent data delay by higher level's cluster head；N is higher level's cluster head
The data volume of transmission, represents link load.All direct subordinates that subordinate's neighbor list is used for storing the cluster head (have with the cluster head
The connected cluster head in side, and farther apart from base station), each element therein is with one two tuple U (ID, Enode) represent.Wherein,
ID is subordinate's cluster head mark；EnodeFor the current remaining of subordinate's cluster head.
Wherein, before clustering operation is carried out, in addition it is also necessary in a square detection zone, uniformly dispose at random N number of
Sensor node, each sensor node calculates it the distance between with surrounding neighbours node respectively, and base station calculate its with it is every
Distance between individual sensor node.After the completion of evaluation work, base station is broadcasted to whole network and base is included in a piece of news, message
Stand to the longest distance d of nodesmaxWith beeline dmin.The two distance measurements are in Uneven Cluster algorithm based on
Calculate the size of related cluster.
In a preferred embodiment, it is shown in Figure 3, a kind of stream of the process for clustering operation that Fig. 3 provides for the present invention
Cheng Tu；Step s1 process is specially：
Step s11：The cluster radius of each sensor node in wireless sensor network is calculated according to competition radius relationship formula
Ri；Competing radius relationship formula is：
d(vi, sink) and it is sensor node viTo the distance of base station, c is 0 to 1
Between a constant coefficient, dminIt is minimum distance of each sensor node away from base station, dmaxIt is each sensor node away from base station
Maximum distance；
It is understood that including a cluster head and some ordinary sensors sections for information gathering in each cluster
Point, the cluster radius closer to base station is smaller, and cluster member is fewer, and vice versa.Wherein the criterion of neighbor node depends on cluster
Compete radius Ri, a node is with RiIt is exactly the neighbor node of the sensor node for the nodes that are covered in the circle of radius
Number, therefore RiThe quality of value directly opposite has influence on the quality of election cluster head.RiSelection dependent on network area size and
The energy consumption threshold values d of radio model0, generally there is Ri<d0。
Clustering operation is periodically carried out, in each clustering operation cycle, is proceeded as follows：
Step s12：Screen the sensor node work for not including cluster head in current wireless sensor network in itself cluster radius
For non-overlay node；
Step s13：Sensor node v is determined according to ballot paper relational expressioniThrow and give its neighbor node vjBallot paper v (vi,vj),
Ballot paper relational expression is：
Wherein, neighbor node refer to a sensor node using from as the center of circle, cluster radius be the circle that radius is constituted in covering
Sensor node；dikFor node viTo vkDistance, vkTravel through sensor node viAll neighbor nodes, ejFor node vj's
Dump energy；
Step s14：Sensor node v is calculated according to summation relational expressioniNumber of ballot papers, summation relational expression be：
Step s15：Sensor node v is calculated according to weight relationship formulaiWeighted value Ii, weight relationship formula is：
Wherein, PiIt is node viTo the average distance of its all neighbor node；
Step s16：The maximum sensor node of selection weighted value is used as cluster head；
Step s17：For not turning into the sensor node of cluster head in this cycle, if it is in the cluster radius of multiple cluster heads
When, the fitness value of each cluster head is calculated according to fitness relational expression, and make the sensor node add fitness value highest
In the cluster of cluster head；Fitness relational expression is：
Wherein, degreeiFor sensor node viDegree.
It should be noted that if a cluster head is in the cluster radius of a sensor node, this sensor node
It is referred to as " capped ".Similar, if without cluster head in its vicinity, the sensor node is referred to as " uncovered
".During sub-clustering, dump energy information is generally possible to enclose other important informations to reduce the traffic.The sub-clustering stage is by a series of
Iteration is constituted, in iterative process each time, if a sensor node finds its weight in all uncovered neighbours
It is maximum to occupy in node, and it selects to turn into cluster head itself, and sends a CH notification message to its all neighbor node.Its
Remaining sensor node needs to wait t2Time so as to its each self-check in its communication context whether there is other cluster heads, it is assumed that
Certain node finds that it is covered by a cluster head, and the election that it will move out the wheel iteration exits WITHDRAW by broadcasting one
Message.All sensor nodes will all wait t3 time to collect these exit messages.After iteration each time, these
Uncovered sensor node may form a similar network topology.In order to handle some fringe node problems, one
Individual uncovered node recalculates the weight of oneself on the basis of the neighbor node that it is covered is ignored.Now, if
Its own weighted value changes, and just needs to update the value.Uncovered node collects these information within the t1 times, and
Participate in competing using the weighted value.One sensor node can stop interative computation when running into following 2 kinds of situations：(1) turn into
Leader cluster node；(2) covered by a leader cluster node.
From above-mentioned steps, general each cycle can filter out a cluster head, and next cycle can be from the node to be capped
In screened again.Because each sensor node is only capable of in a cluster, therefore, if it is in the cluster radius of multiple cluster heads
It is interior, it is necessary to select the addition of cluster.
Specifically, above-mentioned steps s2 pseudo-code of the algorithm is as follows：
Certainly, the present invention does not limit the specific algorithm content of each step.
It is understood that the present invention is according to EEUCR agreements (Energy Efficient Unequal-
Clustering Routing protocol for WSNs based on a Unequal-Clustering Algorithm
(UCA) and Connected Graph Theory) Design of Routing Algorithm is carried out, EEUCR agreements are a kind of suitable for long distance
From the Data Transport Protocol of, stationary nodes.The applicable elements of EEUCR agreements are：(a) assume that base station energy can be supplemented at any time；Net
Each sensor node knows respective position in network, and the specific of the interior all the sensors node of net is known by location technology base station
Position；(b) all the sensors node physical configuration parameter is consistent in network, and primary power is identical, and it is constant that cloth postpones physical location.
The data volume that sensor node need to be transmitted is smaller but transfer ratio is more frequent, and each node possesses unique number and fixed by GPS etc.
Position system knows respective geographical position, uses two-dimensional coordinate<X,Y>Represent.Numbering, coordinate information are stored in the RAM of sensor node
In；(c) each sensor node position be fixed and the communication distance with base station farther out, transmission situation is more complicated, as
Reason situation is complicated, and obstacle is more；(d) EEUCR agreements, which belong in network layer protocol, agreement discussion and experimental situation, assumes there is ideal
Physical layer and data link layer support.
EEUCR agreements are as other clustering route protocols, and data transfer is divided into cluster to be transmitted between transmission and cluster：
(1) data transfer in cluster：Cluster head is member node distribution TDMA (time division multiplexing) time slot in this cluster, each member's section
Point sends data to cluster head in one's own time slot, and other time closes the radio communication mold of oneself to save energy
Block.Cluster head is responsible for the collection and fusion of data in this cluster, and fused data is sent into base station.
(2) data transfer between cluster：Data transfer is based on connected graph theory, each cluster in connected graph between EEUCR protocol families
All there are many transmission paths between head and base station, corresponding to a variety of routing resources.Data are sent to the process of base station by cluster head
In, cluster head higher level neighbor list information can be combined according to practical situations and select optimal transmission scheme.For example can be with comprehensive
Close the dump energy E for considering higher level's cluster headnode, pass through the least energy consumption E of higher level's cluster head to base stationBS, pass through higher level's cluster head to base
The minimal time delay T stooddelayWith tetra- factors of link load N of higher level's cluster head.It following is a brief introduction of two kinds of data transfer between cluster
Scheme：
In the first specific embodiment, the default multi-path data transmission rule in step s3 is specially：
The cluster head of base station is included in itself higher level's list, base station is directly transferred data to；
Cluster head not comprising base station is from itself in level list in itself higher level's list, the optimal higher level of selection base element
It is used as the immediate superior of data transfer；Base element is higher level's cluster head mark ID, the current remaining E of higher level's cluster headnode, it is logical
Higher level's cluster head is crossed to the minimum ENERGY E needed for base stationBS, pass through the minimal time delay T of higher level's cluster head to base stationdelay, higher level's cluster head
Any one in the data volume N of transmission.
It is understood that when above-mentioned rule as cluster head is to base station transmission data, first transferring data to the cluster head
Data will be forwarded to base station along the optimal tree between optimal single factor test decision-making higher level, cluster.Here in optimal single factor test decision-making
Level i.e. with one kind in the five-tuple element that describes before for standard, it is determined that the optimal path that each cluster head reaches base station is used as this
The optimal tree of cluster head.
For example, connected graph is using base station as source point, the breadth-first search (BFS) in graph theory is performed, cluster is successively calculated
The E of higher level's list interior joint five-tuple element of headBSAnd Tdelay, here with EBS(energy consumption for arriving base station) is standard, for the time
Sensitive network can be with TdelayFor standard.During BFS algorithms are performed, due to each cluster head (including base station) Dou You subordinates
List, to identify its all direct subordinates, therefore can traverse all cluster heads.When performing BFS, if cluster head
Subordinate's list is sky, then illustrates that this paths is finished, the cluster head is leaf node in the single factor test decision tree of formation.
During BFS algorithm performs, when going to cluster head i, E in selection cluster head i higher level's listBSMinimum work
For cluster head i optimal higher level, i.e., the energy consumption needed for base station is transferred data to by optimal higher level is minimum.For example：For cluster head i's
Direct subordinate cluster head j, performs following rule：If the E of cluster head i optimal higher levelBSWith the energy consumption sum between cluster head i and j, it is small
In the E of cluster head j current optimal higher levelBS, then the optimal higher level for setting cluster head j is cluster head i, and updates cluster head j higher level's cluster head i
EBS；Conversely, then cluster head i is not cluster head j optimal higher level, but still update cluster head j higher level's cluster head i EBS。
In another embodiment, the default multi-path data transmission rule in step s3 is specially：
The cluster head of base station is included in itself higher level's list, base station is directly transferred data to；
Do not include the cluster head of base station in itself higher level's list, itself is calculated onto itself in level list according to transitive relation formula
Each higher level's cluster head delivery value TranV (i), and by own data transmission to the maximum higher level's cluster head of delivery value；Transmission
Relational expression is：
Wherein, s is weight coefficient, and E (i) is higher level's cluster head i current remaining, EaveEnFor this week it is interim it is all not by
The average energy of overlay node.
It is understood that when the maximum advantage of connected graph is the data transfer between cluster, there is more selections, that is,
There is mulitpath to reach base station, so as to improve the reliability of data transfer.Can be according to Enode, carry out the residue of balanced cluster head
Energy, prevents local cluster head quick death；According to EBSTo minimize the energy expenditure of data transfer between cluster；According to TdelayCan be with
The promptness of data transfer is improved, data delay is reduced；Can be with the data load in equilibrium path according to N.By weighing data
U (ID, E during transmissionnode,EBS,Tdelay, N), significantly overcome the deficiency that route is set between cluster.Also, it can be obtained by experiment,
For remote wireless transmission, multi-hop transmission can save energy, share node energy consumption equally, it is to avoid cluster head is because of energy exhaustion
And too fast death, improve energy efficiency and extend the life span of whole network.Therefore, in the default multi-path data transmission of design
When regular, the transmission data of each cluster head can be adjusted as far as possible, reduce the excessive situation of part cluster head energy expenditure and occur.
Certainly, two kinds of specific embodiments are these are only, also can be using other default multi-path data transmission rules, the present invention
This is not construed as limiting.
The invention provides a kind of non-homogeneous route transmission method based on wireless sensor network, after sub-clustering, structure
The two-way directed connected graph between each cluster head and between cluster head and base station is built.It is understood that using the structure of connected graph,
So that many cluster heads become not unique to the path of base station, i.e., the relationship between superior and subordinate between cluster head is not to determine, such case
Under, it can carry out the data volume that the balanced cluster head nearer apart from base station undertakes by the default multi-path data transmission rule of adjustment, subtract
The situation of data jamming and quick death occurs caused by small part cluster head energy charge is excessive；And due to connected graph multipath
Situation, in the case where there is cluster head failure, also reduces the influence to other cluster heads, cluster head associated with it can lead to as far as possible
Cross other paths to carry out data transmission, the situation that chain rupture is avoided as far as possible occurs, and using the structure of connected graph, in difference
Also connection is had between the cluster head in path substantially, is not directly connected in time, can also be forwarded in most cases by other cluster heads,
Without being forwarded every time by base station, the path of data forwarding is simplified, extra energy expenditure is reduced.
It is shown in Figure 4 present invention also offers a kind of non-homogeneous route transmission device based on wireless sensor network,
A kind of structural representation for non-homogeneous route transmission device based on wireless sensor network that Fig. 4 provides for the present invention.The dress
Put including：
Sub-clustering module 1, for carrying out clustering operation to each sensor node in wireless sensor network, determines each
Cluster and cluster head residing for sensor node；
Connected graph builds module 2, for building the two-way directed connected graph between each cluster head and between cluster head and base station；
Path selection module 3, for according to default multi-path data transmission rule, selecting between each cluster head and base station
Data transfer path, and carry out data transmission according to data transfer path.
Preferably, connected graph builds module 2 and specifically included：
Base station connects control unit, and the distance for command range base station is not more than d0Cluster head and base station between formed connect
Road；If apart from base station distance d0In the range of do not include cluster head, then several cluster heads nearest apart from base station are connected with base station；
d0For the energy consumption threshold value of the radio model of wireless sensor network；
List cell, for adding base station in higher level's list of connected cluster head, the cluster head being connected with base station adds
Enter in subordinate's list of base station；Data transfer direction is to be transmitted from subordinate's cluster head to the higher level of itself；
Link setting unit, for cluster head i and cluster head j spacing and default spacing threshold to be compared, if being not less than
Default spacing threshold, then do not form link between two cluster heads, if less than default spacing threshold, according to default link predicting relation formula
Determine whether form link between two cluster heads；Cluster head i and cluster head j is any two cluster head in wireless sensor network；
Default spacing threshold is：
(q+di/dmax)×d0；
diVertical range for cluster head i relative to base station, dmaxIt is whole wireless sensor network region relative to base station
Farthest vertical range, q is density control constant；
Presetting link predicting relation formula is specially：
Wherein, djVertical range for cluster head j relative to base station, RiIt is cluster head i cluster radius, RjFor cluster head j cluster half
Footpath；
Isolated processing unit, is empty isolated cluster for higher level's list after the completion of link is built between each cluster head
Head, the isolated cluster head of screening distance is apart from several most short cluster heads, and the chosen distance base from apart from several most short cluster heads
Nearest cluster head of standing is added in higher level's list of isolated cluster head；If not finding the cluster head for meeting above-mentioned condition, the isolated cluster of control
Head is connected with base station.
Preferably, sub-clustering module 1 is specifically included：
Cluster radius calculation unit, for calculating each sensor section in wireless sensor network according to competition radius relationship formula
The cluster radius R of pointi；Competing radius relationship formula is：
d(vi, sink) and it is sensor node viTo the distance of base station, c is 0 to 1
Between a constant coefficient, dminIt is minimum distance of each sensor node away from base station, dmaxIt is each sensor node away from base station
Maximum distance；
Periodicity sub-clustering unit, in each clustering operation cycle, screening itself cluster in current wireless sensor network
The sensor node not comprising cluster head is used as uncovered node in radius；Sensor node v is determined according to ballot paper relational expressioniThrow
Give its neighbor node vjBallot paper v (vi,vj), ballot paper relational expression is：
Wherein, neighbor node refer to a sensor node using from as the center of circle, cluster radius be the circle that radius is constituted in covering
Sensor node；dikFor node viTo vkDistance, vkTravel through sensor node viAll neighbor nodes, ejFor node vj's
Dump energy；
Sensor node v is calculated according to summation relational expressioniNumber of ballot papers, summation relational expression be：
Sensor node v is calculated according to weight relationship formulaiWeighted value Ii, weight relationship formula is：
Wherein, PiIt is node viTo the average distance of its all neighbor node；
The maximum sensor node of selection weighted value is used as cluster head；For not turning into the sensor section of cluster head in this cycle
Point, if it is in the cluster radius of multiple cluster heads, the fitness value of each cluster head is calculated according to fitness relational expression, and order should
Sensor node is added in the cluster of fitness value highest cluster head；Fitness relational expression is：
Wherein, degreeiFor sensor node viDegree.
The invention provides a kind of non-homogeneous route transmission device based on wireless sensor network, after sub-clustering, structure
The two-way directed connected graph between each cluster head and between cluster head and base station is built.It is understood that using the structure of connected graph,
So that many cluster heads become not unique to the path of base station, i.e., the relationship between superior and subordinate between cluster head is not to determine, such case
Under, it can carry out the data volume that the balanced cluster head nearer apart from base station undertakes by the default multi-path data transmission rule of adjustment, subtract
The situation of data jamming and quick death occurs caused by small part cluster head energy charge is excessive；And due to connected graph multipath
Situation, in the case where there is cluster head failure, also reduces the influence to other cluster heads, cluster head associated with it can lead to as far as possible
Cross other paths to carry out data transmission, the situation that chain rupture is avoided as far as possible occurs, and using the structure of connected graph, in difference
Also connection is had between the cluster head in path substantially, is not directly connected in time, can also be forwarded in most cases by other cluster heads,
Without being forwarded every time by base station, the path of data forwarding is simplified, extra energy expenditure is reduced.
Two kinds of embodiments above are only the preferred embodiment of the present invention, it is noted that led for this technology
For the those of ordinary skill in domain, under the premise without departing from the principles of the invention, some improvement can also be made, these improvement
It should be regarded as protection scope of the present invention.
The embodiment of each in this specification is described by the way of progressive, and what each embodiment was stressed is and other
Between the difference of embodiment, each embodiment identical similar portion mutually referring to.For device disclosed in embodiment
For, because it is corresponded to the method disclosed in Example, so description is fairly simple, related part is said referring to method part
It is bright.
It should also be noted that, in this manual, such as first and second or the like relational terms be used merely to by
One entity or operation make a distinction with another entity or operation, and not necessarily require or imply these entities or operation
Between there is any this actual relation or order.Moreover, term " comprising ", "comprising" or its any other variant meaning
Covering including for nonexcludability, so that process, method, article or equipment including a series of key elements not only include that
A little key elements, but also other key elements including being not expressly set out, or also include be this process, method, article or
The intrinsic key element of equipment.In the absence of more restrictions, the key element limited by sentence "including a ...", is not arranged
Except also there is other identical element in the process including the key element, method, article or equipment.
The foregoing description of the disclosed embodiments, enables professional and technical personnel in the field to realize or using the present invention.
A variety of modifications to these embodiments will be apparent for those skilled in the art, as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, it is of the invention
The embodiments shown herein is not intended to be limited to, and is to fit to and principles disclosed herein and features of novelty phase one
The most wide scope caused.
Claims (8)
1. a kind of non-homogeneous route transmission method based on wireless sensor network, it is characterised in that including：
Clustering operation is carried out to each sensor node in the wireless sensor network, determined residing for each sensor node
Cluster and cluster head；
Build between each cluster head and the two-way directed connected graph between cluster head and base station；
According to default multi-path data transmission rule, the data transfer path between each described cluster head and the base station is selected,
And carry out data transmission according to the data transfer path.
2. route transmission method according to claim 1, it is characterised in that between each cluster head of the structure and cluster head with
The process of two-way directed connected graph between base station is specially：
The distance of base station described in command range is not more than d0Cluster head and the base station between form link；If apart from the base station
Apart from d0In the range of do not include cluster head, then several cluster heads nearest apart from base station are connected with the base station；d0For the nothing
The energy consumption threshold value of the radio model of line sensor network；
In higher level's list that the base station is added to connected cluster head, the cluster head being connected with the base station adds the base station
Subordinate's list in；Data transfer direction is to be transmitted from subordinate's cluster head to the higher level of itself；
Cluster head i and cluster head j spacing and default spacing threshold are compared, if not less than the default spacing threshold, two
Link is not formed between individual cluster head, if less than the default spacing threshold, two cluster heads are determined according to default link predicting relation formula
Between whether form link；Cluster head i and cluster head j is any two cluster head in the wireless sensor network；
The default spacing threshold is：
(q+di/dmax)×d0；
diVertical range for cluster head i relative to the base station, dmaxIt is the whole wireless sensor network region relative to institute
The farthest vertical range of base station is stated, q is density control constant；
The default link predicting relation formula is specially：
Wherein, djVertical range for cluster head j relative to the base station, RiIt is cluster head i cluster radius, RjFor cluster head j cluster half
Footpath；
After the completion of link is built between each cluster head, it is empty isolated cluster head for higher level's list, screens apart from the isolated cluster head
Distance most short several cluster heads, and the nearest cluster head addition in chosen distance base station from the distance most short several cluster heads
To higher level's list of the isolated cluster head；If not finding the cluster head for meeting above-mentioned condition, control the isolated cluster head with it is described
Base station is connected.
3. route transmission method according to claim 1, it is characterised in that described in the wireless sensor network
Each sensor node carry out clustering operation process be specially：
The cluster radius R of each sensor node in the wireless sensor network is calculated according to competition radius relationship formulai；It is described competing
Striving radius relationship formula is：
d(vi, sink) and it is sensor node viTo the distance of the base station, c is 0 to 1
Between a constant coefficient, dminIt is minimum distance of each sensor node away from the base station, dmaxEach sensor node away from
The maximum distance of the base station；
Clustering operation is periodically carried out, in each clustering operation cycle, is proceeded as follows：
The sensor node not comprising cluster head is screened in itself cluster radius in presently described wireless sensor network as not being coated to
Lid node；
Sensor node v is determined according to ballot paper relational expressioniThrow and give its neighbor node vjBallot paper v (vi,vj), the ballot paper relational expression
For：
<mrow>
<mi>v</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>v</mi>
<mi>i</mi>
</msub>
<mo>,</mo>
<msub>
<mi>v</mi>
<mi>j</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mfrac>
<msub>
<mi>e</mi>
<mi>j</mi>
</msub>
<mrow>
<munder>
<mo>&Sigma;</mo>
<mrow>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mi>k</mi>
</mrow>
</msub>
<mo>&le;</mo>
<msub>
<mi>R</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<msub>
<mi>e</mi>
<mi>k</mi>
</msub>
</mrow>
</mfrac>
</mtd>
<mtd>
<mrow>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>&le;</mo>
<msub>
<mi>R</mi>
<mi>i</mi>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mn>0</mn>
</mtd>
<mtd>
<mrow>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>></mo>
<msub>
<mi>R</mi>
<mi>i</mi>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow>
Wherein, neighbor node refer to a sensor node using from as the center of circle, cluster radius as the biography covered in the circle that radius is constituted
Sensor node；dikFor node viTo vkDistance, vkTravel through sensor node viAll neighbor nodes, ejFor node vjResidue
Energy；
Sensor node v is calculated according to summation relational expressioniNumber of ballot papers, the summation relational expression is：
<mrow>
<mi>v</mi>
<mi>o</mi>
<mi>t</mi>
<mi>e</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>v</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>&le;</mo>
<msub>
<mi>R</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<mi>v</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>v</mi>
<mi>j</mi>
</msub>
<mo>,</mo>
<msub>
<mi>v</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
Sensor node v is calculated according to weight relationship formulaiWeighted value Ii, the weight relationship formula is：
Wherein, PiIt is node viTo the average distance of its all neighbor node；
The maximum sensor node of selection weighted value is used as cluster head；
For not turning into the sensor node of cluster head in this cycle, if it is in the cluster radius of multiple cluster heads, according to adaptation
Degree relational expression calculates the fitness value of each cluster head, and makes the sensor node add in the cluster of fitness value highest cluster head；
The fitness relational expression is：
Wherein, degreeiFor sensor node viDegree.
4. route transmission method according to claim 3, it is characterised in that the default multi-path data transmission rule tool
Body is：
The cluster head of the base station is included in itself higher level's list, the base station is directly transferred data to；
Cluster head not comprising the base station is from itself in level list in itself higher level's list, the optimal higher level of selection base element
It is used as the immediate superior of data transfer；The base element is higher level's cluster head mark ID, the current remaining of higher level's cluster head
Enode, pass through higher level's cluster head to the minimum ENERGY E needed for base stationBS, pass through the minimal time delay T of higher level's cluster head to base stationdelay, on
Level cluster head transmission data volume N in any one.
5. route transmission method according to claim 3, it is characterised in that the default multi-path data transmission rule tool
Body is：
The cluster head of the base station is included in itself higher level's list, the base station is directly transferred data to；
Do not include the cluster head of the base station in itself higher level's list, itself is calculated onto itself in level list according to transitive relation formula
Each higher level's cluster head delivery value TranV (i), and by own data transmission to the maximum higher level's cluster head of the delivery value；
The transitive relation formula is：
<mrow>
<mi>T</mi>
<mi>r</mi>
<mi>a</mi>
<mi>n</mi>
<mi>V</mi>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mi>s</mi>
<mo>&times;</mo>
<mrow>
<mo>(</mo>
<mfrac>
<mrow>
<mi>E</mi>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
</mrow>
<msub>
<mi>E</mi>
<mrow>
<mi>a</mi>
<mi>v</mi>
<mi>e</mi>
<mi>E</mi>
<mi>n</mi>
</mrow>
</msub>
</mfrac>
<mo>)</mo>
</mrow>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<mi>s</mi>
<mo>)</mo>
</mrow>
<mo>&times;</mo>
<mrow>
<mo>(</mo>
<mfrac>
<msub>
<mi>d</mi>
<mn>0</mn>
</msub>
<msub>
<mi>E</mi>
<mrow>
<mi>B</mi>
<mi>S</mi>
</mrow>
</msub>
</mfrac>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow>
Wherein, s is weight coefficient, and E (i) is higher level's cluster head i current remaining, EaveEnIt is interim all uncovered for this week
The average energy of node.
6. a kind of non-homogeneous route transmission device based on wireless sensor network, it is characterised in that including：
Sub-clustering module, for carrying out clustering operation to each sensor node in the wireless sensor network, determines each
Cluster and cluster head residing for sensor node；
Connected graph builds module, for building the two-way directed connected graph between each cluster head and between cluster head and base station；
Path selection module, for according to default multi-path data transmission rule, select each described cluster head and the base station it
Between data transfer path, and carry out data transmission according to the data transfer path.
7. route transmission device according to claim 6, it is characterised in that the connected graph builds module and specifically included：
Base station connects control unit, and the distance for base station described in command range is not more than d0Cluster head and the base station between shape
Into link；If apart from the base station distance d0In the range of do not include cluster head, then by several cluster heads nearest apart from base station with
The base station is connected；d0For the energy consumption threshold value of the radio model of the wireless sensor network；
List cell, for the base station to be added in higher level's list of connected cluster head, the cluster being connected with the base station
Head is added in subordinate's list of the base station；Data transfer direction is to be transmitted from subordinate's cluster head to the higher level of itself；
Link setting unit, for cluster head i and cluster head j spacing and default spacing threshold to be compared, if not less than described
Default spacing threshold, then do not form link between two cluster heads, if less than the default spacing threshold, judging to close according to default link
It is formula determines whether form link between two cluster heads；Cluster head i and cluster head j is any two cluster in the wireless sensor network
Head；
The default spacing threshold is：
(q+di/dmax)×d0；
diVertical range for cluster head i relative to the base station, dmaxIt is the whole wireless sensor network region relative to institute
The farthest vertical range of base station is stated, q is density control constant；
The default link predicting relation formula is specially：
Wherein, djVertical range for cluster head j relative to the base station, RiIt is cluster head i cluster radius, RjFor cluster head j cluster half
Footpath；
Isolated processing unit, is empty isolated cluster head, sieve for higher level's list after the completion of link is built between each cluster head
Select apart from the isolated cluster head distance most short several cluster heads, and the chosen distance from the distance most short several cluster heads
The nearest cluster head in base station is added in higher level's list of the isolated cluster head；If not finding the cluster head for meeting above-mentioned condition, control
The isolated cluster head is connected with the base station.
8. route transmission device according to claim 6, it is characterised in that the sub-clustering module is specifically included：
Cluster radius calculation unit, for calculating each sensor section in the wireless sensor network according to competition radius relationship formula
The cluster radius R of pointi；It is described competition radius relationship formula be：
d(vi, sink) and it is sensor node viTo the distance of the base station, c is 0 to 1
Between a constant coefficient, dminIt is minimum distance of each sensor node away from the base station, dmaxEach sensor node away from
The maximum distance of the base station；
Periodicity sub-clustering unit, in each clustering operation cycle, screening itself cluster in presently described wireless sensor network
The sensor node not comprising cluster head is used as uncovered node in radius；Sensor node v is determined according to ballot paper relational expressioniThrow
Give its neighbor node vjBallot paper v (vi,vj), the ballot paper relational expression is：
<mrow>
<mi>v</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>v</mi>
<mi>i</mi>
</msub>
<mo>,</mo>
<msub>
<mi>v</mi>
<mi>j</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mfrac>
<msub>
<mi>e</mi>
<mi>j</mi>
</msub>
<mrow>
<munder>
<mo>&Sigma;</mo>
<mrow>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mi>k</mi>
</mrow>
</msub>
<mo>&le;</mo>
<msub>
<mi>R</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<msub>
<mi>e</mi>
<mi>k</mi>
</msub>
</mrow>
</mfrac>
</mtd>
<mtd>
<mrow>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>&le;</mo>
<msub>
<mi>R</mi>
<mi>i</mi>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mn>0</mn>
</mtd>
<mtd>
<mrow>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>></mo>
<msub>
<mi>R</mi>
<mi>i</mi>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow>
Wherein, neighbor node refer to a sensor node using from as the center of circle, cluster radius as the biography covered in the circle that radius is constituted
Sensor node；dikFor node viTo vkDistance, vkTravel through sensor node viAll neighbor nodes, ejFor node vjResidue
Energy；
Sensor node v is calculated according to summation relational expressioniNumber of ballot papers, the summation relational expression is：
<mrow>
<mi>v</mi>
<mi>o</mi>
<mi>t</mi>
<mi>e</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>v</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>&le;</mo>
<msub>
<mi>R</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<mi>v</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>v</mi>
<mi>j</mi>
</msub>
<mo>,</mo>
<msub>
<mi>v</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
Sensor node v is calculated according to weight relationship formulaiWeighted value Ii, the weight relationship formula is：
Wherein, PiIt is node viTo the average distance of its all neighbor node；
The maximum sensor node of selection weighted value is used as cluster head；For not turning into the sensor node of cluster head in this cycle, if
When it is in the cluster radius of multiple cluster heads, the fitness value of each cluster head is calculated according to fitness relational expression, and make the sensing
Device node is added in the cluster of fitness value highest cluster head；The fitness relational expression is：
Wherein, degreeiFor sensor node viDegree.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710561443.1A CN107182091A (en) | 2017-07-11 | 2017-07-11 | A kind of non-homogeneous route transmission method and its device based on wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710561443.1A CN107182091A (en) | 2017-07-11 | 2017-07-11 | A kind of non-homogeneous route transmission method and its device based on wireless sensor network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107182091A true CN107182091A (en) | 2017-09-19 |
Family
ID=59845792
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710561443.1A Pending CN107182091A (en) | 2017-07-11 | 2017-07-11 | A kind of non-homogeneous route transmission method and its device based on wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107182091A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109062272A (en) * | 2018-09-05 | 2018-12-21 | 佛山铮荣科技有限公司 | Rice irrigation intelligent observing and controlling system |
| CN110490266A (en) * | 2019-08-23 | 2019-11-22 | 北京邮电大学 | A kind of sensing data uploads, Transducer-fault Detecting Method and device |
| WO2020029829A1 (en) * | 2018-08-07 | 2020-02-13 | Huawei Technologies Co., Ltd. | Method and apparatus for virtual network functions and packet forwarding |
| CN112051824A (en) * | 2020-09-22 | 2020-12-08 | 吴信强 | Operation and maintenance system based on industrial Internet of things |
| US10909067B2 (en) | 2018-08-07 | 2021-02-02 | Futurewei Technologies, Inc. | Multi-node zero-copy mechanism for packet data processing |
| CN112996078A (en) * | 2021-02-04 | 2021-06-18 | 南京邮电大学 | Non-uniform clustering method for energy load balancing and non-uniform clustering routing method |
| CN114007249A (en) * | 2021-10-20 | 2022-02-01 | 沈阳化工大学 | Real-time routing method based on unbalanced tree and oriented to intelligent power distribution network |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101557636A (en) * | 2009-05-15 | 2009-10-14 | 广东工业大学 | Wireless sensor network routing method |
-
2017
- 2017-07-11 CN CN201710561443.1A patent/CN107182091A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101557636A (en) * | 2009-05-15 | 2009-10-14 | 广东工业大学 | Wireless sensor network routing method |
Non-Patent Citations (3)
| Title |
|---|
| HUI XIA等: "Energy-Efficient Routing Algorithm Based on Unequal Clustering and Connected Graph in Wireless Sensor Networks", 《INTERNATIONAL JOURNAL OF WIRELESS INFORMATION NETWORKS》 * |
| 张瑞华: "基于非均匀分簇和最小能耗的无线传感网络路由算法", 《上海交通大学学报》 * |
| 郑龙鹏: "WSN上下文相关的分簇路由算法研究与优化", 《中国优秀硕士学位论文全文数据库（信息科技辑）》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020029829A1 (en) * | 2018-08-07 | 2020-02-13 | Huawei Technologies Co., Ltd. | Method and apparatus for virtual network functions and packet forwarding |
| US10909067B2 (en) | 2018-08-07 | 2021-02-02 | Futurewei Technologies, Inc. | Multi-node zero-copy mechanism for packet data processing |
| US10986041B2 (en) | 2018-08-07 | 2021-04-20 | Futurewei Technologies, Inc. | Method and apparatus for virtual network functions and packet forwarding |
| CN109062272A (en) * | 2018-09-05 | 2018-12-21 | 佛山铮荣科技有限公司 | Rice irrigation intelligent observing and controlling system |
| CN110490266A (en) * | 2019-08-23 | 2019-11-22 | 北京邮电大学 | A kind of sensing data uploads, Transducer-fault Detecting Method and device |
| CN110490266B (en) * | 2019-08-23 | 2022-04-22 | 北京邮电大学 | Sensor data uploading and sensor fault detection method and device |
| CN112051824A (en) * | 2020-09-22 | 2020-12-08 | 吴信强 | Operation and maintenance system based on industrial Internet of things |
| CN112996078A (en) * | 2021-02-04 | 2021-06-18 | 南京邮电大学 | Non-uniform clustering method for energy load balancing and non-uniform clustering routing method |
| CN114007249A (en) * | 2021-10-20 | 2022-02-01 | 沈阳化工大学 | Real-time routing method based on unbalanced tree and oriented to intelligent power distribution network |
| CN114007249B (en) * | 2021-10-20 | 2024-03-22 | 沈阳化工大学 | Real-time routing method based on unbalanced tree for intelligent power distribution network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107182091A (en) | A kind of non-homogeneous route transmission method and its device based on wireless sensor network | |
| CN101854666B (en) | Self-defined cross-zone multi-hop routing method for wireless sensor network | |
| Bhandary et al. | Routing in wireless multimedia sensor networks: a survey of existing protocols and open research issues | |
| CN104135751B (en) | A kind of Uneven Cluster method for routing suitable for subway tunnel | |
| Yarinezhad et al. | A routing algorithm for wireless sensor networks based on clustering and an fpt-approximation algorithm | |
| CN106900025A (en) | A kind of wireless sensor network clustering routing based on double cluster heads | |
| CN101119303B (en) | Dynamic cluster based multi-objective programming wireless sensing network routing algorithm | |
| CN106454905A (en) | Improved hierarchical type multi-link algorithm of wireless sensor network | |
| CN104410997B (en) | A kind of clustering topology construction method for wireless sensor network | |
| CN103945484A (en) | Farmland wireless self-organizing network topology density correlation path selecting and optimizing method | |
| Pattnaik et al. | Assimilation of fuzzy clustering approach and EHO‐Greedy algorithm for efficient routing in WSN | |
| CN110417663A (en) | A kind of multifactor mixed logic dynamic algorithm based on proactive routing protocol | |
| Cai et al. | ACO based QoS routing algorithm for wireless sensor networks | |
| Li et al. | Trading optimality for scalability in large-scale opportunistic routing | |
| CN107404745A (en) | A kind of fire detector remote detecting system based on MANET | |
| CN103095577B (en) | Context-sensitive Uneven Cluster routing algorithm | |
| CN104469879B (en) | A kind of dynamic k value cluster routing methods | |
| Kansal et al. | Compression of various routing protocol in wireless sensor network | |
| Jabbar et al. | Designing an energy-aware mechanism for lifetime improvement of wireless sensor networks: a comprehensive study | |
| CN107333314A (en) | A kind of wireless sense network cluster is built and its cluster head update method | |
| CN109511152A (en) | A kind of balanced cluster-dividing method of terminaloriented communication access net perception monitoring | |
| CN107690167A (en) | A kind of expansible network clustering method of wireless sensor | |
| CN108541038A (en) | A kind of route selection method and system of wireless sensor network | |
| CN110139335A (en) | A kind of mobile Ad Hoc network method for routing based on node location information and active volume | |
| CN108566658B (en) | Clustering algorithm for balancing energy consumption in wireless sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20170919 |