CN107148029A - A kind of wireless body area network transmission method and device - Google Patents

A kind of wireless body area network transmission method and device Download PDF

Info

Publication number
CN107148029A
CN107148029A CN201610115437.9A CN201610115437A CN107148029A CN 107148029 A CN107148029 A CN 107148029A CN 201610115437 A CN201610115437 A CN 201610115437A CN 107148029 A CN107148029 A CN 107148029A
Authority
CN
China
Prior art keywords
mrow
msub
node
iterative formula
msubsup
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201610115437.9A
Other languages
Chinese (zh)
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.)
Institute of Microelectronics of CAS
Original Assignee
Institute of Microelectronics of CAS
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 Institute of Microelectronics of CAS filed Critical Institute of Microelectronics of CAS
Priority to CN201610115437.9A priority Critical patent/CN107148029A/en
Publication of CN107148029A publication Critical patent/CN107148029A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/02Arrangements for optimising operational condition
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Medicinal Preparation (AREA)

Abstract

This application provides a kind of wireless body area network transmission method and device, wireless body area network transmission method includes:Obtain Preset Transfer layer iterative formula, default media access control MAC layer iterative formula and predetermined physical layer iterative formula;Respectively using Preset Transfer layer iterative formula, the default MAC layer iterative formula and predetermined physical layer iterative formula, the transport layer rate of convergence value of current ink sending node is calculated respectively, MAC layer restrains access probability value and physical layer convergence sending power consumption value, the Preset Transfer layer iterative formula, default media access control MAC layer iterative formula and predetermined physical layer iterative formula maximize object function and the default generation of the maximization bound for objective function by default, the maximization object function includes two variables of network life and network utility, for calculating network effectiveness and the maximum of network life sum.Therefore, the application has reached the purpose that network utility gets both with network life.

Description

A kind of wireless body area network transmission method and device
Technical field
The application is related to wireless body area network technical field, more particularly to a kind of wireless body area network transmission method and device.
Background technology
Wireless body area network technology is using being arranged in body or the terminal node (i.e. link sending node) of body surface is gathered Biological information of human body, biological information of human body is through being wirelessly transmitted to destination node, and destination node, which is responsible for setting up with public network, to communicate, by people Body biological information is transmitted to public network, so as to realize the intelligent medical application such as tele-medicine and health monitoring.
At present, in the transmission plan in wireless body area network technology, due at the beginning of wireless body area network link sending node Beginning energy is certain, therefore in the network life of any one link sending node in extending wireless body area network, in the unit interval Consumed energy tails off, and causes network utility to reduce, and improve wireless body area network in any one link sending node speed When improving the network utility of wireless body area network any one link sending node, the energy of consumption is carried in the unit interval Height, causes network life to shorten.But, any one current transmission plan can not make link sending node network life and Network utility sum reaches that maximum reaches the purpose that both network life and network utility get both.
Therefore, the transmission plan presence in current wireless body area network technology can not reach the network of link sending node The problem of purpose that life-span and network utility get both.
The content of the invention
In order to solve the above technical problems, the embodiment of the present application provides a kind of wireless body area network method and device for transmitting, to reach The purpose that network utility gets both with network life, technical scheme is as follows:
A kind of wireless body area network transmission method, including:
Obtain Preset Transfer layer iterative formula, default media access control MAC layer iterative formula and predetermined physical stacking generation Formula;
Respectively using Preset Transfer layer iterative formula, the default MAC layer iterative formula and predetermined physical layer Iterative formula, calculates the transport layer rate of convergence value, MAC layer convergence access probability value and thing of current ink sending node respectively Layer convergence sending power consumption value is managed, so that the current ink node uses the transport layer rate of convergence value, MAC layer convergence access Probable value and physical layer convergence sending power consumption value, carry out data transmission;
The Preset Transfer layer iterative formula, default media access control MAC layer iterative formula and predetermined physical stacking generation The default generating process of formula, including:
Obtain default maximization object function and the maximization bound for objective function, the maximization target letter Number includes two variables of network life and network utility, for calculating network effectiveness and the maximum of network life sum;
The maximization object function and the maximization bound for objective function are derived, calculated default Transport layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula.
It is preferred that, the maximization object function is:MaximizeThe γ joins for system Number, and less than 1, the Us(xs) it is network utility function, the TnetIt is described for network lifeFor summing function, the s For the link sending node on link (i, j), the i in the link (i, j) is link sending node, and j is destination node;
The constraints includes:xs≤cij(e)·τijWith
The xsFor the transmission rate of any one link sending node on link (i, j), the cij(e) for link (i, J) link capability, the link (i, j) jumps connecting link, the τ for the one of link sending node i to destination node jijFor chain The probability of road (i, j) Successful transmissions, it is describedFor link sending node i transmission per unit of time average power consumptions, the E0Sent out for link Send the primary power of node i, the ti=1/Ti, the TiFor in link (i, j) during the existence of service priority highest node Between, the min TiEqual to Tnet, the PiSuccessful probability, the P are competed for the access link of node ikChain is accessed for node k Road competes successful probability, Ninterference(ij) it is the set of the point interfered in link (i, j) transmitting procedure, Π is company Multiplication, the T is symbol period, and e is the vector form that link (i, j) transmits power consumption, constant K=(- φ1/log(φ2BER)), wherein φ1And φ2Related with modulation system, BER is the bit error rate, and link l signal to noise ratio is defined asWherein, eijFor transmission power consumption scalar form, GkiFor path loss, nijFor noise, GijFor the path gain on link l, if sending information simultaneously in the absence of excessive neighbor node, KSIR is much larger than 1, in high noise Than in region, cijIt is approximately equal to log (KSIRij(e)), the l represents link (i, j).
It is preferred that, the maximization object function and the maximization bound for objective function are derived, counted The process of Preset Transfer layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula is calculated, including:
By introducing congestion factor and Energy consumption factor, using Lagrange duality method to it is described maximization object function and The maximization bound for objective function is solved, and generates Lagrangian;
Orthogonal decomposition is carried out to the Lagrangian, decomposition obtains three sub- prioritization schemes and arrives correspondence transmission respectively Layer, MAC layer and physical layer;
The optimal value of every sub- prioritization scheme is solved using gradient method, Preset Transfer layer iterative formula is respectively obtained, presets MAC layer iterative formula and predetermined physical layer iterative formula.
It is preferred that, using Preset Transfer layer iterative formula, calculate the transport layer convergence of current ink sending node The process of rate value, including:
Use Preset Transfer layer iterative formulaCalculate current The transmission rate value of link sending node, until the x's(t+1) restrain;
By the x's(t+1) corresponding rate value is restrained as the rate of convergence value of current ink sending node;
Wherein, the x's(t+1) corresponding rate value is transmission rate of the current ink sending node at (t+1) moment, The x's(t) corresponding rate value is current ink sending node in the transmission rate of t, the κ3(t) when being t iteration Positive step-length;Represent span asx′s=log xs, τ 'ij=log τij, The λlFor congestion factor, the λlCurrency beThe μl(t) according to formulaCalculating is obtained, the μlFor energy factors, wherein, κ1, κ2For Positive step-length during t iteration, []+It is arithmetic number to represent domain value range, to ensure the factor (λ, μ) non-negative.
It is preferred that, using the default MAC layer iterative formula, calculate the MAC convergence accesses of current ink sending node The process of probable value, including:Use the default MAC layer iterative formulaCalculate current ink The access link of sending node competes successful probability, until the PiConvergence;
By the PiCorresponding access link competes successful probability as the convergence of current ink sending node during convergence Access probability value;
It is describedLinterference(l) interfered with link l transmission Link, ωiFor priority factors, wherein ωiMeet
It is preferred that, using predetermined physical layer iterative formula, calculate the physical layer convergence of current ink sending node The process of sending power consumption value, including:
Use predetermined physical layer iterative formula The physical layer sending power consumption value of current ink sending node is calculated, until the ei(t+1) restrain;
By the ei(t+1) corresponding sending power consumption value is sent out as the physical layer convergence of current ink sending node when restraining Send power consumption number;
Wherein, the ei(t+1) for node i in the node physical layer sending power consumption at (t+1) moment, the ei(t) it is node I is in the node physical layer sending power consumption of t, κ4(t) the positive step-length for being for t iteration,Represent span asN is the transmission delivery number of times obtained by node is calculated with mean power,The Shighest_UPFor The set of service priority highest node;
It is describedFor calculating current ink When sending node is service priority highest node, the physical layer sending power consumption value of current ink sending node;
It is describedFor calculating in current ink sending node During non-traffic highest priority node, the physical layer sending power consumption value of current ink sending node.
A kind of wireless body area network transmitting device, including:
First acquisition unit, for obtaining Preset Transfer layer iterative formula, default media access control MAC layer iterative formula And predetermined physical layer iterative formula;
First computing unit, for using Preset Transfer layer iterative formula, the default MAC layer iterative formula respectively And the predetermined physical layer iterative formula, the transport layer rate of convergence value of current ink sending node, MAC layer are calculated respectively to be received Access probability value and physical layer convergence sending power consumption value are held back, so that the current ink node uses the transport layer rate of convergence Value, MAC layer convergence access probability value and physical layer convergence sending power consumption value, carry out data transmission;
Presetting module, for the default generation Preset Transfer layer iterative formula, default media access control MAC layer iteration Formula and predetermined physical layer iterative formula;
The presetting module includes:Second acquisition unit, for obtaining default maximization object function and the maximization Bound for objective function, the maximization object function includes two variables of network life and network utility, based on Calculate network utility and the maximum of network life sum;
Second computing unit, for entering to the maximization object function and the maximization bound for objective function Row is derived, and calculates Preset Transfer layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula.
It is preferred that, the second computing unit includes:
First solves unit, for by introducing congestion factor and Energy consumption factor, using Lagrange duality method to institute State maximization object function and the maximization bound for objective function is solved, generate Lagrangian;
Resolving cell, for carrying out orthogonal decomposition to the Lagrangian, decomposition obtains three sub- prioritization schemes point It is clipped to correspondence transport layer, MAC layer and physical layer;
Second solves unit, the optimal value for solving each word prioritization scheme using gradient method, respectively obtains default biography Defeated layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula.
It is preferred that, first computing unit includes:
3rd computing unit, for using Preset Transfer layer iterative formulaThe transmission rate value of current ink sending node is calculated, until the x's (t+1) restrain;
First determining unit, for by the x's(t+1) restrain corresponding rate value and be used as current ink sending node Rate of convergence value;
Wherein, the x's(t+1) corresponding speed is transmission rate of the current ink sending node at (t+1) moment, described x's(t) corresponding speed is current ink sending node in the transmission rate of t, the κ3(t) forward direction when for t iteration Step-length;Represent span asx′s=log xs, τ 'ij=log τij,The λl For congestion factor, the λlCurrency be The μl(t) according to formulaCalculating is obtained, the μlFor energy The factor, wherein, κ1, κ2Positive step-length during for the t times iteration, []+It is arithmetic number to represent domain value range, with ensure the factor (λ, μ) non-negative.
It is preferred that, first computing unit includes:
4th computing unit, for using the default MAC layer iterative formulaCalculate and work as The access link of preceding link sending node competes successful probability, until the PiConvergence;
Second determining unit, for by the PiCorresponding access link competes successful probability and is used as current chain during convergence The convergence access probability value of road sending node;
It is describedLinterference(l) interfered with link l transmission Link, ωiFor priority factors, wherein ωiMeet
It is preferred that, first computing unit includes:
5th computing unit, for using predetermined physical layer iterative formulaCurrent ink is calculated to send The physical layer sending power consumption value of node, until the ei(t+1) restrain;
3rd determining unit, for by the ei(t+1) corresponding sending power consumption value is sent as current ink when restraining The physical layer convergence sending power consumption value of node;
Wherein, the ei(t+1) for node i in the node physical layer sending power consumption at (t+1) moment, the ei(t) it is node I is in the node physical layer sending power consumption of t, κ4(t) the positive step-length for being for t iteration,Represent span asN is the transmission delivery number of times obtained by node is calculated with mean power,
Compared with prior art, the application has the beneficial effect that:
In this application, due to Preset Transfer layer iterative formula, default media access control MAC layer iterative formula and default Physical layer iterative formula is by calculating maximizing object function and maximizing after bound for objective function is derived Going out, and maximize object function includes two variables of network life and network utility, and maximizing object function is used to calculate Network utility and the maximum of network life sum can calculate network utility and network longevity by maximizing object function The maximum of sum is ordered, therefore current ink sending node is by using Preset Transfer layer iterative formula, default media interviews control Transport layer rate of convergence value, the MAC layer that MAC layer iterative formula processed and predetermined physical layer iterative formula are calculated restrain access probability Value and physical layer convergence sending power consumption value, carry out the transmission of data, can make the network utility and net of current ink sending node Network life-span sum reaches maximum, so as to reach the purpose that network utility gets both with network life.
Brief description of the drawings
In order to illustrate more clearly of the technical scheme in the embodiment of the present application, make required in being described below to embodiment Accompanying drawing is briefly described, it should be apparent that, drawings in the following description are only some embodiments of the present application, for For those of ordinary skill in the art, without having to pay creative labor, it can also be obtained according to these accompanying drawings His accompanying drawing.
Fig. 1 is a kind of a kind of flow chart for wireless body area network transmission method that the application is provided;
Fig. 2 is a kind of a kind of sub-process figure for wireless body area network transmission method that the application is provided;
Fig. 3 is a kind of another sub-process figure for wireless body area network transmission method that the application is provided;
Fig. 4 is a kind of another sub-process figure for wireless body area network transmission method that the application is provided;
Fig. 5 is a kind of another sub-process figure for wireless body area network transmission method that the application is provided;
Fig. 6 is a kind of a kind of structural representation for wireless body area network transmitting device that the application is provided;
Fig. 7 is a kind of a kind of structural representation for second computing unit that the application is provided.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present application, the technical scheme in the embodiment of the present application is carried out clear, complete Site preparation is described, it is clear that described embodiment is only some embodiments of the present application, rather than whole embodiments.It is based on Embodiment in the application, it is every other that those of ordinary skill in the art are obtained under the premise of creative work is not made Embodiment, belongs to the scope of the application protection.
One embodiment
Fig. 1 is referred to, a kind of a kind of flow chart of the wireless body area network transmission method provided it illustrates the application can be with Comprise the following steps:
Step S11:Obtain Preset Transfer layer iterative formula, default MAC (media access control, Media Access Control) layer iterative formula and predetermined physical layer iterative formula.
In the present embodiment, Preset Transfer layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula Generate in advance.
Wherein, the default life of Preset Transfer layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula Can be into process:
Step A11:Obtain default maximization object function and the maximization bound for objective function, the maximum Changing object function includes two variables of network life and network utility, for calculating network effectiveness and network life sum most Big value.
By maximizing object function, the network utility and network life sum of current ink sending node can be calculated Maximum.
Step A12:The maximization object function and the maximization bound for objective function are derived, counted Calculate Preset Transfer layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula.
Default generating process is carried out before the step S11 of the wireless body area network transmission method shown in Fig. 1 starts to perform , and only need to perform once default generating process.In the step for starting the wireless body area network transmission method shown in execution Fig. 1 During rapid S11, Preset Transfer layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula are directly obtained.
Step S12:Respectively using Preset Transfer layer iterative formula, the default MAC layer iterative formula and described pre- If physical layer iterative formula, transport layer rate of convergence value, the MAC layer convergence access that current ink sending node is calculated respectively are general Rate value and physical layer convergence sending power consumption value, so that the current ink node uses the transport layer rate of convergence value, MAC layer Access probability value and physical layer convergence sending power consumption value are restrained, is carried out data transmission.
Any one link in wireless body area network at least includes 1 link sending node, and wireless body area network is at least wrapped Include a link.
In the present embodiment, using Preset Transfer layer iterative formula, the transport layer for calculating current ink sending node is received Hold back rate value.Using default MAC layer iterative formula, the MAC layer convergence access probability value of current ink sending node is calculated.Make With predetermined physical layer iterative formula, the physical layer convergence sending power consumption value of current ink sending node is calculated.Work as calculating The preceding respective transport layer rate of convergence value of link sending node, MAC layer convergence access probability value and physical layer convergence sending power consumption After value, current ink sending node is sent using transport layer rate of convergence value, MAC layer convergence access probability value and physical layer convergence Power consumption number, carries out data transmission.
For any one link sending node in wireless body area network, step S11 and step S12 are applicable.Calculating Transport layer rate of convergence value, MAC layer convergence access probability value and the physical layer convergence of any one link sending node send work( During consumption value, the link sending node currently calculated is current ink sending node.
In this application, due to Preset Transfer layer iterative formula, default media access control MAC layer iterative formula and default Physical layer iterative formula is by calculating maximizing object function and maximizing after bound for objective function is derived Going out, and maximize object function includes two variables of network life and network utility, and maximizing object function is used to calculate Network utility and the maximum of network life sum can calculate network utility and network longevity by maximizing object function The maximum of sum is ordered, therefore current ink sending node is by using Preset Transfer layer iterative formula, default media interviews control Transport layer rate of convergence value, the MAC layer that MAC layer iterative formula processed and predetermined physical layer iterative formula are calculated restrain access probability Value and physical layer convergence sending power consumption value, carry out the transmission of data, can make the network utility and net of current ink sending node Network life-span sum reaches maximum, so as to reach the purpose that network utility gets both with network life.
Wherein, the wireless body area network transmission method shown in Fig. 1 is reaching the purpose that network utility gets both with network life Meanwhile, it equally ensure that the low-power consumption requirement of wireless body area network transmission.
The maximization object function in wireless body area network transmission method shown in Fig. 1 can be:Maximize
Wherein, the γ is systematic parameter, and less than 1, the Us(xs) it is network utility function, the TnetFor the network longevity Life, it is describedFor summing function, the s is that the i in the link sending node on link (i, j), the link (i, j) is transmission Node, j is destination node.
The constraints includes:xs≤cij(e)·τijWith
The xsFor the transmission rate of any one link sending node on link (i, j), the cij(e) for link (i, J) link capability, the link (i, j) jumps connecting link, the τ for the one of link sending node i to destination node jijFor chain The probability of road (i, j) Successful transmissions, it is describedFor link sending node i transmission per unit of time average power consumptions, the E0Sent out for link Send the primary power of node i, the ti=1/Ti, the TiFor in link (i, j) during the existence of service priority highest node Between, the minTiEqual to Tnet, the PiSuccessful probability, the P are competed for link sending node i access linkkFor link Sending node k access link competes successful probability, Ninterference(ij) it is to interfere in link (i, j) transmitting procedure The set of point, Π is even multiplication, and the T is symbol period, and e is the vector form that link (i, j) transmits power consumption, constant K= (-φ1/log(φ2BER)), wherein φ1And φ2Related with modulation system, BER is the bit error rate, and link l signal to noise ratio is defined asWherein, eijFor transmission power consumption scalar form, GkiFor path loss, nijFor noise, GijFor the path gain on link l, if sending information simultaneously in the absence of excessive neighbor node, KSIR is much larger than 1, in high noise Than in region, cijIt is approximately equal to log (KSIRij(e)), the l represents link (i, j).
In the present embodiment, data link can be represented by l, naturally it is also possible to be represented by link (i, j).
xs≤cij(e)·τijThe physical significance of sign is:The transmission rate of current ink sending node is necessarily no more than The maximum link ability of link (i, j).Wherein, maximum link ability is the maximum transmitted speed that current ink (i, j) can undertake Rate.
The physical significance of sign is:Current ink sending node is within life cycle, and the ability of consumption is necessarily not More than the primary power of current ink sending node.
Another embodiment
In the present embodiment, thus it is shown that to the maximization object function and the constraint bar of the maximization object function Part is derived, and calculates the mistake of Preset Transfer layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula Journey, refers to Fig. 2, and Fig. 2 is illustrated that a kind of a kind of sub-process figure for wireless body area network transmission method that the application is provided, can be with Comprise the following steps:
Step S21:By introducing congestion factor and Energy consumption factor, using Lagrange duality method to the maximization mesh Scalar functions and the maximization bound for objective function are solved, and generate Lagrangian.
Step S22:Orthogonal decomposition is carried out to the Lagrangian, decomposition obtains three sub- prioritization schemes and arrived respectively pair Answer transport layer, MAC layer and physical layer.
Step S23:The optimal value of every sub- prioritization scheme is solved using gradient method, Preset Transfer stacking generation is respectively obtained public Formula, default MAC layer iterative formula and predetermined physical layer iterative formula.
Based on shown in the wireless body area network transmission method and Fig. 2 shown in Fig. 1 to the maximization object function and described Maximize bound for objective function derived, calculate Preset Transfer layer iterative formula, preset MAC layer iterative formula and The process of predetermined physical layer iterative formula, the transport layer iterative formula calculated is:Wherein, the x's(t+1) corresponding rate value sends for current ink Transmission rate of the node at (t+1) moment, the x's(t) corresponding rate value is biography of the current ink sending node in t Defeated speed, the κ3(t) positive step-length when for t iteration;Represent span asx's=logxs, τ′ij=log τij,The λlFor congestion factor, the λlCurrency beThe μl(t) according to formulaCalculating is obtained, the μlFor energy factors, wherein, κ1, κ2For Positive step-length during t iteration, []+It is arithmetic number to represent domain value range, to ensure work factor (λ, μ) non-negative.
Presetting MAC layer iterative formula isWherein,Linterference(l) it is to transmit the link interfered, ω with link liTo be excellent The first level factor, wherein ωiMeet
Predetermined physical layer iterative formula be: Wherein, the ei(t+1) the node physical layer for node i at (t+1) moment launches power consumption, the ei(t) for node i in t Node physical layer transmitting power consumption, κ4(t) the positive step-length for being for t iteration,Represent span asN is Node with mean power calculate obtained by transmission deliver number of times,The Shighest_UPFor service priority most The set of high node, it is describedWork as calculating When preceding link sending node is service priority highest node, the physical layer sending power consumption value of current ink sending node;It is describedFor calculating in current ink sending node non-traffic priority During highest node, the physical layer sending power consumption value of current ink sending node.
Due to Preset Transfer layer iterative formula, the default MAC layer iterative formula and predetermined physical layer iterative formula Each carry out calculating each self-corresponding transport layer rate of convergence value, MAC layer convergence access probability value and physical layer convergence transmission work( Consumption value, therefore calculate the scheme of transport layer rate of convergence value, MAC layer convergence access probability value and physical layer convergence sending power consumption value For distributed computing approach, transport layer, MAC layer and physical layer are independent of each other in calculating process.
Further embodiment
In the present embodiment, thus it is shown that using Preset Transfer layer iterative formula, calculate current ink and send section The process of the transport layer rate of convergence value of point, refers to Fig. 3, and Fig. 3 is illustrated that a kind of wireless body area network that the application is provided is passed Another sub-process figure of transmission method, may comprise steps of:
Step S31:Use Preset Transfer layer iterative formula The transmission rate value of current ink sending node is calculated, until the x's(t+1) restrain.
Step S32:By the x's(t+1) the corresponding rate value of corresponding speed convergence is used as current ink sending node Rate of convergence value.
Further embodiment
In the present embodiment, thus it is shown that use the default MAC layer iterative formula, calculate current ink sending node MAC restrain the process of access probability value, refer to Fig. 4, Fig. 4 is illustrated that a kind of wireless body area network transmission that the application is provided Another sub-process figure of method, may comprise steps of:
Step S41:Use the default MAC layer iterative formulaCalculate current ink hair The access link of node is sent to compete successful probability, until the PiConvergence.
In the present embodiment, current ink sending node i is according to its congestion cost λlWith energy cost μl, calculate with it is above-mentioned Link interferes the λ of linkkAnd μk, and then calculate ki
Calculate kiAfterwards, the access link for calculating current ink sending node competes successful probability Pi, until PiConvergence.
Step S42:By the PiCorresponding access link competes successful probability as current ink and sends section during convergence The convergence access probability value of point.
Further embodiment
In the present embodiment, thus it is shown that using predetermined physical layer iterative formula, calculate current ink and send section The process of the physical layer convergence sending power consumption value of point, refers to Fig. 5, and Fig. 5 is illustrated that a kind of wireless body area that the application is provided Another sub-process figure of net transmission method, may comprise steps of:
Step S51:Use predetermined physical layer iterative formulaCurrent ink is calculated to send The physical layer sending power consumption value of node, until the ei(t+1) restrain.
In the present embodiment, first according to the congestion factor of current ink sending node, signal to noise ratio, last iteration energy Numerical quantity and link transmission gain, calculate mj(t)。
M is calculated againj(t) after, formula is substituted intoTo ei(t+1) counted Calculate, until ei(t+1) restrain.
Step S52:By the ei(t+1) restrain when corresponding sending power consumption value as current ink sending node physics Layer convergence sending power consumption value.
For foregoing each method embodiment, in order to be briefly described, therefore it is all expressed as to a series of combination of actions, but It is that those skilled in the art should know, the application is not limited by described sequence of movement, because according to the application, certain A little steps can be carried out sequentially or simultaneously using other.Secondly, those skilled in the art should also know, be retouched in specification The embodiment stated belongs to preferred embodiment, necessary to involved action and module not necessarily the application.
It is corresponding with above method embodiment, this application provides a kind of wireless body area network transmitting device, Fig. 6 is referred to, Fig. 6 is illustrated that a kind of a kind of structural representation for wireless body area network transmitting device that the application is provided, wireless body area network transmission Device includes:First acquisition unit 61, the first computing unit 62 and presetting module 63.
First acquisition unit 61, it is public for obtaining Preset Transfer layer iterative formula, default media access control MAC layer iteration Formula and predetermined physical layer iterative formula.
First computing unit 62, for using Preset Transfer layer iterative formula, the default MAC layer iteration public respectively Formula and predetermined physical layer iterative formula, calculate transport layer rate of convergence value, the MAC layer of current ink sending node respectively Access probability value and physical layer convergence sending power consumption value are restrained, so that the current ink node restrains speed using the transport layer Rate value, MAC layer convergence access probability value and physical layer convergence sending power consumption value, carry out data transmission.
Presetting module 63, changes for the default generation Preset Transfer layer iterative formula, default media access control MAC layer For formula and predetermined physical layer iterative formula.
Wherein, presetting module 63 includes:The computing unit 632 of second acquisition unit 631 and second.
Second acquisition unit 631, for obtaining the default constraint for maximizing object function and the maximization object function Condition, the maximization object function includes two variables of network life and network utility, for calculating network effectiveness and net The maximum of network life-span sum.
Second computing unit 632, for the constraint bar to the maximization object function and the maximization object function Part is derived, and calculates Preset Transfer layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula.
The concrete structure of second computing unit 632 may refer to Fig. 7, and Fig. 7 is illustrated that one kind second that the application is provided A kind of structural representation of computing unit, the second computing unit includes:First, which solves unit 71, resolving cell 72 and second, solves Unit 73.
First solves unit 71, for by introducing congestion factor and Energy consumption factor, using Lagrange duality method pair The maximization object function and the maximization bound for objective function are solved, and generate Lagrangian.
Resolving cell 72, for carrying out orthogonal decomposition to the Lagrangian, decomposition obtains three sub- prioritization schemes Correspondence transport layer, MAC layer and physical layer are arrived respectively.
Second solves unit 73, the optimal value for solving each word prioritization scheme using gradient method, respectively obtains default Transport layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula.
In said apparatus embodiment, the first computing unit 62 includes:3rd computing unit, the first determining unit, the 4th Computing unit, the second determining unit, the 5th computing unit and the 3rd determining unit.
Wherein, the 3rd computing unit and the first determining unit cooperation, for calculating current ink sending node Transport layer rate of convergence value.
3rd computing unit, for using Preset Transfer layer iterative formulaThe transmission rate value of current ink sending node is calculated, until the x's (t+1) restrain.
First determining unit, for by the x's(t+1) restrain corresponding rate value and be used as current ink sending node Rate of convergence value.
Wherein, the x's(t+1) it is transmission rate of the current ink sending node at (t+1) moment, the x's(t) it is Current ink sending node is in the transmission rate of t, the κ3(t) positive step-length when for t iteration;Represent value Scope isx's=logxs, τ 'ij=log τij,The λlFor congestion factor, the λl's Currency isThe μl(t) according to formulaCalculating is obtained, the μlFor energy factors, wherein, κ1, κ2For Positive step-length during t iteration, []+It is arithmetic number to represent domain value range, to ensure work factor (λ, μ) non-negative.
4th computing unit and the second determining unit cooperation, the MAC for calculating current ink sending node are received Hold back access probability value.
4th computing unit, for using the default MAC layer iterative formulaCalculate and work as The access link of preceding link sending node competes successful probability, until the PiConvergence.
Second determining unit, for by the PiCorresponding access link competes successful probability and is used as current chain during convergence The convergence access probability value of road sending node.
It is describedLinterference(l) interfered with link l transmission Link, ωiFor priority factors, wherein ωiMeet
5th computing unit and the 3rd determining unit cooperation, the physical layer for calculating current ink sending node Restrain sending power consumption value.
5th computing unit, for using predetermined physical layer iterative formulaCurrent ink is calculated to send The physical layer sending power consumption value of node, until the ei(t+1) restrain.
3rd determining unit, for by the ei(t+1) corresponding sending power consumption value is sent as current ink when restraining The physical layer convergence sending power consumption value of node.
Wherein, the ei(t+1) for node i in the node physical layer sending power consumption at (t+1) moment, the ei(t) it is node I is in the node physical layer sending power consumption of t, κ4(t) the positive step-length for being for t iteration,Represent span asN is the transmission delivery number of times obtained by node is calculated with mean power,The Shighest_UPFor The set of service priority highest node.
It is describedFor calculating current ink When sending node is service priority highest node, the physical layer sending power consumption value of current ink sending node;
It is describedFor calculating in current ink sending node During non-traffic highest priority node, the physical layer sending power consumption value of current ink sending node.
It should be noted that each embodiment in this specification is described by the way of progressive, each embodiment weight Point explanation be all between difference with other embodiment, each embodiment identical similar part mutually referring to. For device class embodiment, because it is substantially similar to embodiment of the method, so description is fairly simple, related part is joined See the part explanation of embodiment of the method.
Finally, in addition it is also necessary to explanation, herein, such as first and second or the like relational terms be used merely to by One entity or operation make a distinction with another entity or operation, and not necessarily require or imply these entities or operation Between there is any this actual relation or order.Moreover, term " comprising ", "comprising" or its any other variant meaning Covering including for nonexcludability, so that process, method, article or equipment including a series of key elements not only include that A little key elements, but also other key elements including being not expressly set out, or also include be this process, method, article or The intrinsic key element of equipment.In the absence of more restrictions, the key element limited by sentence "including a ...", is not arranged Except also there is other identical element in the process including the key element, method, article or equipment.
For convenience of description, it is divided into various units during description apparatus above with function to describe respectively.Certainly, this is being implemented The function of each unit can be realized in same or multiple softwares and/or hardware during application.
As seen through the above description of the embodiments, those skilled in the art can be understood that the application can Realized by the mode of software plus required general hardware platform.Understood based on such, the technical scheme essence of the application On the part that is contributed in other words to prior art can be embodied in the form of software product, the computer software product It can be stored in storage medium, such as ROM/RAM, magnetic disc, CD, including some instructions are to cause a computer equipment (can be personal computer, server, or network equipment etc.) performs some of each embodiment of the application or embodiment Method described in part.
A kind of wireless body area network transmission method provided herein and device are described in detail above, herein Apply specific case to be set forth the principle and embodiment of the application, the explanation of above example is only intended to help Understand the present processes and its core concept;Simultaneously for those of ordinary skill in the art, according to the thought of the application, It will change in specific embodiments and applications, in summary, this specification content should not be construed as to this The limitation of application.

Claims (11)

1. a kind of wireless body area network transmission method, it is characterised in that including:
Obtain Preset Transfer layer iterative formula, default media access control MAC layer iterative formula and predetermined physical layer iterative formula;
Respectively using Preset Transfer layer iterative formula, the default MAC layer iterative formula and the predetermined physical stacking generation Formula, calculates the transport layer rate of convergence value, MAC layer convergence access probability value and physical layer of current ink sending node respectively Sending power consumption value is restrained, so that the current ink node uses the transport layer rate of convergence value, MAC layer convergence access probability Value and physical layer convergence sending power consumption value, carry out data transmission;
The Preset Transfer layer iterative formula, default media access control MAC layer iterative formula and predetermined physical layer iterative formula Default generating process, including:
Obtain default maximize in object function and the maximization bound for objective function, the maximization object function Including two variables of network life and network utility, for calculating network effectiveness and the maximum of network life sum;
The maximization object function and the maximization bound for objective function are derived, Preset Transfer is calculated Layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula.
2. according to the method described in claim 1, it is characterised in that the maximization object function is:The γ is systematic parameter, and less than 1, the Us(xs) it is network utility letter Number, the TnetIt is described for network lifeFor summing function, the s is the link sending node on link (i, j), the chain I in road (i, j) is link sending node, and j is destination node;
The constraints includes:Xs≤cij (e) τ ij and <mrow> <msub> <mi>c</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>e</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mn>1</mn> <mi>T</mi> </mfrac> <mi>l</mi> <mi>o</mi> <mi>g</mi> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <msub> <mi>KSIR</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>(</mo> <mi>e</mi> <mo>)</mo> <mo>)</mo> </mrow> <mo>,</mo> <mo>&amp;ForAll;</mo> <mi>l</mi> <mo>;</mo> </mrow>
The xsFor the transmission rate of any one link sending node on link (i, j), the cij(e) it is link (i, j) Link capability, the link (i, j) jumps connecting link, the τ for the one of link sending node i to destination node jijFor link The probability of (i, j) Successful transmissions, it is describedFor link sending node i transmission per unit of time average power consumptions, the E0Sent for link The primary power of node i, the ti=1/Ti, the TiFor the life span of service priority highest node in link (i, j), The min TiEqual to Tnet, the PiSuccessful probability, the P are competed for the access link of node ikFor node k access link Compete successful probability, Ninterference(ij) it is the set of the point interfered in link (i, j) transmitting procedure, Π multiplies to connect Computing, the T is symbol period, and e is the vector form that link (i, j) transmits power consumption, constant K=(- φ1/log(φ2BER)), Wherein φ1And φ2Related with modulation system, BER is the bit error rate, and link l signal to noise ratio is defined asWherein, eijFor transmission power consumption scalar form, GkiFor path loss, nijFor noise, GijFor the path gain on link l, if sending information simultaneously in the absence of excessive neighbor node, KSIR is much larger than 1, in high noise Than in region, cijIt is approximately equal to log (KSIRij(e)), the l represents link (i, j).
3. method according to claim 2, it is characterised in that to the maximization object function and the maximization target The constraints of function is derived, and calculates Preset Transfer layer iterative formula, default MAC layer iterative formula and predetermined physical layer The process of iterative formula, including:
By introducing congestion factor and Energy consumption factor, object function is maximized and described to described using Lagrange duality method Maximize bound for objective function to be solved, generate Lagrangian;
Orthogonal decomposition is carried out to the Lagrangian, decomposition obtains three sub- prioritization schemes and arrives correspondence transport layer, MAC respectively Layer and physical layer;
The optimal value of every sub- prioritization scheme is solved using gradient method, Preset Transfer layer iterative formula, default MAC layer is respectively obtained Iterative formula and predetermined physical layer iterative formula.
4. the method according to claim 1-3 any one, it is characterised in that public using Preset Transfer stacking generation Formula, calculates the process of the transport layer rate of convergence value of current ink sending node, including:
Use Preset Transfer layer iterative formulaCalculate current ink The transmission rate value of sending node, until the x's(t+1) restrain;
By the x's(t+1) corresponding rate value is restrained as the rate of convergence value of current ink sending node;
Wherein, the corresponding rate value of the x's (t+1) is transmission rate of the current ink sending node at (t+1) moment, the x's (t) corresponding rate value is transmission rate of the current ink sending node in t, the positive step when κ 3 (t) is t iteration It is long;Represent span is as x ' s=log xs, τ ' ij=log τ ij, the λ l Congestion factor, the currency of the λ l is The μ l (t) are according to formula <mrow> <msub> <mi>&amp;mu;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>=</mo> <msup> <mrow> <mo>&amp;lsqb;</mo> <msub> <mi>&amp;mu;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>&amp;kappa;</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>&amp;CenterDot;</mo> <mrow> <mo>(</mo> <mi>log</mi> <mi> </mi> <msub> <mi>E</mi> <mn>0</mn> </msub> <msub> <mi>t</mi> <mi>i</mi> </msub> <mo>-</mo> <mi>l</mi> <mi>o</mi> <mi>g</mi> <mover> <msub> <mi>e</mi> <mi>i</mi> </msub> <mo>&amp;OverBar;</mo> </mover> <mo>-</mo> <msubsup> <mi>&amp;tau;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mrow> <mo>&amp;prime;</mo> <mrow> <mo>(</mo> <msub> <mi>&amp;lambda;</mi> <mi>l</mi> </msub> <mo>(</mo> <mi>t</mi> <mo>)</mo> <mo>,</mo> <msub> <mi>&amp;mu;</mi> <mi>l</mi> </msub> <mo>(</mo> <mi>t</mi> <mo>)</mo> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mo>&amp;rsqb;</mo> </mrow> <mo>+</mo> </msup> </mrow> Calculating is obtained, and the μ l are energy The factor, wherein, κ 1, positive step-length when κ 2 is the t times iteration, []+represent domain value range is arithmetic number, with ensure the factor (λ, μ) non-negative.
5. the method according to claim 1-3 any one, it is characterised in that use the default MAC layer iterative formula, The MAC for calculating current ink sending node restrains the process of access probability value, including:It is public using the default MAC layer iteration FormulaThe access link for calculating current ink sending node competes successful probability, until described PiConvergence;
By the PiCorresponding access link competes successful probability and accessed generally as the convergence of current ink sending node during convergence Rate value;
It is describedLinterference(l) it is to transmit the link interfered with link l, ωiFor priority factors, wherein ωiMeet
6. the method according to claim 1-3 any one, it is characterised in that public using predetermined physical stacking generation Formula, calculates the process of the physical layer convergence sending power consumption value of current ink sending node, including:
Use predetermined physical layer iterative formula <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mrow> <mi>t</mi> <mo>+</mo> <mn>1</mn> </mrow> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <msubsup> <mrow> <mo>{</mo> <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>&amp;kappa;</mi> <mn>4</mn> </msub> <mrow> <mo>&amp;lsqb;</mo> <mrow> <mfrac> <mrow> <msub> <mi>&amp;lambda;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>-</mo> <munder> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>k</mi> </mrow> </munder> <msub> <mi>G</mi> <mrow> <mi>k</mi> <mi>j</mi> </mrow> </msub> <msub> <mi>m</mi> <mi>j</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <munder> <mi>&amp;Sigma;</mi> <mi>l</mi> </munder> <msub> <mi>&amp;mu;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mi>log</mi> <mi> </mi> <mi>n</mi> <mo>-</mo> <mfrac> <mrow> <mrow> <mo>(</mo> <mrow> <mn>1</mn> <mo>-</mo> <mi>&amp;gamma;</mi> </mrow> <mo>)</mo> </mrow> <msup> <mi>e</mi> <msubsup> <mi>&amp;tau;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mo>&amp;prime;</mo> </msubsup> </msup> </mrow> <msub> <mi>E</mi> <mn>0</mn> </msub> </mfrac> </mrow> <mo>&amp;rsqb;</mo> </mrow> </mrow> <mo>}</mo> </mrow> <msubsup> <mi>e</mi> <mi>i</mi> <mi>min</mi> </msubsup> <msubsup> <mi>e</mi> <mi>i</mi> <mi>max</mi> </msubsup> </msubsup> <mo>,</mo> <mi>i</mi> <mo>&amp;Element;</mo> <msub> <mi>S</mi> <mrow> <mi>h</mi> <mi>i</mi> <mi>g</mi> <mi>h</mi> <mi>e</mi> <mi>s</mi> <mi>t</mi> <mo>_</mo> <mi>U</mi> <mi>P</mi> </mrow> </msub> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msubsup> <mrow> <mo>{</mo> <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>&amp;kappa;</mi> <mn>4</mn> </msub> <mrow> <mo>&amp;lsqb;</mo> <mrow> <mfrac> <mrow> <msub> <mi>&amp;lambda;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>-</mo> <munder> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>k</mi> </mrow> </munder> <msub> <mi>G</mi> <mrow> <mi>k</mi> <mi>j</mi> </mrow> </msub> <msub> <mi>m</mi> <mi>j</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mo>&amp;rsqb;</mo> </mrow> </mrow> <mo>}</mo> </mrow> <msubsup> <mi>e</mi> <mi>i</mi> <mi>min</mi> </msubsup> <msubsup> <mi>e</mi> <mi>i</mi> <mi>max</mi> </msubsup> </msubsup> <mo>,</mo> <mi>i</mi> <mo>&amp;NotElement;</mo> <msub> <mi>S</mi> <mrow> <mi>h</mi> <mi>i</mi> <mi>g</mi> <mi>h</mi> <mi>e</mi> <mi>s</mi> <mi>t</mi> <mo>_</mo> <mi>U</mi> <mi>P</mi> </mrow> </msub> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> </mrow> The physical layer sending power consumption value of current ink sending node is calculated, until the ei (t+1) convergences; 2
By the ei(t+1) corresponding sending power consumption value sends work(as the physical layer convergence of current ink sending node when restraining Consumption value;
Wherein, the ei(t+1) for node i in the node physical layer sending power consumption at (t+1) moment, the ei(t) for node i in t The node physical layer sending power consumption at moment, κ4(t) the positive step-length for being for t iteration,Represent span asN is the transmission delivery number of times obtained by node is calculated with mean power,The Shighest_UPFor The set of service priority highest node;
It is described <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>=</mo> <msubsup> <mrow> <mo>{</mo> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>&amp;kappa;</mi> <mn>4</mn> </msub> <mo>&amp;lsqb;</mo> <mfrac> <mrow> <msub> <mi>&amp;lambda;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>-</mo> <munder> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>k</mi> </mrow> </munder> <msub> <mi>G</mi> <mrow> <mi>k</mi> <mi>j</mi> </mrow> </msub> <msub> <mi>m</mi> <mi>j</mi> </msub> <mo>(</mo> <mi>t</mi> <mo>)</mo> <mo>+</mo> <munder> <mi>&amp;Sigma;</mi> <mi>l</mi> </munder> <msub> <mi>&amp;mu;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mi>log</mi> <mi> </mi> <mi>n</mi> <mo>-</mo> <mfrac> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>&amp;gamma;</mi> <mo>)</mo> <msup> <mi>e</mi> <msubsup> <mi>&amp;tau;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mo>&amp;prime;</mo> </msubsup> </msup> </mrow> <msub> <mi>E</mi> <mn>0</mn> </msub> </mfrac> <mo>&amp;rsqb;</mo> <mo>}</mo> </mrow> <msubsup> <mi>e</mi> <mi>i</mi> <mi>min</mi> </msubsup> <msubsup> <mi>e</mi> <mi>i</mi> <mi>max</mi> </msubsup> </msubsup> </mrow> Sent for calculating current ink When node is service priority highest node, the physical layer sending power consumption value of current ink sending node;
It is described <mrow> <msubsup> <mrow> <mo>{</mo> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>k</mi> <mn>4</mn> </msub> <mo>&amp;lsqb;</mo> <mfrac> <mrow> <msub> <mi>&amp;lambda;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>-</mo> <munder> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>k</mi> </mrow> </munder> <msub> <mi>G</mi> <mrow> <mi>k</mi> <mi>j</mi> </mrow> </msub> <msub> <mi>m</mi> <mi>j</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>&amp;rsqb;</mo> <mo>}</mo> </mrow> <msubsup> <mi>e</mi> <mi>i</mi> <mi>min</mi> </msubsup> <msubsup> <mi>e</mi> <mi>i</mi> <mi>max</mi> </msubsup> </msubsup> <mo>,</mo> <mi>i</mi> <mo>&amp;NotElement;</mo> <msub> <mi>S</mi> <mrow> <mi>h</mi> <mi>i</mi> <mi>g</mi> <mi>h</mi> <mi>e</mi> <mi>s</mi> <mi>t</mi> <mo>_</mo> <mi>U</mi> <mi>P</mi> </mrow> </msub> </mrow> For calculating in the non-industry of current ink sending node During business highest priority node, the physical layer sending power consumption value of current ink sending node.
7. a kind of wireless body area network transmitting device, it is characterised in that including:
First acquisition unit, for obtaining Preset Transfer layer iterative formula, presetting media access control MAC layer iterative formula and pre- If physical layer iterative formula;
First computing unit, for using Preset Transfer layer iterative formula, the default MAC layer iterative formula and institute respectively Predetermined physical layer iterative formula is stated, the transport layer rate of convergence value of current ink sending node, MAC layer convergence are calculated respectively and is connect Enter probable value and physical layer convergence sending power consumption value so that the current ink node using the transport layer rate of convergence value, MAC layer restrains access probability value and physical layer convergence sending power consumption value, carries out data transmission;
Presetting module, for the default generation Preset Transfer layer iterative formula, default media access control MAC layer iterative formula And predetermined physical layer iterative formula;
The presetting module includes:Second acquisition unit, for obtaining default maximization object function and the maximization target The constraints of function, the maximization object function includes two variables of network life and network utility, for calculating net The maximum of network effectiveness and network life sum;
Second computing unit, for being pushed away to the maximization object function and the maximization bound for objective function Lead, calculate Preset Transfer layer iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula.
8. device according to claim 7, it is characterised in that the second computing unit includes:
First solves unit, for by introducing congestion factor and Energy consumption factor, using Lagrange duality method to it is described most Bigization object function and the maximization bound for objective function are solved, and generate Lagrangian;
Resolving cell, for carrying out orthogonal decomposition to the Lagrangian, decomposition obtains three sub- prioritization schemes and arrived respectively Correspondence transport layer, MAC layer and physical layer;
Second solves unit, the optimal value for solving each word prioritization scheme using gradient method, respectively obtains Preset Transfer layer Iterative formula, default MAC layer iterative formula and predetermined physical layer iterative formula.
9. the device according to claim 7 or 8, it is characterised in that first computing unit includes:
3rd computing unit, for using Preset Transfer layer iterative formulaThe transmission rate value of current ink sending node is calculated, until the x's (t+1) restrain;
First determining unit, for by the x's(t+1) corresponding rate value is restrained as the convergence of current ink sending node Rate value;
Wherein, the corresponding speed of the x's (t+1) is transmission rate of the current ink sending node at (t+1) moment, the x's (t) corresponding speed is transmission rate of the current ink sending node in t, the positive step when κ 3 (t) is t iteration It is long;Represent span is as x ' s=log xs, τ ' ij=log τ ij, the λ l Congestion factor, the currency of the λ l is institute μ l (t) are stated according to formula <mrow> <msub> <mi>&amp;mu;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>=</mo> <msup> <mrow> <mo>&amp;lsqb;</mo> <msub> <mi>&amp;mu;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>&amp;kappa;</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>&amp;CenterDot;</mo> <mrow> <mo>(</mo> <mi>log</mi> <mi> </mi> <msub> <mi>E</mi> <mn>0</mn> </msub> <msub> <mi>t</mi> <mi>i</mi> </msub> <mo>-</mo> <mi>l</mi> <mi>o</mi> <mi>g</mi> <mover> <msub> <mi>e</mi> <mi>i</mi> </msub> <mo>&amp;OverBar;</mo> </mover> <mo>-</mo> <msubsup> <mi>&amp;tau;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mrow> <mo>&amp;prime;</mo> <mrow> <mo>(</mo> <msub> <mi>&amp;lambda;</mi> <mi>l</mi> </msub> <mo>(</mo> <mi>t</mi> <mo>)</mo> <mo>,</mo> <msub> <mi>&amp;mu;</mi> <mi>l</mi> </msub> <mo>(</mo> <mi>t</mi> <mo>)</mo> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mo>&amp;rsqb;</mo> </mrow> <mo>+</mo> </msup> </mrow> Calculating is obtained, the μ l be energy because Son, wherein, κ 1, positive step-length when κ 2 is the t times iteration, []+represent domain value range is arithmetic number, to ensure the factor (λ, μ) Non-negative.
10. the device according to claim 7 or 8, it is characterised in that first computing unit includes:
4th computing unit, for using the default MAC layer iterative formulaCalculate current chain The access link of road sending node competes successful probability, until the PiConvergence;
Second determining unit, for by the PiCorresponding access link competes successful probability and sent out as current ink during convergence Send the convergence access probability value of node;
It is describedLinterference(l) it is to transmit the link interfered with link l, ωiFor priority factors, wherein ωiMeet
11. the device according to claim 7 or 8, it is characterised in that first computing unit includes:
5th computing unit, for using predetermined physical layer iterative formula <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mrow> <mi>t</mi> <mo>+</mo> <mn>1</mn> </mrow> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <msubsup> <mrow> <mo>{</mo> <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>&amp;kappa;</mi> <mn>4</mn> </msub> <mrow> <mo>&amp;lsqb;</mo> <mrow> <mfrac> <mrow> <msub> <mi>&amp;lambda;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>-</mo> <munder> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>k</mi> </mrow> </munder> <msub> <mi>G</mi> <mrow> <mi>k</mi> <mi>j</mi> </mrow> </msub> <msub> <mi>m</mi> <mi>j</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <munder> <mi>&amp;Sigma;</mi> <mi>l</mi> </munder> <msub> <mi>&amp;mu;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mi>log</mi> <mi> </mi> <mi>n</mi> <mo>-</mo> <mfrac> <mrow> <mrow> <mo>(</mo> <mrow> <mn>1</mn> <mo>-</mo> <mi>&amp;gamma;</mi> </mrow> <mo>)</mo> </mrow> <msup> <mi>e</mi> <msubsup> <mi>&amp;tau;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mo>&amp;prime;</mo> </msubsup> </msup> </mrow> <msub> <mi>E</mi> <mn>0</mn> </msub> </mfrac> </mrow> <mo>&amp;rsqb;</mo> </mrow> </mrow> <mo>}</mo> </mrow> <msubsup> <mi>e</mi> <mi>i</mi> <mi>min</mi> </msubsup> <msubsup> <mi>e</mi> <mi>i</mi> <mi>max</mi> </msubsup> </msubsup> <mo>,</mo> <mi>i</mi> <mo>&amp;Element;</mo> <msub> <mi>S</mi> <mrow> <mi>h</mi> <mi>i</mi> <mi>g</mi> <mi>h</mi> <mi>e</mi> <mi>s</mi> <mi>t</mi> <mo>_</mo> <mi>U</mi> <mi>P</mi> </mrow> </msub> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msubsup> <mrow> <mo>{</mo> <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>&amp;kappa;</mi> <mn>4</mn> </msub> <mrow> <mo>&amp;lsqb;</mo> <mrow> <mfrac> <mrow> <msub> <mi>&amp;lambda;</mi> <mi>l</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>e</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>-</mo> <munder> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>k</mi> </mrow> </munder> <msub> <mi>G</mi> <mrow> <mi>k</mi> <mi>j</mi> </mrow> </msub> <msub> <mi>m</mi> <mi>j</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mo>&amp;rsqb;</mo> </mrow> </mrow> <mo>}</mo> </mrow> <msubsup> <mi>e</mi> <mi>i</mi> <mi>min</mi> </msubsup> <msubsup> <mi>e</mi> <mi>i</mi> <mi>max</mi> </msubsup> </msubsup> <mo>,</mo> <mi>i</mi> <mo>&amp;NotElement;</mo> <msub> <mi>S</mi> <mrow> <mi>h</mi> <mi>i</mi> <mi>g</mi> <mi>h</mi> <mi>e</mi> <mi>s</mi> <mi>t</mi> <mo>_</mo> <mi>U</mi> <mi>P</mi> </mrow> </msub> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> </mrow> Current ink is calculated to send The physical layer sending power consumption value of node, until the ei (t+1) convergences;
3rd determining unit, for by the ei(t+1) corresponding sending power consumption value is used as current ink sending node when restraining Physical layer convergence sending power consumption value;
Wherein, the ei (t+1) is node physical layer sending power consumption of the node i at (t+1) moment, and the ei (t) is node i in t The node physical layer sending power consumption at moment, κ 4 (t) is the t iteration positive step-length that is, and it is transmission delivery number of times obtained by node is calculated with mean power to represent span as 4 n, <mrow> <msub> <mi>m</mi> <mi>j</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mi>&amp;lambda;</mi> <mi>j</mi> </msub> <mi>S</mi> <mi>I</mi> <mi>R</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>e</mi> <mi>j</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <msub> <mi>G</mi> <mrow> <mi>j</mi> <mi>j</mi> </mrow> </msub> </mrow> </mfrac> <mo>.</mo> </mrow> 5
CN201610115437.9A 2016-03-01 2016-03-01 A kind of wireless body area network transmission method and device Pending CN107148029A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610115437.9A CN107148029A (en) 2016-03-01 2016-03-01 A kind of wireless body area network transmission method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610115437.9A CN107148029A (en) 2016-03-01 2016-03-01 A kind of wireless body area network transmission method and device

Publications (1)

Publication Number Publication Date
CN107148029A true CN107148029A (en) 2017-09-08

Family

ID=59784022

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610115437.9A Pending CN107148029A (en) 2016-03-01 2016-03-01 A kind of wireless body area network transmission method and device

Country Status (1)

Country Link
CN (1) CN107148029A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102316594A (en) * 2011-09-23 2012-01-11 北京邮电大学 Method for cross layer resource distribution and grouped dispatch in cognitive wireless network
CN103929490A (en) * 2014-04-28 2014-07-16 中国科学院微电子研究所 Data transmission method for body area network system
CN104125098A (en) * 2014-08-04 2014-10-29 中国科学院微电子研究所 Adaptive adjustment method and system for media access control
CN104486641A (en) * 2014-11-20 2015-04-01 清华大学 Multi-service broadcasting single-frequency network optimizing method based on superposition codes
CN104796993A (en) * 2015-04-21 2015-07-22 西安交通大学 Stackelberg game-based cross-layer resource allocation method of heterogeneous network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102316594A (en) * 2011-09-23 2012-01-11 北京邮电大学 Method for cross layer resource distribution and grouped dispatch in cognitive wireless network
CN103929490A (en) * 2014-04-28 2014-07-16 中国科学院微电子研究所 Data transmission method for body area network system
CN104125098A (en) * 2014-08-04 2014-10-29 中国科学院微电子研究所 Adaptive adjustment method and system for media access control
CN104486641A (en) * 2014-11-20 2015-04-01 清华大学 Multi-service broadcasting single-frequency network optimizing method based on superposition codes
CN104796993A (en) * 2015-04-21 2015-07-22 西安交通大学 Stackelberg game-based cross-layer resource allocation method of heterogeneous network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
王亚丽: "无线传感器网络流分析与流控制技术研究", 《中国博士学位论文库》 *

Similar Documents

Publication Publication Date Title
Qiu et al. Deep deterministic policy gradient (DDPG)-based energy harvesting wireless communications
CN101816212B (en) The confirmation of movement station and the aggregation denied in wireless network
CN101449558B (en) Transmission device, transmission method, system large scale integrated circuit
Zheng et al. Resource allocation in wireless powered relay networks: A bargaining game approach
CN105163380B (en) The distributed cross-layer optimizing method of MIMO wireless multi-hop networks
CN110225525A (en) A kind of frequency spectrum sharing method based on cognitive radio networks, device and equipment
Li et al. A low latency, energy efficient MAC protocol for wireless sensor networks
CN102868972A (en) Internet of things (IoT) error sensor node location method based on improved Q learning algorithm
Elwekeil et al. Prolonging smart grid network lifetime through optimising number of sensor nodes and packet length
CN105163325B (en) Isomery directional sensor network dispositions method
CN103596191A (en) Intelligent configuration system and intelligent configuration method for wireless sensor network
WO2023179010A1 (en) User packet and resource allocation method and apparatus in noma-mec system
CN104883741A (en) Resource allocation algorithm for cognitive radio network
CN107172701A (en) A kind of power distribution method of non-orthogonal multiple access system
Trapasiya et al. Energy efficient policy selection in wireless sensor network using cross layer approach
Xu et al. Towards a secure medium access control protocol for cluster-based underwater wireless sensor networks
CN105659669A (en) Power control method and system for wireless networks
CN107148029A (en) A kind of wireless body area network transmission method and device
CN103634867B (en) Service life optimizing method for wireless sensor network under uniform deployment condition
Li et al. Lifetime optimization for reliable broadcast and multicast in wireless ad hoc networks
CN104378180B (en) Multicast reliability based on binary system molecule traffic model determines method
CN106162646A (en) The motivational techniques of a kind of cooperation interference realizing safety of physical layer and device
CN112492586B (en) Encryption transmission scheme optimization method and device
CN112637812B (en) Vehicle-mounted cooperative communication relay selection method based on supervised machine learning
Abdelhak et al. Energy-aware distributed QR decomposition on wireless sensor nodes

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20170908