CN105451315A - Serial energy acquisition method with characteristic of throughput maximization - Google Patents

Serial energy acquisition method with characteristic of throughput maximization Download PDF

Info

Publication number
CN105451315A
CN105451315A CN201510733555.1A CN201510733555A CN105451315A CN 105451315 A CN105451315 A CN 105451315A CN 201510733555 A CN201510733555 A CN 201510733555A CN 105451315 A CN105451315 A CN 105451315A
Authority
CN
China
Prior art keywords
time
energy
user node
node
particle
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201510733555.1A
Other languages
Chinese (zh)
Other versions
CN105451315B (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.)
Jiangsu Santaishan Data Application Research Institute Co.,Ltd.
Original Assignee
Jiangsu University of Science and Technology
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 Jiangsu University of Science and Technology filed Critical Jiangsu University of Science and Technology
Priority to CN201510733555.1A priority Critical patent/CN105451315B/en
Publication of CN105451315A publication Critical patent/CN105451315A/en
Application granted granted Critical
Publication of CN105451315B publication Critical patent/CN105451315B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/06TPC algorithms
    • H04W52/14Separate analysis of uplink or downlink
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/18TPC being performed according to specific parameters
    • H04W52/24TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/241TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account channel quality metrics, e.g. SIR, SNR, CIR, Eb/lo
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/18TPC being performed according to specific parameters
    • H04W52/24TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/242TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account path loss
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/18TPC being performed according to specific parameters
    • H04W52/24TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/243TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account interferences
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/18TPC being performed according to specific parameters
    • H04W52/26TPC being performed according to specific parameters using transmission rate or quality of service QoS [Quality of Service]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/18TPC being performed according to specific parameters
    • H04W52/28TPC being performed according to specific parameters using user profile, e.g. mobile speed, priority or network state, e.g. standby, idle or non transmission
    • H04W52/283Power depending on the position of the mobile

Abstract

The invention discloses a serial energy acquisition method with characteristic of throughput maximization. The method comprises the steps: step one, network initialization; step two, initial network transmission; step three, optimal network time distribution; and step four, network transmission. According to the invention, the signal energy of uplinks and downlinks of user nodes can be collected reasonably; a time distribution scheme of information transmission and energy collection between user nodes can be optimized effectively; the energy collection efficiency of the user node of the network can be improved; and an objective of network throughput maximization can be achieved.

Description

Throughput-maximized serial energy-collecting method
Technical field
The present invention relates to the information transmission under a kind of cordless communication network and energy-collecting method, particularly relate to a kind of throughput-maximized serial energy-collecting method, belong to wireless power technical field of communication network.
Background technology
The wireless power communication technology is the important research field in present communications subject, is proposed the earliest, derived multiple research direction through development for many years by the father tesla of alternating current, and wherein electromagnetic induction is current modal wireless charging scheme.Wireless communication system take then electromagnetic wave as transmission medium, achieves effective transmission of telecommunications breath.For this feature, VarshneyLavR. in 2008 IEEEInternationalSymposiumonInformationTheory publish thesis " Transportinginformationandenergysimultaneously " show to compromise and realize radio communication and power delivery.2010, GroverPulkit and SahaiAnant IEEEInternationalSymposiumonInformationTheoryProceedings publish thesis " shannonmeetstesla:wirelessinformationandpowertransfer " show also can obtain the dual gain of information and Energy Transfer in frequency-selective channel simultaneously.Subsequently, people expand research for the method realizing radio communication and electrical transfer simultaneously, JuHyungsik published thesis " ThroughputMaximizationinWirelessPoweredCommunicationNetw orks " in 2014 at IEEETransactionsonWirelessCommunications, the document gives optimal time allocative decision, achieves this wireless power communication network uplink throughput and maximizes.But the method only considers the transmission plan of each user node from Integrated access point collecting energy, does not study the situation of energy acquisition between user node.
Under considering proximity condition, between wireless power network neighboring user node, implement the situation that collecting energy may be better than implementing from remote accessing point energy acquisition.For this reason, the present invention is based on throughput-maximized criterion, design a kind of new particle group optimizing wireless power communication network transmission method, the time devided modulation scheme of information transmission and energy acquisition between effective optimizing user node, improve network user node energy acquisition efficiency, reach the object of optimized network throughput.
Summary of the invention
The object of the present invention is to provide a kind of throughput-maximized serial energy-collecting method, by being optimized distribution to the time of information transmission and energy acquisition, effectively improving network energy collecting efficiency, realizing network uplink throughput-maximized.
Object of the present invention is achieved by the following technical programs:
A throughput-maximized serial energy-collecting method, the method comprises the following steps:
1. netinit, disposes K+1 node; Numbering 0 is Integrated access point, and numbering 1 ~ K is user node; It is P that Integrated access point has firm power 0watt, user node initial power is 0 watt; Integrated access point 0 and the total communication time of all K user node are T second, are 0 ~ K peer distribution initialization time t at random 0t, t 1t ..., t kt; Wherein, t ifor time devided modulation weight (i=0,1 ..., K), and t 0+ t 1+ ... + t k=1, make t=[t 0t 1t k];
2. network initial transmission
1) down link energy acquisition: Integrated access point is at time t 0with power P in T 0continue to send down link signal x 0, each user node is at time t 0the down link signal x that in T, continuous reception Integrated access point sends 0, gather and store this signal energy; A kth user node Received signal strength is y k=h k, 0x 0+ z k(k=1 ..., K), wherein, h k, 0for Integrated access point 0 is to the channel condition information of a kth user node, z kfor additive white Gaussian noise;
2) uplink energy collection and information transmission: a kth user node is in the time interior enforcement energy acquisition also stores, at time t kself up-link information x is sent according to time division multiple access way in T k(k=1 ..., K), namely a kth user node sends the uplink signal moment a front k-1 user and carries out energy acquisition, subsequently complete send self up-link information after enter park mode immediately;
3. network time optimizes distribution:
1) a kth user node collecting energy is calculated k=1 ..., K;
In formula, P iit is the transmitted power of i-th user node; D k, i, α k, ibe respectively the Distance geometry path transmission loss factor of i-th user node to a kth user node; ζ kfor the energy conversion efficiency of a kth user node, 0 < ζ k< 1;
2) calculate a kth user node and gather power P k: P kke k/ (t kt), η in formula kfor collecting energy utilance;
3) calculate each user node and can obtain uplink throughput C k(t): C k(t)=t klog 2(1+|h 0, k| 2p k/ δ 2), h in formula 0, kfor a kth user node is to the channel condition information of Integrated access point 0, δ 2for noise variance;
4) computing network current Uplink throughput
5) solve and upgrade peer distribution time t, computing network current Uplink throughput C (t); With uplink throughput maximization for criterion, C (t) value corresponding to more different distribution time t:
max t { C ( t ) } . s . t . P k &le; P 0 , &Sigma; k = 0 K t k = 1 , t k &GreaterEqual; 0
In formula, { C (t) } represents the set that the C (t) that different distribution time t is corresponding is formed; represent choose C (t) corresponding to different distribution time t institute form gather in maximum C (t) value; S.t.P k≤ P 0represent the collecting energy constraints that should meet calculated in C (t) process, namely each node can collecting energy P kintegrated access point 0 energy P should be less than 0;
6) the peer distribution time t preserving corresponding maximum C (t) value is the time devided modulation value after optimizing;
4. the Internet Transmission stage
In same fading channel block, according to the time devided modulation value t after each node optimization, time division multiple access transmission means is adopted to carry out information transmission and energy acquisition; In subsequent channels fading channel block, if channel condition information changes, then optimization is re-started, repeated execution of steps 3 to network each peer distribution time; Otherwise, still by the time devided modulation value after current each node optimization, adopt time division multiple access transmission means to carry out information transmission and energy acquisition.
Object of the present invention can also be realized further by following technical measures:
Aforementioned throughput-maximized serial energy-collecting method, wherein user node possesses two radio frequency links, can complete the function of information transmission and energy acquisition in step 2 in downlink communication in different radio frequency link simultaneously.
Aforementioned throughput-maximized serial energy-collecting method, wherein ζ in step 3 kbe less than 0.7.
Aforementioned throughput-maximized serial energy-collecting method, wherein optimizes allocated phase in step 3 network time, solves based on convex optimized algorithm to peer distribution time t.
Aforementioned throughput-maximized serial energy-collecting method, wherein optimize allocated phase in step 3 network time, based on heuristic value, peer distribution time t is solved, based on the standard particle group optimizing method in heuristic value to each peer distribution time t kcarry out method for solving as follows:
(1) K+1 node is mapped to n particle;
(2) initialization particle rapidity v kbe one group of random number, initialization fitness function value C k(t)=0, each node time apportioning cost of initialization is one group of random number, itself and be T, and this time apportioning cost is mapped to particle initial position y k(t);
(3) collecting energy and transmitted power is calculated;
A. a kth particle collecting energy is: k=1 ..., K; In formula, P iit is the transmitted power of i-th user node; D k, i, α k, ibe respectively the Distance geometry path transmission loss factor of i-th user node to a kth user node; ζ kfor the energy conversion efficiency of a kth user node, 0 < ζ k< 1;
B. a kth particle transmitted power is: P kke k/ (t kt), η in formula kfor collecting energy utilance;
(4) maximize criterion based on uplink throughput, calculate fitness function:
C k(t)=t klog 2(1+|h 0,k| 2P k2);
Based on fitness function computing network current Uplink throughput:
C ( t ) = &Sigma; k = 1 K C k ( t )
(5) population is upgraded
If a. the individual extreme value of current particle is better than the individual extreme value of this particle of a moment, then upgrade the individual extreme value of current particle;
If b. the individual extreme value of current particle is better than a moment global extremum, then upgrade current global extremum;
C. the speed v of each particle is upgraded kwith position y k(t);
(6) repeated execution of steps (3)-(5) are until reach maximum iteration time;
(7) when reaching maximum iteration time, mapping global optimum's particle position is optimal network node time apportioning cost t, and corresponding C (t) is uplink throughput maximum.
Compared with prior art, the invention has the beneficial effects as follows: the uplink and downlink signal energy rationally gathering user node, the time devided modulation scheme of information transmission and energy acquisition between effective optimizing user node, improve network user node energy acquisition efficiency, reach the maximized object of network throughput.
Accompanying drawing explanation
Fig. 1 is the structure principle chart of wireless power of the present invention and communication network;
Fig. 2 is communication protocol sequential chart of the present invention;
Fig. 3 is time-optimized allocation flow figure of the present invention.
Embodiment
Below in conjunction with the drawings and specific embodiments, the invention will be further described.
Transmit while throughput-maximized serial energy-collecting method of the present invention can realize wireless communication system information and energy, be applicable to the cordless communication network with a node arbitrarily.As shown in Figure 1, in region, cordless communication network comprises 1 Integrated access point (node 0) and several user nodes (node 1 ~ K); The function of Integrated access point 0 is at downlink communication time t 0energy is sent, at uplink communication time t in T 1t ..., t kin T, receiving data information (supposes in specific embodiment that each user node only has single radio frequency link, namely in downlink communication, only carries out energy acquisition.But when user node possesses two radio frequency links, in downlink communication, also can complete the function of information transmission and energy acquisition in different radio frequency link) simultaneously.User node k (k=1 ..., K) function be at downlink communication time t 0collection Integrated access point being sent to signal energy is completed, at uplink communication time t in T 1t ..., t k-1the energy acquisition to front k-1 user node uplink signal is completed in T, and by its data information at uplink communication time t ktransfer to Integrated access point 0 in T, immediately enter park mode.
The present invention proposes a kind of novel the particle group optimizing information transmission and the energy-collecting method that maximize criterion based on wireless uplink link throughput, institute's extracting method can the reasonable distribution node communication time, effectively improve wireless communication efficiency, improve network energy utilance, embodiment is as follows:
1. the netinit stage
As shown in Figure 1, intra-zone administration K+1 node, numbering 0 is Integrated access point, and numbering 1 ~ K is user node.Integrated access point is deployed in certain of network surrounding, has constant transmitted power P 0, data message can be realized and receive; Each user node all can directly realize communicating with Integrated access point, has the function of energy acquisition, data processing and transmission.The total communication time of each node of network is T second, and initial phase is 0 ~ K peer distribution initialization time t at random 0t, t 1t ..., t kt.Wherein, t ifor time devided modulation weight (i=0,1 ..., K), t 0+ t 1+ ... + t k=1, make t=[t 0t 1t k].
2. network initial transmission phase
1) down link energy acquisition.Integrated access point 0 is at time t 0with power P in T 0continue to send down link signal x 0, each user node is at time t 0continuous reception down link signal x in T 0, gather and store this signal energy.Now, a kth user node Received signal strength is y k=h k, 0x 0+ z k(k=1 ..., K).Wherein, h k, 0for Integrated access point 0 is to the channel condition information of a kth user node, z kfor additive white Gaussian noise, and suppose that noise power that each node receives can be ignored.
2) uplink energy collection and information transmission.Each user node, in uplink communication, all implements forward direction information transmission and backward energy acquisition by sequence number.When user node 1 is at time t 1with power P in T 1when sending up-link information to Integrated access point 0 (forward direction), user node 2 ..., K (backward) is at time t 1energy acquisition is implemented in T; When user node 2 is at time t 2with power P in T 2when sending up-link information to Integrated access point 0 (forward direction), user node 3 ..., K (backward) is at time t 2energy acquisition is implemented in T; By that analogy, when user node k is at time t kwith power P in T kwhen sending up-link information to Integrated access point 0 (forward direction), user node k+1 ..., K (backward) is at time t kenergy acquisition is implemented in T.That is, a kth user node is in the time inside carry out energy acquisition and store, at time t krespective up-link information x is sent according to time division multiple access way order in T k(k=1 ..., K), after completing self up-link information of transmission, enter park mode immediately subsequently, sequential chart is as shown in Figure 2.
3. network time optimizes allocated phase, as shown in Figure 3, is time-optimized allocation flow figure of the present invention:
1) K+1 node is mapped to n particle.
2) initialization particle rapidity v kbe one group of random number, initialization fitness function value C kt ()=0, each node time apportioning cost of initialization is one group of random number (itself and for T), and this time apportioning cost is mapped to particle initial position y k(t).
3) collecting energy and transmitted power is calculated.
1. a kth particle collecting energy is: k=1 ..., K.In formula, P iit is the transmitted power of i-th user node; D k, i, α k, ibe respectively the Distance geometry path transmission loss factor of i-th user node to a kth user node; ζ kfor the energy conversion efficiency of a kth user node, 0 < ζ k< 1.ζ kconcrete value need be determined by real system circuit characteristic, is generally less than 0.7 with state-of-the art.
2. a kth particle transmitted power is: P kke k/ (t kt), η in formula kfor collecting energy utilance.
4) maximize criterion based on uplink throughput, calculate fitness function
C k(t)=t klog 2(1+|h 0,k| 2P k2)
Based on fitness function computing network current Uplink throughput
C ( t ) = &Sigma; k = 1 K C k ( t )
5) population is upgraded
If 1. the individual extreme value of current particle is better than the individual extreme value of this particle of a moment, then upgrade the individual extreme value of current particle.
If 2. the individual extreme value of current particle is better than a moment global extremum, then upgrade current global extremum.
3. the speed v of each particle is upgraded kwith position y k(t)
6) repeated execution of steps 3)-5) until reach maximum iteration time.
7) when reaching maximum iteration time, mapping global optimum's particle position is optimal network node time apportioning cost t, and corresponding C (t) is uplink throughput maximum.
4. the Internet Transmission stage
In same fading channel block, according to the time devided modulation value t after each node optimization, time division multiple access transmission means is adopted to carry out information transmission and energy acquisition.That is, Integrated access point 0 is at time t 0with power P in T 0continue to send down link signal x 0, each user node is at time t 0continuous reception down link signal x in T 0, gather and store this signal energy; When user node 1 is at time t 1with power P in T 1when sending up-link information to Integrated access point 0 (forward direction), user node 2 ..., K (backward) is at time t 1energy acquisition is implemented in T; When user node 2 is at time t 2with power P in T 2when sending up-link information to Integrated access point 0 (forward direction), user node 3 ..., K (backward) is at time t 2energy acquisition is implemented in T; By that analogy, when user node k is at time t kwith power P in T kwhen sending up-link information to Integrated access point 0 (forward direction), user node k+1 ..., K (backward) is at time t kenergy acquisition is implemented, as shown in Figure 2 in T.In subsequent channels fading channel block, if channel condition information changes, then optimization is re-started, repeated execution of steps 3 to network each peer distribution time.Otherwise, still by the time devided modulation value after current each node optimization, adopt time division multiple access transmission means to carry out information transmission and energy acquisition.
In addition to the implementation, the present invention can also have other execution modes, and all employings are equal to the technical scheme of replacement or equivalent transformation formation, all drop in the protection range of application claims.

Claims (5)

1. a throughput-maximized serial energy-collecting method, it is characterized in that, the method comprises the following steps:
1) netinit, disposes K+1 node; Numbering 0 is Integrated access point, and numbering 1 ~ K is user node; It is P that Integrated access point has firm power 0watt, user node initial power is 0 watt; Integrated access point 0 and the total communication time of all K user node are T second, are 0 ~ K peer distribution initialization time t at random 0t,t 1t ..., t kt; Wherein, t ifor time devided modulation weight (i=0,1 ..., K), and t 0+ t 1+ ... + t k=1, make t=[t 0t 1t k];
2) network initial transmission
(1) down link energy acquisition: Integrated access point is at time t 0with power P in T 0continue to send down link signal x 0, each user node is at time t 0the down link signal x that in T, continuous reception Integrated access point sends 0, gather and store this signal energy; A kth user node Received signal strength is y k=h k, 0x 0+ z k(k=1 ..., K), wherein, h k, 0for Integrated access point 0 is to the channel condition information of a kth user node, z kfor additive white Gaussian noise;
(2) uplink energy collection and information transmission: a kth user node is in the time interior enforcement energy acquisition also stores, at time t kself up-link information xk (k=1 is sent according to time division multiple access way in T, K), namely a kth user node sends the uplink signal moment a front k-1 user and carries out energy acquisition, subsequently complete send self up-link information after enter park mode immediately;
3) network time optimizes distribution:
(1) a kth user node collecting energy E is calculated k: k=1 ..., K;
In formula, P iit is the transmitted power of i-th user node; D k,i, α k,ibe respectively the Distance geometry path transmission loss factor of i-th user node to a kth user node; ζ kfor the energy conversion efficiency of a kth user node, 0< ζ k<1;
(2) calculate a kth user node and gather power P k: P kke k/ (t kt), η in formula kfor collecting energy utilance;
(3) calculate each user node and can obtain uplink throughput C k(t): C k(t)=t klog 2(1+|h 0, k| 2p k/ δ 2), h in formula 0, kfor a kth user node is to the channel condition information of Integrated access point 0, δ 2for noise variance;
(4) computing network current Uplink throughput
(5) solve and upgrade peer distribution time t, computing network current Uplink throughput C (t); With uplink throughput maximization for criterion, C (t) value corresponding to more different distribution time t:
m a x t { C ( t ) } .
s . t . P k &le; P 0 , &Sigma; k = 0 K t k = 1 , t k &GreaterEqual; 0
In formula, { C (t) } represents the set that the C (t) that different distribution time t is corresponding is formed; represent choose C (t) corresponding to different distribution time t institute form gather in maximum C (t) value; S.t.P k≤ P 0represent the collecting energy constraints that should meet calculated in C (t) process, namely each node can collecting energy P kintegrated access point 0 energy P should be less than 0;
(6) the peer distribution time t preserving corresponding maximum C (t) value is the time devided modulation value after optimizing;
4) the Internet Transmission stage
In same fading channel block, according to the time devided modulation value t after each node optimization, time division multiple access transmission means is adopted to carry out information transmission and energy acquisition; In subsequent channels fading channel block, if channel condition information changes, then optimization is re-started, repeated execution of steps 3 to network each peer distribution time); Otherwise, still by the time devided modulation value after current each node optimization, adopt time division multiple access transmission means to carry out information transmission and energy acquisition.
2. serial energy-collecting method throughput-maximized as claimed in claim 1, it is characterized in that, described user node possesses two radio frequency links, in step 2) in downlink communication, the function of information transmission and energy acquisition can be completed in different radio frequency link simultaneously.
3. serial energy-collecting method throughput-maximized as claimed in claim 1, is characterized in that, described step 3) middle ζ kbe less than 0.7.
4. serial energy-collecting method throughput-maximized as claimed in claim 1, is characterized in that, described step 3) network time optimization allocated phase, based on convex optimized algorithm, peer distribution time t is solved.
5. serial energy-collecting method throughput-maximized as claimed in claim 1, it is characterized in that, described step 3) network time optimization allocated phase, based on heuristic value, peer distribution time t is solved, based on the standard particle group optimizing method in heuristic value to each peer distribution time t kcarry out method for solving as follows:
(1) K+1 node is mapped to n particle;
(2) initialization particle rapidity v kbe one group of random number, initialization fitness function value C k(t)=0, each node time apportioning cost of initialization is one group of random number, itself and be T, and this time apportioning cost is mapped to particle initial position y k(t);
(3) collecting energy and transmitted power is calculated;
A. a kth particle collecting energy is: k=1 ..., K; In formula, P iit is the transmitted power of i-th user node; D k,i, α k,ibe respectively the Distance geometry path transmission loss factor of i-th user node to a kth user node; ζ kfor the energy conversion efficiency of a kth user node, 0< ζ k<1;
B. a kth particle transmitted power is: P kke k/ (t kt), η in formula kfor collecting energy utilance;
(4) maximize criterion based on uplink throughput, calculate fitness function:
C k(t)=t klog 2(1+|h 0,k| 2P k2);
Based on fitness function computing network current Uplink throughput:
C ( t ) = &Sigma; k = 1 K C k ( t )
(5) population is upgraded
If a. the individual extreme value of current particle is better than the individual extreme value of this particle of a moment, then upgrade the individual extreme value of current particle;
If b. the individual extreme value of current particle is better than a moment global extremum, then upgrade current global extremum;
C. the speed v of each particle is upgraded kwith position y k(t);
(6) repeated execution of steps (3)-(5) are until reach maximum iteration time;
(7) when reaching maximum iteration time, mapping global optimum's particle position is optimal network node time apportioning cost t, and corresponding C (t) is uplink throughput maximum.
CN201510733555.1A 2015-11-02 2015-11-02 Throughput-maximized serial energy-collecting method Active CN105451315B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510733555.1A CN105451315B (en) 2015-11-02 2015-11-02 Throughput-maximized serial energy-collecting method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510733555.1A CN105451315B (en) 2015-11-02 2015-11-02 Throughput-maximized serial energy-collecting method

Publications (2)

Publication Number Publication Date
CN105451315A true CN105451315A (en) 2016-03-30
CN105451315B CN105451315B (en) 2019-02-12

Family

ID=55560987

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510733555.1A Active CN105451315B (en) 2015-11-02 2015-11-02 Throughput-maximized serial energy-collecting method

Country Status (1)

Country Link
CN (1) CN105451315B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105848266A (en) * 2016-05-13 2016-08-10 江苏科技大学 Multi-antenna communication network circulating energy collection method with minimal energy consumption
CN105848267A (en) * 2016-05-13 2016-08-10 江苏科技大学 Energy consumption minimization-based serial energy collecting method
CN105916156A (en) * 2016-04-07 2016-08-31 浙江大学 Hybrid base station-based communication system throughput maximizing method
CN108521672A (en) * 2017-10-24 2018-09-11 南京大学 A kind of resource allocation methods of distributed wireless energy and the information transmission system
CN116915717A (en) * 2023-09-08 2023-10-20 Tcl通讯科技(成都)有限公司 Throughput distribution method and device, storage medium and electronic equipment

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7567543B2 (en) * 2005-10-24 2009-07-28 Nec Laboratories America, Inc. Method and apparatus for cross layer resource allocation for wireless backhaul networks
US7634287B1 (en) * 2000-11-15 2009-12-15 The Board Of Trustees Of The Leland Stanford Junior University Power controlled multiple access (PCMA) in wireless communication networks
CN101784107A (en) * 2010-01-15 2010-07-21 东南大学 Non-cooperative repeated game-based power scheduling method in wireless MIMO network
US8310975B2 (en) * 2009-03-11 2012-11-13 Nec Laboratories America, Inc. Optimal beam scheduling for multicasting in wireless networks
CN103188785A (en) * 2011-12-31 2013-07-03 北京大唐高鸿数据网络技术有限公司 Optimization method of power distribution in accessing strategy of wireless relays of internet of things
CN103428806A (en) * 2013-08-14 2013-12-04 华南理工大学 Method for combining relay selection and power control in reliable cooperative communication

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7634287B1 (en) * 2000-11-15 2009-12-15 The Board Of Trustees Of The Leland Stanford Junior University Power controlled multiple access (PCMA) in wireless communication networks
US7567543B2 (en) * 2005-10-24 2009-07-28 Nec Laboratories America, Inc. Method and apparatus for cross layer resource allocation for wireless backhaul networks
US8310975B2 (en) * 2009-03-11 2012-11-13 Nec Laboratories America, Inc. Optimal beam scheduling for multicasting in wireless networks
CN101784107A (en) * 2010-01-15 2010-07-21 东南大学 Non-cooperative repeated game-based power scheduling method in wireless MIMO network
CN103188785A (en) * 2011-12-31 2013-07-03 北京大唐高鸿数据网络技术有限公司 Optimization method of power distribution in accessing strategy of wireless relays of internet of things
CN103428806A (en) * 2013-08-14 2013-12-04 华南理工大学 Method for combining relay selection and power control in reliable cooperative communication

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
HYUNGSIK JU,RUI ZHANG: "Throughput Maximization in Wireless Powered Communication Networks", 《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS》 *
LAV R. VARSHNEY: "2008 IEEE International Symposium on Information Theory", 《2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY》 *
PULKIT GROVER,ANANT SAHAI: "Shannon meets Tesla: Wireless information and power transfer", 《INFORMATION THEORY PROCEEDINGS (ISIT), 2010 IEEE INTERNATIONAL SYMPOSIUM ON》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105916156A (en) * 2016-04-07 2016-08-31 浙江大学 Hybrid base station-based communication system throughput maximizing method
CN105916156B (en) * 2016-04-07 2019-04-16 浙江大学 A method of communication system throughput is maximized based on hybrid base station
CN105848266A (en) * 2016-05-13 2016-08-10 江苏科技大学 Multi-antenna communication network circulating energy collection method with minimal energy consumption
CN105848267A (en) * 2016-05-13 2016-08-10 江苏科技大学 Energy consumption minimization-based serial energy collecting method
CN105848266B (en) * 2016-05-13 2019-05-17 江苏科技大学 Energy consumption minimized multi-antenna communication network circulating energy acquisition method
CN108521672A (en) * 2017-10-24 2018-09-11 南京大学 A kind of resource allocation methods of distributed wireless energy and the information transmission system
CN108521672B (en) * 2017-10-24 2020-10-13 南京大学 Resource allocation method of distributed wireless energy and information transmission system
CN116915717A (en) * 2023-09-08 2023-10-20 Tcl通讯科技(成都)有限公司 Throughput distribution method and device, storage medium and electronic equipment
CN116915717B (en) * 2023-09-08 2024-01-23 Tcl通讯科技(成都)有限公司 Throughput distribution method and device, storage medium and electronic equipment

Also Published As

Publication number Publication date
CN105451315B (en) 2019-02-12

Similar Documents

Publication Publication Date Title
CN107172705B (en) Beam optimization method and system of wireless energy-carrying heterogeneous network
CN107948983B (en) Energy acquisition small base station resource allocation method based on alliance game
CN105451343B (en) A kind of more junction network resource allocation methods based on energy acquisition
CN105307271A (en) Multi-antenna communication system circulating energy collection method with maximum throughput capacity
CN105451315A (en) Serial energy acquisition method with characteristic of throughput maximization
CN105744629B (en) A kind of time-optimized distribution method of energy acquisition relay system based on relay selection
CN105025547A (en) Relay selection and power distribution method of energy acquisition node network
CN110062377B (en) Power division factor and beam forming combined optimization method in safe energy-carrying communication
CN106454990B (en) A kind of relay selection method considering energy transmission
CN104301984A (en) Power control method based on time domain half-duplex relay in D2D cellular network
CN101557641B (en) Subcarrier and power distribution method applicable to cellular relay system
CN107171764A (en) A kind of wireless safe transmission method and system for taking energy heterogeneous network
CN106487482A (en) A kind of power dividing method that full duplex relaying wireless messages are transmitted with synchronous energy
CN107070529B (en) A kind of optimization energy distribution method for taking energy multiple antennas relaying
CN108541001A (en) A kind of interruption rate optimization algorithm collecting two-way collaboration communication for energy
Quang et al. Performance evaluation of underlay cognitive radio networks over Nakagami-m fading channels with energy harvesting
CN106304111A (en) Isomery cellular network power allocation method based on energy acquisition relay station
CN103533629A (en) Particle swam optimization-based heterogeneous network interference coordination method
CN106549698B (en) The maximization minimum user rate method of bidirectional relay system based on wireless energy transfer
CN105848266A (en) Multi-antenna communication network circulating energy collection method with minimal energy consumption
CN106998222A (en) The power distribution method of high energy efficiency in a kind of distributing antenna system
CN112543472B (en) Multi-relay time slot and power joint optimization method based on DTPS (delay tolerant packet switching) protocol in cognitive SWIPT (switched Power packet exchange protocol)
CN112261662B (en) Transmission method for improving energy efficiency of NOMA cooperative communication system
CN104066096A (en) Super-dense heterogeneous-network optimal power coordination method based on improved particle swarm
CN109831826B (en) Resource allocation method for joint uplink and downlink information transmission in wireless energy supply communication network

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
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20160330

Assignee: JIANGSU TAIHANG INFORMATION TECHNOLOGY Co.,Ltd.

Assignor: JIANGSU University OF SCIENCE AND TECHNOLOGY

Contract record no.: X2020980007380

Denomination of invention: Serial energy acquisition method for maximizing throughput

Granted publication date: 20190212

License type: Common License

Record date: 20201030

EE01 Entry into force of recordation of patent licensing contract
EC01 Cancellation of recordation of patent licensing contract
EC01 Cancellation of recordation of patent licensing contract

Assignee: JIANGSU TAIHANG INFORMATION TECHNOLOGY Co.,Ltd.

Assignor: JIANGSU University OF SCIENCE AND TECHNOLOGY

Contract record no.: X2020980007380

Date of cancellation: 20201223

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20220105

Address after: 212000 303, innovation building, 101 Nanxu Avenue, high tech Zone, Zhenjiang City, Jiangsu Province

Patentee after: Zhenjiang Junda Information Technology Co.,Ltd.

Address before: Meng Xi Road 212003 Zhenjiang city of Jiangsu province Jingkou District No. 2

Patentee before: JIANGSU University OF SCIENCE AND TECHNOLOGY

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20220129

Address after: 223800 2nd floor, building A5, insurance Town, Hubin New District, Suqian City, Jiangsu Province

Patentee after: Jiangsu Santaishan Data Application Research Institute Co.,Ltd.

Address before: 212000 303, innovation building, 101 Nanxu Avenue, high tech Zone, Zhenjiang City, Jiangsu Province

Patentee before: Zhenjiang Junda Information Technology Co.,Ltd.