CN104717712B - A kind of node selecting method for the wireless sense network enhancing network lifecycle that cooperates - Google Patents

A kind of node selecting method for the wireless sense network enhancing network lifecycle that cooperates Download PDF

Info

Publication number
CN104717712B
CN104717712B CN201510129229.XA CN201510129229A CN104717712B CN 104717712 B CN104717712 B CN 104717712B CN 201510129229 A CN201510129229 A CN 201510129229A CN 104717712 B CN104717712 B CN 104717712B
Authority
CN
China
Prior art keywords
mrow
msub
node
rsqb
lsqb
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
Application number
CN201510129229.XA
Other languages
Chinese (zh)
Other versions
CN104717712A (en
Inventor
徐平平
刘琨
武贵路
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Southeast University
Original Assignee
Southeast University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Southeast University filed Critical Southeast University
Priority to CN201510129229.XA priority Critical patent/CN104717712B/en
Publication of CN104717712A publication Critical patent/CN104717712A/en
Application granted granted Critical
Publication of CN104717712B publication Critical patent/CN104717712B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • 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
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • 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

Abstract

The invention discloses a kind of node selecting method for the wireless sense network enhancing network lifecycle that cooperates, by establishing channel condition information, residue energy of node and the relation of outage probability, so that it is determined that go out which node can be used as potential relay transmission message, the life duration of collaborative network can effectively be extended, while employ the life duration that more accurately method defines collaborative network；Compared with existing relay selection scheme, technical solution of the present invention improves the life duration of cooperative communication network.

Description

A kind of node selecting method for the wireless sense network enhancing network lifecycle that cooperates
Technical field
The present invention relates to a kind of node selecting method for the wireless sense network enhancing network lifecycle that cooperates, belong to channel radio Believe relaying technique.
Background technology
Wireless sensor network (WSN, wireless sensor networks) is by substantial amounts of microsensor node The network being made up of Ad hoc mode.These sensor node costs are low, small power consumption and possess certain perception, Computing capability and wireless communication ability.Wireless sensor network is in environment measuring, national defence anti-terrorism, earthquake relief work, medical treatment and nursing, intelligence The energy numerous areas such as household and deep space probing all has broad application prospects, and is one of focus of academic circles at present research.Sensing The energy of device node is typically all to be provided by the battery built in node, and the energy for being available for node to carry out operating processing is limited , and sensor node is typically all to sow in the complicated area of environmental condition, and how to carry out the supplement of node energy is one Hang-up.Therefore, how energy is efficiently used, maximization network life cycle is further applied as wireless sensor network The overriding challenge faced.
According to the via node number for participating in collaboration communication, relay selection scheme can be divided into two classes：One kind is more relayings Node selection scheme, i.e., participate in cooperation forwarding according to certain multiple relaying of requirement selection；Another kind of is single trunk node selection scheme, I.e. according to a certain algorithm, only the optimal relaying of selection one turns to assist source node to carry out data in multiple alternative relayings Hair.To meet the SNR of destination node as index, after the via node in system is less than certain quantity (or ratio is less than After certain numerical value), cooperative communication network " death " is defined, the duration before death is the life duration of cooperative communication network.
In the junction network shown in Fig. 1, information source S send information to up to destination node D and each relaying in the first time slot and saved Point R, each via node R select a via node in second time slot forwarding information extremely after single trunk node selection scheme Destination node D.In the prior art, conventional single trunk node selection scheme typically has two kinds：One kind is MTP schemes, is referred to The via node of the minimum transmission energy of needs is chosen every time as cooperative transmission node；Another kind is MRE schemes, refers to that selection is surplus The maximum via node of complementary energy, the i.e. present energy of via node subtract the energy needed for transmission, and the maximum is to cooperate with passing Defeated node.
But there is following defect in MTP schemes and MRE schemes：1st, determined with the sensor node of specific quantity (ratio) be present Justice cooperation wireless sensor network life duration is inaccurate, because some sensor can not participate in forwarding information and only be reduction of The spatial gain of the system, the QoS demand of pedal system might not be discontented with；2nd, each transmission energy of MTP Scheme Choices is minimum Node, it is possible to so that some relaying is too early " death "；3rd, MRE schemes make it that the energy in relaying is average, but can make simultaneously Via node into forwarding information consumes excessive energy, therefore both are not beneficial to the extension of wireless sense network life duration. Therefore a more excellent trunk node selection scheme is needed to overcome these problems.
Abbreviation and Key Term definition
WSN wireless sensor networks wireless sense networks
CSI channel state information channel condition informations
REI residual energy information dump energy information
QOS quality of service service quality
AF amplify and forward amplification forwardings
MTP minimum transmission energy minimum transfer energy
MRE maximum residual energy maximum residual energy
MRI maximum energy-efficiency index maximum energy efficiency indexes
The OLS optimal lifetime strategy optimal network life-spans
The content of the invention
Goal of the invention：In order to overcome the deficiencies in the prior art, the present invention provides a kind of cooperation wireless sense network and increased The node selecting method of strong network lifecycle, by establishing channel condition information (CSI), residue energy of node (REI) with The relation of disconnected probability, so that it is determined that going out which node can be used as potential relay transmission message, effectively to extend collaborative network Life duration, while define using more accurately method the life duration of collaborative network.
Technical scheme：To achieve the above object, the technical solution adopted by the present invention is：
A kind of node selecting method for the wireless sense network enhancing network lifecycle that cooperates, comprises the following steps：
(1) initialization relaying number N, the primary power of N number of via node are Timing step lifetime=0 is set；
(2) system break probability is judgedIt is that cooperative relay system maximum can be held whether to be less than given threshold η, η Bear outage probability value：
Wherein, γ is the threshold value of the received signal to noise ratio of destination node, if the received signal to noise ratio of destination node is more than threshold gamma, Then think that destination node proper reception of information；ek[m] is that k-th of relaying saves Primary power o'clock in m time slots；Pr() represents to ask for the probability of bracket content；PsFor information source node S transmission power； hsdRepresent information source node to destination node channel gain, meet average be 0, variance beCyclic Symmetry multiple Gauss point Cloth；hskRepresent information source node to via node channel gain, meet average be 0, variance beCyclic Symmetry multiple Gauss Distribution；hkdRepresent via node to destination node channel gain, meet average be 0, variance beThe multiple height of Cyclic Symmetry This distribution；K1() represents the Bessel function of the second kind of single order；
As can be seen from the above equation, system break probabilityIt is only relevant with the dump energy of via node；IfThen enter step (3)；Otherwise, record lifetime and terminate；
(3) cooperative relay system generates new h at randomsd、hskAnd hkd；
(4) judge whether via node belongs to set RE, that is, judge whether via node meets following condition：
1. the signal to noise ratio that receives of destination node needs to be more than threshold gamma, therefore k-th of via node meets to be somebody's turn to do in m time slots Under the conditions of required for minimum transmission power Pk-min[m] is：
Wherein, Pk[m] represents transimission power of k-th of via node in m time slots；Set information is in each slot transmission Time be a unit interval, then the power consumption of via node transmission is numerically equal to the power of transmission, and kth is required based on this Individual via node meets Pk-min[m]≤Pk-maxAnd Pk-min[m]≤ek[m] the two conditions, that is, require in m time slots, kth The minimum transmission power P of individual via nodek-min[m] is less than its maximum transmission power Pk-max, the minimum of k-th of via node disappears Energy consumption Pk-min[m] is less than its primary power e in m time slotsk[m]；
2. in m time slots, the received signal to noise ratio of k-th of via node is more than γ, ensures that the information of relay forwarding will not Excessively distortion, i.e.,
Based on above-mentioned condition, RE=Rt∩{k:Pk-min[m]≤ek[m]}∩{k:Pk-min[m]≤Pmax}；If REFor empty set, Then keep current relay state constant, return to step (3)；Otherwise, into step (5)；
(5) MEI schemes or OLS schemes are used from REMiddle one via node of selection is as assistance transmission node；
1. MEI schemes are used as the energy efficiency via node of selection maximum ratio and assist transmission node, it is specially：For REIn each via node, calculate following formula：
ChooseFor the minimum via node of value as transmission node is assisted, the via node so selected is the energy of consumption Measure the minimum via node of relative surplus node energy ratio；
2. OLS schemes are to choose the via node conduct that system break probability is minimum after the complete current information of node-node transmission Assist transmission node：For REIn each via node, calculate following formula：
Wherein 1kIt is 1 in the value of kth opening position for the vector of N × 1, the value of remaining opening position is 0；
ChooseThe minimum via node of value is as assistance transmission node；Due to the life duration for the wireless sense network that cooperates Definition is relevant with outage probability, therefore the energy allocative decision is equivalent to steppingly extension network life duration；
(6) the cooperative transmission node change relay state selected according to step (5), lifetime=lifetime+1, Return to step (2).
Based on the inventive method, we can define a length of during network life：
Represent that all via nodes can reach most under initial energy Big transmission time slot；I.e. step (2) is confirmingIn the case of the lifetime values that record.
Beneficial effect：The node selecting method of cooperation wireless sense network enhancing network lifecycle provided by the invention, leads to The relation for establishing channel condition information, residue energy of node and outage probability is crossed, is dived so that it is determined which node gone out and can be used as Relay transmission message, can effectively extend the life duration of collaborative network, at the same employ more accurately method definition association Make the life duration of network；Compared with existing relay selection scheme, technical solution of the present invention improves cooperative communication network Life duration.
Brief description of the drawings
Fig. 1 is the system model of cooperation wireless sense network；
Fig. 2 is the implementation process figure of the present invention；
The network duration contrast of the various relay selection schemes of Fig. 3.
Embodiment
The present invention is further described below in conjunction with the accompanying drawings.
It is as shown in Figure 1 a kind of system model for the wireless sense network that cooperates, in the first time slot, information source is sent out by broadcast channel Breath deliver letters to via node and destination node, using AF pass-through modes, the received signal to noise ratio of via node is：
SNR=Ps|hsk|2
In the second time slot, all relayings for receiving information therefrom select optimal relay transmission information to destination, purpose section Point received signal to noise ratio be：
A kind of node selecting method for the wireless sense network enhancing network lifecycle that cooperates, comprises the following steps：
(1) initialization relaying number N, the primary power of N number of via node are Timing step lifetime=0 is set；
(2) system break probability is judgedIt is that cooperative relay system maximum can be held whether to be less than given threshold η, η Bear outage probability value：
Wherein, γ is the threshold value of the received signal to noise ratio of destination node, if the received signal to noise ratio of destination node is more than threshold gamma, Then think that destination node proper reception of information；ek[m] is that k-th of relaying saves Primary power o'clock in m time slots；Pr() represents to ask for the probability of bracket content；PsFor information source node S transmission power； hsdRepresent information source node to destination node channel gain, meet average be 0, variance beCyclic Symmetry multiple Gauss point Cloth；hskRepresent information source node to via node channel gain, meet average be 0, variance beCyclic Symmetry multiple Gauss point Cloth；hkdRepresent via node to destination node channel gain, meet average be 0, variance beCyclic Symmetry multiple Gauss Distribution；K1() represents the Bessel function of the second kind of single order；
As can be seen from the above equation, system break probabilityIt is only relevant with the dump energy of via node；IfThen enter step (3)；Otherwise, record lifetime and terminate；
(3) cooperative relay system generates new h at randomsd、hskAnd hkd；
(4) judge whether via node belongs to set RE, that is, judge whether via node meets following condition：
1. the signal to noise ratio that receives of destination node needs to be more than threshold gamma, therefore k-th of via node meets to be somebody's turn to do in m time slots Under the conditions of required for minimum transmission power Pk-min[m] is：
Wherein, Pk[m] represents transimission power of k-th of via node in m time slots；Set information is in each slot transmission Time be a unit interval, then the power consumption of via node transmission is numerically equal to the power of transmission, and kth is required based on this Individual via node meets Pk-min[m]≤Pk-maxAnd Pk-min[m]≤ek[m] the two conditions, that is, require in m time slots, kth The minimum transmission power P of individual via nodek-min[m] is less than its maximum transmission power Pk-max, the minimum of k-th of via node disappears Energy consumption Pk-min[m] is less than its primary power e in m time slotsk[m]；
2. in m time slots, the received signal to noise ratio of k-th of via node is more than γ, ensures that the information of relay forwarding will not Excessively distortion, i.e. Rt={ k:Ps|hsk|2≥γ}；
Based on above-mentioned condition, RE=Rt∩{k:Pk-min[m]≤ek[m]}∩{k:Pk-min[m]≤Pmax}；If REFor empty set, Then keep current relay state constant, return to step (3)；Otherwise, into step (5)；
(5) MEI schemes or OLS schemes are used from REMiddle one via node of selection is as assistance transmission node；
1. MEI schemes are used as the energy efficiency via node of selection maximum ratio and assist transmission node, it is specially：For REIn each via node, calculate following formula：
ChooseFor the minimum via node of value as transmission node is assisted, the via node so selected is the energy of consumption Measure the minimum via node of relative surplus node energy ratio；
2. OLS schemes are to choose the via node conduct that system break probability is minimum after the complete current information of node-node transmission Assist transmission node：For REIn each via node, calculate following formula：
Wherein 1kIt is 1 in the value of kth opening position for the vector of N × 1, the value of remaining opening position is 0；
ChooseThe minimum via node of value is as assistance transmission node；Due to the life duration for the wireless sense network that cooperates Definition is relevant with outage probability, therefore the energy allocative decision is equivalent to steppingly extension network life duration；
(6) the cooperative transmission node change relay state selected according to step (5), lifetime=lifetime+1, Return to step (2).
The present invention is made further instructions with reference to embodiment.
Embodiment uses network topology as shown in Figure 1, and it is vertical with destination node that sensor node is located at information source node On bisector, information source node is 20m with destination node distance.The emulation platform of embodiment is Matlab R2012b.Scene setting For：The transimission power of information source is 12dB, and SNR threshold gamma is 14dB, and the threshold value η of outage probability is 0.1, information source node and relaying Node hskAnd via node and the channel coefficients h of destination nodekdMeet 0 average, the Cyclic Symmetry multiple Gauss point that variance is 1 Cloth.Via node quantity is 4, and the maximum transmission power of via node is 82.25mW, and the primary power of via node changes model Enclose for 100~500mJ.
Under the same experiment scene that the embodiment is set, emulated by Monte Carlo, more each relay selection scheme Under sensor network life duration, as shown in Figure 3.
By Fig. 3, compared with existing relay selection scheme (MRE and MTP), MEI and OLS relay selections scheme extends The life duration of cooperative communication network, MEI almost overlaps with OLS line style in figure.
Described above is only the preferred embodiment of the present invention, it should be pointed out that：For the ordinary skill people of the art For member, under the premise without departing from the principles of the invention, some improvements and modifications can also be made, these improvements and modifications also should It is considered as protection scope of the present invention.

Claims (1)

  1. A kind of 1. node selecting method for the wireless sense network enhancing network lifecycle that cooperates, it is characterised in that：Including following step Suddenly：
    (1) initialization relaying number N, the primary power of N number of via node areMeter is set Shi Buchang lifetime=0；
    (2) system break probability is judgedIt is in cooperative relay system largest tolerable whether to be less than given threshold η, η Disconnected probable value：
    <mrow> <msub> <mi>P</mi> <mrow> <mi>o</mi> <mi>u</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo>(</mo> <mover> <mi>e</mi> <mo>&amp;RightArrow;</mo> </mover> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mo>&amp;Pi;</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <msub> <mi>P</mi> <mrow> <mi>o</mi> <mi>u</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo>(</mo> <msub> <mi>e</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <mo>)</mo> </mrow> </mrow>
    <mfenced open = "" close = ""> <mtable> <mtr> <mtd> <mrow> <msub> <mi>P</mi> <mrow> <mi>o</mi> <mi>u</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo>(</mo> <msub> <mi>e</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mi>s</mi> </msub> <msup> <mrow> <mo>|</mo> <msub> <mi>h</mi> <mrow> <mi>s</mi> <mi>d</mi> </mrow> </msub> <mo>|</mo> </mrow> <mn>2</mn> </msup> <mo>+</mo> <mfrac> <mrow> <msub> <mi>P</mi> <mi>s</mi> </msub> <msub> <mi>e</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <msup> <mrow> <mo>|</mo> <mrow> <msub> <mi>h</mi> <mrow> <mi>k</mi> <mi>s</mi> </mrow> </msub> <msub> <mi>h</mi> <mrow> <mi>k</mi> <mi>d</mi> </mrow> </msub> </mrow> <mo>|</mo> </mrow> <mn>2</mn> </msup> </mrow> <mrow> <mn>1</mn> <mo>+</mo> <msub> <mi>P</mi> <mi>s</mi> </msub> <msup> <mrow> <mo>|</mo> <msub> <mi>h</mi> <mrow> <mi>s</mi> <mi>k</mi> </mrow> </msub> <mo>|</mo> </mrow> <mn>2</mn> </msup> <mo>+</mo> <msub> <mi>e</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <msup> <mrow> <mo>|</mo> <msub> <mi>h</mi> <mrow> <mi>k</mi> <mi>d</mi> </mrow> </msub> <mo>|</mo> </mrow> <mn>2</mn> </msup> </mrow> </mfrac> <mo>&lt;</mo> <mi>&amp;gamma;</mi> <mo>)</mo> </mrow> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>=</mo> <mn>1</mn> <mo>-</mo> <mo>&amp;lsqb;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mrow> <mo>(</mo> <mfrac> <mi>&amp;gamma;</mi> <mrow> <msub> <mi>P</mi> <mi>s</mi> </msub> <msubsup> <mi>&amp;sigma;</mi> <mrow> <mi>s</mi> <mi>k</mi> </mrow> <mn>2</mn> </msubsup> </mrow> </mfrac> <mo>+</mo> <mfrac> <mi>&amp;gamma;</mi> <mrow> <msub> <mi>e</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <msubsup> <mi>&amp;sigma;</mi> <mrow> <mi>k</mi> <mi>d</mi> </mrow> <mn>2</mn> </msubsup> </mrow> </mfrac> <mo>)</mo> </mrow> </mrow> </msup> <msqrt> <mfrac> <mrow> <mn>4</mn> <mi>&amp;gamma;</mi> <mrow> <mo>(</mo> <mi>&amp;gamma;</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>P</mi> <mi>s</mi> </msub> <msub> <mi>e</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <msubsup> <mi>&amp;sigma;</mi> <mrow> <mi>s</mi> <mi>k</mi> </mrow> <mn>2</mn> </msubsup> <msubsup> <mi>&amp;sigma;</mi> <mrow> <mi>k</mi> <mi>d</mi> </mrow> <mn>2</mn> </msubsup> </mrow> </mfrac> </msqrt> <msub> <mi>K</mi> <mn>1</mn> </msub> <mrow> <mo>(</mo> <msqrt> <mfrac> <mrow> <mn>4</mn> <mi>&amp;gamma;</mi> <mrow> <mo>(</mo> <mi>&amp;gamma;</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>P</mi> <mi>s</mi> </msub> <msub> <mi>e</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <msubsup> <mi>&amp;sigma;</mi> <mrow> <mi>s</mi> <mi>k</mi> </mrow> <mn>2</mn> </msubsup> <msubsup> <mi>&amp;sigma;</mi> <mrow> <mi>k</mi> <mi>d</mi> </mrow> <mn>2</mn> </msubsup> </mrow> </mfrac> </msqrt> <mo>)</mo> </mrow> <mo>&amp;rsqb;</mo> </mrow> </mtd> </mtr> </mtable> </mfenced>
    Wherein, γ is the threshold value of the received signal to noise ratio of destination node, if the received signal to noise ratio of destination node is more than threshold gamma, is recognized Information is proper reception of for purpose node；ek[m] is k-th via node the Primary power during m time slots；Pr() represents to ask for the probability of bracket content；PsFor information source node S transmission power；hsdRepresent Information source node to the channel gain of destination node, meet average be 0, variance beCyclic Symmetry multiple Gauss distribution；hskRepresent Information source node to the channel gain of via node, meet average be 0, variance beCyclic Symmetry multiple Gauss distribution；hkdRepresent Via node to the channel gain of destination node, meet average be 0, variance beCyclic Symmetry multiple Gauss distribution；K1(·) Represent the Bessel function of the second kind of single order；
    IfThen enter step (3)；Otherwise, record lifetime and terminate；
    (3) cooperative relay system generates new h at randomsd、hskAnd hkd；
    (4) judge whether via node belongs to set RE, that is, judge whether via node meets following condition：
    1. the received signal to noise ratio of destination node needs to be more than threshold gamma, therefore k-th of via node meets the condition in m time slots Lower required minimum transmission power Pk-min[m] is：
    <mrow> <msub> <mi>P</mi> <mrow> <mi>k</mi> <mo>-</mo> <mi>m</mi> <mi>i</mi> <mi>n</mi> </mrow> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <mo>=</mo> <mi>m</mi> <mi>i</mi> <mi>n</mi> <mo>{</mo> <msub> <mi>P</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <mo>:</mo> <msub> <mi>P</mi> <mi>s</mi> </msub> <msup> <mrow> <mo>|</mo> <msub> <mi>h</mi> <mrow> <mi>s</mi> <mi>d</mi> </mrow> </msub> <mo>|</mo> </mrow> <mn>2</mn> </msup> <mo>+</mo> <mfrac> <mrow> <msub> <mi>P</mi> <mi>s</mi> </msub> <msub> <mi>P</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <mo>|</mo> <msub> <mi>h</mi> <mrow> <mi>s</mi> <mi>k</mi> </mrow> </msub> <msub> <mi>h</mi> <mrow> <mi>k</mi> <mi>d</mi> </mrow> </msub> <msup> <mo>|</mo> <mn>2</mn> </msup> </mrow> <mrow> <mn>1</mn> <mo>+</mo> <msub> <mi>P</mi> <mi>s</mi> </msub> <msup> <mrow> <mo>|</mo> <msub> <mi>h</mi> <mrow> <mi>s</mi> <mi>k</mi> </mrow> </msub> <mo>|</mo> </mrow> <mn>2</mn> </msup> <mo>+</mo> <msub> <mi>P</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <msup> <mrow> <mo>|</mo> <msub> <mi>h</mi> <mrow> <mi>k</mi> <mi>d</mi> </mrow> </msub> <mo>|</mo> </mrow> <mn>2</mn> </msup> </mrow> </mfrac> <mo>&amp;GreaterEqual;</mo> <mi>&amp;gamma;</mi> <mo>}</mo> </mrow>
    Wherein, Pk[m] represents transimission power of k-th of via node in m time slots；Set information each slot transmission when Between be a unit interval, then the power consumption of via node transmission is numerically equal to the power of transmission, is required based on this in k-th Meet P after nodek-min[m]≤Pk-maxAnd Pk-min[m]≤ek[m] the two conditions, that is, require in m time slots, in k-th After the minimum transmission power P of nodek-min[m] is less than its maximum transmission power Pk-max, the minimal consumption energy of k-th of via node Measure Pk-min[m] is less than its primary power e in m time slotsk[m]；
    2. in m time slots, the received signal to noise ratio of k-th of via node is more than γ, ensures that the information of relay forwarding will not be excessively Distortion, i.e. Rt={ k:Ps|hsk|2≥γ}；
    Based on above-mentioned condition, RE=Rt∩{k:Pk-min[m]≤ek[m]}∩{k:Pk-min[m]≤Pk-max}；If REFor empty set, then protect It is constant to hold current relay state, return to step (3)；Otherwise, into step (5)；
    (5) MEI schemes or OLS schemes are used from REMiddle one via node of selection is as assistance transmission node；
    1. MEI schemes are：For REIn each via node, calculate following formula：
    <mrow> <msubsup> <mi>k</mi> <mrow> <mi>M</mi> <mi>E</mi> <mi>I</mi> </mrow> <mo>*</mo> </msubsup> <mo>=</mo> <mi>arg</mi> <munder> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> <mrow> <mi>k</mi> <mo>&amp;Element;</mo> <msub> <mi>R</mi> <mi>E</mi> </msub> </mrow> </munder> <mfrac> <mrow> <msub> <mi>e</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> </mrow> <mrow> <msub> <mi>w</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> </mrow> </mfrac> </mrow>
    ChooseThe minimum via node of value is as assistance transmission node；
    2. OLS schemes are：For REIn each via node, calculate following formula：
    <mfenced open = "" close = ""> <mtable> <mtr> <mtd> <mrow> <msubsup> <mi>k</mi> <mrow> <mi>O</mi> <mi>L</mi> <mi>S</mi> </mrow> <mo>*</mo> </msubsup> <mo>=</mo> <mi>arg</mi> <munder> <mi>min</mi> <mrow> <mi>k</mi> <mo>&amp;Element;</mo> <msub> <mi>R</mi> <mi>E</mi> </msub> </mrow> </munder> <msub> <mi>P</mi> <mrow> <mi>o</mi> <mi>u</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo>(</mo> <mover> <mi>e</mi> <mo>&amp;RightArrow;</mo> </mover> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <mo>-</mo> <msub> <mi>w</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <msub> <mn>1</mn> <mi>k</mi> </msub> <mo>)</mo> </mrow> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>=</mo> <mi>arg</mi> <munder> <mi>min</mi> <mrow> <mi>k</mi> <mo>&amp;Element;</mo> <msub> <mi>R</mi> <mi>E</mi> </msub> </mrow> </munder> <mfrac> <mrow> <msub> <mi>P</mi> <mrow> <mi>o</mi> <mi>u</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo>(</mo> <mover> <mi>e</mi> <mo>&amp;RightArrow;</mo> </mover> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <mo>-</mo> <msub> <mi>w</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <msub> <mn>1</mn> <mi>k</mi> </msub> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>P</mi> <mrow> <mi>o</mi> <mi>u</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo>(</mo> <mover> <mi>e</mi> <mo>&amp;RightArrow;</mo> </mover> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>=</mo> <mi>arg</mi> <munder> <mi>min</mi> <mrow> <mi>k</mi> <mo>&amp;Element;</mo> <msub> <mi>R</mi> <mi>E</mi> </msub> </mrow> </munder> <mfrac> <mrow> <msub> <mi>P</mi> <mrow> <mi>o</mi> <mi>u</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo>(</mo> <msub> <mi>e</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <mo>-</mo> <msub> <mi>w</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>P</mi> <mrow> <mi>o</mi> <mi>u</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo>(</mo> <msub> <mi>e</mi> <mi>k</mi> </msub> <mo>&amp;lsqb;</mo> <mi>m</mi> <mo>&amp;rsqb;</mo> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </mtd> </mtr> </mtable> </mfenced>
    Wherein 1kIt is 1 in the value of kth opening position for the vector of N × 1, the value of remaining opening position is 0；
    ChooseThe minimum via node of value is as assistance transmission node；
    (6) cooperative transmission node selected according to step (5) changes relay state, lifetime=lifetime+1, returns Step (2).
CN201510129229.XA 2015-03-23 2015-03-23 A kind of node selecting method for the wireless sense network enhancing network lifecycle that cooperates Active CN104717712B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510129229.XA CN104717712B (en) 2015-03-23 2015-03-23 A kind of node selecting method for the wireless sense network enhancing network lifecycle that cooperates

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510129229.XA CN104717712B (en) 2015-03-23 2015-03-23 A kind of node selecting method for the wireless sense network enhancing network lifecycle that cooperates

Publications (2)

Publication Number Publication Date
CN104717712A CN104717712A (en) 2015-06-17
CN104717712B true CN104717712B (en) 2018-02-23

Family

ID=53416559

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510129229.XA Active CN104717712B (en) 2015-03-23 2015-03-23 A kind of node selecting method for the wireless sense network enhancing network lifecycle that cooperates

Country Status (1)

Country Link
CN (1) CN104717712B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105375955B (en) * 2015-10-26 2018-07-17 西安电子科技大学 A kind of cooperation transmission method in letter energy simultaneous interpretation junction network
CN108848540B (en) * 2018-06-20 2020-09-15 中国联合网络通信集团有限公司 Relay node selection method and system
CN109769257B (en) * 2019-01-16 2021-09-10 重庆邮电大学 Heterogeneous network robust resource allocation and duration hybrid optimization method based on energy efficiency

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102065518A (en) * 2010-11-25 2011-05-18 西安电子科技大学 Iteration-enhanced amplifying and forwarding cooperation communication method
CN103369624A (en) * 2013-07-04 2013-10-23 西安电子科技大学 High-energy-efficiency relay selection method in energy constraint cooperative communication system
CN104270798A (en) * 2014-09-23 2015-01-07 西安交通大学 Distributed relay selection method suitable for simultaneous information and power transfer relay network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2502775A (en) * 2012-05-31 2013-12-11 Toshiba Res Europ Ltd Selecting routes between nodes in a network based on node processing gain and lifetime

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102065518A (en) * 2010-11-25 2011-05-18 西安电子科技大学 Iteration-enhanced amplifying and forwarding cooperation communication method
CN103369624A (en) * 2013-07-04 2013-10-23 西安电子科技大学 High-energy-efficiency relay selection method in energy constraint cooperative communication system
CN104270798A (en) * 2014-09-23 2015-01-07 西安交通大学 Distributed relay selection method suitable for simultaneous information and power transfer relay network

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
Relay Selection Methods for Maximizing the Lifetime of Wireless Sensor Networks;Fábio Engel,etc;《2013 IEEE wireless communication and networking conference》;20131231;全文 *
协作通信系统中能效优化的中继分配算法;曹傧等;《电子科技大学学报》;20141130;全文 *
基于接收信噪比和网络寿命的最优中继选择;孙文胜等;《电信科学》;20120731;全文 *
无线传感网两种中继选择策略的中断概率分析;刘磊等;《现代电子技术》;20101231;全文 *

Also Published As

Publication number Publication date
CN104717712A (en) 2015-06-17

Similar Documents

Publication Publication Date Title
Rasouli et al. ADCA: Adaptive duty cycle algorithm for energy efficient IEEE 802.15. 4 beacon-enabled wireless sensor networks
CN104717712B (en) A kind of node selecting method for the wireless sense network enhancing network lifecycle that cooperates
CN104270798B (en) A kind of distributed relay selection method being suitable for believing energy simultaneous interpretation junction network
US9147340B2 (en) Apparatus and methods for hybrid service discovery
WO2008076991A3 (en) Fast state transition for a ue with reconfiguration over paging
CN105722179B (en) A kind of maximized wireless energy transfer method of cooperative relay system information throughput
Chen et al. Maximizing the lifetime of sensor network using local information on channel state and residual energy
CN107124215A (en) The full duplex multiple antennas destination node selected based on optimal antenna disturbs transmission method
CN108848540A (en) Relay node selecting method and system
CN105188124A (en) Robustness gaming power control method under imperfect CSI for multi-user OFDMA relay system
CN105872246A (en) Anti-addiction method, anti-addiction device and terminal
Guntupalli et al. Performance of frame transmissions and event-triggered sleeping in duty-cycled WSNs with error-prone wireless links
Zhang et al. A blind adaptive tuning algorithm for reliable and energy-efficient communication in IEEE 802.15. 4 networks
CN101815312A (en) Cooperative spectrum detection method based on self-adaptive data fusion
CN103167400B (en) Portable electron device and method for tracing thereof
CN104902492A (en) Wireless body area networks (WBAN)-oriented energy efficient topological structure optimization method
CN103179646B (en) A kind of medical-therapeutic treatment of human body is implanted into the wireless sensor network cooperation transmission method under channel and system
CN109688557A (en) A kind of cooperative node selection method, device
CN106559812A (en) A kind of based reminding method of end delay calling, device and core net node
CN106899386B (en) Method for demodulating fragmented frame signals based on multi-channel communication receiving system
CN104836920B (en) A method and system carrying out intersect waking between mobile terminal applications according to a server terminal
CN105228231A (en) A kind of system and method by detection data frame optimization router amount of radiation
Sum et al. Energy consumption evaluation for power saving mechanisms in recent IEEE 802.15. 4 low-rate wireless personal area networks
CN107155195B (en) WSN node energy monitoring method and system based on data tracing
Randriatsiferana et al. Energy modeling based on power profiling of wireless sensor device

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