Joint Radio Resource Allocation and Base Station Location Selection in OFDMA Based Private Wireless Access Networks for Smart Grid

This paper studies the base stations deployment problem in orthogonal frequency-divisionmultiple access (OFDMA) based private wireless access networks for smart grid (SG). Firstly, we analyze the differences between private wireless access networks for SG and public cellular access networks. Then, we propose scheduling and power control based algorithms for the radio resource allocation subproblem andK-means, simulated annealing (SA), and particle swarm optimization (PSO) based algorithms for the base station (BS) location selection subproblem and iterate over these two sets of algorithms to solve the target problem. Simulation results show that the proposed method can effectively solve the target problem. Specifically, the combination of power control based resource allocation algorithm and PSO based location selection algorithm is recommended.


Introduction
It is critical that the underlying communication technology shall support efficient data exchange between various domains comprising smart grid (SG) [1].This paper studies the orthogonal frequency-division multiple access (OFDMA) [2] based private wireless access networks for SG.Actually, wireless technologies can be used in the grid for monitoring, metering, and data gathering [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17].Specifically, SG devices such as switching station, distribution circuit, and distributed energy sites will produce various information data and send them periodically to the base station (BS) to realize the automation of power distribution and electricity information acquisition.In order to achieve this requirement, many technical problems need to be solved.Among them, this paper addresses the problem of how to optimize the deployment of BSs.
This problem has been extensively studied in the literature for the public cellular access networks.However, the scenario of private wireless access networks for SG is quite different from that of the public cellular access networks.
Property 1 (the locations of devices can be considered as fixed).Due to the peculiarity of SG, the locations of most power devices can be considered as fixed or quasi-fixed.
Property 2 (the uplink transmission is dominant [18,19]).The smart grid network is an uplink dominated network, as the main data flow is from power devices to control center.The most often requirement of communications in SG is devices periodically reporting status monitoring data to the control center via BSs.Therefore, the direction of most data transmissions will be uplink.
Property 3 (the transmission rate requirement of devices can be considered as fixed [19]).The communications happening in the SG belong to the type of machine-to-machine (M2M) communications and the uplink data transmission rate requirement of each device can be considered as fixed or quasi-fixed.
Property 4 (the frequency separation requirement [19]).Wireless networks are more vulnerable than their wired counterparts due to the potential for direct access to the transport medium.Hence, security must be considered at every layer of the protocol stack in the private wireless access networks for SG.In addition to the authentication, authorization, and encryption considered at the application layer, the frequency separation mechanism at the physical layer shall also be considered, which is explained as follows.Actually, data produced by different types of devices in smart grid shall be transmitted to different destination systems.For example, as shown in Figure 1, the data produced by data terminal unit (DTU) shall be transmitted to the production service system, while the data produced by video terminal unit (VTU) shall be transmitted to the management service system.Due to the security purpose, the transmission paths used by different types of data shall be separated as much as possible.The separation can be achieved physically or logically.For example, four different approaches to construct the access network are illustrated in Figure 1, where the data paths in Figure 1(a) are the most separated; that is, the separation is achieved physically, while the data paths in Figure 1(d) are the least separated; that is, the separation can be achieved logically.Further, in addition to the separation for the wireline segment, data transmission over the wireless segment of data path shall also be separated for different types of devices.This requires that different types of devices shall use different frequency channels to transmit their data; that is, different types of devices sharing the same frequency channel will not be allowed.This is the frequency separation requirement considered in this work.
As a first step towards addressing the above issues, this paper investigates the problem of how to deploy BSs and allocate wireless resources so that the uplink transmission requirements are efficiently met.For this problem, we propose to decompose it into the resource allocation subproblem and the location selection subproblem and solve these two subproblems in an iterative fashion.The remainder of the paper is organized as follows.Section 2 formulates the joint resource allocation and location selection problem.Section 3 presents the overall framework to address this problem.Sections 4 and 5 propose resource allocation and location selection algorithms, respectively.Simulation results are reported in Section 6.Finally, we conclude in Section 7.

Problem Formulation
Consider a set of SG devices scattered in an area Ψ.Let H denote the set of devices.For each device  ∈ H, let   denote the minimum uplink data rate requirement and   the uplink transmission power.The value of   shall satisfy 0 ≤   ≤  max , where  max is the upper bound.For convenience, let  = {  } and  = {  }, respectively.Assume that all devices are classified into  different types.Let H  denote the set of type- SG devices, 1 ≤  ≤ .
Assume that the private wireless access network consists of  BSs which are located in the area Ψ.Let z  = ( 1  ,  2  ) denote the deployment location of the th BS, 1 ≤  ≤ , where  1  and  2  are the horizontal and vertical ordinate of the deployment location, respectively.For convenience, let z = {z  }.Not every location in Ψ can be the candidate location for BS.Assume that Θ denotes the candidate BS location set in Ψ and the deployment location of BS can only be selected from the elements of Θ.That is, we restrict z  ∈ Θ.In addition, let Ω = { 1 ,  2 , . . .,   } denote the relationship between SG devices and BSs, where   is the set of devices served by the th BS.For simplicity and without loss of generality, we assume that the value of   is determined by the distance based rule.That is, a device will be served by the BS which is the closest to it.
Consider a OFDMA based private wireless access network.The radio resource is defined as follows.In the frequency domain, assume that the total bandwidth is divided into  channels.Let  and  0 denote total and channel bandwidth in Hertz, respectively.In the time domain, assume that the time axes are organized into consecutive slots and  0 consecutive slots constitute a frame.The basic resource unit for data transmission is a resource block (RB) which is defined as one channel in the frequency domain and one slot in the time domain, respectively.In each frame, assume that  slots can be used for uplink communications.Therefore, for each channel, there are  RBs which are allocatable.Finally, define binary variable  ,, to denote the results of radio resource allocation which is valued 1 if the th RB of the th channel is allocated to device  and 0 otherwise.Each device shall be allocated a number of RBs to meet its minimum data rate requirement.For convenience, let  = { ,, }.
Given that the RB (, ) has been allocated to device , the received signal-interference-noise-ratio (SINR) experienced by device  on this RB at BS  can be written as where   is the path loss from device  to BS ,  N is the power of background noise,  I = ∑  ̸ =,∈D ,     is the power of interference, and D , is the set of devices which share the same RB with device .For simplicity and without loss of generality, we assume that the path loss mainly depends on the distance and can be calculated according to the formula PL() for a distance separation of  meters and we assume that there is no interference between distant devices.Let Ĉ,, denote the uplink data rate achieved by device  on RB (, ) which is calculated by the Shannon formula as Then, the total data rate achieved by device , denoted as Ĉ , can be calculated as For convenience, let Ĉ = { Ĉ }.
Finally, the problem addressed in this paper can be formulated as, given the parameters Ψ, H, , , {H  },  max , , Θ, ,  0 , ,  0 , and , how to determine the values of deployment location z, transmission power , and radio resource allocation , so that the achieved data rate Ĉ approaches  as much as possible.The symbols used in this paper are summarized in List of Symbols.

The Framework
It is difficult to solve z, , and  simultaneously.Therefore, we decompose the problem into two subproblems.The first is the location selection subproblem which determines z; the second is the resource allocation subproblem which determines  and .Specifically, the resource allocation subproblem determines  and  based on z produced by the location selection subproblem.Then, the payoff of the current z is calculated.Let  denote the payoff of a given z.
The general expression of the payoff function can be written as where   (⋅) is an increasing function representing the utility of device  and   (⋅) is also an increasing function representing the cost of device .In this paper, we firstly let   ( Ĉ ) = Ĉ /  , where   is the minimum uplink data rate requirement of device .Secondly, since the locations of devices in smart grid are fixed and the power can be supplied by alternating current adapter, we just let   (  ) = 0.This is a difference between wireless communications for smart grid and for land mobile users.Therefore, we define the satisfaction ratio   of device  as the ratio between achieved data rate and required data rate; that is, and we then define  as the sum of satisfaction ratio over all devices; that is, which is used to measure how good the given z is.
The problem can be solved by solving these two subproblems in an iterative fashion.The value of  for the current z will be fed back to the location selection subproblem for guided search of the better z.The next two sections will solve these two subproblems in sequence.

Resource Allocation Methods
The task of resource allocation is to determine  and  given z.Two different methods based on different principles are presented.The first is scheduling based for which uplinks which are far away from each other are scheduled to share the same RB.The second is power control based for which the transmission power of each uplink is controlled so that uplinks which are not far away from each other can also share the same RB.

Scheduling Based Resource
Allocation.This method consists of four steps, which are described in sequence as follows.

Uplink Transmission Power
Setting.This subsection determines the transmission power   for each device .As stated before, for this method, uplinks which are far away from each other (i.e., do not interfere with each other) will be scheduled to share the same RB.Therefore, for the scheduling based method, it can be expected that the interference power  I in (1) is negligible.That is, we assume that there is no interference between distant devices.Thus, given the RB allocated to device , the received SINR experienced by device  on this RB at BS  can be approximately written as where device  is served by BS  (i.e.,  ∈   ) and Γ is the minimum SINR requirement.Γ is a system parameter and common to all devices and RBs.Therefore, the uplink transmission power   can be set to That is, since in this method distant devices between which there is no interference are scheduled simultaneously, there is no power control and power is strictly a function of the target minimum SINR requirement.The second rule is if   ̸ =   but the interference caused to each other is too large, then edge  , exists.Specifically, if the distance between device  and BS   is less than the interference radius   of device  or if the distance between device  and BS   is less than the interference radius   of device , then edge  , exists.
The calculation of interference radius is as follows.For device , the interference radius   is defined as the distance at which the received SINR is , where  is the SINR requirement to ensure that the device does not cause nonnegligible interference to other uplinks that are out of the range of interference radius.According to (7), we have the equation for   as from which the value of   can be solved.After calculating the interference radius for each device, the interference graph G  Require: z.Ensure: G  , 1 ≤  ≤ .

Utility Function Calculation.
For each , 1 ≤  ≤ , the utility function  , is defined as the sum of satisfaction ratio over all devices of the th type given that a total of  channels have been allocated to them.To calculate  , , define Δ , as the sum of satisfaction ratio over all devices of the th type given that the th channel has been allocated to them.Then the value of  , can be obtained according to where  ,0 = 0. Further, to calculate Δ , , define Δ ,, as the sum of satisfaction ratio over all devices of the th type given that the th RB of the th channel has been allocated to them.Then the value of Δ , can be obtained according to Let H ,, denote the set of devices of the th type that share the th RB of the th channel.Then the value of Δ ,, can be calculated as where Ĉ,, can be obtained by (2).Finally, we say a device is feasible in slot  if the total power allocated to this device in this slot does not exceed  max .The procedure to calculate utility function is outlined in Algorithm 2, where the set H ,, is determined in a heuristic manner in lines ( 4)- (10).
where  ∈ H  and Γ is the minimum SINR requirement.Similarly, Γ is a system parameter and common to all devices and RBs.
We propose an iterative update algorithm for finding the minimum transmission power satisfying the above equation.Specifically, for the th iteration, the optimal power  []   to be used by device  can be obtained by solving the following equation: where is the power settings obtained at iteration  − 1.According to (14), the value of  []   can be easily obtained using the bisection method [20].Additionally, if the value of  []   is greater than  max , it will be set as  max .The update of the values of transmission power proceeds in iterations until the power convergence.

Utility Function Definitions.
The utility function  ,, is defined as the sum of satisfaction ratio over all devices in H  given that a total of  channels have been allocated to them.To calculate  ,, , define Δ ,,, as the sum of satisfaction ratio over all devices in H  given that the first  RBs of the th channel have been allocated to them.Then the value of  ,, can be obtained according to Require: G  , 1 ≤  ≤ .Ensure: { , } and {H ,, }.

RB Allocation.
This subsection presents the RB allocation algorithm.Similarly, different types of devices are not allowed to share the same frequency channel, which is the constraint which channel allocation shall satisfy.
For convenience, we define function  , as In addition, we say a group H  is feasible in slot  if the total power allocated to each device  ∈ H  in this slot does not exceed  max .The procedure of the power control based RB allocation is outlined in Algorithm 5, where   also denotes the number of channels which have been allocated to the th type.Specifically, after the type which is allocated to the th channel has been selected in line (3), the RBs of the th channel shall be allocated according to {H  } which has been obtained in Algorithm 4, as shown in line (6).

Location Selection Methods
The task of location selection is to search for the location z.Three different location selection methods are presented.The first is K-means based [21].This method is raw and is used as the benchmark in this work.The next two are simulated annealing (SA) based [22] and particle swarm optimization (PSO) based [23], respectively.

𝐾-Means
where 1 ≤  ≤ , ℎ ∈ {1, 2}, and |  | is the number of devices served by the th BS.For each , if the calculated z  does not belong to Θ, it shall be set as the element in Θ which is the closest to the calculated value.

SA Based Location Selection.
The location selection is to iterate over all candidate locations to find the best location that maximizes the satisfaction ratio.Since the enumeration is practically impossible, an algorithm with controllable complexity which can output a solution within the given time limit is desirable.We consider a stochastic local search algorithm which progressively traverses from one location to its neighbor in a probabilistic manner for finding the global optimal solution.Specifically, an algorithm based on simulated annealing is proposed, as outlined in Algorithm 6.
Beginning with an initial location, the variable z best records the location with the highest payoff obtained so far as the algorithm proceeds.In lines (4) and ( 9), the resource allocation methods in Section 4 are used to determine the values of  and .At each iteration, a new location z next among the neighborhood of current location z is chosen in line (8).The new location z next is determined as follows.First, for the current z, we can obtain Ω = { 1 ,  2 , . . .,   } and then calculate the satisfactory ratio of each   , 1 ≤  ≤ .For each iteration only one BS location is changed.We choose BS  * with the lowest satisfactory ratio to change the location.Specifically, we select a candidate BS location from Θ which is no more than  meters away from the original BS location (1) initialize  = 0; (2) initialize  =  init ; (3) initialize z; (4) determine the values of  and  given z; (5) determine the value of  given z, , and ; (6)  as the new BS location, where  is a parameter.If z next yields a better payoff than z, the search proceeds with z next for the next iteration.Otherwise, z next is still chosen with probability  ( next −)/ based on the concept of simulated annealing in line (17).In line (20), the temperature  decreases after each iteration according to an annealing schedule  = , where 0 <  < 1 is also a parameter.Different values of  max , , and  can be set to control the speed of cooling.

PSO Based Location Selection.
In this subsection, a particle swarm optimization based algorithm is presented to search for the location.Assume that the swarm consists of  particles and the search space is  dimensional.Let Z  = (z 1 , . . ., z  , . . ., z  ) represent the position of the th particle, where z  is a two-dimensional vector representing the deployment location of the th BS.Let k  = (k 1 , . . ., k  , . . ., k  ) represent the velocity of the th particle, where and V 2  represent the horizontal and vertical velocity, respectively.Let P  = (p 1 , . . ., p  , . . ., p  ) represent the position of the best solution found by the th particle and let P * = (p * 1 , . . ., p *  , . . ., p *  ) represent the position of the best solution found by all particles during the search.The position of each particle is updated by using , where Z []   is the position of the th particle at iteration  and k [+1]    is the new velocity of the th particle at iteration  + 1.The velocities of the particles are updated according to k [+1]  = k []   +  1 (P []   − Z []   ) +  2 (P * [] − Z []   ), where P []   is the position of the best solution found by the th particle at iteration , P * [] is the position of the best solution found by all particles during the search so far, and  and  are random values generated by the uniform distribution in the interval [0, 1].
Additionally, for the PSO based algorithm, there are two types of collisions.For the first type, the particles could be attracted to regions outside the feasible search space Θ; for the second type, the velocity of particles could be too large.The anticollision mechanisms for preserving the feasibility of solution are as follows.For the first type of collision, if z  ∉ Θ occurs, we set z  randomly selected location in Θ.For the second type of collision, if it occurs, we set where ℎ ∈ {1, 2} and V max is the velocity limit.The procedure for PSO based algorithm is outlined in Algorithm 7, where  max is the iteration limit.

Performance Evaluation
6.1.Parameter Setting.Assume there are a total of  = 3 types of SG devices.In the case of no particular description, the required uplink data rate of each type is  1 = 100 kbps,  2 = 400 kbps, and  3 = 800 kbps, respectively, and the number of devices of each type is 50, 50, and 50, respectively.We randomly distribute these devices in a circle region Ψ with a radius of 1200 meters.Further, we assume that Θ contains a total of 350 candidate BS locations which are also randomly generated in Ψ.Based on the simulation settings in [24,25], wireless communication related parameters are set as follows.The maximum transmission power  max is 20 dBm.The path loss formula is PL() = 6 + 42.68 log() dB for a distance (1)  separation of  meters.The total bandwidth  is 5 MHz and the bandwidth of each channel  0 is 180 kHz.Assume that the power of background noise  N =  0 , where the noise power spectrum density  0 = −174 dBm/Hz.The minimum SINR requirement Γ is 3 dB, which is used in (7) and (13) to determine transmit power.The SINR requirement  is −2 dB, which is used in (9) to determine interference radius.Finally, the number of slots in each frame  0 is 20.In the case of no particular description, assume that the number of usable slots  is also 20.For SA, there are three parameters  init , , and .For  init and , based on the recommendations in [20,26,27], we set  init = 1000 and  = 30.For , we have run many simulation experiments to find an appropriate value of it.Simulation results show that the larger the value of  is, the better the supporting ratio is.Therefore, since the value of  shall be between 0 and 1, we set  = 0.99.For PSO, there are five parameters ,  max , ,  1 , and  2 .For , ,  1 , and  2 , based on the recommendations in [27,28], we set  = 10,  = 0.7,  1 = 2, and  2 = 2.For  max , we have run many simulation experiments to find an appropriate value of it.Simulation results show that the value of  max shall not be too small or too large.Specifically, if the value of  max is too small, the convergence rate of PSO will be very slow; if the value of  max is too large, PSO will oscillate and not converge.Therefore, after many simulation experiments, we have selected  max = 150 to achieve acceptable convergence rate.Finally, for both algorithms, the iteration limit  max is set to be 1000.
Combining different resource allocation and location selection algorithms, we have a total of six different schemes.
We evaluate the performance of above schemes for different parameter configurations.For each parameter configuration, we run simulation experiments for 1000 times and average the results.

Simulation Results
. This subsection presents the performance evaluation results of the proposed schemes under different scenarios and the effects of various system parameters are evaluated and compared.6.2.1.Convergence.We show in Figure 2 a typical trace of the progression of benefits for guided stochastic search in all schemes, where "PC" and "Sched" represent power control and scheduling based resource allocation algorithm, respectively.We can find that the payoff of the best location selection is increased gradually and will be converged to a constant value finally.Therefore, the curves in Figure 2 show that the proposed schemes are converged to a steady state.Additionally, we can observe that the solution quality and the required number of iterations to converge are significantly different from each other.Firstly, the final values of payoff for different schemes are different.Specifically, the "PC + PSO" scheme can achieve the highest payoff (i.e., 128.5030) among all schemes.Recall that the payoff is defined as the sum of satisfaction ratio over all devices where the satisfaction ratio of a device is defined as the ratio between achieved data rate and the required data rate.For this set of simulation experiments, since there are totally 150 devices (as stated in the beginning of Section 6.1), the value of payoff will not be higher than 150.Therefore, a payoff of 128.5030 means that  most data rate requirements have been satisfied.Secondly, for K-means related schemes (i.e., the "PC + K-means" and "Sched + K-means" schemes), although their payoff is not high (i.e., 104.8572 and 100.1876), the required numbers of iterations to converge (i.e., 2 and 2) are much smaller than other schemes; that is, they converge much faster than other schemes.Therefore, we can conclude that different schemes can achieve different tradeoffs between solution quality and convergence rate.
For any device , if its uplink data rate requirement is met (i.e., Ĉ ≥   ), we say this device is satisfied.Further, we define the supporting ratio as the ratio between the number of devices which have been satisfied and the total number of devices.In the following simulation experiments, we will evaluate the impact of the number of channels (i.e., the total bandwidth), the number of BSs, and the number of devices on the performance (i.e., the supporting ratio) of all these six schemes.Additionally, we would like to claim that all the values plotted in Figures 3, 4, and 5 are obtained after the algorithms have converged to a steady state.

Impact of the Number of Channels.
The number of channels is equal to ⌊/ 0 ⌋, where  is the total bandwidth.Figure 3 shows the supporting ratio of all proposed schemes when the total bandwidth  or, equivalently, the number of channels is varied.For this set of simulation experiments, there are totally 150 devices, for which the sum of data rate requirements is 50 ×  1 + 50 ×  2 + 50 ×  3 = 65 Mbps.We set the number of BSs  to be 10.It can be observed that when the total bandwidth (i.e., the number of channels) increases, the supporting ratio increases.Specifically, when the total bandwidth is 9 MHz (i.e., the number of channels is 50), the supporting ratio of the "PC + PSO" and "PC + SA" schemes is as high as 1 (i.e., the data rate requirements of all 150 devices have been satisfied), but the supporting ratio of the "PC + Kmeans" and "Sched + K-means" schemes is just 0.8713 and 0.8605, respectively (i.e., there are still 150 × (1 − 0.8713) = 20 and 150 × (1 − 0.8605) = 21 devices whose data rate requirements are not satisfied, resp.).Finally, it can be observed that the "PC + PSO" scheme is the best among all other schemes, which will be validated again by the following simulation results.This is due to two aspects of reasons.For the first reason, SA and PSO are metaheuristics, which efficiently explore the search space to find near-optimal solutions.By searching over a large set of feasible solutions, they can find good solutions with less computational effort compared to simple heuristics (e.g., the K-means method).Therefore, SA and PSO are superior to K-means in finding good solutions.For the second reason, if two devices are close to each other, they could interfere with each other if they use the same RB.For the PC method, the transmission power of each device is controlled so that devices which are close to each other can also share the same RB; for the Sched method, only devices which are far away from each other can share the same RB.Since the PC method allows devices which are close to each other to transmit data simultaneously, it can admit more devices than the Sched method.On the other hand, for the PC method, since there exists interference among neighbor devices, each device will have to increase its transmission power to combat such interference to meet the minimum SINR requirement.This makes devices using the PC method consume more power resource than the Sched method.Therefore, the PC method can admit more devices than the Sched method via consuming more power.

Impact of the Number of BSs.
Figure 4 shows the supporting ratio of all proposed schemes when the number of BSs  is varied.We can observe that when the number of BSs increases, the supporting ratio increases, since the average distance between devices and access points is shortened.Specifically, when the number of BSs is 15, the supporting ratio of the "PC + PSO" and "PC + SA" schemes is 1 and 0.9767, respectively (i.e., there are zero and 150 × (1 − 0.9767) = 4 devices whose data rate requirements are not satisfied, resp.), but the supporting ratio of the "PC + Kmeans" and "Sched + K-means" schemes is just 0.8447 and 0.7743, respectively (i.e., there are still 150 × (1 − 0.8447) = 24 and 150 × (1 − 0.7743) = 34 devices whose data rate requirements are not satisfied, resp.).Therefore, we can conclude that the "PC + PSO" scheme is the best one and for the simulated scenario at least 15 BSs shall be deployed so that the supporting ratio of one can be achieved.For the following simulations, we will set the value of  to be 15.

Impact of the Number of Devices.
Figure 5 shows the supporting ratio of all proposed schemes when the number of devices is varied.For convenience, let   denote the number of devices of the th type.Let  ,init denote the initial value of   .As stated in the beginning of Section 6.1, we set  1,init = 50,  2,init = 50, and  3,init = 50.We will collect the performance metrics (i.e., the supporting ratio) which is a function of ( 1 ,  2 ,  3 ).However, it is hard to visualize highdimensional data when the dimension is greater than two.Therefore, we run the simulation for three times.For the th ( = 1, 2, 3) run, we change the values of   =  ,init +  while keeping the values of other   ( ̸ = ) fixed to be  ,init , where  = 10, 20, 30, 40, 50.Due to the limited space, we only plot the simulation results of the second run in Figure 5 where the horizontal axis represents the number of devices of the second type.We can observe that when the number of devices increases, the supporting ratio decreases, since the radio resource consumed by each type of devices increases.Specifically, when the number of devices of the second type is increased to be 100, there are totally 50 + 100 + 50 = 200 devices, for which the sum of data rate requirements is 50 ×  1 + 100 ×  2 + 50 ×  3 = 85Mbps.For this scenario, the supporting ratio of the "PC + PSO" and "PC + SA" schemes is still 0.8626 and 0.8420, respectively (i.e., there are 150 × 0.8626 = 129 and 150 × 0.8420 = 126 devices whose data rate requirements can be satisfied, resp.), but the supporting ratio of the "PC + K-means" and "Sched + Kmeans" schemes is only 0.6600 and 0.6015, respectively (i.e., there are only 150 × 0.6600 = 99 and 150 × 0.6015 = 90 devices whose data rate requirements have been satisfied, resp.).Comparing these curves, we can also conclude that the "PC + PSO" scheme is more preferable than other schemes.

Conclusions
In this paper, we study the joint BS location selection, transmission power control, and wireless channel allocation problem in OFDMA based private wireless access networks for smart grid.We transform the joint problem into channel allocation and site selection subproblems and solve these two subproblems iteratively.According to the simulation results, the combination of power control based resource allocation algorithm and PSO based location selection algorithm is recommended to solve the joint problem.Then um bero fBSs z  :

List of Symbols
The deployment location of the th BS Θ: The set of candidate BS locations   : The set of devices served by the th BS : ThetotalbandwidthinHertz : The number of channels into which the total bandwidth is divided  0 : The channel bandwidth in Hertz  0 : Thenumberofslotsinaframe : The number of slots which can be used for uplink communications in each frame  ,, : The binary variable indicating whether the th RB of the th channel is allocated to device   ,, : The received SINR experienced by device  on the RB (, ) at BS    : Thepathlossfromdevice to BS   N : The power of background noise  I : The power of interference D , : The set of devices which share the same RB with device  PL(): The path loss for a distance separation of  meters Ĉ,, : The uplink data rate achieved by device  on RB (, ) Ĉ : The total data rate achieved by device  : Theseto fall  : Theseto fall  z: Th es e to fa l lz  Ω: Thesetofall  : Theseto fall ,, Ĉ: Theseto fall Ĉ   : The satisfaction ratio of device  : The sum of satisfaction ratio over all devices Γ: The minimum SINR requirement G  : The interference graph for the th type   : The vertex set in G    : The edge set in G   , : The edge which represents devices  and  cannot reuse the same RB   : Theinterferenceradiusofdevice : The SINR requirement to calculate   dis(, ): The distance between device  and BS   , : The sum of satisfaction ratio over all devices of the th type given that a total of  channels have been allocated to them Δ , : The sum of satisfaction ratio over all devices of the th type given that the th channel has been allocated to them Δ ,, : The sum of satisfaction ratio over all devices of the th type given that the th RB of the th channel has been allocated to them H ,, : Thesetofdevicesoftheth type that share the th RB of the th channel   : The number of channels which have been allocated to the th type    : Thesetoftype- devices which are served by BS  H  : Thesetofdevicesoftheth type which can share the same RB   : Thenumberofgroups H  : ThesetofallH   []   : The power setting obtained at iteration   ,, : The sum of satisfaction ratio over all devices in H  given that a total of  channels have been allocated to them Δ ,,, : The sum of satisfaction ratio over all devices in H  given that the first  RBs of the th channel have been allocated to them  , : Thesumof ,, over all groups x  : Thelocationsofdevice.

Figure 4 :Figure 5 :
Figure 4: Impact of the number of BSs.

Ψ:
The area in which a set of SG devices is scattered H: Theset of devices   : The minimum uplink data rate requirement of device    : The uplink transmission power of device   max : The maximum uplink transmission power : Thenumberoftypesofdevices H  : The set of SG devices of the th type : (6)ocation is outlined in Algorithm 3, where   denotes the number of channels which have been allocated to the th type.Specifically, after the type which is allocated to the th channel has been selected in line (3), the RBs of the th channel shall be allocated according to {H ,, } which has been obtained in Algorithm 2, as shown in line(6).Let    denote the set of type- devices which are served by BS , 1 ≤  ≤ .The value of    can be derived from the value of   , which can be derived from the value of z.Let H  = {H 1 , ..., H  , ..., H   } denote the grouping for the th type, where H  is the set of devices of the th type which can share the same RB and   is the number of groups.The procedure of grouping is outlined in Algorithm 4.4.2.2.Uplink Transmission PowerControl.Since all devices in H  share the same RB, the received SINR in (1) can be rewritten as .1.4.RB Allocation.This subsection presents the RB allocation algorithm.As indicated by Property 4, due to the security consideration, different types of devices shall use different frequency channels and different types sharing the same frequency channel are not allowed.This is the constraint which channel allocation shall satisfy.The procedure of the scheduling based RB