CN104066142B - The method and device of data transfer path in a kind of determination wireless sensor network - Google Patents
The method and device of data transfer path in a kind of determination wireless sensor network Download PDFInfo
- Publication number
- CN104066142B CN104066142B CN201310094365.0A CN201310094365A CN104066142B CN 104066142 B CN104066142 B CN 104066142B CN 201310094365 A CN201310094365 A CN 201310094365A CN 104066142 B CN104066142 B CN 104066142B
- Authority
- CN
- China
- Prior art keywords
- source node
- node
- msub
- mrow
- cost
- 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.)
- Active
Links
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
Abstract
The invention discloses a kind of method and device for determining data transfer path in wireless sensor network, data transfer path can be determined according to power distribution, balance the energy expenditure of cooperative node, and then extend Network morals, this method includes：S1：Determine weighted power apportioning cost corresponding to the source node of data transfer that is included in WSN；S2：For other any child nodes of WSN in addition to source node, according to weighted power apportioning cost, determine that data are transmitted to the first transmission cost of child node from source node；S3：In whole child nodes, the child node for selecting the first transmission cost minimum is added in source node set；S4：Loose operations are done to the child node being newly added in source node set and the whole child nodes for not being added to source node set, using the child node being newly added in return execution source node set as source node, return and perform step S2, be combined into only until the destination node of data transfer is added into source node set.
Description
Technical field
The present invention relates to wireless sensor network (WSN, Wireless Sensor Network) technical field, especially
It is related to a kind of method and device for determining data transfer path in wireless sensor network.
Background technology
The multipath fading of wireless channel hinders the increase of channel capacity and the improvement of service quality.Wherein how defeated multi input is
Go out (MIMO, Multiple-Input Multiple-Out-put) technology by disposing more simultaneously in receiving terminal and transmitting terminal
Antenna, can both effectively antagonize decline, and and can makes full use of spatial domain resource, increases substantially channel capacity.MIMO technology into
One of key technology for wireless communication field.But between MIMO multiaerial systems requirement adjacent antenna ideally
Distance is much larger than carrier wavelength, and the transmission channel between multiple dual-mode antennas must be independent.But mobile terminal
Volume, quality and energy consumption are all restricted, and can not install more antennas at all.Therefore, although MIMO technology can be in honeycomb base
Run on standing, but MIMO technology can not be applied to the common cordless communication network for including multiple mobile terminals, such as by portion
Administration's substantial amounts of cheap microsensor node composition wireless sensor network in monitored area.Wireless sensor network is to pass through
The network system of the self-organizing for the multi-hop that communication is formed, the purpose is to collaboratively perceive, gather and handle net
The information of object is perceived in network overlay area, and is sent to observer.Because sensing node general number is huger, deployment
Environment it is also more complicated, artificial is difficult to supplement or change at any time battery supplement energy.Therefore, using effective energy management plan
Slightly, extend network life cycle, be Design of Wireless Sensor Network and the key problem realized.
Cooperative communication technology is the advantage using radio broadcasting, by sharing net as a kind of extension of multi-antenna technology
The antenna of other users in network, form virtual mimo antenna array and send or receive to realize, gain is obtained, so as to reduce letter
Cease the energy expense of transmission.Cooperation route be joint physical layer cooperative communication technology and Internet routing technology across
Layer routing plan.Cooperation route can effectively save the energy expenditure of nodes, particularly in wireless sensor network
In, because sensing node general number is huger, the environment of deployment is also more complicated, and artificial is difficult to supplement or change at any time electricity
Pond supplements energy.Therefore, using effective energy management strategies, extend network life cycle, be Design of Wireless Sensor Network
With the key problem of realization.
The method for determining data transfer path in wireless sensor network can be Energy Efficient (Energy-
Efficient cooperation routing algorithm), the algorithm are to route calculation to minimize cooperation of the end-to-end transmission gross energy as target
Method, such as cumulative cooperation (PC, Progressive Cooperation), based on shortest path cooperation algorithm (CAN,
Cooperation Along the Non-Cooperative), shortest path cooperation (CSP, Cooperative Shortest
Path), minimum power cooperation (MPCR, Minimum Power Cooperative Routing), general shortest path first
The cooperation such as (GSPRA, Generalized Shortest Path Routing Algorithm) routing algorithm.Wherein, PLC is assisted
It is consistent to make cooperated with the CAN basic thought of routing algorithm of routing algorithm, it is first determined the data transfer gone out under conventional transmission
Shortest path, then relayed based on this Path selection so as to realizing cooperation transmission.The two difference is PLC cooperation routing algorithms
Energy is more saved than CAN cooperation routing algorithms, but the complexity of algorithm is much higher.CSP cooperation routing algorithms are with Di Jiesite
Basic framework of (Dijkstra) shortest path first as routing algorithm is drawn, and the characteristic of cooperation transmission is guided to the loose stage
And the cooperation routing algorithm redesigned.MPCR cooperation routing algorithms are a kind of single relay selections ensured under certain handling capacity
Distributed collaborative routing algorithm.GSPRA is the distributed multihop cooperation routing algorithm based on MIMO.The existence of radio sensing network
Cycle depends on first complete node of energy loss, therefore is that the saving of gross energy is not intended to the defects of this kind of method
The life cycle of radio sensing network can be extended by.
The defects of below with an instantiation to analyze this kind cooperation routing algorithm：As shown in figure 1, the digital table in Fig. 1
Show that every unit of transfer's data need to consume the electricity of how many unit.For example, numeral 2 represents to need consumption 2 per unit of transfer's data
The electricity of unit, numeral 12 represent to need to consume the electricity of 12 units per unit of transfer's data.Data need to transmit from source node s
To destination node d.Directly unit of transfer's data need the energy consumed between side between wherein two nodes represents two nodes.Except section
Other three nodes outside point b are all the nodes of Full Charge Capacity.If choosing traditional multihop routing algorithm determines data transfer path, number
According to transmission path { s- will be prolonged>a,a->b,b->D } transmission, and every unit of transfer data need to consume the electricity of 6 units.Node b
Also can be less because of electricity, electricity is exhausted at first causes whole wireless sensor network to cancel.If take above-mentioned cooperation routing algorithm
(such as CAN, PLC, CSP) determines data transfer path, and data will be along path { s->a,(s,a)->b,(a,b)->D } transmission, and
The electricity of 5 units will be consumed.Therefore conventional transmission is compared, the data transfer path that cooperation routing algorithm is determined, can to pass
The energy consumed when defeated is greatly reduced, and causes that the life cycle of whole wireless sensor network is extended to a certain extent.
But the data transfer path that this kind cooperation routing algorithm is determined, fail to consider power distribution to whole wireless
The influence of the life cycle of sensor network.Such as (a, b)->During d this jumps, it can also suitably increase node a transmission work(
Rate, reduce node b transimission power.Although total energy expense will increase compared to CSP cooperation routing algorithms, energy load
Balanced, the life cycle of whole wireless sensor network will also extend.Therefore, the cooperation routing algorithm proposed in the prior art
The data transfer path determined can not make reach maximization the life cycle of whole wireless sensor network.
The content of the invention
The embodiments of the invention provide a kind of method and device for determining data transfer path in wireless sensor network, energy
It is enough that data transfer path is determined according to power distribution, balance the energy expenditure of cooperative node, and then prolonging wireless sensor network
Life cycle.
A kind of method of data transfer path in determination wireless sensor network, including：Step S1：Determine wireless senser
Weighted power apportioning cost corresponding to the source node of the data transfer included in network, wherein the weighted power apportioning cost is source section
Ratio between the primary power and dump energy of point；Step S2：For its in wireless sensor network in addition to source node
His any child node, according to the weighted power apportioning cost, determine that data pass from source node is transmitted to the child node first
Defeated cost, wherein first transmission cost, which is data, is transmitting the transmission cost to the child node from source node；Step
S3：According to the first transmission cost determined, in whole child nodes, the child node for selecting the first transmission cost minimum is added to
In source node set；Step S4：To the child node being newly added in source node set and the whole for not being added to source node set
Child node does loose operations, and the child node that will be newly added in return execution source node set performs step as source node, return
Rapid S2, it is combined into only until the destination node of data transfer is added into source node set, what is included in the source node set is all
The data transfer path of element composition is as the data transfer path under cooperation transmission mode.
The device of data transfer path in a kind of determination wireless sensor network, including：Weighted power apportioning cost determines mould
Block, for weighted power apportioning cost corresponding to the source node for the data transfer for determining to include in wireless sensor network, wherein institute
It is the ratio between the primary power of source node and dump energy to state weighted power apportioning cost；First transmission cost determining module,
For for other any child nodes in wireless sensor network in addition to source node, according to the weighted power apportioning cost,
Determine that data are transmitted to the first transmission cost of the child node from source node, wherein first transmission cost be data from
Source node transmits the transmission cost to the child node；Module is chosen, the first transmission cost determined for basis, complete
In portion's child node, the child node for selecting the first transmission cost minimum is added in source node set；Loose operations module, for pair
The new child node being added in source node set and whole child nodes of source node set are not added to do loose operations, will newly add
Enter to the child node returned in execution source node set as source node, and trigger the first transmission cost determining module, until will
The destination node of data transfer is added to source node set and is combined into only, the number of all elements composition included in the source node set
According to transmission path as the data transfer path under cooperation transmission mode.
Using above-mentioned technical proposal, the source node for the data transfer for determining to include in wireless sensor network by step 1
Corresponding weighted power apportioning cost, and step 2 are directed to other any sub- sections in wireless sensor network in addition to source node
Point, according to the weighted power apportioning cost, determine that data are transmitted to the first transmission cost of the child node from source node；Then
In whole child nodes, the child node for selecting the first transmission cost minimum is added in source node set, finally to being newly added to
Child node in source node set and whole child nodes of source node set are not added to do loose operations, newly will be added to return
The child node in source node set is performed as source node, returns and performs step 2, until the destination node of data transfer is added
Enter to source node set and be combined into only, the data transfer path of all elements composition included in the source node set passes as cooperation
Data transfer path under defeated pattern.Compared with prior art, present invention technical scheme set forth above, weighted power distribution is introduced
Value, what is proposed in the prior art is determined on data transfer path based on shortest path first, is extended so that collaboration communication
In, power distribution mode is more reasonable during cooperation transmission so that the selection of routed path is more suitable for cooperation transmission.Energy
It is enough that data transfer path is determined according to power distribution, balance the energy expenditure of cooperative node, and then prolonging wireless sensor network
Life cycle.
Brief description of the drawings
Fig. 1 is the simple network topology structure of wireless sensor schematic diagram of proposition in the prior art；
Fig. 2 is the method stream of data transfer path in the determination wireless sensor network of proposition in the embodiment of the present invention one
Cheng Tu；
Fig. 3 a are the point-to-point transmission pattern diagram of proposition in the embodiment of the present invention one；
Fig. 3 b are the broadcast transmission mode schematic diagram of proposition in the embodiment of the present invention one；
Fig. 3 c are multipair transmission mode schematic diagram of proposition in the embodiment of the present invention one；
Fig. 3 d are the cooperation broadcast transmission mode schematic diagram of proposition in the embodiment of the present invention one；
Fig. 4 is transmission node topology schematic diagram in the WSN of proposition in the embodiment of the present invention one；
Fig. 5 is the MNLCR different scenes performance comparison schematic diagrames of proposition in the embodiment of the present invention one；
Fig. 6 is the different node density MNLCR performance comparison schematic diagrames of proposition in the embodiment of the present invention one；
Fig. 7 is the algorithm performance contrast schematic diagram of proposition in the embodiment of the present invention one；
Fig. 8 is the device knot of data transfer path in the determination wireless sensor network of proposition in the embodiment of the present invention two
Structure schematic diagram.
Embodiment
The data transfer path determined for the cooperation routing algorithm proposed in the prior art can not make whole wireless
Reach maximized problem the life cycle of sensor network, technique proposed herein scheme of the embodiment of the present invention, introduce weighting
Power assignment value, what is proposed in the prior art is determined on data transfer path based on shortest path first, is extended so that
In collaboration communication, power distribution mode is more reasonable during cooperation transmission so that the selection of routed path is more suitable for assisting
Transmit, so as to determine data transfer path according to power distribution, balance the energy expenditure of cooperative node, and then extend nothing
The life cycle of line sensor network.
Below in conjunction with each accompanying drawing to the main realization principle of technical scheme of the embodiment of the present invention, embodiment and
It is set forth in the beneficial effect that should be able to reach.
Embodiment one
The embodiment of the present invention one proposes a kind of method for determining data transfer path in wireless sensor network, this hair here
In the bright technique proposed herein scheme of embodiment one, balance first considers node primary power, dump energy and cooperation transmission
The factors such as energy expense, a kind of cooperation transmission power distribution mode of weighting is proposed, that is, propose weighted power apportioning cost namely
Say, weighted power apportioning cost is the ratio between the primary power of source node and dump energy, then in obtained weighted power
On the basis of apportioning cost, cooperation routing algorithm (MNLCR, the Cooperative of a kind of maximization network life cycle are proposed
Routing Algorithm for Maximizing Network Lifetime), to determine the number in wireless sensor network
According to transmission path.As shown in Fig. 2 mainly include following four steps：
Step S1, weighted power corresponding to the source node for the data transfer for determining to include in wireless sensor network are distributed
Value.
Step S2, for other any child nodes in wireless sensor network in addition to source node, according in step S1
The weighted power apportioning cost determined, determine that data are transmitted to the first transmission cost of the child node from source node.
Step S3, according to the first transmission cost determined, in whole child nodes, select the first transmission cost minimum
Child node is added in source node set.
Step S4：To the child node being newly added in source node set and the whole child nodes for not being added to source node set
Loose operations are done, the child node in return execution source node set will be newly added to as source node, and return and perform step S2, directly
It is combined into only to the destination node of data transfer is added into source node set, all elements composition included in the source node set
Data transfer path as the data transfer path under cooperation transmission mode.
Further description is made to technique proposed herein scheme of the embodiment of the present invention below.
Embodiment one
Step 1, weighted power corresponding to the source node for the data transfer for determining to include in wireless sensor network are distributed
Value.
Weighted power apportioning cost is the ratio between the primary power of source node and dump energy.Wireless sensor network
In, data transfer generally comprises multi-hop.Wherein during multi-hop cooperation transmission, each jump of data transfer can include four
The form of the different transmission of kind, specifically may refer to shown in Fig. 3 a~3d, different transmission forms corresponds to different power distribution sides
Formula and energy loss.Therefore different cooperation transmission modes carries out data transmission also having the life cycle of wireless sensor network
Different influences.Specially：
The first data-transmission mode：As shown in Figure 3 a, point-to-point data-transmission mode, this kind of transmission mode are belonged to
Traditional mode can be referred to as, under this kind of transmission mode, source node set is combined into S={ s1 }, and destination node collection is combined into T={ t1 }.
Second of data-transmission mode：As shown in Figure 3 b, broadcast mode is belonged to, this kind of data-transmission mode also belongs to a little
To more data transfers, under this kind of transmission mode, source node set is combined into S={ s1 }, destination node collection be combined into T=t1, t2 ...,
tm}.In broadcast mode, data transfer make use of the broadcast characteristic being wirelessly transferred, and each node in signal cover can
Enough receives signal.Therefore, in a broadcast mode, in point-to-points transmitting procedure, link cost is with the maximum biography of link overhead
Defeated node is defined, link overhead be less than maximum node can not expend energy receive signal.
The third data-transmission mode：As shown in Figure 3 c, collaboration mode is belonged to, this kind of data-transmission mode falls within multipair
Point transmission, as source node set is combined into S={ s1, s2 ..., sm }, destination node collection is combined into T={ t1 }.
4th kind of data-transmission mode：As shown in Figure 3 d, cooperation broadcast transmission mode is belonged to, this kind of transmission mode is fallen within
The data transfer of multi-to-multi, source node set are combined into S={ s1, s2 ..., sm }, and destination node collection is combined into T={ t1, t2 ..., tm }.
Above-mentioned four kinds of data-transmission modes in wireless sensor network, different data-transmission modes have its different
Advantage and disadvantage.Wherein, cooperate under broadcast transmission mode, the source node and destination node of data transfer are all multiple, therefore data pass
Signaling cost, time synchronized expense, interference range etc. are all significantly increased during defeated.Therefore the embodiment of the present invention one proposes here
Technical scheme in, be mainly based upon the data transfer of collaboration mode, i.e. collaboration mode shown in Fig. 3 c.
In wireless sensor network, in data transmission procedure, due to participating in multiple source nodes of data transfer initial
It is differentiated on ENERGY E i and dump energy Ri, so it is determined that during data transfer path, it would be desirable that dump energy deficiency
Source node need not consume more energy.Therefore, in the technique proposed herein scheme of the embodiment of the present invention one, in cooperation transmission
In communication, the primary power of source node and the ratio Ei of dump energy are taken into consideration:Ri determines data transfer path.Such as
In data transmission procedure, when two nodes consume same energy, the big node of ratio needs the transmission node smaller than ratio to pay
Go out more transmission costs.Therefore, in wireless sensor network, the data transfer that determines to include in wireless sensor network
The primary power value and residual energy value of source node, according to primary power value and residual energy value, determine to add corresponding to source node
Weigh power assignment value.
Specifically, with according to the following equation 1 weighted power apportioning cost corresponding to source node can be determined：
Wherein, P1It is weighted power apportioning cost, EiIt is the primary power value of source node i, RiIt is the dump energy of source node i
Value, X is weighting parameters.X is defined in power distribution, and node primary power Ei and dump energy Ri ratio and node need
Weight relationship between consumed energy.Weighting parameters X value is bigger, represents under cooperation transmission mode, power allocation scheme
More focus on the dump energy percentage of the transmission node, conversely, weighting parameters X value is smaller, represent in cooperation transmission mode
Under, power allocation scheme is more focused on completing the energy that data transfer needs to consume.As X=0, represent in cooperation transmission mode
Under, power allocation scheme only considers that data transfer needs the energy consumed, the dump energy percentage without considering the transmission node
Than.
Step 2, it is true according to step 1 for other any child nodes in wireless sensor network in addition to source node
The weighted power apportioning cost made, determine that data are transmitted to the first transmission cost of the child node from source node.
Wherein the first transmission cost is that data are transmitting the transmission cost to the child node from source node.For any
Child node, it is first determined whether the child node is the adjacent node of source node, if it is judged that being yes, it is determined that source node
Transmission power value, the weighted power apportioning cost determined is multiplied with transmission power value, obtained product saves as data from source
Point is transmitted to the first transmission cost of the child node., whereas if judged result is no, it is determined that the first transmission of the child node
Cost is infinity.
Step 3, according to the first transmission cost determined, in whole child nodes, select the first transmission cost minimum
Child node is added in source node set.
Step 4, to the child node being newly added in source node set and the whole child nodes for not being added to source node set
Loose operations are done, the child node in return execution source node set will be newly added to as source node, and return and perform step 2, directly
It is combined into only to the destination node of data transfer is added into source node set, the number of all elements composition included in source node set
According to transmission path as the data transfer path under cooperation transmission mode.
Wherein it is determined that the second transmission cost, transmitted wherein the second transmission cost is data from source node to being newly added to
The transmission cost between child node in source node set；
After the second transmission cost is determined, for any child node for not being added to source node set, perform following
Operation：
Determine the 3rd transmission cost and weighting cost respectively, wherein the 3rd transmission cost be data from source node transmit to
This is not added to the transmission cost between the child node in source node set, and weighting cost is that data are being added to source node from newly
By collaboration communication between child node in child node in set and the source node set being added to before, cooperation transmission was to should
The transmission cost not being added between the child node in source node set；
If it is determined that the 3rd transmission cost be more than the second transmission cost and weighted transmission cost and value；
Then the child node for being newly added to source node set is arranged to be arranged in the son not being added in source node set
The front nodal point of node.
Wherein, cost is weighted, can be determined in the following manner：
Source section is added to new by collaboration communication, cooperation transmission between each child node for determining to include in source node set
The most short transmission path of child node in point set, obtain the child node quantity information that most short transmission path includes；Judge that this is obtained
Whether the child node quantity information obtained is more than or equal to cooperation child node quantity information set in advance；If it is, with to be added
To the child node that source node combines as destination node, according to power distribution function, by cooperation child node quantity set in advance
The child node of information, the transmission cost of cooperation transmission to the destination node is as weighting cost, if it is not, then arriving source with to be added
The child node of node set, according to power distribution function, will include the son being newly added in source node set as destination node
All child nodes in the most short transmission path of node, the transmission cost of cooperation transmission to the destination node is as weighting cost.
Wherein, power distribution function can determine in the following manner：
The weighted power apportioning cost first according to corresponding to source node, it is determined for compliance with the object function of following constraintss.
First constraints：The signal to noise ratio that receiving terminal joint receives is more than predetermined threshold value.
Second constraints：The absolute value of corresponding signal amplitude is less than or equal to power-handling capability when source node sends data
Extraction of square root.
Secondly, value method is multiplied based on Lagrange the object function is solved, determine power distribution function.
Specifically, object function can be represented using following formula 2：
Wherein,It is weighted power apportioning cost corresponding to source node, EiIt is the primary power value of source node i, RiIt is source
The residual energy value of node i, X are weighting parameters, | ωi|2It is transmit power when source node i sends data.
Specifically, the first constraints is represented using following formula 3：
Wherein, SNRminIt is predetermined threshold value,It is the signal to noise ratio that receiving terminal joint receives, η (t) is to receive
The noise arrived, PηIt is the power corresponding to noise η (t), αilRepresent sending node i to receiving node t1Power attenuation coefficient
Extraction of square root.
Second constraints is represented using following formula 4：
Wherein, | ωi| it is the absolute value of corresponding signal amplitude when source node sends data,It is the specified work(of source node
Rate value extracts square root.
Specifically, it is determined that the power distribution function gone out can be represented using following formula 5：
Wherein, SNRminIt is predetermined threshold value,It is weighted power apportioning cost corresponding to source node, EiIt is source node i
Primary power value, RiIt is the residual energy value of source node i, X is weighting parameters,It is hair when source node i sends data
Send power, η (t) is the noise received, PηIt is the power corresponding to noise η (t), αi1 2Represent sending node i to receiving node
T1 power attenuation coefficient.
In specific implementation, for ease of illustrating, the embodiment of the present invention one here by the cooperation transmission mode shown in based on Fig. 3 c,
In a manner of elaborating the power distribution of maximization network life cycle exemplified by a jump in data transmission procedure, that is, determine power
The concrete processing procedure of partition function.
Under cooperation transmission mode, as shown in Figure 3 d, the signal that receiving terminal (i.e. destination node) T is received can use following
Formula 6 represents：
Wherein, r (t) is the signal (data received equivalent to destination node) that receiving terminal T is received, | ωi| it is source
The absolute value after transmit power extraction of square root when node i sends data, η (t) is the noise received, αi1It is that sending node i is arrived
The extraction of square root of receiving node t1 power attenuation coefficient, φ (t) represent the signal that unit power is sent.
Assuming that transmitting terminal (source node) and receiving terminal (destination node) receive synchronously, then when the noise that receiving terminal joint receives
Than the data that received can be correctly decoded more than threshold value SNRmin, receiving terminal.Now, the total energy of source node transmission
Measuring (can also be general power) is
In wireless sensor network, in data transmission procedure, due to participating in multiple source nodes of data transfer initial
It is differentiated on ENERGY E i and dump energy Ri, so it is determined that during data transfer path, it would be desirable that dump energy deficiency
Source node need not consume more energy.Therefore, it can be seen from 2~formula of above-mentioned formula 4, in collaboration communication, cooperation transmission
Under pattern, objective optimization function is during single-hop data transfer：
Constraints is respectively：With
After determining objective optimization function and constraints, value method can be multiplied by Lagrange and is solved to objective optimization
Function is solved, and obtains following formula：
Then derivation is carried out to obtained above-mentioned formula to obtain：
Joint above-mentioned two formula, solve the power distribution function that can be obtained in formula 5：
Above-mentioned formula is in collaboration communication, and in single-hop cooperation transmission, data transfer combines (source node set) S's
The optimal allocation mode of transmit power.
In collaboration communication, using the power distribution mode of weighting, the load for participating in cooperative transmission node can be balanced, from
And extend the life cycle of the wireless sensor network.And the due to consideration that choosing of the primary power and dump energy of source node
It road mode, can cause when determining data transfer path based on routing algorithm, avoid selecting the node of energy deficiency to participate in cooperation
Transmission.
The embodiment of one~step 4 of above-mentioned steps is elaborated with an instantiation below.The present invention is implemented
Example one is set forth above under cooperation transmission mode, and data transfer path is determined based on MNLCR (x) algorithms, and the algorithm is basic
Thought is：
Wireless sensor network is expressed as to the energy attenuation figure G=(V, E) of a Weight, wherein V represents transmission section
Point set, E represent transmission link set, and Ei and Ri represents transmission node i primary power and dump energy respectively, and Pij is represented
Minimum transmit power when transmission node i to transmission node j is transmitted under traditional mode (i.e. under point-to-point transmission pattern).Its
In, in said procedure, it is necessary to set transmission link eij ∈ E initial weight asPij.Coop (u, v) represents data
By transmission node u and its preceding k-1 transmission node cooperation transmission to transmission node v weighting cost, Coop (u, v) value can table
It is shown asIt is then the weighted value that path is chosen.Cost [v] is biography of the data in source node to node v
Transmission cost on transmission link.Cost [u] is front and continued transmission node u of the data from source node to transmission node v transmission link
On transmission cost.Figure G vertex sets V is divided into two groups, first group be obtained shortest path vertex set (represented with S,
An only source point in S, often tries to achieve a shortest path, just will be added in set S later when initial, until whole summits all
It is added in S, algorithm just finishes), second group of vertex set (being represented with U) for not determining shortest path for remaining, by most short
The increasing order of path length adds second group of summit in S successively.Step then can be performed by performing following programs
One~step 4：
Step1:Initialize S={ s }；U=V- { s }；
For all transmission node i ∈ U
If transmission node i is the neighbors of source node, Cost [i]=(Es/Rs) xPsi；
If transmission node i is not the neighbors of source node, Cost [i]=∞；
Step2:The minimum summit u of its Cost [u] are chosen in set U, and not in S, add S；
Then S=S+ { u }；U=U- { u }；
Step3:Loose operations are carried out for other nodes v in U.
Relax(u,v)；
Above-mentioned Step2, Step3 are repeated, until including all summits in S, i.e. untill S=V, U={ }.
Wherein, loose operations call function can be realized by performing following programs：
Cooperation cost function can be realized by performing following programs：
The technique proposed herein scheme of the embodiment of the present invention one is analyzed below by simulated experiment, and this is sent out
What bright embodiment proposed here is determined data transfer path based on MNLCR algorithms and is determined based on the algorithm proposed in the prior art
Influence of the data transfer path to the life cycle of wireless sensor network.I.e. under different technologies scheme, wireless sensor network
Life cycle comparison.
It is assumed that in 80*80 region the N number of transmission node of random distribution (for ease of illustrate, hereinafter
For node), power attenuation factor lambda=2 are set, set the number for often jumping the node for participating in cooperation as 2, the maximum non-association of node
Make transmission radius dmax=25, each node can dynamically adjust transmit power, arbitrary node i to neighbors with tradition side
The normalized value for the energy that formula unit of transfer data need to expend is ei=(R/400)2, the primary power of node is set as 1.
When carrying out simulated experiment, in technique proposed herein scheme of the embodiment of the present invention, two kinds of network scenarios are given.Scene one is mould
Intend the data transfer of fixed source node and destination node until having that a node energy exhausts in network and network is dead, it is of the invention
Embodiment is single data stream scenario (abbreviation single stream) referred to here as this scene.Scene two be every time in N number of node with
Machine chooses source node and destination node analog data transmissions, often completes once to transmit reselecting node again until network is dead,
The embodiment of the present invention is random data stream scene (abbreviation single stream) referred to here as this scene.Obvious single stream is unfavorable for node energy
The average use of amount, thus under equal conditions, single stream can make it that wireless sensor network is first dead.
Fig. 5 is network life cycle curve map (N of the MNLCR routing algorithms under single stream and two kinds of scenes of stochastic flow
=25).Fig. 6 ordinate is normalized network life cycle, and abscissa is then the value of x in MNLCR (x) algorithms.Contrast
Fig. 5 and Fig. 6, the network life cycle under the scene of stochastic flow are much larger than single stream scene.As x=0, MNLCR (x) roads
It is not consider node primary power and dump energy by algorithm.Now, MNLCR (x) algorithms have just been degenerated to CSP algorithms, also make
Network life cycle less than x ≠ 0 when.X increase represents that algorithm will more lay particular stress on selection node when selecting routing node
Dump energy is more and node that channel is less excellent.
As can be seen from the figure：Under the scene of stochastic flow, network life cycle is most long during x=2；In the scene of single stream
Under, network life cycle is most long during x=5.Fig. 6 be then under different node densities (random distribution 15,25,35,45,55
Node), x values and network life cycle relation.Fig. 6 ordinate is normalized network life cycle, and abscissa is then
X value in MNLCR (x) algorithms.It can be drawn from experiment：Under different node densities, network life cycle is under different x values
Variation tendency be basically identical；As x=2, the network life cycle of different node densities is most long；Node density
Higher, MNLCR (2) extends more obvious than the life cycle of CSP (i.e. MNLCR (0)) algorithm.In addition, increasing for node can make
Obtain network life cycle and extend (life cycle of 55 nodes is more than 35 nodes), but the life cycle under MNLCR (x) algorithms
The speed of extension is slightly higher than the increased speed of node.In view of two groups of contrast experiments of the above, under such a ideal network environment, x
=2 are put up the best performance in such algorithm.
Therefore, as shown in fig. 7, under single stream scene, what the embodiment of the present invention proposed here is determined based on MNLCR algorithms
The technical scheme of data transfer path, network life cycle be respectively the routing algorithms such as multi-hop 1209%, 281%, 732%,
393%th, 122%；Under stochastic flow scene, what the embodiment of the present invention proposed here determines data transmission route based on MNLCR algorithms
The technical scheme in footpath, network life cycle are 292%, 178%, 193%, 148%, the 127% of the routing algorithms such as multi-hop respectively.
Multi-hop, the design original intention of CSP, CAN algorithm are not intended to maximization network life cycle, therefore performance is poor.FA
Though algorithm is classical maximization network periodical algorithms, because to show also not under the scene of stochastic flow without coordination mechanism
Such as CSP algorithms.Cooperation the routing algorithm FACR, MNLCR (2) of the maximization network life cycle of contrast truly also has
25% or so life cycle increases.
In summary, using the technical scheme set forth above of the embodiment of the present invention one, weighted power apportioning cost is introduced, existing
There is what is proposed in technology to be determined based on shortest path first on data transfer path, be extended so that in collaboration communication, cooperation
Power distribution mode is more reasonable in transmitting procedure so that the selection of routed path is more suitable for cooperation transmission.Being capable of basis
Power distribution determines data transfer path, balances the energy expenditure of cooperative node, and then the life of prolonging wireless sensor network
Cycle.
Embodiment two
The embodiment of the present invention two proposes a kind of device for determining data transfer path in wireless sensor network here, such as schemes
Shown in 8, including：
Weighted power apportioning cost determining module 801, for the source for the data transfer for determining to include in wireless sensor network
Weighted power apportioning cost corresponding to node.
Specifically, above-mentioned weighted power apportioning cost determining module 801, specifically for determining to include in wireless sensor network
Data transfer source node primary power value and residual energy value；According to the primary power value and residual energy value, really
Determine weighted power apportioning cost corresponding to source node.
Specifically, above-mentioned weighted power apportioning cost determining module 801, specifically for according to formulaDetermine that source is saved
Weighted power apportioning cost corresponding to point, wherein the weighted power apportioning cost is between the primary power of source node and dump energy
Ratio；
Wherein, EiIt is the primary power value of source node i, RiIt is the residual energy value of source node i, X is weighting parameters.
First transmission cost determining module 802, for for other in wireless sensor network in addition to source node
One child node, according to the weighted power apportioning cost, determine that data transmit generation from source node is transmitted to the child node first
Valency, wherein first transmission cost, which is data, is transmitting the transmission cost to the child node from source node.
Specifically, above-mentioned first transmission cost determining module 802, specifically for determining whether the child node is source node
Adjacent node；If it is, the transmission power value of source node is determined, by the weighted power apportioning cost and the transmission power value
It is multiplied, obtained product is transmitted to the first transmission cost of the child node as data from source node；If not, described in determining
First transmission cost of child node is infinity.
Module 803 is chosen, for according to the first transmission cost determined, in whole child nodes, selecting the first transmission
The child node of Least-cost is added in source node set.
Loose operations module 804, source node set it is not added to for the child node to being newly added in source node set and
Whole child nodes of conjunction do loose operations, using the child node being newly added in return execution source node set as source node, and
The first transmission cost determining module is triggered, is combined into only until the destination node of data transfer is added into source node set, the source
The data transfer path of all elements composition included in node set is as the data transfer path under cooperation transmission mode.
Specifically, above-mentioned loose operations module 804, specifically for determining the second transmission cost, wherein second transmission
Cost is that data are being transmitted from source node to the transmission cost between the child node being newly added in source node set；For any
The child node of source node set is not added to, performs operations described below：The 3rd transmission cost and weighting cost, wherein institute are determined respectively
Stating the 3rd transmission cost, to be data transmitting to this transmission that is not added between the child node in source node set from source node
Cost, the weighting cost are data in the source node set being added to from the child node being newly added in source node set with before
By collaboration communication between child node in conjunction, cooperation transmission is not added to the biography between the child node in source node set to this
Defeated cost；If the 3rd transmission cost is more than the second transmission cost and weighted transmission cost and value；Then it will newly be added to source
The child node of node set is arranged to be arranged in the front nodal point of the child node not being added in source node set.
Specifically, above-mentioned loose operations module 804, specifically for determining the weighting cost in the following manner：It is determined that
Pass through collaboration communication, cooperation transmission to the son being newly added in source node set between each child node included in source node set
The most short transmission path of node；The child node quantity information that most short transmission path described in obtaining includes；Judge the son node number
Measure whether information is more than or equal to cooperation child node quantity information set in advance；If it is, combined with to be added to source node
Child node as destination node, according to power distribution function, by the child node of cooperation child node quantity information set in advance,
The transmission cost of cooperation transmission to the destination node is used as weighting cost；If it is not, then with the son to be added to source node set
Node is as destination node, according to power distribution function, by the most short pass comprising the child node being newly added in source node set
All child nodes in defeated path, the transmission cost of cooperation transmission to the destination node is as weighting cost.
Specifically, above-mentioned loose operations module 804, specifically for determining the power distribution function in the following manner：
The weighted power apportioning cost according to corresponding to source node, it is determined for compliance with the object function of following constraintss：First constraints：Connect
The signal to noise ratio that receiving end joint receives is more than predetermined threshold value；Second constraints：Corresponding signal width when source node sends data
The absolute value of value extracts square root less than or equal to power-handling capability；Multiply value method based on Lagrange to solve the object function, it is determined that
Go out power distribution function.
The object function is：
Wherein,It is weighted power apportioning cost corresponding to source node, EiIt is the primary power value of source node i, RiIt is source
The residual energy value of node i, X are weighting parameters, | ωi|2It is transmit power when source node i sends data.
First constraints is represented using following formula：
Wherein, SNRminIt is predetermined threshold value,It is the signal to noise ratio that receiving terminal joint receives, η (t) is to receive
The noise arrived, PηIt is the power corresponding to noise η (t), αilRepresent sending node i to receiving node t1Power attenuation coefficient
Extraction of square root.
Second constraints is represented using following formula：
Wherein, | ωi| it is the absolute value of corresponding signal amplitude when source node sends data,It is the specified work(of source node
Rate value extracts square root.
The power distribution function is represented using following formula：
Wherein, SNRminIt is predetermined threshold value,It is weighted power apportioning cost corresponding to source node, EiIt is source node i
Primary power value, RiIt is the residual energy value of source node i, X is weighting parameters,It is hair when source node i sends data
Send power, η (t) is the noise received, PηIt is the power corresponding to noise η (t), αi1 2Represent sending node i to receiving node
t1Power attenuation coefficient.
It will be understood by those skilled in the art that embodiments of the invention can be provided as method, apparatus (equipment) or computer
Program product.Therefore, in terms of the present invention can use complete hardware embodiment, complete software embodiment or combine software and hardware
Embodiment form.Moreover, the present invention can use the meter for wherein including computer usable program code in one or more
The computer journey that calculation machine usable storage medium is implemented on (including but is not limited to magnetic disk storage, CD-ROM, optical memory etc.)
The form of sequence product.
The present invention is the flow chart with reference to method, apparatus (equipment) and computer program product according to embodiments of the present invention
And/or block diagram describes.It should be understood that can be by each flow in computer program instructions implementation process figure and/or block diagram
And/or square frame and the flow in flow chart and/or block diagram and/or the combination of square frame.These computer programs can be provided to refer to
The processors of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing devices is made to produce
One machine so that produced by the instruction of computer or the computing device of other programmable data processing devices for realizing
The device for the function of being specified in one flow of flow chart or multiple flows and/or one square frame of block diagram or multiple square frames.
These computer program instructions, which may be alternatively stored in, can guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works so that the instruction being stored in the computer-readable memory, which produces, to be included referring to
Make the manufacture of device, the command device realize in one flow of flow chart or multiple flows and/or one square frame of block diagram or
The function of being specified in multiple square frames.
These computer program instructions can be also loaded into computer or other programmable data processing devices so that counted
Series of operation steps is performed on calculation machine or other programmable devices to produce computer implemented processing, so as in computer or
The instruction performed on other programmable devices is provided for realizing in one flow of flow chart or multiple flows and/or block diagram one
The step of function of being specified in individual square frame or multiple square frames.
Although preferred embodiments of the present invention have been described, but those skilled in the art once know basic creation
Property concept, then can make other change and modification to these embodiments.So appended claims be intended to be construed to include it is excellent
Select embodiment and fall into having altered and changing for the scope of the invention.
Obviously, those skilled in the art can carry out the essence of various changes and modification without departing from the present invention to the present invention
God and scope.So, if these modifications and variations of the present invention belong to the scope of the claims in the present invention and its equivalent technologies
Within, then the present invention is also intended to comprising including these changes and modification.
Claims (18)
- A kind of 1. method for determining data transfer path in wireless sensor network, it is characterised in that including：Step S1：Weighted power apportioning cost corresponding to the source node of data transfer that is included in wireless sensor network is determined, its Described in weighted power apportioning cost be ratio between the primary power of source node and dump energy；Step S2：For other any child nodes in wireless sensor network in addition to source node, according to the weighted power Apportioning cost, determine the child node whether be source node adjacent node；If it is, the transmission power value of source node is determined, will The weighted power apportioning cost is multiplied with the transmission power value, and obtained product is transmitted to the son as data from source node First transmission cost of node；If not, the first transmission cost for determining the child node is infinity；Step S3：According to the first transmission cost determined, in whole child nodes, the son section that the first transmission cost is minimum is selected Point is added in source node set；Step S4：Pine is cooked to the child node being newly added in source node set and the whole child nodes for not being added to source node set Relax operation, will newly be added to the child node in the return execution source node set as source node, and return and perform step S2, directly It is combined into only to the destination node of data transfer is added into source node set, all elements composition included in the source node set Data transfer path as the data transfer path under cooperation transmission mode.
- 2. the method as described in claim 1, it is characterised in that determine the source of data transfer included in wireless sensor network Weighted power apportioning cost corresponding to node, including：Determine the primary power value and residual energy value of the source node of the data transfer included in wireless sensor network；According to the primary power value and residual energy value, weighted power apportioning cost corresponding to source node is determined.
- 3. method as claimed in claim 2, it is characterised in that according to the primary power value and residual energy value, determine source Weighted power apportioning cost corresponding to node, including：According to formulaDetermine weighted power apportioning cost corresponding to source node；Wherein, EiIt is the primary power value of source node i, RiIt is the residual energy value of source node i, X is weighting parameters.
- 4. the method as described in claim 1, it is characterised in that do not add to the child node being newly added in source node set and Whole child nodes to source node set do loose operations, will newly be added to the child node in the return execution source node set As source node, including：The second transmission cost is determined, is transmitted wherein second transmission cost is data from source node to being newly added to source node The transmission cost between child node in set；For any child node for not being added to source node set, operations described below is performed：Determine the 3rd transmission cost and weighting cost respectively, wherein the 3rd transmission cost be data from source node transmit to This is not added to the transmission cost between the child node in source node set, and the weighting cost is that data are being added to source from newly By collaboration communication, cooperation transmission between child node in child node in node set and the source node set being added to before The transmission cost not being added to this between child node in source node set；If the 3rd transmission cost is more than the second transmission cost and weighted transmission cost and value；Then the child node for being newly added to source node set is arranged to be arranged in the child node not being added in source node set Front nodal point.
- 5. method as claimed in claim 4, it is characterised in that the weighting cost, determine in the following manner：Determine between each child node for being included in source node set by collaboration communication, cooperation transmission is to being newly added to source node set The most short transmission path of child node in conjunction；The child node quantity information that most short transmission path described in obtaining includes；Judge whether the child node quantity information is more than or equal to cooperation child node quantity information set in advance；If it is, using to be added to the child node that source node combines as destination node, will be advance according to power distribution function The child node of the cooperation child node quantity information of setting, the transmission cost of cooperation transmission to the destination node is as weighting cost；If it is not, then using the child node to be added to source node set as destination node, according to power distribution function, will include The new all child nodes being added in the most short transmission path of the child node in source node set, cooperation transmission to the destination node Transmission cost as weighting cost.
- 6. method as claimed in claim 5, it is characterised in that the power distribution function determines in the following manner：The weighted power apportioning cost according to corresponding to source node, it is determined for compliance with the object function of following constraintss：First constraints：The signal to noise ratio that receiving terminal joint receives is more than predetermined threshold value；Second constraints：The absolute value of corresponding signal amplitude is opened flat less than or equal to power-handling capability when source node sends data Side；Multiply value method based on Lagrange to solve the object function, determine power distribution function.
- 7. method as claimed in claim 6, it is characterised in that the object function is：<mrow> <mi>m</mi> <mi>i</mi> <mi>n</mi> <mo>{</mo> <munderover> <mo>&Sigma;</mo> <mi>i</mi> <mi>n</mi> </munderover> <msup> <mrow> <mo>(</mo> <mfrac> <msub> <mi>E</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>i</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mi>X</mi> </msup> <mo>|</mo> <msub> <mi>&omega;</mi> <mi>i</mi> </msub> <msup> <mo>|</mo> <mn>2</mn> </msup> <mo>}</mo> </mrow>Wherein,It is weighted power apportioning cost corresponding to source node, EiIt is the primary power value of source node i, RiIt is source node i Residual energy value, X is weighting parameters, | ωi|2It is transmit power when source node i sends data.
- 8. method as claimed in claim 6, it is characterised in thatFirst constraints is represented using following formula：<mrow> <mfrac> <mrow> <mo>|</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msub> <mi>&omega;</mi> <mi>i</mi> </msub> <msub> <mi>&alpha;</mi> <mrow> <mi>i</mi> <mn>1</mn> </mrow> </msub> <msup> <mo>|</mo> <mn>2</mn> </msup> </mrow> <msub> <mi>P</mi> <mi>&eta;</mi> </msub> </mfrac> <mo>&GreaterEqual;</mo> <msub> <mi>SNR</mi> <mrow> <mi>m</mi> <mi>i</mi> <mi>n</mi> </mrow> </msub> </mrow>Wherein, SNRminIt is predetermined threshold value,It is the signal to noise ratio that receiving terminal joint receives, η (t) is received Noise, PηIt is the power corresponding to noise η (t), αilRepresent sending node i to receiving node t1Power attenuation coefficient open it is flat Side；Second constraints is represented using following formula：<mrow> <mn>0</mn> <mo>&le;</mo> <mo>|</mo> <msub> <mi>&omega;</mi> <mi>i</mi> </msub> <mo>|</mo> <mo>&le;</mo> <msqrt> <msub> <mi>P</mi> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> </msub> </msqrt> </mrow>Wherein, | ωi| it is the absolute value of corresponding signal amplitude when source node sends data,It is source node power-handling capability Extraction of square root.
- 9. method as claimed in claim 6, it is characterised in that the power distribution function is represented using following formula：<mfenced open = "" close = ""> <mtable> <mtr> <mtd> <mrow> <mi>L</mi> <mi>C</mi> <mrow> <mo>(</mo> <msub> <mi>s</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>t</mi> <mn>1</mn> </msub> <mo>)</mo> </mrow> <mo>=</mo> <mo>|</mo> <msub> <mover> <mi>&omega;</mi> <mo>^</mo> </mover> <mi>i</mi> </msub> <msup> <mo>|</mo> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>=</mo> <mfrac> <mrow> <msup> <mrow> <mo>(</mo> <mfrac> <msub> <mi>E</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>i</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mi>X</mi> </msup> <msubsup> <mi>&alpha;</mi> <mrow> <mi>i</mi> <mn>1</mn> </mrow> <mn>2</mn> </msubsup> <msub> <mi>SNR</mi> <mi>min</mi> </msub> <msub> <mi>P</mi> <mi>&eta;</mi> </msub> </mrow> <msup> <mrow> <mo>(</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msup> <mrow> <mo>(</mo> <mfrac> <msub> <mi>E</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>i</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mi>X</mi> </msup> <msubsup> <mi>&alpha;</mi> <mrow> <mi>i</mi> <mn>1</mn> </mrow> <mn>2</mn> </msubsup> <mo>)</mo> </mrow> <mn>2</mn> </msup> </mfrac> </mrow> </mtd> </mtr> </mtable> </mfenced>Wherein, SNRminIt is predetermined threshold value,It is weighted power apportioning cost corresponding to source node, EiIt is the first of source node i Beginning energy value, RiIt is the residual energy value of source node i, X is weighting parameters,It is transmission work(when source node i sends data Rate, η (t) are the noises received, PηIt is the power corresponding to noise η (t), αi1 2Represent sending node i to receiving node t1's Power attenuation coefficient.
- A kind of 10. device for determining data transfer path in wireless sensor network, it is characterised in that including：Weighted power apportioning cost determining module, the source node of the data transfer for determining to include in wireless sensor network are corresponding Weighted power apportioning cost, wherein the weighted power apportioning cost is the ratio between the primary power of source node and dump energy Value；First transmission cost determining module, for for other any sub- sections in wireless sensor network in addition to source node Point, determine the child node whether be source node adjacent node；If it is, the transmission power value of source node is determined, by described in Weighted power apportioning cost is multiplied with the transmission power value, and obtained product is transmitted to the child node as data from source node The first transmission cost；If not, the first transmission cost for determining the child node is infinity；Module is chosen, for according to the first transmission cost determined, in whole child nodes, selecting the first transmission cost minimum Child node be added in source node set；Loose operations module, the whole of source node set it is not added to for the child node to being newly added in source node set and Child node does loose operations, using the child node being newly added in the return execution source node set as source node, and triggers First transmission cost determining module, it is combined into only until the destination node of data transfer is added into source node set, the source node The data transfer path of all elements composition included in set is as the data transfer path under cooperation transmission mode.
- 11. device as claimed in claim 10, it is characterised in that the weighted power apportioning cost determining module, be specifically used for Determine the primary power value and residual energy value of the source node of the data transfer included in wireless sensor network；According to described first Beginning energy value and residual energy value, determine weighted power apportioning cost corresponding to source node.
- 12. device as claimed in claim 11, it is characterised in that the weighted power apportioning cost determining module, be specifically used for According to formulaDetermine weighted power apportioning cost corresponding to source node；Wherein, EiIt is the primary power value of source node i, RiIt is the residual energy value of source node i, X is weighting parameters.
- 13. device as claimed in claim 10, it is characterised in that the loose operations module, specifically for determining that second passes Defeated cost, transmitted wherein second transmission cost is data from source node to the child node being newly added in source node set Between transmission cost；For any child node for not being added to source node set, operations described below is performed：Determine that the 3rd passes respectively Defeated cost and weighting cost, wherein the 3rd transmission cost, which is data, is not added to source node set being transmitted from source node to this The transmission cost between child node in conjunction, the weighting cost are data from the child node being newly added in source node set Source node is not added to this by collaboration communication, cooperation transmission between the child node in the source node set that is added to before The transmission cost between child node in set；If the 3rd transmission cost is more than the second transmission cost and weighted transmission cost And value；Then the child node for being newly added to source node set is arranged to be arranged in the son section not being added in source node set The front nodal point of point.
- 14. device as claimed in claim 13, it is characterised in that the loose operations module, specifically for according to following sides Formula determines the weighting cost：Arrived between each child node for determining to include in source node set by collaboration communication, cooperation transmission The most short transmission path of the new child node being added in source node set；The son node number that most short transmission path includes described in obtaining Measure information；Judge whether the child node quantity information is more than or equal to cooperation child node quantity information set in advance；If it is, Then using the child node to be added combined to source node as destination node, according to power distribution function, by cooperation set in advance The child node of child node quantity information, the transmission cost of cooperation transmission to the destination node is as weighting cost；If it is not, then with Child node to be added to source node set, according to power distribution function, will include as destination node and newly be added to source node All child nodes in the most short transmission path of child node in set, the transmission cost conduct of cooperation transmission to the destination node Weight cost.
- 15. device as claimed in claim 14, it is characterised in that the loose operations module, specifically for according to following sides Formula determines the power distribution function：The weighted power apportioning cost according to corresponding to source node, it is determined for compliance with following constraintss Object function：First constraints：The signal to noise ratio that receiving terminal joint receives is more than predetermined threshold value；Second constraints：Save in source The absolute value of corresponding signal amplitude extracts square root less than or equal to power-handling capability when point sends data；Value method is multiplied based on Lagrange The object function is solved, determines power distribution function.
- 16. device as claimed in claim 15, it is characterised in that the object function is：<mrow> <mi>m</mi> <mi>i</mi> <mi>n</mi> <mo>{</mo> <munderover> <mo>&Sigma;</mo> <mi>i</mi> <mi>n</mi> </munderover> <msup> <mrow> <mo>(</mo> <mfrac> <msub> <mi>E</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>i</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mi>X</mi> </msup> <mo>|</mo> <msub> <mi>&omega;</mi> <mi>i</mi> </msub> <msup> <mo>|</mo> <mn>2</mn> </msup> <mo>}</mo> </mrow>Wherein,It is weighted power apportioning cost corresponding to source node, EiIt is the primary power value of source node i, RiIt is source node i Residual energy value, X is weighting parameters, | ωi|2It is transmit power when source node i sends data.
- 17. device as claimed in claim 15, it is characterised in thatFirst constraints is represented using following formula：<mrow> <mfrac> <mrow> <mo>|</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msub> <mi>&omega;</mi> <mi>i</mi> </msub> <msub> <mi>&alpha;</mi> <mrow> <mi>i</mi> <mn>1</mn> </mrow> </msub> <msup> <mo>|</mo> <mn>2</mn> </msup> </mrow> <msub> <mi>P</mi> <mi>&eta;</mi> </msub> </mfrac> <mo>&GreaterEqual;</mo> <msub> <mi>SNR</mi> <mrow> <mi>m</mi> <mi>i</mi> <mi>n</mi> </mrow> </msub> </mrow>Wherein, SNRminIt is predetermined threshold value,It is the signal to noise ratio that receiving terminal joint receives, η (t) is received Noise, PηIt is the power corresponding to noise η (t), αilRepresent sending node i to receiving node t1Power attenuation coefficient open it is flat Side；Second constraints is represented using following formula：<mrow> <mn>0</mn> <mo>&le;</mo> <mo>|</mo> <msub> <mi>&omega;</mi> <mi>i</mi> </msub> <mo>|</mo> <mo>&le;</mo> <msqrt> <msub> <mi>P</mi> <msub> <mi>&gamma;</mi> <mi>i</mi> </msub> </msub> </msqrt> </mrow>Wherein, | ωi| it is the absolute value of corresponding signal amplitude when source node sends data,It is source node power-handling capability Extraction of square root.
- 18. device as claimed in claim 15, it is characterised in that the power distribution function is represented using following formula：<mfenced open = "" close = ""> <mtable> <mtr> <mtd> <mrow> <mi>L</mi> <mi>C</mi> <mrow> <mo>(</mo> <msub> <mi>s</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>t</mi> <mn>1</mn> </msub> <mo>)</mo> </mrow> <mo>=</mo> <mo>|</mo> <msub> <mover> <mi>&omega;</mi> <mo>^</mo> </mover> <mi>i</mi> </msub> <msup> <mo>|</mo> <mn>2</mn> </msup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>=</mo> <mfrac> <mrow> <msup> <mrow> <mo>(</mo> <mfrac> <msub> <mi>E</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>i</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mi>X</mi> </msup> <msubsup> <mi>&alpha;</mi> <mrow> <mi>i</mi> <mn>1</mn> </mrow> <mn>2</mn> </msubsup> <msub> <mi>SNR</mi> <mi>min</mi> </msub> <msub> <mi>P</mi> <mi>&eta;</mi> </msub> </mrow> <msup> <mrow> <mo>(</mo> <msubsup> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msup> <mrow> <mo>(</mo> <mfrac> <msub> <mi>E</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>i</mi> </msub> </mfrac> <mo>)</mo> </mrow> <mi>X</mi> </msup> <msubsup> <mi>&alpha;</mi> <mrow> <mi>i</mi> <mn>1</mn> </mrow> <mn>2</mn> </msubsup> <mo>)</mo> </mrow> <mn>2</mn> </msup> </mfrac> </mrow> </mtd> </mtr> </mtable> </mfenced>Wherein, SNRminIt is predetermined threshold value,It is weighted power apportioning cost corresponding to source node, EiIt is the first of source node i Beginning energy value, RiIt is the residual energy value of source node i, X is weighting parameters,It is transmission work(when source node i sends data Rate, η (t) are the noises received, PηIt is the power corresponding to noise η (t), αi1 2Represent sending node i to receiving node t1's Power attenuation coefficient.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310094365.0A CN104066142B (en) | 2013-03-22 | 2013-03-22 | The method and device of data transfer path in a kind of determination wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310094365.0A CN104066142B (en) | 2013-03-22 | 2013-03-22 | The method and device of data transfer path in a kind of determination wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104066142A CN104066142A (en) | 2014-09-24 |
| CN104066142B true CN104066142B (en) | 2017-11-21 |
Family
ID=51553623
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310094365.0A Active CN104066142B (en) | 2013-03-22 | 2013-03-22 | The method and device of data transfer path in a kind of determination wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104066142B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105828426B (en) * | 2015-12-22 | 2019-03-01 | 北京交通大学 | High speed railway foundation facility monitors sensing net node energy management method and system |
| CN106059861B (en) * | 2016-07-26 | 2023-10-24 | 河南工程学院 | System and method for constructing minimum dynamic aggregation tree of Internet of things in distributed mode |
| CN106851768B (en) * | 2016-12-30 | 2020-03-27 | 北京航空航天大学 | Self-adaptive cross-layer multiple access method and system for ensuring service quality |
| CN106941532B (en) * | 2017-03-30 | 2019-07-12 | 北京奇艺世纪科技有限公司 | A kind of data transmission method and device applied to distributed system |
| CN108632941A (en) * | 2018-05-07 | 2018-10-09 | 重庆邮电大学 | Selection collaboration method based on Energy-aware and relay selection method |
| CN109275170A (en) * | 2018-08-20 | 2019-01-25 | 全球能源互联网研究院有限公司 | A kind of charging method and system of wireless chargeable sensing network |
| CN110286694B (en) * | 2019-08-05 | 2022-08-02 | 重庆邮电大学 | Multi-leader unmanned aerial vehicle formation cooperative control method |
| CN110493842B (en) * | 2019-08-20 | 2020-12-11 | 常熟理工学院 | Data communication method of mobile ad hoc network |
| CN111542070B (en) * | 2020-04-17 | 2023-03-14 | 上海海事大学 | Efficient multi-constraint deployment method for industrial wireless sensor network |
| CN111800838B (en) * | 2020-06-17 | 2022-02-01 | 西安电子科技大学 | Clustering cross-layer communication control method, system and application of wireless mobile self-organizing network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101098373A (en) * | 2006-06-30 | 2008-01-02 | 中国科学院软件研究所 | Mobile decision approach for data gathering set in wireless sensor network |
| CN101577956A (en) * | 2009-06-15 | 2009-11-11 | 北京邮电大学 | Method and system for selecting collaboration relay node |
| CN102325041A (en) * | 2011-07-18 | 2012-01-18 | 南京邮电大学 | Complex network theory-based wireless sensor network group management method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7486627B2 (en) * | 2003-06-03 | 2009-02-03 | Palo Alto Research Center Incorporated | Time-aware strategy for message-initiated constraint-based routing |
-
2013
- 2013-03-22 CN CN201310094365.0A patent/CN104066142B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101098373A (en) * | 2006-06-30 | 2008-01-02 | 中国科学院软件研究所 | Mobile decision approach for data gathering set in wireless sensor network |
| CN101577956A (en) * | 2009-06-15 | 2009-11-11 | 北京邮电大学 | Method and system for selecting collaboration relay node |
| CN102325041A (en) * | 2011-07-18 | 2012-01-18 | 南京邮电大学 | Complex network theory-based wireless sensor network group management method |
Non-Patent Citations (4)
| Title |
|---|
| 引入剩余能量的LEACH 协议改进算法;徐东意，张华忠;《计算机工程与应用》;20091231;全文 * |
| 无线传感器网络中的能量均衡路由算法研究;张海洋;《中国优秀硕士学位论文全文数据库 信息科技辑》;20090115;全文 * |
| 无线传感器网络分簇协议LEACH协议中的簇头选择的改进研究;王法;《中国优秀硕士学位论文全文数据库 信息科技辑》;20091115;全文 * |
| 无线传感器网络能量均衡的分簇路由算法研究;聂丽;《中国优秀硕士学位论文全文数据库 信息科技辑》;20090615;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104066142A (en) | 2014-09-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104066142B (en) | The method and device of data transfer path in a kind of determination wireless sensor network | |
| Mukherjee et al. | Edge computing-enabled cell-free massive MIMO systems | |
| Chen et al. | Distributed power splitting for SWIPT in relay interference channels using game theory | |
| CN101138206B (en) | Method and arrangement for advanced routing metrics in multihop networks | |
| Xie et al. | Optimal resource allocation for reliable and energy efficient cooperative communications | |
| Guan et al. | Topology control in mobile ad hoc networks with cooperative communications | |
| CN102638872B (en) | Relay selection method based on load balancing in cooperation relay network | |
| Yu et al. | Topology control in cooperative wireless ad-hoc networks | |
| Jia et al. | A genetic approach on cross-layer optimization for cognitive radio wireless mesh network under SINR model | |
| Khayatian et al. | Coalition-based approaches for joint power control and relay selection in cooperative networks | |
| Zhang et al. | Resource allocation for wireless cooperative networks: A unified cooperative bargaining game theoretic framework | |
| Hafeez et al. | Analysis of dynamic spectrum leasing for coded bi-directional communication | |
| Hussain et al. | Energy efficient virtual MIMO communication for wireless sensor networks | |
| Song et al. | Energy efficient cooperative coalition selection in cluster-based capillary networks for CMIMO IoT systems | |
| CN104954970A (en) | D2D (device to device) resource allocation method and system | |
| CN104661278B (en) | A kind of sub-clustering cooperative routing method based on evolutionary Game | |
| Chen et al. | Energy-balanced cooperative routing in multihop wireless ad hoc networks | |
| Avokh et al. | Interference-aware multicast and broadcast routing in wireless mesh networks using both rate and channel diversity | |
| Ebrahimi et al. | Device-to-device data transfer through multihop relay links underlaying cellular networks | |
| Lu et al. | A layered coalitional game framework of wireless relay network | |
| Mach et al. | Incentive-based D2D relaying in cellular networks | |
| Dai et al. | Fairness improves throughput in energy-constrained cooperative ad-hoc networks | |
| Chen et al. | Energy-balanced cooperative routing in multihop wireless networks | |
| Liu et al. | Relay selection for three-stage relaying scheme in clustered wireless networks | |
| CN106550409A (en) | Compound relaying motivational techniques in coordination downlink communication |
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 |