Abstract:
A method including performing a first function which is dependent on an estimated resource capacity and a penalty which is dependent on at least one of a number of physical resource units selected and interference; and selecting one or more physical resource units in dependence on said first function.

Description:
FIELD OF THE INVENTION 
       [0001]    The present invention relates to a method and apparatus and in particular but not exclusively to a method and apparatus for use in the selection of physical resource units. 
       BACKGROUND 
       [0002]    A communication device can be understood as a device provided with appropriate communication and control capabilities for enabling use thereof for communication with other parties. The communication may comprise, for example, communication of voice, electronic mail (email), text messages, data, multimedia and so on. A communication device typically enables a user of the device to receive and transmit communication via a communication system and can thus be used for accessing various applications. 
         [0003]    A communication system is a facility which facilitates the communication between two or more entities such as the communication devices, network entities and other nodes. A communication system may be provided by one or more interconnect networks. One or more gateway nodes may be provided for interconnecting various networks of the system. For example, a gateway node is typically provided between an access network and other communication networks, for example a core network and/or a data network. 
         [0004]    An appropriate access system allows the communication device to access to the wider communication system. An access to the wider communications system may be provided by means of a fixed line or a wireless communication interface, or a combination of these. Communication systems providing wireless access typically enable at least some mobility for the users thereof. Examples of these include wireless communications systems where the access is provided by means of an arrangement of cellular access networks. Other examples of wireless access technologies include different wireless local area networks (WLANs) and satellite based communication systems. 
         [0005]    A wireless access system typically operates in accordance with a wireless standard and/or with a set of specifications which set out what the various elements of the system are permitted to do and how that should be achieved. For example, the standard or specification may define if the user, or more precisely user equipment, is provided with a circuit switched bearer or a packet switched bearer, or both. Communication protocols and/or parameters which should be used for the connection are also typically defined. For example, the manner in which communication should be implemented between the user equipment and the elements of the network and is their functions and responsibilities are typically defined by a predefined communication protocol. 
         [0006]    The increasing number of wireless communication users has forced operators and infrastructure equipment vendors to design and install access network equipment with an increasing spatial density and a consequent reduction of the range of each network equipment often to tens of meters. 
         [0007]    Local area wireless access is hence becoming more desirable, in order to allow users to access the same internet services he/she is used to having on a wired network. 
         [0008]    Physical resources (spectrum, time) are factors, whose efficiency has to be selected on the basis of a trade-off between operator(s) and user&#39;s costs and final user satisfaction. Physical resource availability and/or use constraints have been addressed by the design of wireless systems able to share the same overall physical resource set. Maximization of the efficiency of this set is needed since transported Internet services are pushing QoS (Quality of Service) requirements to the limits of the actual technology. 
         [0009]    In a shared radio resources scenario, where several Access Point (AP) nodes/operators share the same physical resources (for example time or frequency), resource pattern assignment and interference management/reduction is one of the major problems for coexistence of multiple access points. The amount of information exchanged between the nodes can be limited or absent due for example to inter-operators sharing policies. 
         [0010]    Current WLAN systems may provide some degree of time domain interference management (contention-based), but one drawback is on the lack of scalability. 
         [0011]    In Beibei Wang; Yongle Wu; Zhu Ji; Liu, K. J.; Clancy, T., “Game theoretical mechanism design methods,”  Signal Processing Magazine, IEEE , vol. 25, no. 6, pp. 74-84, November 2008 an arrangement for power control based on taxation is described. 
         [0012]    Leshem, A.; Zehavi, E., “Cooperative Game Theory and the Gaussian Interference Channel,”  Selected Areas in Communications, IEEE Journal on , vol. 26, no. 7, pp. 1078-1088, September 2008 describes a cooperative scenario where there is no overlapping of frequencies and, therefore, the arrangement does not scale to proper frequency reuse. Furthermore, the signalling requirements and algorithm complexity are large. 
         [0013]    In Nie; C. Comaniciu, “Adaptive Channel Allocation Spectrum Etiquette for Cognitive Radio Networks”, IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN) 2005, November 2005 different distributed approaches are considered but the application of the procedures is limited to the choice of a single channel. 
         [0014]    In general, the known arrangements generally have at least one of the following drawbacks: spectral inefficiency, signaling overhead, bad scalability and high complexity in the resource allocation. 
       SUMMARY OF THE INVENTION 
       [0015]    According to a first aspect, there is provided a method comprising performing a first function which is dependent on an estimated resource capacity and a penalty which is dependent on at least one of a number of physical resource units selected and interference; and selecting one or more physical resource units in dependence on said first function. 
         [0016]    The first function may comprise a utility function, 
         [0017]    The estimated resource capacity may comprise a channel capacity. 
         [0018]    The estimated resource capacity may comprise a function of a signal to interference dependent parameter ratio. 
         [0019]    The penalty may comprise a factor which depends on an interference dependent parameter. 
         [0020]    The interference dependent parameter may comprise one of interference-plus-noise and interference. 
         [0021]    The interference dependent parameter may be per physical resource unit. 
         [0022]    The method may comprise obtaining said dependent parameter. 
         [0023]    The penalty may comprise a factor which increases as a number of physical resource units which are selected increases. 
         [0024]    The method may comprise selecting one or more physical resource units from one or more physical resource units based on for which said estimated resource capacity outweighs said penalty 
         [0025]    The method may comprise sorting of physical resource units in dependence on interference. 
         [0026]    According a second aspect of the invention, there is provided a computer program comprising program code means adapted to perform any of the steps of discussed above when the program is run. 
         [0027]    According to a third aspect, there is provide apparatus comprising means for performing a first function which is dependent on an estimated resource capacity and a penalty which is dependent on at least one of a number of physical resource units selected and interference; and means for selecting one or more physical resource units in dependence on said first function. 
         [0028]    The first function may comprise a utility function. 
         [0029]    The estimated resource capacity may comprise a channel capacity. 
         [0030]    The estimated resource capacity may comprise a function of a signal to interference dependent parameter ratio. 
         [0031]    The penalty may comprise a factor which depends on an interference dependent parameter. 
         [0032]    The interference dependent parameter may comprise one of interference-plus-noise and interference. 
         [0033]    The interference dependent parameter may be per physical resource unit. 
         [0034]    The apparatus may comprise means for obtaining said dependent parameter. 
         [0035]    The penalty may comprise a factor which increases as a number of physical resource units which are selected increases. 
         [0036]    The apparatus may comprise means for selecting one or more physical resource units from one or more physical resource units based on for which said estimated resource capacity outweighs said penalty 
         [0037]    The apparatus may comprise means for sorting of physical resource units in dependence on interference. 
     
    
     
       BRIEF DESCRIPTION OF FIGURES 
         [0038]    For a better understanding of the present invention and how the same may be carried into effect, reference will now be made by way of example only to the accompanying drawings in which: 
           [0039]      FIG. 1  shows a schematic representation of two wireless access systems a mobile device may use for accessing a data network; 
           [0040]      FIG. 2  shows a partially sectioned view of a mobile device; 
           [0041]      FIG. 3  illustrates a shared resource scenario where multiple access nodes/operators share the same resources; 
           [0042]      FIG. 4  shows a graph of interference spectral density versus frequency resource number; 
           [0043]      FIG. 5  shows a graph of capacity per physical resource unit (PRU) and transfer function per PRU against PRU; 
           [0044]      FIG. 6  shows a graph of overall utility with no taxation and the utility function with taxation against total number of selected PRUs; 
           [0045]      FIG. 7  shows a schematic diagram illustrating an embodiment of the present invention; 
           [0046]      FIG. 8  shows a cumulative distribution function of downlink signal to noise ratio; 
           [0047]      FIG. 9  shows a graph of user equipment outage throughput versus frame index; 
           [0048]      FIG. 10  shows a graph of mean cell throughput versus frame index; 
           [0049]      FIG. 11  schematically shows an access point embodying the present invention; and 
           [0050]      FIG. 12  shows a method embodying the present invention 
       
    
    
     DETAILED DESCRIPTION OF EMBODIMENTS 
       [0051]    Reference is made to  FIGS. 1 and 2 . A communication device can be used for accessing various services and/or applications provided via a communications system. In wireless or mobile systems the access is provided via an access interface between a communication device  1301  and an appropriate wireless access system  1310  and  1320 . 
         [0052]    A communication device  1301  can typically access wirelessly a communication system via at least one base station  1312  and  1322  or similar wireless transmitter and/or receiver node. Non-limiting examples of appropriate access nodes or access points are a base station of a cellular system and a base station of a wireless local area network (WLAN). Each communication device may have one or more radio channels open at the same time and may be connected to more than one base station. 
         [0053]    A base station is typically controlled by at least one appropriate controller entity  1313 ,  1323  so as to enable operation thereof and management of devices in communication with the base station. The controller entity is typically provided with memory capacity  1324  and at least one data processor. 
         [0054]    A communication device may be used for accessing various applications. For example, a communication device may access applications provided in a data network  1330 . For example, various applications may be offered in a data network that is based on the Internet Protocol (IP) or any other appropriate protocol. 
         [0055]    In  FIG. 1  the base station nodes  1312  and  1322  are connected to the data network  1330  via appropriate gateways  1315  and  1325  respectively. A gateway function between a base station node and another network may be provided by means of any appropriate gateway node, for example a packet data gateway and/or an access gateway. 
         [0056]      FIG. 2  shows a schematic partially sectioned view of a communication device  1301  that can be used for accessing a communication system via a wireless interface. The communication device  1301  of  FIG. 2  can be used for various tasks such as making and receiving phone calls, for receiving and/or sending data from and to a data network and for experiencing, for example, multimedia or other content. 
         [0057]    An appropriate device may be provided by any device capable of at least sending or receiving radio signals  1311  and  1321 . Non-limiting examples include a mobile station (MS), a portable computer provided with a wireless interface card or other wireless interface facility, personal data assistant (PDA) provided with wireless communication capabilities, or any combinations of these or the like. The device may not be intended to be moved and for example could be a computer with a wireless facility in an office environment. Alternatively or additionally the device may be a remote sensing device which is arranged to periodically report sensed data. The sensing device may report environment conditions or may report conditions or information about equipment. The device  1301  may communicate via an appropriate radio interface arrangement of the device. In  FIG. 2  the radio interface arrangement is designated schematically by block  1307 . The interface arrangement may be provided for example by means of a radio part and associated antenna arrangement. The antenna arrangement may be arranged internally or externally to the device. 
         [0058]    A communication device is typically provided with at least one data processing entity  1303 ,  1309  and at least one memory  1304  for use in tasks it is designed to perform. The data processing and storage entities can be provided on an appropriate circuit board and/or in chipsets. This feature is denoted by reference  1306 . 
         [0059]    The user may control the operation of the device by means of a suitable user interface such as key pad  1302 , voice commands, touch sensitive screen or pad, combinations thereof or the like. A display  1305 , a speaker and a microphone may be provided. Furthermore, a communications device may comprise appropriate connectors (either wired or wireless) to other devices and/or for connecting to external accessories, for example hands-free equipment, thereto. 
         [0060]    Embodiments of the invention may use game-theory. Some embodiments of the invention may allow the design of decentralized/distributed algorithms. Some embodiments of the invention aim to provide a reliable and efficient trade-off between planned and unplanned networks. Some embodiments of the invention may provide the dynamicity and flexibility of the contention/collision avoidance-based networks (e.g. WiFi, Bluetooth) and may achieve similar results in terms of throughput and guarantee of service requirements of the planned networks (e.g. GSM (global system for mobile communications), WCDMA (wideband code division multiple access), and LTE (long term evolution)). In some embodiments of the invention, the algorithm may provide an efficient use of the available radio resources. 
         [0061]    One or more embodiments of the invention may provide an autonomous and distributed algorithm and/or method and/or apparatus for physical radio resource allocation in local area wireless access systems or the like. The algorithm is based on a game modeling of the scenario according to game-theory formulation. One or more algorithms embodying the present invention is arranged to find the maximum of a channel capacity-based utility function. In order to avoid selfishness of each single AP node (i.e. a node taking all the available resources), the utility function may add the estimated capacity to a penalty factor, which is the cumulative effect of a non-linear weighted function of the noise rise estimated on the used Physical Resource Units (PRUs). The convergence speed of the algorithm may be improved in some embodiments of the invention through a sorting of the available PRUs according to an interference evaluation metric. The algorithm can be used in the time domain, in the frequency domain, or jointly in time and frequency domain. PRUs can hence potentially be time slots, frequency channels or time/frequency slots. The PRUS can also be defined by additionally or alternatively codes and/or space diversity. 
         [0062]    One embodiment of the invention is arranged to evaluate the utility function of a set of PRUs (Physical resource unit) and autonomously select the transmission PRUs based on this utility metric. A method embodying the present invention will be described with reference to  FIG. 12 . The method may be implemented by a computer program and accordingly  FIG. 12  may illustrate an algorithm or steps implemented at least partially by a computer program running on a suitable processor, computer or the like. Embodiment of the invention which are in computer program form may be provided on any suitable data carrier or may be downloadable from a server or the like. 
         [0063]    The PRUs may be in the time and/or frequency domain. 
         [0064]    The utility function, an example of which is defined by equation (1) below, is a non-linear weighted function of capacity and interference-to-noise ratio (also known as noise rise). This interference-to-noise ratio is a measure of the energy which is “wasted” to win over the ‘other-cell’ interference and therefore it is energy which is not spent in the most efficient way. 
         [0065]    One algorithm embodying the present invention uses the following sensing information, available per PRU: 
         [0000]    Signal-to-interference-plus-noise ratio (SINR)
 
Interference-to-noise ratio (INR)SINR=S/(I+N) where S is the received signal, I is the incoming interference and N is the noise at the receiver.
 
         [0000]    
       
      
       INR=I/N  
      
     
         [0066]    This information can be sensed directly by the AP and/or sensed by the affiliated UEs (user equipment) and then reported to the AP through data packets or via any other suitable method. 
         [0067]    The overall physical transmission resource is subdivided into s i   MAX  orthogonal PRUs. The algorithm of  FIG. 12  is as follows. When an AP is on its turn to update the resource allocation, the following algorithm is applied to determine how the available PRUs are to be assigned: 
         [0068]    In S 1 , sorting of the aggregated interference information vector provided by sensing I (Interference), is carried out from 1 to s i   MAX  such that PRU  1  is the one experiencing less interference and PRU s i   MAX  is the one experiencing the highest interference level. The advantage of this sorting process is that, for some embodiments, it reduces the complexity of the algorithm, as the PRU allocation decision loop can be stopped when the utility function value described in step S 2  falls below zero. This step may be omitted in some embodiments of the invention. This may assist in reducing the convergence time of the algorithm to the desired optimal resource allocation state in order not to introduce unacceptable service delays. 
         [0069]    In the next step S 2 , for each PRU k, its associated utility function is calculated according to equation (1): 
         [0000]    
       
         
           
             
               
                 
                   
                     U 
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             
                               C 
                               k 
                             
                              
                             
                               ( 
                               
                                 SINR 
                                 k 
                               
                               ) 
                             
                           
                         
                         
                           
                             
                               I 
                               k 
                             
                             &lt; 
                             
                               N 
                               k 
                             
                           
                         
                       
                       
                         
                           
                             
                               
                                 C 
                                 k 
                               
                                
                               
                                 ( 
                                 
                                   SINR 
                                   k 
                                 
                                 ) 
                               
                             
                             - 
                             
                               
                                 f 
                                  
                                 
                                   ( 
                                   
                                     k 
                                     
                                       s 
                                       i 
                                       MAX 
                                     
                                   
                                   ) 
                                 
                               
                                
                               
                                 
                                   C 
                                   k 
                                 
                                  
                                 
                                   ( 
                                   
                                     INR 
                                     k 
                                   
                                   ) 
                                 
                               
                             
                           
                         
                         
                           otherwise 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
       Where, 
       [0070]    U(k) is the utility function provided by PRU k 
         [0000]    C k  is the estimated channel capacity as a function of SINR (signal-to-interference-plus-noise ratio), which is system specific and may be obtained by, for example, measurements or simulations. This estimated channel capacity should take into account current transmission mode selection (modulation, coding, multi-antenna configuration, etc). Ck is a function which is related to the technology being used (WLAN; LTE, etc). One example of such function for an LTE system is 
         [0000]    
       
         
           
             
               
                 C 
                 k 
               
               = 
               
                 
                   B 
                   · 
                   
                     B 
                     eff 
                   
                 
                  
                 
                   
                     log 
                     2 
                   
                    
                   
                     ( 
                     
                       1 
                       + 
                       
                         SINR 
                         
                           SNR 
                           eff 
                         
                       
                     
                     ) 
                   
                 
               
             
             , 
           
         
       
     
         [0000]    where B is bandwidth, B eff  is the bandwidth efficiency and SNR eff  is the Signal to Noise Ratio efficiency and it may be found in the paper:
 
P. Mogensen et al. “LTE capacity compared to Shannon bound” (see below). For the tax function C k (INR) is calculated on place of SINR.
 
         [0000]    
       
         
           
             
               C 
               k 
             
             = 
             
               
                 B 
                 · 
                 
                   B 
                   eff 
                 
               
                
               
                 
                   log 
                   2 
                 
                  
                 
                   ( 
                   
                     1 
                     + 
                     
                       INR 
                       
                         SNR 
                         eff 
                       
                     
                   
                   ) 
                 
               
             
           
         
       
     
         [0000]    SINR k  is the signal-to-interference-plus-noise ratio in PRU k if the AP chooses to transmit in PRU k. This is derived from the sensed information.
 
f(x) is a design parameter and it is generally a continuous function. The algorithm maybe such that f(x) is such that the first derivative is non-decreasing or conversely the second derivative is always non-negative, i.e., f″(x)≧0 in the interval [0≦x≦1]. The reasoning is the following: the more PRUs an AP selects the higher the penalty (or price) it should pay for additional PRUs. A simple yet effective example of f(x) choice is f(x)=2x. In some embodiments, x can be the logical number of the PRU. Alternatively x can be the number of selected PRUs. In other embodiments, x is the percentage of PRUs that the AP has already selected. Alternatively the function can be f(k).
 
k is the logical number of a PRU, as provided by the sorting process described in step 1.
 
s i   MAX  is the total number of PRUs in the overall physical transmission resource.
 
INR k  is the interference-to-noise ratio in PRU k if the AP chooses to transmit in PRU k. This is derived by the sensed information.
 
         [0071]    In Step S 3 , the amount of PRUs, s i , are selected that maximize the proposed overall utility OU(s i ) as defined in Equation (2) below. In other words. the method selects only the first s i  PRUs which give positive utility. If not all the selected PRUs are needed in order to satisfy bit-rate requirements for all served communication devices, the algorithm may allocate only up to the first s i  PRUs needed to satisfy the throughput requirements. 
         [0072]    The overall utility function is calculated as: 
         [0000]    
       
         
           
             
               
                 
                   
                     OU 
                      
                     
                       ( 
                       
                         s 
                         i 
                       
                       ) 
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         k 
                         = 
                         1 
                       
                       
                         s 
                         i 
                       
                     
                      
                     
                       U 
                        
                       
                         ( 
                         k 
                         ) 
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
         [0073]    The relation between the overall utility OU(s i ) and the achieved sum capacity is illustrated in  FIG. 6  which is described in more detail later. 
         [0074]    The tax transfer function is given by 
         [0000]    
       
         
           
             
               
                 
                   
                     T 
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                   = 
                   
                     
                       f 
                        
                       
                         ( 
                         
                           k 
                           
                             s 
                             i 
                             MAX 
                           
                         
                         ) 
                       
                     
                      
                     
                       
                         C 
                         k 
                       
                        
                       
                         ( 
                         
                           INR 
                           k 
                         
                         ) 
                       
                     
                   
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
           
         
       
     
         [0075]    As described in shown in equation 1, the tax transfer function is subtracted from channel capacity C k  in order to evaluate the total utility of the k-th PRU. In order to maximize the utility, the point where U(k) falls below zero is located. 
         [0076]    If the algorithm is applied to several APs at the same time, there may be a small probability that the algorithm will ever converge. In order to enhance the convergence of the process, it may be assumed that APs avoid changing their PRUs allocation at the same time. This may be achieved in any suitable way. For example: 
         [0077]    At every frame, an access point has a small probability of updating its PRU allocation, reducing the possibility that 2 or more APs change their allocation at the same time. 
         [0078]    The APs coordinate the process, taking turns to update the allocation. 
         [0079]    It should be appreciated that this is by way of example only. In alternative embodiments of this invention, different methods for avoiding APs changing their PRU allocations at the same time may be provided. Alternatively, it can be assumed that the probability is small with no action being taken. 
         [0080]    Some embodiments of the inventions may provide one or more of the following advantages: 
         [0081]    Good performance in terms of aggregate capacity, outage capacity and resource efficiency if an appropriate tax function f(x) is chosen. 
         [0082]    In some embodiments of the invention there may be no need for direct communication among the APs. All information is gathered locally in each AP and all decisions may be taken autonomously (distributed algorithm). Alternatively, one embodiment may not be a distributed form, but may instead exchange information among the APs (partially distributed), or use strong signaling and synchronization among the APs (centralized). 
         [0083]    The utility of each PRU may be calculated separately, and therefore the complexity of the algorithm may be linear based on the maximum number of PRUs that can be allocated. Since the decision may be taken autonomously but in a coordinated way and without communication among APs, the complexity of the algorithm does not depend on the number of neighbour APs (the interference may be taken into account in the algorithm regardless of whether it comes from one or many sources). Therefore, the complexity of some algorithms embodying the invention may be quite low as compared to algorithms that need to exchange information between APs or algorithms that need to test all allocation possibilities. 
         [0084]    Some embodiments of the invention may be able to provide a relatively fast convergence time. 
         [0085]    Reference is made to  FIG. 3  which illustrates a situation where three cells  6  are shown. Each cell is provided with an access point  4 . The access point may take any suitable form and can, for example be a wireless router, a base station or any other access point with which a communication device is able to communicate with wirelessly. Associated with each cell and wireless router are communication devices  2  which communicate wirelessly with the access point  4 . The resources which the various devices need to share are schematically referenced  8 . The resources which need to be shared can be between access points in adjacent areas and/or access points sharing at least partially a common area. In this example, the shared resource represents a physical radio resource and this shared resource is divided up into time slots. Furthermore, the radio resource in this example is also divided by frequency. It should be appreciated that the physical resource can be shared in any other suitable manner. 
         [0086]    Embodiments of the present invention have been described in the context of the WLAN arrangement. However, it should be appreciated that embodiments of the present invention can be used with any other type of network be it a so-called planned network such as GSM, WCDMA or LTE or a WLAN network such as WiFi or Bluetooth. Furthermore, embodiments of the present invention can be used by more than one network using the same or different standards. This can be used as a way of sharing resources between different types of networks as well as within a particular network. 
         [0087]    Reference is made to  FIG. 4  which shows how the PRU sorting process can improve embodiments of the present invention.  FIG. 4  represents a simulation showing interference spectral density plotted against frequency resource number. Two lines are shown. The first line  20  represents the unsorted interference whereas the second line  22  represents the sorted interference. When the interference is not sorted, the evaluation of equation (2) needs to be done for all possible allocations of PRUs. When it is sorted, the evaluation needs only to evaluate a small subset of the possible allocations. Therefore, sorting the interference may allow the method to be run faster when implemented in a computer or similar. 
         [0088]    Reference is made to  FIG. 5  which shows a simulation which plots the spectral efficiency and transfer function of PRU against the PRU number. The first curve  24  represents the capacity per PRU and the second curve  26  represents the transfer function per PRU. Spectral efficiency is Ck divided by the bandwidth of a PRU. The transfer function is given by equation (3) 
         [0089]    Reference is made to  FIG. 6  which shows the sum capacity and utility function plotted against the total number of selected PRUs. This graph shows two curves. Curve  30  is a plot of the overall utility, equation (2), for this case. Curve  28  shows overall utility if f shown in equation (3) is zero. 
         [0090]    The maximum of the overall utility function illustrated by curve  30  coincides with the point where curve  24  crosses curve  26 . 
         [0091]    Reference is made to  FIG. 7  which schematically shows a proof of usage test. It also represents a schematic view of what would happen in practice. A device under test corresponds to an access point  40 . A controlled interference generator  42  is provided which generates interference to the access point  40 . In an actual scenario,  42  would be represented by other access points and communication devices in overlapping or adjacent cells. Also shown is a communication device  44  which is considered to a very traffic demanding user equipment where resource allocations can be measured. This UE is served by access point  40 , as will be the case in use. The user equipment  44  is attached to the access point  40  and demands high traffic such as a large bit torrent. 
         [0092]    The interference generator  42  is able to control the level of received interference on each channel for both the user equipment and the access point  40 . In the test procedure, a very good signal reception condition is initially used. This is represented by the user equipment being very close to the access point. The interference level is set such that C k  (INR K ) as defined in equations 1 and 3 above is equal to the maximum capacity of the system. In other words a high interference level is generated on each channel with a fixed power spectral density. The signal reception conditions are varied, for example by moving the user equipment further away from the access point. For each signal condition, the number of allocated channels at the UE is measured. If the measured value is s*, for each value s* the following invariant can be verified in embodiments of the invention. If the interference is muted on s′ channels, the output of the allocated channels is: 
         [0000]    s* if s′&lt;=s*
 
s′ if s′&gt;s*
 
         [0093]    This was verified during simulations and it is considered that some embodiments of the present invention will have similar behaviour. 
         [0094]    Embodiments of the invention may use game theory. In this regard reference is made to Fudenberg, D.; Tirole, J., “Game Theory”, MIT Press, 1991 Chapter 7. 
         [0095]    Game Theory is a branch of applied mathematics which attempts to mathematically capture behaviour in strategic situations in which an individual success for making choices depends on the choices of others. 
         [0096]    Reference is now made to  FIGS. 8 to 10  which show some simulation results for embodiments of the present invention. In these scenarios, the simulation results were obtained in the frequency domain. The PRUs are OFDMA (Orthogonal Frequency Divisional Multiple Access) PRB (Physical Resource Blocks) in a network with four access points. Over 500 randomly generated network positions were assumed. Both the access points and the mobile station positions were assumed to be random. An LTE-advance system with 100 Hz is assumed. The function C k  (see above) is a modified Shannon approximation which is described in the following reference: 
         [0000]    Mogensen, P.; Wei Na; Kovacs, I. Z.; Frederiksen, F.; Pokhariyal, A.; Pedersen, K. I.; Kolding, T.; Hugl, K.; Kuusela, M., “LTE Capacity Compared to the Shannon Bound,”  Vehicular Technology Conference,  2007. VTC2007-Spring. IEEE 65th, vol., no., pp. 1234-1238, 22-25 Apr. 2007. 
         [0097]    The function f(x) was chosen to be f(x)=2x. The simulations compare results of an algorithm embodying the present invention with reuse  1  and reuse  2  frequency schemes. Referring first to  FIG. 8 , three curves  50 ,  52  and  54  are shown. Curve  50  represents a reuse  1  frequency scheme. The second curve  52  represents a reuse  2  frequency scheme and the third curve  54  represents a curve using a method embodying the present invention.  FIG. 8  represents the cumulative distribution function PDF of downlink signal to noise ratio for three spectrum use approaches: fixed frequency reuse  1 , fixed frequency reuse  2  and dynamic spectrum access using a method embodying the invention. As can be seen from  FIG. 8 , embodiments of the present invention are able to improve the signal to interference noise ratio even over reuse scheme  2 . As a first simulation set, all PRBs are used by all access points with a reuse factor of 1. Over time the algorithm embodying the present invention may converge to a more efficient solution approximating the performance of reuse  2  which is considered to be an optimal integer frequency reuse. This sort of result could be obtained by network planning. Accordingly, embodiments of the present invention can be regarded as approximating reuse  2  performance and represents a good measure of the effectiveness of an algorithm embodying the present invention. 
         [0098]    Reference is now made to  FIG. 9  which shows the UE outage (at 5%) throughput of an algorithm embodying the present invention over time. The time index is with reference to super frames. In  FIG. 9 , four curves are shown. The first curve  56  represents the curve for a reuse  2  frequency scheme—with downlink outage throughput. Curve  58  represents a reuse  2  frequency scheme for uplink outage throughput. Curve  60  represents an algorithm embodying the invention for a downlink outage throughput. The fourth curve  62  represents an embodiment of the present invention with uplink outage throughput. It can be seen that reuse  2  performance can be considered to be approximated when convergence is reached. 
         [0099]    Thus, an algorithm embodying the invention can provide substantial outage capacity gain over reuse  1  leading to a performance comparable to reuse  2 . 
         [0100]    Reference is made to  FIG. 10  which shows the evolution of cell throughput of an algorithm embodying the present invention over time which again is represented by super frames. Again, reuse  2  performance can be considered to be approximated when convergence is reached. In the arrangement shown in  FIG. 10 , there are four curves. Curve  64  represents the reuse  2  for downlink cell throughput. Curve  66  represents reuse  2  for uplink cell throughput. Curve  68  represents an algorithm embodying the present invention for downlink cell throughput whilst curve  70  represents an algorithm embodying the present invention for uplink cell throughput. It should be appreciated that in  FIG. 10 , shows mean cell throughput in Mbps against frame index. This Figure shows that capacity also approximates the values of reuse  2 . On the first round is of spectral adaption, for example for frames  1  to  4  the sum capacity is reduced. This can be explained by game theory. Only a combined effort of all access points can lead from an inefficient stable state of reuse  1  to an efficient stable state closed to reuse  2 . Unilateral efforts may reduce the total throughput but the combined effect will increase it as seen from frame  6  onwards. 
         [0101]    These results were generated considering perfectly elastic traffic—full buffer simulations. The dynamic spectrum access can potentially deal with asymmetric bursty traffic in a much more efficient way than fixed spectrum reuses. 
         [0102]    It should be appreciated that this is just one simulation of how embodiments of the present invention might work in practice. 
         [0103]    Reference is made to  FIG. 11  which schematically shows an access point embodying the present invention. 
         [0104]    The access point  86  comprises an antenna  84 . The antenna  84  is coupled to transmit circuitry  74  and receiver circuitry  82 . The transmit circuitry  74  passes data to be transmitted to the antenna. Likewise, the receiver circuitry  82  is arranged to receive data from a communication device via the antenna. The transmit circuitry  74  and the receiver circuitry  82  are connected to a processor  72 . The access point  86  has an SINR/INR block  76 . This block is arranged to calculate the SINR/INR  76  from information which is measured or determined from the received signals and/or on the basis of data received from communication devices. Accordingly, the SINR/INR block  76  may be a memory storing device or a device which is arranged to determine the SINR/INR values from the received information. This block  76  may be connected to the processor  72 . A sorting block  71  is arranged to sort the aggregated information vector based on the information from the SINR/INR block  76 . 
         [0105]    A utility function calculation block  78  is provided which receives information from the sorting block  71  and the SINR/INR  76  block. The utility function block  78  is arranged to calculate the utility function. 
         [0106]    Selection block  80  is arranged to select the amount of PRUs to be used. The selection block may be connected to the processor block  72  which uses the selection in order to control the used PRUs. 
         [0107]    It should be appreciated that the various blocks shown in  FIG. 11  may be comprised in one or more integrated circuits. One or more of the blocks shown in  FIG. 11  may be implemented by software running on an associated processor. 
         [0108]    The foregoing description has provided by way of exemplary and non-limiting examples a full and informative description of the exemplary embodiment of this invention. However, various modifications and adaptations may become apparent to those skilled in the relevant arts in view of the foregoing description, when read in conjunction with the accompanying drawings and the appended claims. However, all such and similar modifications of the teachings of this invention will still fall within the scope of this invention as defined in the appended claims.