[go: up one dir, main page]

WO2010150050A1 - Procédé et appareil d'allocation de puissance pour des communications coopératives - Google Patents

Procédé et appareil d'allocation de puissance pour des communications coopératives Download PDF

Info

Publication number
WO2010150050A1
WO2010150050A1 PCT/IB2009/052696 IB2009052696W WO2010150050A1 WO 2010150050 A1 WO2010150050 A1 WO 2010150050A1 IB 2009052696 W IB2009052696 W IB 2009052696W WO 2010150050 A1 WO2010150050 A1 WO 2010150050A1
Authority
WO
WIPO (PCT)
Prior art keywords
power allocation
power
relay
computer program
computer
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.)
Ceased
Application number
PCT/IB2009/052696
Other languages
English (en)
Inventor
Matthew Nokleby
Behnaam Aazhang
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.)
Nokia Inc
Original Assignee
Nokia Inc
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 Nokia Inc filed Critical Nokia Inc
Priority to PCT/IB2009/052696 priority Critical patent/WO2010150050A1/fr
Publication of WO2010150050A1 publication Critical patent/WO2010150050A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04—Transmission power control [TPC]
    • H04W52/38—TPC being performed in particular situations
    • H04W52/42—TPC being performed in particular situations in systems with time, space, frequency or polarisation diversity
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/022—Site diversity; Macro-diversity
    • H04B7/026—Co-operative diversity, e.g. using fixed or mobile stations as relays
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04—Transmission power control [TPC]
    • H04W52/38—TPC being performed in particular situations
    • H04W52/46—TPC being performed in particular situations in multi-hop networks, e.g. wireless relay networks

Definitions

  • Embodiments of the present invention relate generally to cooperative communications and, more particularly, to allocating power for cooperative communications.
  • wireless networks may employ various techniques, such as hardware or software solutions, to increase the bandwidth and transfer rates, and the quality of service.
  • UE user equipment
  • UE user equipment
  • battery power for its operation and, as such, conservation of battery power is also a consideration.
  • One technique for increasing the data rate of a UE relies upon relaying the communications signals of a UE, such as to a base station.
  • dedicated relay nodes may be employed to facilitate the communications of a UE, the use of dedicated relay nodes increases the cost of the network and is only useful in those regions in which relay nodes have been deployed.
  • cooperative communications has been proposed in which one UE relays the communications signals of another UE, such as to a base station, an access point or the like (hereinafter generically referenced as a base station). For example, if two UEs are geographically close to one another, each UE may receive the communications signals from the other UE even though the communications signals are intended for another recipient. In accordance with cooperative communications, each UE may relay copies of the communications signals from the other UE to a base station for delivery to the intended recipient. By cooperatively communicating in this fashion, data may be transmitted more reliably at a higher rate.
  • a method, apparatus and computer program product are provided in accordance with exemplary embodiments of the present invention for determining an appropriate power allocation to thereafter utilize in conjunction with the relaying of data of the other device
  • a method, apparatus and computer program product are provided according to other embodiments of the present invention for responding to the power allocations that have been determined and then cooperating with another device to relay the communications signals of the other device by expending power in accordance with the power allocation
  • a bargaining solution such as a Nash bargaining solution
  • each device may benefit not only from communication that is conducted in a more reliable fashion with various network elements, such as base stations, access points and the like, but also in the conservation of battery resources since the battery power that is conserved by more reliably communicating with the network (as a result of the reduction in the need to retransmit data) exceeds the additional battery power that is consumed in relaying the data of the other device
  • cooperative communications are advantageously supported by embodiments of the present invention
  • a method in which a power allocation of a respective device to be utilized to relay communications signals of another device is determined
  • a bargaining solution such as a Nash bargaining solution, may be utilized in order to determine the power allocation
  • the method of this exemplary embodiment also facilitates cooperation with the other device to relay the communications signals of the other device by expending power in accordance with the power allocation
  • a different power allocation may be determined for each device
  • the power allocation may be determined in such a manner as to be based upon a utility of each device as defined by a total amount of data transmitted by a respective device in proportion to the total energy expended for transmission of the data
  • determining the power allocation based upon the utility of each device may include determining the power allocation based upon a product of the utility of each device and a respective disagreement point
  • the disagreement point of a respective device may include a long-term non-cooperative payoff of the respective device
  • an apparatus which includes at least one processor, and at least one memory including computer program code
  • the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to determine a power allocation of a respective device to be utilized to relay communications signals of another device
  • a bargaining solution such as a Nash bargaining solution, may be utilized in order to determine the power allocation
  • the at least one memory and the computer program code of this exemplary embodiment are also configured to, with the at least one processor, cause the apparatus to facilitate cooperation with the other device to relay the communications signals of the other device by expending power in accordance with the power allocation.
  • the at least one memory and the computer program code may also be configured to, with the at least one processor, cause the apparatus to determine the power allocation in such a manner as to be based upon a utility of each device as defined by a total amount of data transmitted by a respective device in proportion to the total energy expended for transmission of the data.
  • the at least one memory and the computer program code may also be configured to, with the at least one processor, cause the apparatus to determine the power allocation based upon the utility of each device by determining the power allocation based upon a product of the utility of each device and a respective disagreement point.
  • the disagreement point of a respective device may include a long-term non-cooperative payoff of the respective device.
  • the apparatus of one embodiment is a mobile phone that further includes user interface circuitry and user interface software configured to facilitate user control of at least some functions of the mobile phone through use of a display and configured to display at least a portion of a user interface of the mobile phone.
  • the display and display circuitry are configured to facilitate user control of at least some functions of the mobile phone.
  • a computer program product which includes at least one computer-readable storage medium having computer-readable program instructions stored therein.
  • the computer-readable program instructions are configured to cause an apparatus at least to determine, for each of at least two devices, a power allocation of a respective device to be utilized to relay communications signals of another device.
  • a bargaining solution such as a Nash bargaining solution, may be utilized in order to determine the power allocation.
  • the computer-readable program instructions of this exemplary embodiment are also configured to cause an apparatus to facilitate cooperation with the other device to relay the communications signals of the other device by expending power in accordance with the power allocation to at least one of the devices.
  • the computer-readable program instructions may also be configured to cause an apparatus at least to determine the power allocation in such a manner as to be based upon a utility of each device as defined by a total amount of data transmitted by a respective device in proportion to the total energy expended for transmission of the data.
  • the computer- readable program instructions may be configured to cause an apparatus at least to determine the power allocation based upon the utility of each device by determining the power allocation based upon a product of the utility of each device and a respective disagreement point.
  • the disagreement point of a respective device may include a long-term non-cooperative payoff of the respective device.
  • a method is also provided in accordance with another embodiment of the present invention which accesses a power allocation to be utilized to relay communication signals of another device and facilitates cooperation with the other device to relay the communications signals of the other device, such as by relaying the communications signals of the other device to a base station, by expending power in accordance with the power allocation.
  • the power allocation may be determined in accordance with a bargaining solution, such as a Nash bargaining solution.
  • the method of this exemplary embodiment may also rely upon cooperation by the other device to relay the communications signals transmitted by the respective device.
  • an apparatus which includes at least one processor, and at least one memory including computer program code.
  • the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to access a power allocation to be utilized to relay communication signals of another device and to facilitate cooperation with the other device to relay the communications signals of the other device, such as by relaying the communications signals of the other device to a base station, by expending power in accordance with the power allocation.
  • the power allocation may be determined in accordance with a bargaining solution, such as a Nash bargaining solution.
  • the at least one memory and the computer program code may also be configured to, with the at least one processor, cause the apparatus to rely upon cooperation by the other device to relay the communications signals transmitted by the respective device.
  • a computer program product which includes at least one computer-readable storage medium having computer-readable program instructions stored therein.
  • the computer-readable program instructions are configured to cause an apparatus at least to access a power allocation to be utilized to relay communication signals of another device and to facilitate cooperation with the other device to relay the communications signals of the other device, such as by relaying the communications signals of the other device to a base station, by expending power in accordance with the power allocation.
  • the power allocation may be determined in accordance with a bargaining solution, such as a Nash bargaining solution.
  • the computer-readable program instructions may also be configured to cause the apparatus to rely upon cooperation by the other device to relay the communications signals transmitted by the respective device.
  • Figure 1 is a block diagram of a system for supporting cooperative communications in accordance with example embodiments of the present invention
  • Figure 2 is a graphical representation of the Nash bargaining solution for the utility function of two UEs in accordance with example embodiments of the present invention
  • Figure 3 is a graphical representation of the results of numerical simulations within the Pareto frontier and the resulting Nash bargaining solution in accordance with one embodiment of the present invention
  • Figure 4 is a graphical representation of the average rate in bits per second per Hertz for two UEs as a function of the expected channel gain between one of the UEs and a base station in instances employing cooperative communications in accordance with example embodiments of the present invention and in instances that do not employ cooperative communications;
  • Figure 5 is a graphical representation of the average power for two UEs as a function of the expected channel gain between one of the UEs and a base station with the UEs employing cooperative communications in accordance with example embodiments of the present invention
  • Figure 6 is a graphical representation of the utility for two UEs as a function of the expected channel gain between one of the UEs and a base station in instances employing cooperative communications in accordance with example embodiments of the present invention and in instances that do not employ cooperative communications;
  • Figure 7 is a graphical representation of the average Nash bargaining solution powers, e.g., the square root of the Nash product in bits per joule, for two UEs as a function of the expected channel gain between one of the UEs and a base station with the UEs employing cooperative communications in accordance with example embodiments of the present invention
  • Figure 8 is a block diagram of an apparatus for determining power allocations in accordance with example embodiments of the present invention.
  • FIG. 9 is a flowchart of the operations performed to determine power allocations in accordance with example embodiments of the present invention.
  • FIG. 10 is a block diagram of an apparatus, such as a UE, for relaying the communications signals of another device in accordance with example embodiments of the present invention.
  • FIG. 11 is a flowchart of the operations performed to relay the communications signals of another device in accordance with example embodiments of the present invention.
  • circuitry refers to all of the following: (a) hardware-only circuit implementations (such as implementations in only analog and/or digital circuitry); (b) to combinations of circuits and software (and/or firmware), such as (as applicable): (i) to a combination of processor(s) or (ii) to portions of processor(s)/software (including digital signal processor(s)), software, and memory(ies) that work together to cause an apparatus, such as a mobile phone or server, to perform various functions); and (c) to circuits, such as a microprocessor(s) or a portion of a microprocessors), that require software or firmware for operation, even if the software or firmware is not physically present.
  • circuitry would also cover an implementation of merely a processor (or multiple processors) or portion of a processor and its (or their) accompanying software and/or firmware.
  • circuitry would also cover, for example and if applicable to the particular claim element, a baseband integrated circuit or applications processor integrated circuit for a mobile phone or a similar integrated circuit in server, a cellular network device, or other network device.
  • game theory is employed to provide a mathematical framework for considering the decision-making of users with conflicting interests, for example, UEs considering cooperative communications in an energy- limited environment.
  • game theory may provide a fair, systematic technique to balance, for example, the performance of each UE relative to the energy expended by another UE.
  • cooperative game theory facilitates a determination of how much a UE should cooperate, and/or how much energy a UE should expend in relaying communications signals of another UE.
  • Figure 1 illustrates a network environment in which two UEs designated UE 1 and UE 2 communicate with a common base station 14 to access the remainder of the network 16. While Figure 1 and the ensuing discussion mention only two UEs, three or more UEs may cooperatively communicate with the common base station in accordance with other embodiments of the present invention with the two UEs merely provided by way of illustration and not limitation.
  • UEs are shown and described to cooperatively communicate with a base station 14, the UEs may cooperatively communicate with other network devices, such as access points or the like.
  • reference herein to a base station is also by way of example, and not of limitation.
  • the UEs' transmissions may be time-division duplexed with UE 1 transmitting its data to the base station 14 during odd time blocks such that UE 1 is active and UE 2 is idle, and UE 2 transmitting its data to the base station during even time blocks such that UE 2 is active and UE 1 is idle.
  • the idle UE may choose to relay signals for the active UE in order to increase its rate.
  • UE 2 may act as a relay node
  • even time blocks when UE 2 operates as a source to transmit its data
  • UE 1 may act as a relay node.
  • the two UEs and the base station may therefore form a three-terminal relay channel in which the roles of source and relay are exchanged each time block.
  • the active UE may transmit its data directly to the base station (as shown in solid lines in Figure 1) and the idle UE may relay the same data (of the active UE) to the base station (as shown in dashed lines in Figure 1).
  • Figure 1 depicts the flow of data from UE 1 during odd time blocks by the arrows designated 1 and the flow of data from UE 2 during even time blocks by the arrows designated 2.
  • a narrowband, Rayleigh, block-fading Gaussian channel model may be assumed, although embodiments of the present invention are also applicable to other channel distributions.
  • the UEs' transmissions are multiplied by the (complex) channel gains and corrupted by Gaussian noise. Without loss of generality, the channel gains may be scaled such that the noise power at each receiver is unity.
  • the block-fading assumption channel gains remain constant over a single time block, and channel gains at different time blocks are statistically independent.
  • the channel gains of this example embodiment are Rayleigh distributed, and the channel statistics remain stationary. As shown in Figure 1 , let /? 13 and /?
  • the channel statistics may be described by the expected magnitudes - ⁇ [
  • pi(t) and p 2 (t) denote the power level of UE 1 and UE 2, respectively.
  • an upper bound may be placed on p-,(t) and p 2 (t). Again normalizing the channel gains, the power constraints may be defined without loss of generality as:
  • UEs of this example embodiment are automatically willing to use all of their power for their own transmissions with the UEs only needing to determine how much power they are willing to use for relaying.
  • the parameter ⁇ is the correlation coefficient between the source signal and the relay signal, which may be tuned to maximize the rate.
  • the optimal value of ⁇ is the value that makes the two terms inside the min ⁇ function equal. In this case, the two terms may be equated and it may be solved for ⁇ . Suppressing time arguments, this solution gives:
  • Equation (3) is a quadratic whose unique positive solution is:
  • Equation (6) may be intuitive.
  • UE 1 may communicate at a higher rate with the base station than with UE 2, which precludes UE 2's contributing to the achievable rate.
  • UE 2 may only contribute a small amount of power before the point-to-point link between the UEs becomes the bottleneck.
  • the achievable rate simplifies to a single term:
  • ⁇ ⁇ i log 2 (l +
  • ) , (7) for t odd and ⁇ chosen according to equation (4). Note that when p 2 0, equation (7) simplifies to the capacity of the point-to-point channel between UE 1 and the base station 14.
  • the relay power P 1 may be restricted such that:
  • the players are the two UEs and their possible strategies are the relay powers pi(t) and p 2 (t) provided by the UEs for relaying the communication signals of the other UE. Since it is assumed for one example embodiment that the UEs use full power for their own transmissions, p-,(t) need only be defined for even time blocks and p 2 (t) need only be defined for odd time blocks.
  • the UEs may be restricted to causal power allocations with p-,(t) and p 2 (t) not depending on future decisions or channel realizations.
  • the power allocations of the example embodiment are also memoryless and depend only on the current channel realizations.
  • the power allocations must also satisfy:
  • each player's e.g., each UE's
  • utility is defined as the total amount of data it has transmitted to the base station 14 (measured in bits) divided by the total energy it has expended (in joules). So, up to a multiplicative constant, the utilities are:
  • the utility functions (14) and (15) are coupled in that by increasing its relay power, a UE improves the utility of the other UE while decreasing its own utility.
  • each player is assumed to be self-interested and therefore concerned solely with maximizing its own utility without regard for the benefit of others.
  • a bargaining solution may therefore be employed in accordance with the example embodiments of the present invention to choose a unique set of strategies. While various bargaining solutions may be employed, a Nash bargaining solution (NBS) may be utilized to choose a unique set of strategies. For purposes of explanation, NBS is first introduced abstractly before being applied to the problem.
  • a two-player bargaining game may be formally defined by a set of feasible utilities U e R 2 and a disagreement point ⁇ e U .
  • the disagreement point represents the status quo prior to bargaining or utility guaranteed to each player should bargaining fail.
  • a bargaining solution is a mapping /( u, ⁇ ) to a payoff vector u* e U such that u* ⁇ ⁇ .
  • the NBS is an axiomatic solution, that is, it is characterized by a set of reasonable axioms rather than by a concrete bargaining process. The following axioms characterize the NBS:
  • the bargaining solution either remains unchanged or it selects one of the new utilities.
  • the Nash bargaining solution is the utility vector that maximizes the product in equation (20), called the Nash product.
  • the Nash bargaining solution is depicted in Figure 2.
  • the NBS payoffs are at least as great as the non-cooperative payoffs.
  • the NBS is therefore guaranteed to be a Nash equilibrium of the repeated game.
  • Equation (22) is non-convex, making it difficult to find the NBS power allocations directly. So, a few results that provide a systematic method for solving equation (22) are next presented. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
  • Lemma 1 The content of Lemma 1 is that power must be allocated efficiently. In other words, if a UE decides to commit a certain average power for relaying, then that power should be allocated to increase the other UE's rate as much as possible. It is also noted that the converse of Lemma 1 is not true, as will be seen below. There exist power allocations that are solutions to the optimization problems in equations (23) and (24) and result in utilities that are not Pareto dominant.
  • Lemma 1 A benefit of Lemma 1 is that the optimization of the expected rate is a convex problem. Since the NBS utilities are Pareto dominant, the optimization problem in equation (22) may be transformed into a series of comparatively simple optimizations. Instead of searching over the entire set of permissible power allocations, the solution may be found by only searching over the (Ci 1 , ⁇ 2 ) pairs.
  • KTT Karush-Kuhn-Tucker
  • Lemma 1 and Theorem 2 provide a systematic method for finding the power allocations p ⁇ and p 2 that achieve the Nash bargaining utilities.
  • thresholds ⁇ ? and ⁇ 2 may be chosen and the resulting power allocations P 1 and p 2 may be determined according to equation (25).
  • the Nash product of equation (22) may be evaluated at pi and p 2 .
  • the possible values of ⁇ 7 and ⁇ 2 may be efficiently searched until the Nash product is maximized.
  • the correlation coefficient ⁇ is the primary impediment to finding a closed- form solution. So, to find a low-complexity approximation to the true NBS, ⁇ may be forced to equal 0, regardless of the channel gains.
  • the optimization process is the same. Using branch-and-bound techniques, the values of ⁇ i and ⁇ 2 may be searched. But, rather than relying on gradient projection to find the resulting power allocations, the power allocations may be defined directly by equation (26), thereby greatly reducing the total complexity. Moreover, the optimality gap associated with this approximation may be searched.
  • the Pareto frontier may be numerically swept for the case when the expected channel gains are E[[/7i 2
  • 2 ] £[
  • 2 ] £l
  • 2 ] 1OdB.
  • the space [0,1] x [0, 1] of possible (Ci 1 , ⁇ 2 ) pairs is quantized into 20 x 20 grid points, and the power allocations and utilities associated with each point are found.
  • the results are depicted along with the disagreement point £and the NBS point.
  • the manner in which the NBS performs in a variety of channel conditions is examined, particularly when the UEs' link qualities are asymmetric.
  • the expected inter-user channel gains is set constant at E[
  • 2 ] 15dB.
  • UE 2's channel with the base station also has a constant expected gain of E[
  • 2 ] 15dB.
  • 2 ] is allowed to vary between -5dB and 2OdB.
  • FIG 7 the square root of the Nash product in accordance with the approximate NBS given in Corollary 3 and the optimal NBS found via Theorem 2 is shown for a respective UE.
  • the square root of the Nash product may be interpreted as the geometric average of the utility gains of the UEs over non-cooperation.
  • a small but discemable gap exists between the approximate and optimal NBS allocations.
  • the increase in (geometric) average utility is highest when E[
  • 2 ] is high or low
  • UEs experience a noticeable increase in bits-per-joule utility.
  • two or more UEs may be in communication with a common base station 14, such as in accordance with time-division duplexing to eliminate inter-user interference.
  • Cooperation is introduced by allowing the idle UE to relay the active UE's data in order to improve the achievable rate. Therefore, the UEs and base station form a three-terminal relay channel, with the UEs exchanging the roles of source and relay at each time block.
  • each UE's utility function is expressed in terms of its bits-per-joule efficiency. Rather than trying to maximize only the achievable rate, UEs instead aim to improve the ratio of achievable rate and the rate of energy consumption. Under traditional non-cooperative game theory, however, the unique one-stage Nash equilibrium is for each UE to refuse to relay.
  • the scenario is modeled as an infinitely-repeated game.
  • UEs can reward other UEs who agree to cooperate and punish other UEs who deviate from the agreement, providing incentive even for self-interested UEs to cooperate.
  • the cooperation levels may be defined by the Nash bargaining solution, which axiomatically defines a fair and efficient compromise between the UEs.
  • the relay power allocations associated with the Nash bargain may be found through a series of convex optimization problems.
  • the foregoing numerical results show that it is possible for both UEs to improve their bits-per-joule performance through bargaining. Each UE experiences increased rate but still allocates power conservatively.
  • the Nash bargain provides a fair distribution of resources: weaker UEs benefit more from cooperation, while stronger UEs are not unduly burdened.
  • the power allocations described above may be determined by any one or more of a variety of devices.
  • the base station 14 or other network entity may be configured to determine the power allocations of each UE, e.g., UE1 and UE2, and may provide the power allocations to the respective UEs for facilitating subsequent cooperative communications involving the UEs.
  • either or both of the UEs may be configured to determine the power allocations for itself and the other UE and may then provide the power allocations to the other UE.
  • an apparatus 20 such as a base station 14 or UE, that may be configured to determine the power allocations of the UEs is depicted in Figure 8.
  • the example apparatus 20 may include or may otherwise be in communication with a processor 22, a memory device 24, a communications interface 26, and power allocation determination circuitry 28.
  • the example apparatus 20 may optionally include, for example, when the apparatus 20 is embodied as a UE, a user interface 30.
  • the processor 22 may be embodied as various means implementing various functionality of example embodiments of the present invention including, for example, a microprocessor, a coprocessor, a controller, a special-purpose integrated circuit such as, for example, an ASIC (application specific integrated circuit), an FPGA (field programmable gate array), or a hardware accelerator, processing circuitry or the like.
  • processor 22 may be representative of a plurality of processors, or one or more multiple core processors, operating in concert. Further, the processor 22 may be comprised of a plurality of transistors, logic gates, a clock (e.g., oscillator), and the like to facilitate performance of the functionality described herein.
  • the processor 22 may, but need not, include one or more accompanying digital signal processors.
  • the processor 22 is configured to execute instructions stored in the memory device 24 or instructions otherwise accessible to the processor 22.
  • the processor 22 may be configured to operate such that the processor causes the apparatus 20 to perform various functionalities described herein.
  • the processor 22 may be an entity capable of performing operations according to embodiments of the present invention while configured accordingly.
  • the processor 22 is specifically configured hardware for conducting the operations described herein.
  • the processor 22 is embodied as an executor of instructions stored on a computer-readable storage medium
  • the instructions specifically configure the processor 22 to perform the algorithms and operations described herein.
  • the processor 22 is a processor of a specific device (e.g., a mobile terminal) configured for employing example embodiments of the present invention by further configuration of the processor 22 via executed instructions for performing the algorithms and operations described herein.
  • the memory device 24 may be one or more computer-readable storage media that may include volatile and/or non-volatile memory.
  • the memory device 24 includes Random Access Memory (RAM) including dynamic and/or static RAM, on-chip or off- chip cache memory, and/or the like.
  • RAM Random Access Memory
  • memory device 24 may include non-volatile memory, which may be embedded and/or removable, and may include, for example, read-only memory, flash memory, magnetic storage devices (e.g., hard disks, floppy disk drives, magnetic tape, etc.), optical disc drives and/or media, non-volatile random access memory (NVRAM), and/or the like.
  • Memory device 24 may include a cache area for temporary storage of data. In this regard, some or all of memory device 24 may be included within the processor 22.
  • the memory device 24 may be configured to store information, data, applications, computer-readable program code instructions, or the like for enabling the processor 22 and the example apparatus 20 to carry out various functions in accordance with example embodiments of the present invention described herein.
  • the memory device 24 could be configured to buffer input data for processing by the processor 22.
  • the memory device 24 may be configured to store instructions for execution by the processor 22.
  • the communication interface 26 may be any device or means embodied in either hardware, a computer program product, or a combination of hardware and a computer program product that is configured to receive and/or transmit data from/to a network 16 and/or any other device or module, such as a base station 14, access point or the like, in communication with the example apparatus 20.
  • Processor 22 may also be configured to facilitate communications via the communications interface by, for example, controlling hardware included within the communications interface 26.
  • the communication interface 26 may include, for example, one or more antennas, a transmitter, a receiver, a transceiver and/or supporting hardware, including a processor for enabling communications with network 16.
  • the example apparatus 20 may communicate with various other network entities in a device-to-device fashion and/or via indirect communications via a base station 14, access point, server, gateway, router, or the like.
  • the communications interface 26 may be configured to provide for communications in accordance with any wired or wireless communication standard.
  • the communications interface 26 may be configured to support communications in multiple antenna environments, such as multiple input multiple output (MIMO) environments. Further, the communications interface 26 may be configured to support orthogonal frequency division multiplexed (OFDM) signaling.
  • MIMO multiple input multiple output
  • OFDM orthogonal frequency division multiplexed
  • the communications interface 26 may be configured to communicate in accordance with various techniques, such as, second-generation (2G) wireless communication protocols IS-136 (time division multiple access (TDMA)), GSM (global system for mobile communication), IS-95 (code division multiple access (CDMA)), third-generation (3G) wireless communication protocols, such as Universal Mobile Telecommunications System (UMTS), CDMA200, wideband CDMA (WCDMA) and time division-synchronous CDMA (TD-SCDMA), 3.9 generation (3.9G) wireless communication protocols, such as Evolved Universal Terrestrial Radio Access Network (E-UTRAN), with fourth-generation (4G) wireless communication protocols, international mobile telecommunications advanced (IMT-Advanced) protocols, Long Term Evolution (LTE) protocols including LTE-advanced, or the like.
  • 2G wireless communication protocols IS-136 (time division multiple access (TDMA)
  • GSM global system for mobile communication
  • IS-95 code division multiple access
  • third-generation (3G) wireless communication protocols such as Universal Mobile Telecommunications System (UMTS),
  • communications interface 26 may be configured to provide for communications in accordance with techniques such as, for example, radio frequency (RF), infrared (IrDA) or any of a number of different wireless networking techniques, including WLAN techniques such as IEEE 802.11 (e.g., 802.11a, 802.11 b, 802.11g, 802.11n, etc.), wireless local area network (WLAN) protocols, world interoperability for microwave access (WiMAX) techniques such as IEEE 802.16, and/or wireless Personal Area Network (WPAN) techniques such as IEEE 802.15, BlueTooth (BT), low power versions of BT, ultra wideband (UWB), Wibree, Zigbee and/or the like.
  • the communications interface 26 may also be configured to support communications at the network layer, possibly via Internet Protocol (IP).
  • IP Internet Protocol
  • the user interface 30 may be in communication with the processor 22 to receive user input via the user interface 30 and/or to present output to a user as, for example, audible, visual, mechanical or other output indications.
  • the processor 22 may comprise user interface circuitry configured to control at least some functions of one or more elements of the user interface 30.
  • the processor 22 and/or user interface circuitry of the processor 22 may be configured to control one or more functions of one or more elements of the user interface 30 through computer program instructions (e.g., software and/or firmware, such as user interface software) stored on a memory accessible to the processor (e.g., volatile memory, non-volatile memory, and/or the like).
  • the user interface 30 may include, for example, a keyboard, a mouse, a joystick, a display (e.g., a touch screen display), a microphone, a speaker, or other input/output mechanisms.
  • a display e.g., a touch screen display
  • the display and the associated display circuitry may be configured to facilitate user control of at least some functions of the apparatus.
  • the power allocation determination circuitry 28 of example apparatus 20 may be any means or device embodied, partially or wholly, in hardware, a computer program product, or a combination of hardware and a computer program product, such as processor 22 implementing stored instructions to configure the example apparatus 20, or a hardware configured processor, that is configured to carry out the functions of the power allocation determination circuitry 28 as described herein.
  • the processor 22 includes, or controls, the power allocation determination circuitry 28.
  • the power allocation determination circuitry 28 may be, partially or wholly, embodied as processors similar to, but separate from processor 22. In this regard, the power allocation determination circuitry 28 may be in communication with the processor 22.
  • the power allocation determination circuitry 28 may, partially or wholly, reside on differing apparatuses such that some or all of the functionality of the power allocation determination circuitry 28 may be performed by a first apparatus, and the remainder of the functionality of the power allocation determination circuitry 28 may be performed by one or more other apparatuses.
  • the power allocation determination circuitry 28 may be configured to utilize a bargaining solution to determine a power allocation for each of two or more devices, such as UEs. See operation 40, As described above, the power allocation determination circuitry may determine the power allocations in accordance with Theorem 2 and equation (25) with the resulting solution, such as the Nash bargaining solution, being optimized as shown, for example, in Figure 3. Alternatively, the power allocation determination circuitry may determine the power allocations in accordance with the approximation provided by Corollary 3 and equation (26).
  • the power allocations may be provided to at least one device as shown in operation 42 of Figure 9.
  • the network entity may advise each of the devices, such as UE 1 and UE 2, of their respective power allocations.
  • the power allocation need only be provided to the other client devices, such as the other UEs.
  • the same device that determines the power allocations then utilizes the determined power allocations to relay communications signals of another device in accordance therewith.
  • each UE may independently determine the power allocations and thereafter cooperate with one another by relaying communications signals of the other in accordance with the determined power allocations.
  • operation 42 of Figure 9 may be optional in that the power allocations that are determined need not be provided to other devices in at least some embodiments.
  • the UEs may facilitate cooperation with each other by relaying the communications signals of the other UE by expending power in accordance with the power allocations in order to support cooperative communications. See operation 44 of Figure 9.
  • Each UE may be embodied in a variety of devices including, for example, a desktop computer, laptop computer, mobile terminal, mobile computer, mobile phone, portable digital assistant (PDA), pagers, mobile communication device, game device, digital camera/camcorder, audio/video player, television device, radio receiver, digital video recorder, positioning device, any combination thereof, and/or the like configured to establish a radio connection with a base station 14, access point or the like.
  • the UE is embodied as a mobile terminal, such as that illustrated in Figure 10.
  • Figure 10 illustrates a block diagram of a mobile terminal 50 representative of one embodiment of a UE in accordance with embodiments of the present invention.
  • the mobile terminal 50 illustrated and hereinafter described is merely illustrative of one type of UE that may implement and/or benefit from embodiments of the present invention and, therefore, should not be taken to limit the scope of the present invention. While certain embodiments of the UE are illustrated and will be hereinafter described for purposes of example, other types of UEs may employ embodiments of the present invention.
  • the mobile terminal 50 may include an antenna 52 (or multiple antennas 12) in communication with a transmitter 54 and a receiver 56.
  • the mobile terminal may also include one or more processors 58 that provides signals to and receives signals from the transmitter and receiver, respectively.
  • These signals may include signaling information in accordance with an air interface standard of an applicable cellular system, and/or any number of different wireline or wireless networking techniques, comprising but not limited to Wireless-Fidelity (Wi-Fi), wireless local access network (WLAN) techniques such as Institute of Electrical and Electronics Engineers (IEEE) 802.11 , 802.16, and/or the like.
  • these signals may include speech data, user generated data, user requested data, and/or the like.
  • the mobile terminal may be capable of operating with one or more air interface standards, communication protocols, modulation types, access types, and/or the like. More particularly, the mobile terminal may be capable of operating in accordance with various first generation (1G), second generation (2G), 2.5G, third-generation (3G) communication protocols, fourth-generation (4G) communication protocols, Internet Protocol Multimedia Subsystem (IMS) communication protocols (e.g., session initiation protocol (SIP)), and/or the like. For example, the mobile terminal may be capable of operating in accordance with 2G wireless communication protocols IS-136 (Time Division Multiple Access (TDMA)), Global System for Mobile communications (GSM), IS-95 (Code Division Multiple Access (CDMA)), and/or the like.
  • TDMA Time Division Multiple Access
  • GSM Global System for Mobile communications
  • CDMA Code Division Multiple Access
  • the mobile terminal may be capable of operating in accordance with 2.5G wireless communication protocols General Packet Radio Service (GPRS), Enhanced Data GSM Environment (EDGE), and/or the like. Further, for example, the mobile terminal may be capable of operating in accordance with 3G wireless communication protocols such as Universal Mobile Telecommunications System (UMTS), Code Division Multiple Access 200 (CDMA200), Wideband Code Division Multiple Access (WCDMA), Time Division-Synchronous Code Division Multiple Access (TD-SCDMA), and/or the like. The mobile terminal may be additionally capable of operating in accordance with 3.9G wireless communication protocols such as Long Term Evolution (LTE) or Evolved Universal Terrestrial Radio Access Network (E-UTRAN) and/or the like. Additionally, for example, the mobile terminal may be capable of operating in accordance with fourth-generation (4G) wireless communication protocols and/or the like as well as similar wireless communication protocols that may be developed in the future.
  • GPRS General Packet Radio Service
  • EDGE Enhanced Data GSM Environment
  • 3G wireless communication protocols such as Universal
  • NAMPS Narrow-band Advanced Mobile Phone System
  • TACS Total Access Communication System
  • mobile terminals may also benefit from embodiments of this invention, as should dual or higher mode phones (e.g., digital/analog or TDMA/CDMA/analog phones).
  • the mobile terminal 50 may be capable of operating according to Wireless Fidelity (Wi-Fi) or Worldwide Interoperability for Microwave Access (WiMAX) protocols.
  • Wi-Fi Wireless Fidelity
  • WiMAX Worldwide Interoperability for Microwave Access
  • the processor 58 may comprise circuitry for implementing audio/video and logic functions of the mobile terminal 50.
  • the processor 58 may comprise a digital signal processor device, a microprocessor device, processing circuitry, an analog-to-digital converter, a digital-to-analog converter, and/or the like. Control and signal processing functions of the mobile terminal may be allocated between these devices according to their respective capabilities.
  • the processor may additionally comprise an internal voice coder (VC) 58a, an internal data modem (DM) 58b, and/or the like.
  • the processor may comprise functionality to operate one or more software programs, which may be stored in memory.
  • the processor 58 may be capable of operating a connectivity program, such as a web browser.
  • the connectivity program may allow the mobile terminal 50 to transmit and receive web content, such as location-based content, according to a protocol, such as Wireless Application Protocol (WAP), hypertext transfer protocol (HTTP), and/or the like.
  • WAP Wireless Application Protocol
  • HTTP hypertext transfer protocol
  • the mobile terminal 50 may be capable of using a Transmission Control Protocol/Internet Protocol (TCP/IP) to transmit and receive web content across the internet or other networks.
  • TCP/IP Transmission Control Protocol/Internet Protocol
  • the mobile terminal 50 may also comprise a user interface including, for example, an earphone or speaker 60, a ringer 62, a microphone 64, a display 66, a user input interface, and/or the like, which may be operationally coupled to the processor 58.
  • the processor 58 may comprise user interface circuitry configured to control at least some functions of one or elements of the user interface, such as, for example, the speaker 60, the ringer 62, the microphone 64, the display 66, and/or the like.
  • the processor 58 and/or user interface circuitry comprising the processor 58 may be configured to control one or more functions of one or more elements of the user interface through computer program instructions (e.g., software and/or firmware, such as user interface software) stored on a memory accessible to the processor 58 (e.g., volatile memory 68, non-volatile memory 70, and/or the like).
  • the mobile terminal may comprise a battery for powering various circuits related to the mobile terminal, for example, a circuit to provide mechanical vibration as a detectable output.
  • the user input interface may comprise devices allowing the mobile terminal to receive data, such as a keypad 72, a touch display (not shown), a joystick (not shown), and/or other input device.
  • the keypad may comprise numeric (0-9) and related keys (#, *), and/or other keys for operating the mobile terminal.
  • the display and display circuitry may be configured to facilitate user control of at least some functions of the mobile terminal.
  • the mobile terminal 50 may also include one or more means for sharing and/or obtaining data.
  • the mobile terminal may comprise a short-range radio frequency (RF) transceiver and/or interrogator 74 so data may be shared with and/or obtained from electronic devices in accordance with RF techniques.
  • the mobile terminal may comprise other short-range transceivers, such as, for example, an infrared (IR) transceiver 76, a BluetoothTM (BT) transceiver 78 operating using BluetoothTM brand wireless technology developed by the BluetoothTM Special Interest Group, a wireless universal serial bus (USB) transceiver 80 and/or the like.
  • IR infrared
  • BT BluetoothTM
  • USB wireless universal serial bus
  • the BluetoothTM transceiver 78 may be capable of operating according to ultra-low power BluetoothTM technology (e.g., WibreeTM) radio standards.
  • the mobile terminal 50 and, in particular, the short-range transceiver may be capable of transmitting data to and/or receiving data from electronic devices within a proximity of the mobile terminal, such as within 10 meters, for example.
  • the mobile terminal may be capable of transmitting and/or receiving data from electronic devices according to various wireless networking techniques, including Wireless Fidelity (Wi-Fi), WLAN techniques such as IEEE 802.11 techniques, IEEE 802.16 techniques, and/or the like.
  • Wi-Fi Wireless Fidelity
  • WLAN techniques such as IEEE 802.11 techniques, IEEE 802.16 techniques, and/or the like.
  • the mobile terminal 50 may comprise memory, such as a subscriber identity module (SIM) 82, a removable user identity module (R-UIM), and/or the like, which may store information elements related to a mobile subscriber. In addition to the SIM, the mobile terminal may comprise other removable and/or fixed memory.
  • the mobile terminal 50 may include volatile memory 68 and/or non-volatile memory 70.
  • volatile memory 68 may include Random Access Memory (RAM) including dynamic and/or static RAM, on-chip or off-chip cache memory, and/or the like.
  • RAM Random Access Memory
  • Non-volatile memory 70 which may be embedded and/or removable, may include, for example, read-only memory, flash memory, magnetic storage devices (e.g., hard disks, floppy disk drives, magnetic tape, etc.), optical disc drives and/or media, non-volatile random access memory (NVRAM), and/or the like. Like volatile memory 68, non-volatile memory 70 may include a cache area for temporary storage of data.
  • the memories may store one or more software programs, instructions, pieces of information, data, and/or the like which may be used by the mobile terminal for performing functions of the mobile terminal.
  • the memories may comprise an identifier, such as an international mobile equipment identification (IMEI) code, capable of uniquely identifying the mobile terminal 50.
  • IMEI international mobile equipment identification
  • the UE and, more particularly, the processor 58 may be configured to access the respective power allocation that has previously been determined and provided to the UE, at least in instances in which the power allocation was determined by another device, such as a base station 14 or other network entity or another UE. See operation 90. Thereafter, the processor may direct that communications signals of another UE be relayed, such as to a base station, with the power of the relayed signals being defined in accordance with the power allocation. See operation 92. For example, the processor may direct that the communications signals of the other UE be relayed at a power level equal to the power allocation.
  • the processor may also rely upon the other UE to relay communications signals that have been transmitted by the UE, such as under the direction and/or control of the processor, with the other UE correspondingly relaying the communications signals at a power level in accordance with, e.g., equal to, a respective power allocation.
  • the UEs may engage in cooperative communications with the respective power allocations defined in such a manner that each UE benefits not only from the increased reliability of communications with the base station, access point or the like, but also due to a reduction in battery power consumption attributable, for example, to a reduction in the number of communications signals that much be retransmitted to a base station, access point or the like in comparison to more conventional communications techniques.
  • Figures 9 and 11 illustrate flowcharts of example systems, methods, and/or computer program products according to example embodiments of the invention. It will be understood that each block or operation of the flowcharts, and/or combinations of blocks or operations in the flowcharts, can be implemented by various means. Means for implementing the blocks or operations of the flowcharts, combinations of the blocks or operations in the flowchart, or other functionality of example embodiments of the present invention described herein may include hardware, and/or a computer program product including a computer-readable storage medium having one or more computer program code instructions, program instructions, or executable computer-readable program code instructions stored therein.
  • program code instructions may be stored on a memory device, such as memory devices 24, 68 or 70, of an example apparatus, such as example apparatus 20 or 50, and executed by a processor, such as the processor 22 or 58, and/or the power allocation determination circuitry 28.
  • any such program code instructions may be loaded onto a computer or other programmable apparatus (e.g., processor 22, memory device 24, power allocation determination circuitry 28, processor 58, memory devices 68 or 70) from a computer-readable storage medium to produce a particular machine, such that the particular machine becomes a means for implementing the functions specified in the flowcharts' block(s) or operation(s).
  • program code instructions may also be stored in a computer-readable storage medium that can direct a computer, a processor, or other programmable apparatus to function in a particular manner to thereby generate a particular machine or particular article of manufacture.
  • the instructions stored in the computer-readable storage medium may produce an article of manufacture, where the article of manufacture becomes a means for implementing the functions specified in the flowcharts' block(s) or operation(s).
  • the program code instructions may be retrieved from a computer- readable storage medium and loaded into a computer, processor, or other programmable apparatus to configure the computer, processor, or other programmable apparatus to execute operations to be performed on or by the computer, processor, or other programmable apparatus.
  • Retrieval, loading, and execution of the program code instructions may be performed sequentially such that one instruction is retrieved, loaded, and executed at a time. In some example embodiments, retrieval, loading and/or execution may be performed in parallel such that multiple instructions are retrieved, loaded, and/or executed together. Execution of the program code instructions may produce a computer-implemented process such that the instructions executed by the computer, processor, or other programmable apparatus provide operations for implementing the functions specified in the flowcharts' block(s) or operation(s).
  • execution of instructions associated with the blocks or operations of the flowchart by a processor, or storage of instructions associated with the blocks or operations of the flowcharts in a computer-readable storage medium support combinations of operations for performing the specified functions. It will also be understood that one or more blocks or operations of the flowcharts, and combinations of blocks or operations in the flowcharts, may be implemented by special purpose hardware-based computer systems and/or processors which perform the specified functions, or combinations of special purpose hardware and program code instructions.
  • embodiments of the present invention may determine power allocations in instances in which the channel state information is unknown and/or in instances that rely upon a different channel model. Further, although at least some of the foregoing examples assumed that the UEs utilized full power for its own transmissions, other embodiments need not make this same assumption. Still further, other embodiments of the present invention may define the utilities in terms of outage probability instead of achievable rate as described above.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention se rapporte à un procédé, à un appareil et à un produit programme d'ordinateur qui sont adaptés pour déterminer une allocation de puissance appropriée pour chacun d'au moins deux dispositifs devant être utilisés ensemble pour relayer des données de l'autre dispositif dans le cadre d'une technique de communications coopératives. La présente invention se rapporte également à un procédé, à un appareil et à un produit programme d'ordinateur qui sont adaptés pour répondre aux allocations de puissances qui ont été déterminées, puis pour coopérer avec l'autre dispositif pour relayer les signaux de communication de l'autre dispositif en élargissant la puissance conformément à l'allocation de puissance. Les allocations de puissance peuvent être déterminées sur la base d'une solution de marchandage, comme une solution de marchandage de Nash par exemple.
PCT/IB2009/052696 2009-06-23 2009-06-23 Procédé et appareil d'allocation de puissance pour des communications coopératives Ceased WO2010150050A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/IB2009/052696 WO2010150050A1 (fr) 2009-06-23 2009-06-23 Procédé et appareil d'allocation de puissance pour des communications coopératives

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/IB2009/052696 WO2010150050A1 (fr) 2009-06-23 2009-06-23 Procédé et appareil d'allocation de puissance pour des communications coopératives

Publications (1)

Publication Number Publication Date
WO2010150050A1 true WO2010150050A1 (fr) 2010-12-29

Family

ID=41694693

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2009/052696 Ceased WO2010150050A1 (fr) 2009-06-23 2009-06-23 Procédé et appareil d'allocation de puissance pour des communications coopératives

Country Status (1)

Country Link
WO (1) WO2010150050A1 (fr)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014026375A1 (fr) * 2012-08-17 2014-02-20 华为技术有限公司 Procédé et appareil de transmission de données de liaison descendante d'une communication coopérative à plusieurs utilisateurs
KR101405841B1 (ko) 2012-12-12 2014-07-14 이화여자대학교 산학협력단 동적 네트워크에서 내쉬 협상 해법의 선형 변환 기반 저복잡도 알고리즘을 이용하는 네트워크 자원 할당 방법 및 시스템
CN104168604A (zh) * 2014-08-28 2014-11-26 重庆邮电大学 协作通信中一种基于纳什均衡的传输策略方法
CN104918134A (zh) * 2015-04-16 2015-09-16 上海大学 一种基于纳什议价的交互式多视点视频的数据包调度方法
EP2916611A4 (fr) * 2012-11-22 2016-03-02 Huawei Tech Co Ltd Procédé, dispositif et système de communication à courte distance
CN109361482A (zh) * 2018-09-04 2019-02-19 中国人民解放军陆军工程大学 一种基于非合作博弈确定多用户选择信道感知顺序的方法
US10547354B2 (en) 2015-12-30 2020-01-28 Idac Holdings, Inc. Methods, systems and devices for wireless transmit/receive unit cooperation
CN113630456A (zh) * 2020-08-05 2021-11-09 北京航空航天大学 基于拉格朗日对偶分解和纳什议价博弈的域间合作缓存方法

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030026222A1 (en) * 2001-08-02 2003-02-06 Kotzin Michael D. Method and apparatus for aggregation of wireless resources of proximal wireless units to facilitate diversity signal combining
US20050255808A1 (en) * 2004-03-29 2005-11-17 Nokia Corporation Method and apparatus to provide power control with finite rate feedback for cooperative relay networks

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030026222A1 (en) * 2001-08-02 2003-02-06 Kotzin Michael D. Method and apparatus for aggregation of wireless resources of proximal wireless units to facilitate diversity signal combining
US20050255808A1 (en) * 2004-03-29 2005-11-17 Nokia Corporation Method and apparatus to provide power control with finite rate feedback for cooperative relay networks

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
GUOPENG ZHANG ET AL: "Fair resource sharing for cooperative relay networks using nash bargaining solutions", IEEE COMMUNICATIONS LETTERS, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 13, no. 6, 1 June 2009 (2009-06-01), pages 381 - 383, XP011262982, ISSN: 1089-7798 *
ZHAOYANG ZHANG ET AL: "A Cooperation Strategy Based on Nash Bargaining Solution in Cooperative Relay Networks", IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 57, no. 4, 1 July 2008 (2008-07-01), pages 2570 - 2577, XP011224337, ISSN: 0018-9545 *

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10201003B2 (en) 2012-08-17 2019-02-05 Huawei Technologies Co., Ltd. Method and device for transmitting downlink data in multiple UEs cooperative communication
WO2014026375A1 (fr) * 2012-08-17 2014-02-20 华为技术有限公司 Procédé et appareil de transmission de données de liaison descendante d'une communication coopérative à plusieurs utilisateurs
EP2916611A4 (fr) * 2012-11-22 2016-03-02 Huawei Tech Co Ltd Procédé, dispositif et système de communication à courte distance
US9585187B2 (en) 2012-11-22 2017-02-28 Huawei Technologies Co., Ltd. Short range communications method, device, and system
US9839062B2 (en) 2012-11-22 2017-12-05 Huawei Technologies Co., Ltd. Short range communications method, device, and system
KR101405841B1 (ko) 2012-12-12 2014-07-14 이화여자대학교 산학협력단 동적 네트워크에서 내쉬 협상 해법의 선형 변환 기반 저복잡도 알고리즘을 이용하는 네트워크 자원 할당 방법 및 시스템
CN104168604A (zh) * 2014-08-28 2014-11-26 重庆邮电大学 协作通信中一种基于纳什均衡的传输策略方法
CN104918134A (zh) * 2015-04-16 2015-09-16 上海大学 一种基于纳什议价的交互式多视点视频的数据包调度方法
CN104918134B (zh) * 2015-04-16 2018-01-02 上海大学 一种基于纳什议价的交互式多视点视频的数据包调度方法
US10547354B2 (en) 2015-12-30 2020-01-28 Idac Holdings, Inc. Methods, systems and devices for wireless transmit/receive unit cooperation
CN109361482A (zh) * 2018-09-04 2019-02-19 中国人民解放军陆军工程大学 一种基于非合作博弈确定多用户选择信道感知顺序的方法
CN113630456A (zh) * 2020-08-05 2021-11-09 北京航空航天大学 基于拉格朗日对偶分解和纳什议价博弈的域间合作缓存方法
CN113630456B (zh) * 2020-08-05 2022-07-05 北京航空航天大学 基于拉格朗日对偶分解和纳什议价博弈的域间合作缓存方法

Similar Documents

Publication Publication Date Title
Zhao et al. A novel framework of three-hierarchical offloading optimization for MEC in industrial IoT networks
Guo et al. Resource allocation for low-latency vehicular communications: An effective capacity perspective
Sun et al. D2D-based V2V communications with latency and reliability constraints
WO2010150050A1 (fr) Procédé et appareil d'allocation de puissance pour des communications coopératives
Zhou et al. Game‐theoretic approach to energy‐efficient resource allocation in device‐to‐device underlay communications
Zhou et al. Iterative energy-efficient stable matching approach for context-aware resource allocation in D2D communications
CN111314889A (zh) 车联网中基于移动边缘计算的任务卸载与资源分配方法
Militano et al. Trust-based and social-aware coalition formation game for multihop data uploading in 5G systems
Quer et al. Inter-network cooperation exploiting game theory and Bayesian networks
Khan et al. Resource allocation for energy efficiency optimization in uplink–downlink decoupled 5G heterogeneous networks
CN107613556A (zh) 一种基于功率控制的全双工d2d干扰管理方法
He et al. Resource allocation schemes based on coalition games for vehicular communications
CN103249157A (zh) 不完美csi条件下的基于跨层调度机制的资源分配方法
Zamani et al. Optimizing weighted-sum energy efficiency in downlink and uplink NOMA systems
Chen et al. Age of information for short-packet relay communications in cognitive-radio-based Internet of Things with outdated channel state information
Liu et al. DDQN-based centralized spectrum allocation and distributed power control for V2X communications
Li et al. UCB‐Based Route and Power Selection Optimization for SDN‐Enabled Industrial IoT in Smart Grid
Della Penda et al. Potential games for subcarrier allocation in multi-cell networks with D2D communications
Huang et al. Energy-efficient resource allocation for machine-type communications in smart grid based on a matching with externalities approach
Beitollahi et al. Multi-frame scheduling for federated learning over energy-efficient 6g wireless networks
Ma et al. Interference management for multimedia femtocell networks with coalition formation game
Yu et al. Resource allocation in vehicular networks based on federated multi-agent reinforcement learning
CN105530203B (zh) D2d通信链路的接入控制方法及系统
Zia et al. Multi-agent RL based user-centric spectrum allocation scheme in D2D enabled hetnets
CN105916197B (zh) D2d网络中社会信用驱动的功率自适应方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09786445

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09786445

Country of ref document: EP

Kind code of ref document: A1