# Patent

## Title
Optimizing downlink throughput with user cooperation and scheduling in adaptive cellular networks

## Abstract

User cooperation is an emerging transmission framework where users act as relays of each other to provide extra diversity paths for better overall performance. In various embodiments, systems and methods for transmitting data from a basestation to a mobile device in an adaptive communications network including user cooperation are provided. Among various embodiments, relaying is performed according to a time division duplex (TDD) system according to either a downlink-assisted relaying (DAR) which performs a relaying operation in a defined supplemental downlink timeslot or according to an uplink-assisted relaying (UAR) which performs a relaying operation in a defined supplemental uplink timeslot. Among other embodiments, relay transmissions according to a max-throughput scheduling algorithm which achieves a maximum system throughput without imposing any fairness constraints on users or according to a round-robin scheduling algorithm which achieves absolute fairness in terms of delays among the considered users. The downlink throughput is optimized from the basestation to the mobile device utilizing either amplify-and-forward (AF) or decode-and-forward (DF) cooperation protocols.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application claims priority to U.S. Provisional Application Ser. No. 60/894,208, filed on Mar. 10, 2007, entitled “OPTIMIZING DOWNLINK THROUGHPUT WITH USER COOPERATION AND SCHEDULING IN ADAPTIVE CELLULAR NETWORKS”, the entirety of which is incorporated herein by reference.


TECHNICAL FIELD
The subject disclosure relates to optimizations for downlink throughput with user cooperation and scheduling in adaptive cellular networks.
BACKGROUND
User cooperation has been of growing interest recently where extra spatial diversity can be achieved by allowing users to relay the messages of each other to the destination. Conventionally, user cooperation has been proposed for improving the capacity of a cellular network and has been closely related to transmission in a relay channel. Since then, on top of the idea of a general relay network, several efficient cooperative protocols have developed. For instance, multiple cooperating users with multiple antennas have been considered; however, all of the existing systems focus only on the performance and operation of fixed source and destination pairs without considering the higher-level system perspective. For instance, the effects of user scheduling have not been considered. In addition, the conventional relaying protocols often require dedicated relaying timeslots, potentially incurring a spectral loss.
Accordingly, it would be desirable to explore different scheduling strategies on user cooperation for a conventional cellular network to form more optimal strategies. The above-described background concerning deficiencies of current designs for user cooperation is merely intended to provide an overview of some of the problems of today's designs, and is not intended to be exhaustive. Other problems with the state of the art and corresponding benefits of the invention may become further apparent upon review of the following description of various non-limiting embodiments.
SUMMARY
A simplified summary is provided herein to help enable a basic or general understanding of various aspects of exemplary, non-limiting embodiments that follow in the more detailed description and the accompanying drawings. This summary is not intended, however, as an extensive or exhaustive overview. The sole purpose of this summary is to present some concepts related to the various exemplary non-limiting embodiments in a simplified form as a prelude to the more detailed description that follows.
User cooperation is provided for an emerging transmission framework where users act as relays for each other to provide extra diversity paths for better overall performance. In various embodiments, data is transmitted from a basestation to a mobile device in an adaptive communications network including user cooperation. The relaying is performed according to a time division duplex (TDD) system according to either a downlink-assisted relaying (DAR) which performs a relaying operation in a defined supplemental downlink timeslot or according to an uplink-assisted relaying (UAR) which performs a relaying operation in a defined supplemental uplink timeslot.
In exemplary, non-limiting embodiments, relay transmissions are conducted according to a max-throughput scheduling algorithm that achieves a maximum system throughput without imposing any fairness constraints on users or according to a round-robin scheduling algorithm that achieves absolute fairness in terms of delays among the considered users. Further, the downlink throughput can be optimized from the basestation to the mobile device utilizing either amplify-and-forward (AF) or decode-and-forward (DF) cooperation protocols.



BRIEF DESCRIPTION OF THE DRAWINGS
The system and methods for optimizing downlink throughput are further described with reference to the accompanying drawings in which:
FIG. 1 illustrates a high-level block diagram of a communications system transmitting from a basestation to a user and set of relay users;
FIG. 2 is a flowchart of an exemplary non-limiting method of optimizing downlink throughput for a communications system;
FIG. 3 illustrates various aspects of communications employing conventional timeslot splitting relaying according to various embodiments described herein;
FIG. 4 illustrates various aspects of communications employing downlink-assisted relaying according to various embodiments;
FIG. 5 illustrates various aspects of communications employing uplink-assisted relaying according to various embodiments;
FIG. 6 illustrates various exemplary aspects of using the AF protocol according to various embodiments;
FIG. 7 illustrates various aspects of round-robin scheduling when user cooperation is enabled according to various embodiments;
FIG. 8 demonstrates the effect of different placement of relaying timeslots according to different embodiments;
FIG. 9 is a flow diagram of a first, non-limiting representative embodiment for relaying and scheduling according to optimal algorithms;
FIG. 10 is a flow diagram of a second, non-limiting representative embodiment for relaying and scheduling according to optimal algorithms;
FIG. 11 is a block diagram of an illustrative embodiment for relaying and scheduling according to various embodiments described herein;
FIG. 12 illustrates an overview of an exemplary, non-limiting network environment suitable for service by various embodiments; and
FIG. 13 is a block diagram of an exemplary, non-limiting operating environment in which various aspects described herein can function.



DETAILED DESCRIPTION
Overview
As mentioned in the background, user cooperation is an emerging transmission framework where users act as relays for each other to provide extra diversity paths for better overall performance than without the extra diversity paths. However, pre-existing approaches focus only on the physical-layer properties and operations of a fixed pair of source and destination at a particular time instant. Thus, improved scheduling strategies are desired over current user cooperation techniques employed for conventional cellular networks.
In consideration of the deficiencies of the state of the art as described in the background, in various embodiments described herein, downlink throughput is optimized for an adaptive cellular network with both user cooperation and scheduling. Several commonly used cooperation strategies are evaluated under different fairness constraints and the DF protocol is shown not to be able to deliver any capacity gain over its non-cooperative counterpart when users are scheduled for maximizing the overall system throughput.
In another aspect, the placement of relaying timeslots, which directly affects the performance of user cooperation for both adaptive and non-adaptive networks, is investigated over existing frame structures so that user cooperation can be enabled in conventional networks without significant modification. In this regard, multiple relays can be supported in different timeslots concurrently with other transmissions through interference cancellation and scheduling, and the selection of corresponding optimal relays and allocation of optimal power are derived herein.
In one embodiment, a time division duplex (TDD) system is implemented since TDD systems allow a flexible asymmetric downlink-to-uplink assignment ratio that is suitable for future generation wireless systems supporting multimedia services and high-speed data transfers. Estimation of channel state information for the transmitter (CSIT) is also facilitated by exploiting the channel reciprocity that provides highly-rewarding adaptive scheduling and resource allocation.
The downlink throughput can be optimized under two commonly adopted cooperation protocols, AF and DF, with different fairness concerns. The optimal placement of relaying timeslots in conventional frame structure is also determined so that user cooperation can be easily incorporated into existing systems, in contrast to systems where an additional timeslot is dedicated to message relaying. Multiple relay users are considered and the corresponding optimal relay selection and power allocation are derived for a given destination.
In other embodiments described herein, the AF protocol is implemented to achieve a capacity gain when fairness is not considered and users are scheduled for achieving the maximum theoretical system throughput, though it is shown that such gain is marginal and benefits mainly distant users. Instead, in another embodiment, the system throughput of a simple round-robin scheduling algorithm is implemented, which maintains absolute fairness in terms of delay and demonstrates a significant improvement approaching that of the non-cooperative approach aiming at maximizing the system throughput when users of comparable average channel gains are considered.
FIG. 1 is an exemplary non-limiting block diagram illustrating a basestation 100 for transmitting data to a mobile device 110, i.e., target user, including user cooperation in an adaptive communications network. With relay users 120, 122, etc., data can reach target user 110 either directly from basestation 100 or indirectly via relay users 120, 122, etc. Various embodiments of the transmission of data in accordance with optimized downlink throughput with user cooperation and scheduling are now further described with respect to various methodologies elaborated upon below.
FIG. 2 is an exemplary non-limiting flow diagram illustrating aspects of processes for transmitting data from a basestation to a mobile device including user cooperation in an adaptive communications network. In no particular order, at 200, relaying is performed according to a time division duplex (TDD) system. As described in more detail below, either downlink-assisted relaying (DAR) is performed, which performs a relaying operation in a defined supplemental downlink timeslot, or uplink-assisted relaying (UAR) is performed, which performs a relaying operation in a defined supplemental uplink timeslot. At 210, relay transmissions are scheduled either according to a max-throughput scheduling algorithm, which achieves a maximum system throughput without imposing any fairness constraints on users, or according to a round-robin scheduling algorithm, which achieves absolute fairness in terms of delays among the considered users. At 220, downlink throughput from the basestation to the mobile device is optimized utilizing either AF or DF cooperation protocols. At 230, power allocation is optimized for a given destination.
As a roadmap for the more detailed description that follows, mathematical models and properties of the cooperation protocols are first described. Then, the placement of relaying timeslots in a frame and the impacts of scheduling algorithms are investigated. Next, optimal relay selection and power allocation algorithms are derived and set forth. Further, performance evaluation and discussions are given to show the benefits of the various embodiments described herein and lastly, some exemplary, non-limiting operating environments and apparatus that can employ the techniques for optimizing downlink throughput are described.
Cooperation Protocols
With respect to cooperation protocols, for supplemental context, the mathematical models of the AF and DF protocols and their properties are now described. As a note, orthogonal relay channels are assumed available at this stage for the multiple-relay scenario that will be discussed in more detail below. In the following, the basestation S transmits a message xi at power PS to the target user i and the relay user j in the first timeslot. In the second timeslot, the relay user j will forward its received message copy {circumflex over (x)}j,i at power Pj(R) to user i. If there are more relay users, they will forward sequentially their received message to user i in the next timeslots in the same way. The received signals by user i in the first (direct path) and second (relay path) timeslots are characterized by

(S−i)yi=√{square root over (|hi|2PS)}xi+ni  Eqn. 1

(S−j−i)yj,i=√{square root over (|hj,i|2Pj(R))}{circumflex over (x)}j,i+nj,i  Eqn. 2

where hi and hj,i, capture the equivalent fading, including both large-scale and small-scale fading, experienced by the direct path (S−i) and inter-user (S−j−i) channels. ni and nj,i are the background additive white Gaussian noise (AWGN) terms with variance No/2 per complex dimension.

In the AF protocol, {circumflex over (x)}j,i in Eqn. 2 is normalized by

{circumflex over (x)}j,i=(√{square root over (|hj|2PS)}xi+nj)/√{square root over (|hj|2PS+No)}.  Eqn. 3

Equivalently, Eqn. 2 can be expressed as




  
    
      
        
          y
          
            j
            ,
            i
          
        
        =
        
          
            
              
                
                  
                    
                    
                      h
                      
                        j
                        ,
                        i
                      
                    
                    
                  
                  2
                
                ⁢
                
                  P
                  j
                  
                    (
                    R
                    )
                  
                
              
            
            ⁢
            
              
                
                  SNR
                  j
                
                
                  
                    SNR
                    j
                  
                  +
                  1
                
              
            
            ⁢
            
              x
              i
            
          
          +
          
            
              
                
                  
                    
                    
                      h
                      
                        j
                        ,
                        i
                      
                    
                    
                  
                  2
                
                ⁢
                
                  P
                  j
                  
                    (
                    R
                    )
                  
                
              
            
            ⁢
            
              1
              
                
                  
                    SNR
                    j
                  
                  +
                  1
                
              
            
            ⁢
            
              
                n
                ^
              
              j
            
          
          +
          
            n
            
              j
              ,
              i
            
          
        
      
    
    
      
        Eqn
        .
        
          
        
        ⁢
        4
      
    
  




where SNRj specifies the received signal-to-noise ratio (SNR) of the (S−j) basestation-relay channel and {circumflex over (n)}j is a normalized AWGN term. From Eqn. 4, the SNR of the relayed path (S−j−i) can then be expressed as





  
    
      
        
          SNR
          
            j
            ,
            i
          
          
            (
            R
            )
          
        
        =
        
          
            
              
                SNR
                
                  j
                  ,
                  i
                
              
              ⁡
              
                (
                
                  a
                  j
                
                )
              
            
            
              
                
                  SNR
                  
                    j
                    ,
                    i
                  
                
                ⁡
                
                  (
                  
                    1
                    -
                    
                      a
                      j
                    
                  
                  )
                
              
              +
              1
            
          
          =
          
            
              
                SNR
                j
              
              ⁡
              
                (
                
                  b
                  
                    j
                    ,
                    i
                  
                
                )
              
            
            
              
                
                  SNR
                  j
                
                ⁡
                
                  (
                  
                    1
                    -
                    
                      b
                      
                        j
                        ,
                        i
                      
                    
                  
                  )
                
              
              +
              1
            
          
        
      
    
    
      
        Eqn
        .
        
          
        
        ⁢
        5
      
    
  




where





  
    0
    <
    
      a
      j
    
  
  =
  
    
      
        
          SNR
          j
        
        
          
            SNR
            j
          
          +
          1
        
      
      <
      
        1
        ⁢
        
          
        
        ⁢
        and
        ⁢
        
          
        
        ⁢
        0
      
      <
      
        b
        
          j
          ,
          i
        
      
    
    =
    
      
        
          SNR
          
            j
            ,
            i
          
        
        
          
            SNR
            
              j
              ,
              i
            
          
          +
          1
        
      
      <
      1.
    
  




Therefore, the SNR of the relayed path is upper-bounded by

0<SNRj,i(R)<min(SNRj,SNRj,i)  Eqn. 6

which essentially specifies the bottleneck of the protocol. In general, when multiple relays are used, the relayed paths and the direct path can be combined using maximum-ratio combining (MRC) and the equivalent SNR of the AF protocol is therefore





  
    
      
        
          
            (
            AF
            )
          
          ⁢
          
            :
          
          ⁢
          
            
          
          ⁢
          
            SNR
            i
            
              equiv
              .
            
          
        
        =
        
          
            SNR
            i
          
          +
          
            
              ∑
              
                
                  
                    
                      
                        j
                        =
                        1
                      
                      ,
                    
                  
                
                
                  
                    
                      j
                      ≠
                      i
                    
                  
                
              
              K
            
            ⁢
            
              
            
            ⁢
            
              
                ρ
                
                  j
                  ,
                  i
                
              
              ⁢
              
                SNR
                
                  j
                  ,
                  i
                
                
                  (
                  R
                  )
                
              
            
          
        
      
    
    
      
        Eqn
        .
        
          
        
        ⁢
        7
      
    
  




in a K-user system with ρj,i=1 referring to the case where user j acts as a relay for user i and ρj,i=0 otherwise.

In the DF protocol, the relay users first attempt to decode the message. On successful decoding, the relays will re-encode the message and then forward it to the destination user. Otherwise, no messages are relayed. The equivalent SNR can be derived from Eqn. 7 by letting SNRj=∞ if SNRj≧SNRi and SNRj=0 otherwise. That is,




  
    
      
        
          
            (
            DF
            )
          
          ⁢
          
            :
          
          ⁢
          
            
          
          ⁢
          
            
              SNR
              i
              
                equiv
                .
              
            
            ⁡
            
              (
              
                R
                i
                target
              
              )
            
          
        
        =
        
          
            SNR
            i
          
          +
          
            
              ∑
              
                
                  
                    
                      
                        j
                        =
                        1
                      
                      ,
                    
                  
                
                
                  
                    
                      j
                      ≠
                      i
                    
                  
                
              
              K
            
            ⁢
            
              
            
            ⁢
            
              
                I
                ⁡
                
                  (
                  
                    
                      SNR
                      j
                    
                    >
                    
                      SNR
                      ⁡
                      
                        (
                        
                          R
                          i
                          target
                        
                        )
                      
                    
                  
                  )
                
              
              ⁢
              
                ρ
                
                  j
                  ,
                  i
                
              
              ⁢
              
                SNR
                
                  j
                  ,
                  i
                
              
            
          
        
      
    
    
      
        Eqn
        .
        
          
        
        ⁢
        8
      
    
  




where I(.) is an indicator function and SNR(Ritarget) refers to the minimum receive SNR required for supporting the target rate Ritarget. We note that the actual throughput of the DF protocol may be smaller than that corresponding to the equivalent SNR specified in Eqn. 8. Additional details regarding the AF and DF protocols may also become apparent upon reviewing the description pertaining to the various embodiments discussed below.

Downlink Throughput Optimization
As mentioned, in one aspect, the subject disclosure pertains to the optimization, or a good placement, of relaying timeslots in a conventional frame structure so that existing networks can benefit from user cooperation without modifying their current frame structure. Then, the optimization of downlink throughput is presented with different fairness concerns under the AF and DF cooperation protocols. In various embodiments, a synchronous and half-duplex TDD network is assumed where downlink and uplink timeslots are typically allocated in bursts with a guard interval of at least the worst-case round-trip delay placed between the two types of timeslots.
With respect to the placement of relaying timeslots, timeslot-splitting relaying (TSR) 300 can be adopted for exploiting user cooperation and is described with reference to FIG. 3 including timing for communications among a basestation 302, a destination user 304 and a relay user 306. Instead of using another full timeslot for the relaying purpose, the slot is split into two sub-slots where the source transmits in the first one and the relay 310 in the second one. However, due to path delay among users in a cellular network, there is still partial interference 312 between the adjacent timeslots, as illustrated. Complete elimination of interference 312 is only possible if extra guard intervals are introduced.
In an adaptive transmission system where CSIT is available, there are other more efficient ways of achieving user cooperation where a higher cooperation gain is delivered without introducing extra overhead and without modifying the original frame structure. Conventional systems that can accommodate cooperative protocols can incorporate the techniques described herein. Furthermore, two more potential placements of the relaying timeslots are also investigated. One of them performs the relaying operation in a new downlink timeslot while the other one performs the relaying operation in an uplink timeslot. The relaying operations involve various degrees of interference cancellation at the destination device of any coexisting transmissions. For convenience, the previous method is referred to herein as downlink-assisted relaying (DAR) and the second one as uplink-assisted relaying (UAR).
FIG. 4 illustrates exemplary timing for DAR communications 400 among a basestation 402, a destination user 404 and a relay user 406. The relaying 410 of DAR 400 results in interference 412, as illustrated, where relaying is performed in a specifically defined downlink timeslot.
FIG. 5 illustrates exemplary timing for UAR communications 500 among a basestation 502, a destination user 504 and a relay user 506. The relaying 510 of UAR 500 is performed in a specifically defined downlink timeslot. While UAR 500 results in two sets of interference 512, 514, as illustrated, as described in more detail below, interference 514 can be eliminated with optimal scheduling.
For comparison of FIGS. 3-5, UAR provides a higher net capacity gain than TSR and DAR in TDD networks with CSIT. These concepts can be further divided into three parts that include isolated cooperation gain, interferences imposed on other concurrent transmission by the relay and interferences caused to the relayed message by other concurrent transmission.
Isolated cooperation gain is defined as the pure gain achieved by the three candidates without taking into consideration their costs (interferences). Since UAR and DAR utilize a full timeslot instead of only a half in TSR, both of them achieve superior performance gain compared to the TSR. This is characterized by




  
    
      
        
          log
          (
          
            1
            +
            
              SNR
              i
              equiv
            
          
          )
        
        ≥
        
          
            1
            c
          
          ⁢
          
            log
            (
            
              1
              +
              
                c
                ⁢
                
                  
                
                ⁢
                
                  SNR
                  i
                  equiv
                
              
            
            )
          
        
      
    
    
      
        Eqn
        .
        
          
        
        ⁢
        9
      
    
  




where c is the number of sub-slots a timeslot is divided into for a general TSR strategy.

As mentioned, FIGS. 3, 4 and 5 illustrate three potential relaying timeslots positions for comparison with one another: conventional timeslot-splitting relaying (TSR), downlink-assisted relaying and uplink-assisted relaying, respectively.
With respect to interferences to concurrent transmissions, as shown in FIG. 3, TSR 300 is observed to possess an advantage as it only causes partial interference to the adjacent timeslot. In contrast, at first glance, UAR 500 appears to perform less well than the other two. However, as discussed below, this does not reflect the whole picture and generally, UAR 500 performs the best among all three strategies.
Considering the DF protocol and the UAR strategy 500 as illustrated in FIG. 5, in the interfered uplink timeslot, the relay user j 506 forwards the message xi to the destination user i 504. At the same time, another user k 508 transmits its own uplink message xkUL to the basestation S 502. The received message at the basestation 502 is given by:

ykUL=√{square root over (|hk|2Pk)}xkUL+g(√{square root over (|hj|2Pj(R))}xi)+nS  Eqn. 10a

where g(√{square root over (|hj|2Pj(R))}xi) represents the interference received from user j 506 on user k 508's message. By constraining the relaying operation to be synchronous to the frame timing, g(√{square root over (|hj|2Pj(R))}xi) can simply be represented by √{square root over (|hj|2Pj(R))}xi. Since xi, hj and Pj(R) are known at the basestation, the interference can be eliminated, resulting in an interference-free received message for user k 508:

ykUL=√{square root over (|hk|2Pk)}xkUL+nS  Eqn. 10b

Even if the AF protocol is used, the interference can still be eliminated but with a small extra noise term left in user k 508's received message. For TSR and DAR, in general, the received downlink message at destination user k can be represented in the same form as:

ykDL=√{square root over (|hk|2PS)}xk+g(√{square root over (|hj,k|2Pj(R))}xi)+nk  Eqn. 11

where g(√{square root over (|hj,k|2Pj(R))}xi) represents the resultant partial interference after some filtering process converting the received analog messages into the digital domain. As user k does not have the information of xi, Pj(R) and hj,k, the interference cannot be eliminated. However, with proper scheduling, signaling and introduction of a guard interval, the missing information can be obtained by user k and a similar interference cancellation technique can be adopted in DAR as well.

A similar situation applies to the AF protocol. In FIGS. 3 and 4, a special case is shown where user i suffers self-interference from its own previous downlink message relayed by user j. However, by scheduling a different user in the consecutive timeslot who is far away from the previous one, the interference can be significantly reduced by the large-scale fading such as path loss.
With respect to interferences from concurrent transmissions, only the UAR scheme reduces the interferences significantly through careful scheduling where the selected concurrent uplink user is far away from the destination user who is receiving messages from its relay. In TSR and DAR, the concurrent transmissions are from the basestation S instead, which has an omnidirectional transmission. Therefore, the interference is reduced by adjusting the basestation transmit power, essentially limiting the coverage of any coexisting transmission.
The three scenarios discussed above, TSR, DAR and UAR are summarized in Table 1 below. By considering the three properties above, UAR is shown to be a good candidate for its high cooperation gain, minimal interference to concurrent transmissions for whatever relay transmit power levels, and negligible interferences from other users through scheduling. In essence, this implies that multiple orthogonal relay channels using full timeslots can be achieved through UAR in a TDD network with CSIT available.







TABLE 1







Comparison of the Three Potential Relaying Timeslots Positions










Interferences












Cooperation
to concurrent
to relayed



Gain
transmission
message
















Timeslot-
Low
Partially,
Partially,



Splitting

significantly
improved by



Relaying

improved by
scheduling





scheduling



Downlink-
High
largely
Severe,



Assisted

improved by
improved by



Relaying

scheduling
scheduling



Uplink-
High
Completely
Largely



Assisted

eliminated
improved by



Relaying

(with a small
scheduling





extra noise





term for AF)










With respect to downlink throughput maximization, two extreme scheduling algorithms to be used with the AF and DF protocols are considered. The first one achieves the maximum system throughput without imposing any fairness constraints on users and will be referred to as max-throughput scheduling. The second one is the round-robin strategy, which instead achieves absolute fairness in terms of delays among the considered users. As shown below in additional detail, the round-robin scheduling algorithm and the AF protocol form together a simple and powerful strategy for providing good system throughput while maintaining fairness among users in terms of delay.
With respect to a “without fairness” constraint, although the DF protocol can achieve a higher receive SNR through cooperation as shown in Eqn. 8, the protocol does not deliver any capacity gain when maximum system throughput is considered without fairness concern. The following theorem and proof is now presented.
Theorem 1: DF cooperation achieves the same maximum system throughput as its non-cooperative counterpart when users are scheduled to maximize the system throughput in any operating SNR region.
Proof: Let R(SNR)=log(1+SNR) be the maximum achievable rate of a link given an SNR. Define Φi={φn(i):ρj,i=1 ∀j∈φn(i), ρj,i=0 ∀j∉φn(i)} to be the set of relay assignment sets with cardinality |Φi|=2K-1−1 for destination user i. Eqn. 8 states that cooperation gain is possible only if SNRj>SNR(Ritarget) for some j, or equivalently,




  
    R
    i
    target
  
  ≤
  
    
      max
      
        {
        
          j
          ∈
          
            φ
            n
            
              (
              i
              )
            
          
        
        }
      
    
    ⁢
    
      R
      ⁡
      
        (
        
          SNR
          j
        
        )
      
    
  




for any given φn(i), which further implies that the maximum rate RiDF achieved by the DF protocol for user i is upper-bounded by





  
    
      
        
          
            R
            i
            DF
          
          ≤
          
            
              max
              
                
                  
                    φ
                    n
                    
                      (
                      i
                      )
                    
                  
                  '
                
                ⁢
                s
              
            
            ⁢
            
              {
              
                
                  max
                  
                    {
                    
                      j
                      ∈
                      
                        φ
                        n
                        
                          (
                          i
                          )
                        
                      
                    
                    }
                  
                
                ⁢
                
                  {
                  
                    
                      R
                      ⁡
                      
                        (
                        
                          SNR
                          i
                        
                        )
                      
                    
                    ,
                    
                      R
                      ⁡
                      
                        (
                        
                          SNR
                          j
                        
                        )
                      
                    
                  
                  }
                
              
              }
            
          
        
        =
        
          
            max
            
              {
              
                j
                =
                
                  {
                  
                    1
                    ,
                    
                      
                    
                    ⁢
                    
                      ...
                      ⁢
                      
                        
                      
                      ⁢
                      K
                    
                  
                  }
                
              
              }
            
          
          ⁢
          
            
              R
              ⁡
              
                (
                
                  SNR
                  j
                
                )
              
            
            ⁢
            
              ∀
              
                i
                ∈
                
                  {
                  
                    1
                    ,
                    ...
                    ⁢
                    
                      
                    
                    ,
                    K
                  
                  }
                
              
            
          
        
      
    
    
      
        Eqn
        .
        
          
        
        ⁢
        12
      
    
  




From Eqn. 12, it is clear that the maximum achievable system throughput of the DF protocol is




  
    
      
        
          
            R
            DF
          
          =
          
            
              
                max
                
                  i
                  ∈
                  
                    {
                    
                      1
                      ,
                      
                        
                      
                      ⁢
                      ...
                      ⁢
                      
                        
                      
                      ,
                      K
                    
                    }
                  
                
              
              ⁢
              
                (
                
                  R
                  i
                  DF
                
                )
              
            
            =
            
              
                max
                
                  {
                  
                    j
                    =
                    
                      {
                      
                        1
                        ,
                        
                          
                        
                        ⁢
                        
                          ...
                          ⁢
                          
                            
                          
                          ⁢
                          K
                        
                      
                      }
                    
                  
                  }
                
              
              ⁢
              
                R
                ⁡
                
                  (
                  
                    SNR
                    j
                  
                  )
                
              
            
          
        
        ,
      
    
    
      
        Eqn
        .
        
          
        
        ⁢
        13
      
    
  




which is the same as that in a non-cooperative network.

Unlike the DF, the AF protocol always provides a cooperation gain because message detection is done only after combining the signals received from both the direct and relayed paths. The maximum system throughput is achieved when the equivalent SNR in Eqn. 7 is maximized. That is, the problem can be formulated as




  
    
      
        
          max
          i
        
        ⁢
        
          
            SNR
            i
            
              equiv
              .
            
          
          .
        
      
    
    
      
        Eqn
        .
        
          
        
        ⁢
        14
      
    
  




Since the number of system users is often larger than the number of orthogonal relay channels available, SNRiequiv. needs to be further optimized. Relay selection and power allocation needs to be performed which will be detailed in the next sub-section.
With respect to a “with fairness” constraint, or round-robin, the maximum system capacity is achieved for round-robin scheduling when the equivalent SNR in Eqn. 7, given a target user i, is maximized. As mentioned above, in a multiuser system, it is likely that the number of users will be larger than the number of total available orthogonal relay channels. Therefore, relays selection is appropriate, as well as, power allocation over the relay channels. In the following, we focus on the AF protocol and derive the optimal relay selection and power allocation strategy for a given target user i with N orthogonal relay channels in total and every potential relay user is allowed to occupy at maximum all the channels. The optimization for the DF protocol is a special case of the AF protocol where aj=1 in Eqn. 5 and the problem is then reduced to a simple one. In the following, m will be used to specify the index of a relay channel.
The following illustrates optimal relay selection and power allocation in accordance with exemplary, non-limiting embodiments.
Let




  
    
      f
      
        j
        ,
        i
      
      m
    
    ⁡
    
      (
      
        P
        j
        
          
            (
            R
            )
          
          ,
          m
        
      
      )
    
  
  =
  
    
      
        SNR
        
          j
          ,
          i
        
        m
      
      ⁡
      
        (
        
          a
          j
        
        )
      
    
    
      
        
          SNR
          
            j
            ,
            i
          
          m
        
        ⁡
        
          (
          
            1
            -
            
              a
              j
            
          
          )
        
      
      +
      1
    
  




which represents the equivalent SNR for the relayed path (S−j−i) in the mth relay channel. The objective can be written as





  
    
      
        
          max
          ⁢
          
            
              ∑
              
                
                  j
                  =
                  1
                
                ,
                
                  j
                  ≠
                  i
                
              
              K
            
            ⁢
            
              
            
            ⁢
            
              
                ∑
                
                  m
                  =
                  1
                
                N
              
              ⁢
              
                
              
              ⁢
              
                
                  ρ
                  
                    j
                    ,
                    i
                  
                  m
                
                ⁢
                
                  
                    f
                    
                      j
                      ,
                      i
                    
                    m
                  
                  ⁡
                  
                    (
                    
                      P
                      j
                      
                        
                          (
                          R
                          )
                        
                        ,
                        m
                      
                    
                    )
                  
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          subject
          ⁢
          
            
          
          ⁢
          to
        
      
    
    
      
        
          Eqn
          .
          
            
          
          ⁢
          15
        
        ⁢
        a
      
    
  
  
    
      
        
          
            P
            j
            
              
                (
                R
                )
              
              ,
              m
            
          
          ≤
          
            
              P
              j
              
                
                  (
                  peak
                  )
                
                ,
                m
              
            
            ⁢
            
              
            
            ⁢
            
              ∀
              
                j
                ∈
                
                  
                    {
                    
                      1
                      ,
                      2
                      ,
                      ...
                      ⁢
                      
                        
                      
                      ,
                      K
                    
                    }
                  
                  /
                  
                    {
                    i
                    }
                  
                
              
            
          
        
        ,
        
          

        
        ⁢
        
          m
          ∈
          
            {
            
              1
              ,
              2
              ,
              ...
              ⁢
              
                
              
              ,
              N
            
            }
          
        
      
    
    
      
        
          Eqn
          .
          
            
          
          ⁢
          15
        
        ⁢
        b
      
    
  
  
    
      
        
          
            ∑
            
              
                j
                =
                1
              
              ,
              
                j
                ≠
                i
              
            
            K
          
          ⁢
          
            
          
          ⁢
          
            
              ∑
              
                m
                =
                1
              
              N
            
            ⁢
            
              
            
            ⁢
            
              P
              j
              
                
                  (
                  R
                  )
                
                ,
                m
              
            
          
        
        ≤
        
          P
          
            
              (
              R
              )
            
            ,
            Total
          
        
      
    
    
      
        
          Eqn
          .
          
            
          
          ⁢
          15
        
        ⁢
        c
      
    
  
  
    
      
        
          
            ∑
            
              
                j
                =
                1
              
              ,
              
                j
                ≠
                i
              
            
            K
          
          ⁢
          
            
          
          ⁢
          
            ρ
            
              j
              ,
              i
            
            m
          
        
        ≤
        
          1
          ⁢
          
            
          
          ⁢
          
            ∀
            
              
                m
                ⁢
                
                  
                
                ⁢
                where
                ⁢
                
                  
                
                ⁢
                
                  ρ
                  
                    j
                    ,
                    i
                  
                  m
                
              
              ∈
              
                
                  {
                  
                    0
                    ,
                    1
                  
                  }
                
                .
              
            
          
        
      
    
    
      
        
          Eqn
          .
          
            
          
          ⁢
          15
        
        ⁢
        d
      
    
  




Constraint Eqn. 15b is the individual peak power constraint for user j in relay channel m, which can also be used to control the maximum co-channel interference on other transmissions in the same channel. There is also a total relay power constraint represented by Eqn. 15c. The basestation power is assumed fixed and known, hence, aj also, and is independent of the power constraint of the mobile users (relays). The knowledge of inter-user channel gains is also assumed at the basestation. In practice, these may be values from a predefined set of channel gain thresholds that are obtained during the initial setup of a cooperating group for a particular target user. Finally, constraint Eqn. 15d states that only a single user is allowed to be a relay for each relay channel.
The problem is in general combinatorial. However, the function ƒj,im(Pj(R),m) can be shown to be concave and monotonically increasing. By using a relaxation technique for the parameter ρj,im, the problem can be formulated into a convex maximization problem which can be solved with the aid of Lagrangian Multiplier and Karush-Kuhn-Tucker (KKT) conditions. Results are shown herein for the derived optimal user selection and power allocation strategy. This problem is analogous to the capacity maximization problem for a traditional network with parallel channels, however, there is a clear difference in the resulting optimal relay (user) selection strategy.
With respect to optimal relay selection, the optimal user jm* for the mth relay channel is selected according to




  
    
      
        
          
            j
            
              m
              *
            
          
          =
          
            
              
                arg
                ⁢
                
                  
                
                ⁢
                max
              
              j
            
            ⁢
            
              
            
            ⁢
            
              
                H
                
                  j
                  ,
                  i
                
                m
              
              ⁡
              
                (
                Ω
                )
              
            
          
        
        ⁢
        
          

        
        ⁢
        where
      
    
    
      
        
          Eqn
          .
          
            
          
          ⁢
          16
        
        ⁢
        a
      
    
  
  
    
      
        
          
            
              H
              
                j
                ,
                i
              
              m
            
            ⁡
            
              (
              Ω
              )
            
          
          =
          
            
              
                f
                
                  j
                  ,
                  i
                
                m
              
              (
              
                
                  f
                  
                    j
                    ,
                    i
                  
                  
                    
                      m
                      ⁢
                      
                        
                      
                      ⁢
                      ′
                    
                    -
                    1
                  
                
                ⁡
                
                  (
                  
                    Ω
                    ~
                  
                  )
                
              
              )
            
            -
            
              
                Ω
                ~
              
              ⁢
              
                
                  f
                  
                    j
                    ,
                    i
                  
                  
                    
                      m
                      ⁢
                      
                        
                      
                      ⁢
                      ′
                    
                    -
                    1
                  
                
                ⁡
                
                  (
                  
                    Ω
                    ~
                  
                  )
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        and
      
    
    
      
        
          Eqn
          .
          
            
          
          ⁢
          16
        
        ⁢
        b
      
    
  
  
    
      
        
          Ω
          ~
        
        =
        
          {
          
            
              
                
                  
                    f
                    
                      j
                      ,
                      i
                    
                    
                      m
                      ⁢
                      
                        
                      
                      ⁢
                      ′
                    
                  
                  (
                  
                    P
                    j
                    
                      
                        (
                        peak
                        )
                      
                      ,
                      m
                    
                  
                  )
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        f
                        
                          j
                          ,
                          i
                        
                        
                          
                            m
                            ⁢
                            
                              
                            
                            ⁢
                            ′
                          
                          -
                          1
                        
                      
                      ⁡
                      
                        (
                        Ω
                        )
                      
                    
                  
                  >
                  
                    P
                    j
                    
                      
                        (
                        peak
                        )
                      
                      ,
                      m
                    
                  
                
              
            
            
              
                Ω
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    0
                  
                  ≤
                  
                    
                      f
                      
                        j
                        ,
                        i
                      
                      
                        
                          m
                          ⁢
                          
                            
                          
                          ⁢
                          ′
                        
                        -
                        1
                      
                    
                    ⁡
                    
                      (
                      Ω
                      )
                    
                  
                  ≤
                  
                    P
                    j
                    
                      
                        (
                        peak
                        )
                      
                      ,
                      m
                    
                  
                
              
            
            
              
                
                  
                    f
                    
                      j
                      ,
                      i
                    
                    
                      m
                      ⁢
                      
                        
                      
                      ⁢
                      ′
                    
                  
                  ⁡
                  
                    (
                    0
                    )
                  
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        f
                        
                          j
                          ,
                          i
                        
                        
                          
                            m
                            ⁢
                            
                              
                            
                            ⁢
                            ′
                          
                          -
                          1
                        
                      
                      ⁡
                      
                        (
                        Ω
                        )
                      
                    
                  
                  <
                  0
                
              
            
          
        
      
    
    
      
        
          Eqn
          .
          
            
          
          ⁢
          16
        
        ⁢
        c
      
    
  




ƒj,im′ is the derivative with respect to Pj(R),m and Ω is the common parameter among all the m relay channels to be adjusted such that the total power constraint in Eqn. 15c is satisfied. The larger Ω is, the smaller the power allocated given a set of selected users.

It is well-known that the optimal user selection strategy for a traditional network maximizing the system capacity can be reduced to choosing the one with the best channel. When individual peak power constraints are imposed, it can be proved that it is optimal to choose the user with the largest rate. However, it can be shown that this is no longer the case for our system with user cooperation where choosing the maximum ƒj,im(Pj(R),m) does not achieve the optimal solution.
With respect to optimal power allocation, the optimal power allocation for any set of selected relay users can be shown to be




  
    
      
        
          
            P
            j
            
              
                (
                R
                )
              
              ,
              
                m
                *
              
            
          
          =
          
          ⁢
          
            
              
                (
                
                  
                    
                      λ
                      ⁢
                      
                        
                          
                            a
                            j
                          
                          ⁢
                          
                            γ
                            
                              j
                              ,
                              i
                            
                            m
                          
                        
                      
                    
                    -
                    1
                  
                  
                    
                      (
                      
                        1
                        -
                        
                          a
                          j
                        
                      
                      )
                    
                    ⁢
                    
                      γ
                      
                        j
                        ,
                        i
                      
                      m
                    
                  
                
                )
              
              +
            
            =
            
            ⁢
            
              
                (
                
                  
                    λ
                    ⁢
                    
                      
                        
                          
                            SNR
                            j
                          
                          ⁡
                          
                            (
                            
                              
                                SNR
                                j
                              
                              +
                              1
                            
                            )
                          
                        
                        
                          γ
                          
                            j
                            ,
                            i
                          
                          m
                        
                      
                    
                  
                  -
                  
                    
                      
                        SNR
                        j
                      
                      +
                      1
                    
                    
                      γ
                      
                        j
                        ,
                        i
                      
                      m
                    
                  
                
                )
              
              +
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              where
              ⁢
              
                
              
              ⁢
              
                λ
                2
              
            
            =
            
              
                Ω
                ~
              
              
                -
                1
              
            
          
          ,
          
            
              
                (
                x
                )
              
              +
            
            =
            
              
                
                  max
                  ⁡
                  
                    (
                    
                      x
                      ,
                      0
                    
                    )
                  
                
                ⁢
                
                  
                
                ⁢
                and
                ⁢
                
                  
                
                ⁢
                
                  γ
                  
                    j
                    ,
                    i
                  
                  m
                
              
              =
              
                
                  
                    
                    
                      h
                      
                        j
                        ,
                        i
                      
                      m
                    
                    
                  
                  2
                
                /
                
                  
                    N
                    o
                  
                  .
                
              
            
          
        
      
    
    
      
        Eqn
        .
        
          
        
        ⁢
        17
      
    
  




This result is consistent with a pair of source and destination nodes where assisted by a fixed number of relays adopting the TSR approach instead.
Numerical Results and Discussions
In the downlink of a cellular network, the maximum system throughput is often dominated by a few users who are close to the basestation. Therefore, it may not be appropriate to evaluate the effectiveness of a user cooperation protocol under such a measure because any significant improvement for the distant users may amount to only an indistinguishable increase of the overall system throughput. In order to obtain more meaningful results, the performance within a cooperating group in which users are of comparable average channel gains from the basestation is considered.
As mentioned, a TDD system is assumed and the simulation settings are as follows. A cell of radius 1 km is considered and users are uniformly distributed within clusters each of 50 m radius. Every cluster contains 5 users and is evaluated at different distances from the basestation. Identical and independently distributed (i.i.d.) Rayleigh fading is assumed for both the basestation-user and inter-user channels. Path loss exponent is set to 3 in all cases with a reference average power of 30 dB at 100 m from the basestation. In particular, the AF protocol under the two scheduling strategies, max-throughput and round-robin are considered in these results. A quasi-static channel is considered and the peak power for each relay channel is allowed to be the maximum total relay power.
FIG. 6 illustrates max-throughput scheduling 600 for 1 relay 610, no relays 620 and for 3 relays 530. In each case, separate curve clusters 640, 650, 660 and 670 are provided representing users at distances 100 m, 250 m, 500 m and 950 m, respectively. As discussed above, the DF protocol does not achieve gain in the maximum system throughput. However, as illustrated in FIG. 6, the AF protocol also provides only marginal improvement. The gain appears the most significant for the farthest cluster near the cell edge where a throughput gain of  ̃8% is recorded with 1 relay. Only a small amount of relay power, 20 dB less than the basestation transmit power, is required and increasing further the relay power does not result in any significant improvement. An upper bound of 3 relays is provided as a reference where the inter-user channels are assumed noise-free. In such case, the system is reduced to a single-input-multiple-output (SIMO) system. It can be observed that the potential gain by more relays is also limited and is expected to be the case for ordinary networks, unless an exceptionally densely populated one is considered.
Round-robin scheduling 700 is shown in FIG. 7 for 1 relay 710 and no relays 720. In each case, separate curve clusters 730, 740, 750 and 760 are provided representing users at distances 100 m, 250 m, 500 m and 950 m, respectively. Round-robin scheduling 700 enables users to transmit under a fair condition where every user has the same percentage share of the channel and same delay, but often at a substantial expense of throughput. FIG. 7 shows that this is no longer the case when user cooperation is enabled. Significant gain in system throughput is achieved with only 1 relay and limited relay power. For instance, over 70% throughput increase is achieved for the cluster near the cell edge at the expense of only 1% basestation transmission power for the relay. Attractive gain can still be achieved for clusters near the basestation where over 25% gain is obtained for clusters at 250 m and about 10% for the 100 m ones. The capacity gap from the max-throughput scheduling is greatly reduced. There may be occasions where one user is used as relay more frequently. However, since bandwidth is often a bigger issue than power in a cellular network, this short-term fairness should be tolerable while the long-term fairness can still be maintained as channels fluctuate.
With respect to a comparison between UAR 810 and TSR 820, FIG. 8 demonstrates the effect of different placement of relaying timeslots. At 100 m, curves 830 and 840 represent the UAR and TSR performance, respectively. Similarly at 250 m, 500 m and 950 m, curves 832, 842, curves 834, 844 and curves 846, 846 represent UAR and TSR performance, respectively. It can be observed, for each distance and set of curves, that the UAR approach is significantly better than the TSR one. When max-throughput scheduling is considered, TSR performs even worse than the non-cooperative counterpart, as can be predicted using Eqn. 9.
FIG. 9 is a flow diagram of a first, non-limiting representative embodiment for relaying and scheduling according to optimal algorithms. Not necessarily in any particular order, at 900, for a set of users and relay devices, fairness criteria to be applied to communications to multiple users are determined. Then, CSIT information is determined where available at 910. At 920, based on the fairness scheme applied and CSIT information if available, an optimal relay schedule is formed. At 930, the data relaying occurs using the optimized schedule. In one embodiment, as described above, UAR can be used, as can DAR. At 940, communications occur according to a user cooperative protocol, such as AF or DF whereby downlink throughput is optimized. At 950, power is dynamically allocated for the given circumstances involving device transmissions.
FIG. 10 is a flow diagram of a second, non-limiting representative embodiment for relaying and scheduling according to optimal algorithms. Again in no particular order, at 1000, CSIT information is estimated or otherwise available. At 1010, an optimal schedule for relay transmissions is generated based upon an assumption of equal fairness among users. For example, a round robin type system can be adopted that treats different users equally in terms of priority, or no fairness constraints can be applied for all users. At 1020, relaying is performed using UAR or DAR. Then, at 1030, data is transmitted either according to the AF user cooperative protocol or the DF user cooperative protocol. Then, at 1040, power is dynamically optimized for the schedule of relay transmissions. At 1050, transmission occurs according to the optimized parameters achieving optimal downlink throughput. Advantageously, the embodiments can be incorporated into existing network frame structures for wireless communications.
FIG. 11 is a block diagram of an embodiment for relaying and scheduling illustrative of some non-limiting aspects of various embodiments described herein. For simplicity of representation, a single relay user 1120 and target user 1110 are shown, though the user cooperative relay techniques described herein can apply to any number of relays and target users. A basestation 1100 is provided for transmitting data to a set of relay devices and a target user device according to a user cooperative protocol, such as AF or DF. In this regard, the basestation 1100 can perform relaying according to either UAR 1136 or DAR (not shown).
The basestation 1100 relays to achieve maximum system throughput 1132 without imposing any fairness constraints on target user devices or according to a round-robin scheduling algorithm, which achieves absolute fairness in terms of delays among target user devices. A relay schedule 1130 is thus optimized based on the fairness considerations and to optimize system throughput, which may include allocating optimal power 1134 for transmissions of the system.
In sum, in various non-limiting embodiments, the downlink throughput optimization problem with user cooperation was investigated. Different from previous works that focused on fixed pairs of source and destination, user scheduling is incorporated with different fairness concerns into the cooperation framework. Two commonly used cooperation protocols, amplify-and-forward and decode-and-forward, were evaluated and some exemplary results were presented.
Specifically, it was demonstrated herein that when users are scheduled for maximizing the system throughput without any fairness constraint, the DF protocol cannot provide any gain in the maximum achievable system throughput compared to its non-cooperative counterpart while the AF protocol always results in an improvement. The placement of relaying timeslots in conventional frame structure was also explored as it directly affected the performance of user cooperation. It was shown that by careful user scheduling, multiple relays could be supported concurrently with other transmissions in different timeslots for adaptive cellular networks with CSIT available. This enables easy incorporation of user cooperation into existing systems without the need of modifying their frame structures.
The corresponding optimal relay selection and power allocation algorithm were derived. Yet, it was demonstrated that only one relay was enough to achieve a significant gain in the downlink throughput for especially the round-robin scheduling algorithm, which is a favorable strategy when combined with user cooperation for maintaining fairness among users in terms of delay without sacrificing the maximum achievable system throughput significantly.
Exemplary Communications Networks and Environments
The above-described optimizations may be applied to any network, however, the following description sets forth some exemplary telephony radio networks and non-limiting operating environments for incorporation of the present invention. The below-described operating environments should be considered non-exhaustive, however, and thus the below-described network architecture merely shows one network architecture into which the present invention may be incorporated. One can appreciate, however, that the invention may be incorporated into any now existing or future alternative architectures for communication networks as well.
The global system for mobile communication (“GSM”) is one of the most widely utilized wireless access systems in today's fast growing communication systems. GSM provides circuit-switched data services to subscribers, such as mobile telephone or computer users. General Packet Radio Service (“GPRS”), which is an extension to GSM technology, introduces packet switching to GSM networks. GPRS uses a packet-based wireless communication technology to transfer high and low speed data and signaling in an efficient manner. GPRS optimizes the use of network and radio resources, thus enabling the cost effective and efficient use of GSM network resources for packet mode applications.
As one of ordinary skill in the art can appreciate, the exemplary GSM/GPRS environment and services described herein can also be extended to 3G services, such as Universal Mobile Telephone System (“UMTS”), Frequency Division Duplexing (“FDD”) and Time Division Duplexing (“TDD”), High Speed Packet Data Access (“HSPDA”), cdma2000 1x Evolution Data Optimized (“EVDO”), Code Division Multiple Access-2000 (“cdma2000 3x”), Time Division Synchronous Code Division Multiple Access (“TD-SCDMA”), Wideband Code Division Multiple Access (“WCDMA”), Enhanced Data GSM Environment (“EDGE”), International Mobile Telecommunications-2000 (“IMT-2000”), Digital Enhanced Cordless Telecommunications (“DECT”), etc., as well as to other network services that shall become available in time. In this regard, the techniques of the invention may be applied independently of the method of data transport, and need not depend on any particular network architecture, or underlying protocols, except where specified otherwise.
FIG. 12 depicts an overall block diagram of an exemplary packet-based mobile cellular network environment, such as a GPRS network, in which the invention may be practiced. In such an environment, there are a plurality of Base Station Subsystems (“BSS”) 1200 (only one is shown), each of which comprises a Base Station Controller (“BSC”) 1202 serving a plurality of Base Transceiver Stations (“BTS”) such as BTSs 1204, 1206, and 1208. BTSs 1204, 1206, 1208, etc. are the access points where users of packet-based mobile devices become connected to the wireless network. In exemplary fashion, the packet traffic originating from user devices is transported over the air interface to a BTS 1208, and from the BTS 1208 to the BSC 1202. Base station subsystems, such as BSS 1200, are a part of internal frame relay network 1210 that may include Service GPRS Support Nodes (“SGSN”) such as SGSN 1212 and 1214.
Each SGSN is in turn connected to an internal packet network 1220 through which a SGSN 1212, 1214, etc. can route data packets to and from a plurality of gateway GPRS support nodes (GGSN) 1222, 1224, 1226, etc. As illustrated, SGSN 1214 and GGSNs 1222, 1224, and 1226 are part of internal packet network 1220. Gateway GPRS serving nodes 1222, 1224 and 1226 mainly provide an interface to external Internet Protocol (“IP”) networks such as Public Land Mobile Network (“PLMN”) 1245, corporate intranets 1240, or Fixed-End System (“FES”) or the public Internet 1230. As illustrated, subscriber corporate network 1240 may be connected to GGSN 1224 via firewall 1232; and PLMN 1245 is connected to GGSN 1224 via boarder gateway router 1234. The Remote Authentication Dial-In User Service (“RADIUS”) server 1242 may be used for caller authentication when a user of a mobile cellular device calls corporate network 1240.
Generally, there can be four different cell sizes in a GSM network-macro, micro, pico and umbrella cells. The coverage area of each cell is different in different environments. Macro cells can be regarded as cells where the base station antenna is installed in a mast or a building above average roof top level. Micro cells are cells whose antenna height is under average roof top level; they are typically used in urban areas. Pico cells are small cells having a diameter is a few dozen meters; they are mainly used indoors. On the other hand, umbrella cells are used to cover shadowed regions of smaller cells and fill in gaps in coverage between those cells.
Although not required, the claimed subject matter can partly be implemented via an operating system, for use by a developer of services for a device or object, and/or included within application software that operates in connection with one or more components of the claimed subject matter. Software may be described in the general context of computer-executable instructions, such as program modules, being executed by one or more computers, such as clients, servers, mobile devices, or other devices. Those skilled in the art will appreciate that the claimed subject matter can also be practiced with other computer system configurations and protocols, where non-limiting implementation details are given.
FIG. 13 thus illustrates an example of a suitable computing system environment 1300 in which the claimed subject matter may be implemented, although as made clear above, the computing system environment 1300 is only one example of a suitable computing environment for a media device and is not intended to suggest any limitation as to the scope of use or functionality of the claimed subject matter. Further, the computing environment 1300 is not intended to suggest any dependency or requirement relating to the claimed subject matter and any one or combination of components illustrated in the example operating environment 1300.
With reference to FIG. 13, an example of a remote device for implementing various aspects described herein includes a general purpose computing device in the form of a computer 1310. Components of computer 1310 can include, but are not limited to, a processing unit 1320, a system memory 1330, and a system bus 1321 that couples various system components including the system memory to the processing unit 1320. The system bus 1321 can be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures.
Computer 1310 can include a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 1310. By way of example, and not limitation, computer readable media can comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile as well as removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CDROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computer 1310. Communication media can embody computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and can include any suitable information delivery media.
The system memory 1330 can include computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) and/or random access memory (RAM). A basic input/output system (BIOS), containing the basic routines that help to transfer information between elements within computer 1310, such as during start-up, can be stored in memory 1330. Memory 1330 can also contain data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 1320. By way of non-limiting example, memory 1330 can also include an operating system, application programs, other program modules, and program data.
The computer 1310 can also include other removable/non-removable, volatile/nonvolatile computer storage media. For example, computer 1310 can include a hard disk drive that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive that reads from or writes to a removable, nonvolatile magnetic disk, and/or an optical disk drive that reads from or writes to a removable, nonvolatile optical disk, such as a CD-ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM and the like. A hard disk drive can be connected to the system bus 1321 through a non-removable memory interface such as an interface, and a magnetic disk drive or optical disk drive can be connected to the system bus 1321 by a removable memory interface, such as an interface.
A user can enter commands and information into the computer 1310 through input devices such as a keyboard or a pointing device such as a mouse, trackball, touch pad, and/or other pointing device. Other input devices can include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and/or other input devices can be connected to the processing unit 1320 through user input 1340 and associated interface(s) that are coupled to the system bus 1321, but can be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A graphics subsystem can also be connected to the system bus 1321. In addition, a monitor or other type of display device can be connected to the system bus 1321 via an interface, such as output interface 1350, which can in turn communicate with video memory. In addition to a monitor, computers can also include other peripheral output devices, such as speakers and/or a printer, which can also be connected through output interface 1350.
The computer 1310 can operate in a networked or distributed environment using logical connections to one or more other remote computers, such as remote computer 1370, which can in turn have media capabilities different from device 1310. The remote computer 1370 can be a personal computer, a server, a router, a network PC, a peer device or other common network node, and/or any other remote media consumption or transmission device, and can include any or all of the elements described above relative to the computer 1310. The logical connections depicted in FIG. 13 include a network 1371, such local area network (LAN) or a wide area network (WAN), but can also include other networks/buses. Such networking environments are commonplace in homes, offices, enterprise-wide computer networks, intranets and the Internet.
When used in a LAN networking environment, the computer 1310 is connected to the LAN 1371 through a network interface or adapter. When used in a WAN networking environment, the computer 1310 can include a communications component, such as a modem, or other means for establishing communications over the WAN, such as the Internet. A communications component, such as a modem, which can be internal or external, can be connected to the system bus 1321 via the user input interface at input 1340 and/or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 1310, or portions thereof, can be stored in a remote memory storage device. It should be appreciated that the network connections shown and described are exemplary and other means of establishing a communications link between the computers can be used.
The word “exemplary” is used herein to mean serving as an example, instance, or illustration. For the avoidance of doubt, the subject matter disclosed herein is not limited by such examples. In addition, any aspect or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs, nor is it meant to preclude equivalent exemplary structures and techniques known to those of ordinary skill in the art. Furthermore, to the extent that the terms “includes,” “has,” “contains,” and other similar words are used in either the detailed description or the claims, for the avoidance of doubt, such terms are intended to be inclusive in a manner similar to the term “comprising” as an open transition word without precluding any additional or other elements.
The aforementioned systems have been described with respect to interaction between several components. It can be appreciated that such systems and components can include those components or specified sub-components, some of the specified components or sub-components, and/or additional components, and according to various permutations and combinations of the foregoing. Sub-components can also be implemented as components communicatively coupled to other components rather than included within parent components (hierarchical). Additionally, it should be noted that one or more components may be combined into a single component providing aggregate functionality or divided into several separate sub-components, and that any one or more middle layers, such as a management layer, may be provided to communicatively couple to such sub-components in order to provide integrated functionality. Any components described herein may also interact with one or more other components not specifically described herein but generally known by those of skill in the art.
In view of the exemplary systems described supra, methodologies that may be implemented in accordance with the described subject matter will be better appreciated with reference to the flowcharts of the various figures. While for purposes of simplicity of explanation, the methodologies are shown and described as a series of blocks, it is to be understood and appreciated that the claimed subject matter is not limited by the order of the blocks, as some blocks may occur in different orders and/or concurrently with other blocks from what is depicted and described herein. Where non-sequential, or branched, flow is illustrated via flowchart, it can be appreciated that various other branches, flow paths, and orders of the blocks, may be implemented which achieve the same or a similar result. Moreover, not all illustrated blocks may be required to implement the methodologies described hereinafter.
In addition to the various embodiments described herein, it is to be understood that other similar embodiments can be used or modifications and additions can be made to the described embodiment(s) for performing the same or equivalent function of the corresponding embodiment(s) without deviating therefrom. Still further, multiple processing chips or multiple devices can share the performance of one or more functions described herein, and similarly, storage can be effected across a plurality of devices. Accordingly, no single embodiment shall be considered limiting, but rather the various embodiments and their equivalents should be construed consistently with the breadth, spirit and scope in accordance with the appended claims.

## Claims

1. A method, comprising:
selecting a relay device, from a set of candidate relay devices, for relay of data from a basestation device to a destination mobile device based on a determination of a signal-to-noise ratio of a channel between the basestation device and the relay device, wherein the determination is subject to respective peak power constraints for the set of candidate relay devices and a total relay power constraint; and
initiating the relay of the data from the basestation device to the destination mobile device via the relay device, wherein the initiating of the relay includes initiating an uplink-assisted relay that relays the data from the relay device to the destination mobile device in a defined supplemental uplink timeslot.

2. The method of claim 1, further comprising:
scheduling the relay of the data according to a function of downlink throughput based upon at least one fairness criterion applied to the set of candidate mobile devices.

3. The method of claim 2, wherein the scheduling the relay includes scheduling according to a round-robin scheduling.

4. The method of claim 2, wherein the scheduling the relay includes scheduling the relay based upon a criterion of minimal fairness constraints.

5. The method of claim 2, further comprising utilizing a user cooperative communications protocol for the relay of the data.

6. The method of claim 5, wherein the utilizing includes utilizing an amplify-and-forward protocol.

7. The method of claim 5, wherein the utilizing includes utilizing a decode-and-forward protocol.

8. The method of claim 1, further comprising:
allocating power for the destination mobile device and the relay device based on the determination.

9. The method of claim 1, further comprising estimating channel state information.

10. The method of claim 1, wherein the initiating the relay includes initiating a downlink-assisted relaying that relays in a defined supplemental downlink timeslot.

11. The method of claim 1, further comprising scheduling one or more uplink transmissions from respective one or more mobile devices that are different than the destination mobile device during the defined supplemental uplink timeslot, including selecting the one or more mobile devices to exclude mobile devices as a function of distance from the destination mobile device.

12. The method of claim 11, wherein the selecting the one or more mobile devices comprises selecting the one or more mobile devices to exclude mobile devices within a defined distance from the destination mobile device.

13. A system, comprising:
a basestation device configured to select a relay device from a set of candidate relay devices and transmit according to an uplink-assisted relaying that relays a message, generated at the basestation device, from the relay device to a target device in a defined supplemental uplink timeslot, wherein the basestation device is further configured to select the relay device based on a signal-to-noise function for the relay device subject to respective peak power constraints for the set of candidate relay devices and a total relay power constraint.

14. The system of claim 13, wherein the message is relayed according to a user cooperative protocol including an amplify-and-forward cooperation protocol or a decode-and-forward cooperation protocol.

15. The system of claim 13, wherein the basestation device is further configured to transmit according to a downlink-assisted relaying that relays the message to the target device in a defined supplemental downlink timeslot.

16. The system of claim 13, wherein the basestation device is further configured to relay the message according to a throughput scheduling algorithm that does not impose fairness constraints on target devices or according to a round-robin scheduling algorithm as a function of one or more delays among target devices.

17. The system of claim 16, wherein the basestation device is further configured to schedule relay of the message according to the round-robin scheduling algorithm.

18. The system of claim 16, wherein the basestation device is further configured to schedule relay of the message according to the throughput scheduling algorithm.

19. The system of claim 13, wherein the basestation device is further configured to allocate power for transmission of the message based at least on the signal-to-noise function.

20. The system of claim 13, wherein the basestation device is further configured to schedule at least one uplink transmission from a respective at least one mobile device different than the target device during the defined supplemental uplink timeslot, wherein the basestation device is further configured to select the at least one mobile device to exclude at least one proximate mobile device as a function of distance from the target device.

21. An apparatus, comprising:
means for selecting a relay device from a plurality of candidate relay devices, including means for selecting the relay device to satisfy a function of respective signal-to-noise ratios for the plurality of candidate relay devices, wherein the function is subject to respective peak power constraints for the plurality of candidate relay devices and a total relay power constraint; and
means for relaying, via the relay device, at least part of data from the basestation device to a mobile device using uplink-assisted relaying, including means for relaying the at least part of the data from the relay device to the mobile device in a defined supplemental uplink timeslot.

22. The apparatus of claim 21, further comprising:
means for scheduling a relay transmission according to an equality of fairness applied to the plurality of candidate relay devices, wherein the means for scheduling the relay transmission includes means for scheduling according to a user cooperative communications protocol.

23. The apparatus of claim 22, wherein the means for scheduling the relay transmission includes means for scheduling according to a round-robin scheduling as a function of at least one delay among a set of mobile devices.

24. The apparatus of claim 22, wherein the means for scheduling the relay transmission includes means for scheduling without consideration of fairness for a set of mobile devices.

25. The apparatus of claim 21, wherein the means for relaying comprises means for relaying according to an amplify-and-forward protocol.

26. The apparatus of claim 21, wherein the means for relaying comprises means for relaying according to a decode-and-forward protocol.

27. The apparatus of claim 21, further comprising means for estimating channel state information to determine a relaying schedule.

28. The apparatus of claim 21, further comprising means for allocating power to the relay device as a function of the respective signal-to-noise ratios for the plurality of candidate relay devices subject to the respective peak power constraints for the plurality of candidate relay devices and the total relay power constraint.

29. A non-transitory computer-readable medium having instructions stored thereon, the instructions comprising:
instructions for selecting a relay device, from a set of candidate relay devices, for relay of data from a basestation device to a target device based on a solution to a function representing a signal-to-noise-ratio of a channel between the basestation device and the relay device subject to respective peak power constraints for the set of candidate relay devices and a total relay power constraint; and
instructions for scheduling the relay of data from the basestation device to the target device via the relay device according to an uplink-assisted relaying that performs the relaying in a supplemental uplink timeslot.

30. The non-transitory computer-readable medium of claim 29, further comprising instructions for processing the data based in part on a fairness criterion associated with one or more devices including the target device.

31. The non-transitory computer-readable medium of claim 29, further comprising instructions for performing a downlink-assisted relaying that performs a relaying operation in a supplemental downlink timeslot.

32. The non-transitory computer-readable medium of claim 31, further comprising instructions for dynamically adjusting power in accordance with the uplink-assisted relaying or the downlink-assisted relaying.

33. The non-transitory computer-readable medium of claim 29, further comprising instructions for dynamically updating a schedule of relay transmissions.

34. The non-transitory computer-readable medium of claim 33, further comprising instructions for altering a parameter to achieve enhanced uplink throughput or downlink throughput.

35. The non-transitory computer-readable medium of claim 29, further comprising instructions for processing the data according to an amplify-and-forward cooperation protocol or a decode-and-forward cooperation protocol.

36. The non-transitory computer-readable medium of claim 29, further comprising instructions for scheduling a set of mobile devices, different than the target device, for uplink transmission during the supplemental uplink timeslot, including instructions for excluding mobile devices from the set of mobile devices based on distance from the target device.

37. The apparatus of claim 36, wherein the means for excluding includes means for excluding the mobile devices based on a determination that the mobile devices are within a defined distance from the destination mobile device.

38. The non-transitory computer-readable medium of claim 36, wherein the instructions for excluding include instructions for excluding the mobile devices that are within a defined distance from the target device.