- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Abstract and Applied Analysis

Volume 2014 (2014), Article ID 941547, 7 pages

http://dx.doi.org/10.1155/2014/941547

## AP Deployment Research Based on Physical Distance and Channel Isolation

^{1}College of Mathematics and Physics, Chongqing University of Post and Telecommunications, Chongqing 400086, China^{2}College of Communication Engineering, Chongqing University, Chongqing 400030, China^{3}School of Information, Hubei University for Nationalities, Enshi 445000, China

Received 5 January 2014; Revised 26 February 2014; Accepted 26 February 2014; Published 31 March 2014

Academic Editor: Hamid Reza Karimi

Copyright © 2014 Dangui Yan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Aiming at the problem of inefficiency of wireless local area networks (WLAN) access point (AP) deployment in urban environment, a new algorithm for AP deployment based on physical distance and channel isolation (DPDCI) is proposed. First, it detects the position information of deployed APs and then calculates the interference penalty factor combined with physical distance and channel isolation, and finally gets the optimal location and channel of the new AP through the genetic algorithm. Comparing with NOOCA algorithm and NOFA-2 algorithm, the results of numerical simulation show that the new algorithm can minimize the mutual interference between basic service sets (BSS), can ensure the maximum of throughput based on quality of service (QoS) in BSS, and can effectively improve the system performance.

#### 1. Introduction

With the development of information era, the growing importance of the wireless local area network (WLAN) becomes more and more obvious. Since the WLAN has the advantages of flexibility, simplicity, easy extension, and so on, it widely applies in hot places such as the markets, leisure clubs, and companies. However, there is no authoritative standards for commercial WLAN deployment and channel allocation and management standards, which leads to the current situation that each major telecom operator deploys its own WLAN equipment in the same hot spots in order to provide its own high-speed broadband multimedia business, respectively, which causes the repetitive construction of the coverage of the wireless access point (AP) and, at the same time, the large amount of channel interference in the limited frequency band due to the high-density deployment of AP. Therefore, how to effectively configure and optimize the AP channels becomes one of the leading problems to be solved for the large-scale commercial use of WLAN.

Aiming at AP channel interference problems, there have been some research results, most of which are mainly through the graph coloring [1], integer linear programming [2], and heuristic method [3] for allocating channels for APs in ISM (industrial, scientific, medical) band to make the whole interference minimum. Reference [4] uses the cognitive radio technology, combined with the service condition of the primary users’ band, to allocate accessible primary users’ channels for AP. However, the above algorithms improve the system throughput by minimizing interference, which neither considers the influence from different business on the throughput nor guarantees the quality of service (QoS) of the system. In order to ensure the QoS and fairness of different business in WLAN, based on Hsum algorithm [5], reference [6] introduces fairness index and puts forward the CAOTR (Channel Assignment based on the Order of Throughput Reduction) algorithm, but the complexity of the algorithm is higher. Reference [7] proposes the interference factor combining physical distance and channel isolation, but it is only suitable for the channel allocation of the fixed-location AP and does not consider changing the deployment position of the AP. In [8], it gives a self-adapted algorithm based on neural network, which adapts retreat parameters in real time at Data Link Layer according to QoS request from Application Layer and channel state information from Physical Layer. In [9, 10], based on game theory algorithm, it seeks the optimal solution under the restricted condition of throughput, QoS, fairness, and so forth. However, [8–10] fail to involve the channel allocation of AP.

This paper considers synthetically the physical distance and channel isolation among APs and the position information of already deployed AP in detection area; a new algorithm for AP deployment based on physical distance and channel isolation (DPDCI) is proposed, which can effectively reduce interference and improve the system overall throughput.

#### 2. System Model

##### 2.1. Network Model

As shown in Figure 1, each AP and associated terminals in AP’s communication range comprise a basic service set (BSS). In the BSS, terminals communicate with AP through the Media Access Control (MAC) protocol, while the communication between the APs is achieved by the IAPP [11], whose working principle is as follows: AP monitoring the adjacent AP beacon, including SNR information and the received signal strength and so on, and then AP will send its own information to the controller, including the number of terminals in the BSS. After the controller gets all the information from each AP, it will measure the overall throughput and allocate the channels. Because of the uncertainty of the AP position, it may cause the overlap on the range of BSS of different APs. In the overlap area, if channel allocation is not reasonable, it will cause interference problems when the terminals in the overlap area exchange data with the corresponding AP, especially when cochannel interference appears; it may even cause the communication interruption between client and its AP.

##### 2.2. Interference Model

As shown in Figure 2, each AP owns two areas—one is communication area, and the other is interference area. Communication area is related to transmitter power and path loss and the receiver sensitivity corresponded to the real communication rate of the physical layer. While interference area is related to transmitter power, path loss and the receiver sensitivity corresponded to the minimum-supported communication rate of the physical layer. Apparently, the interference area is greater than or equal to communication area.

The communication radius (interference radius) is defined as [12] where is transmitting power, is receiving power; is channel attenuation factor, and is the channel attenuation with one meter distance from receiver. The communication radius is obtained based on the minimum effective received power and the interference radius is obtained according to the minimum received power under interference. To simplify the analysis, we assume that the communication radius and interference radius of each AP are and , respectively.

###### 2.2.1. Channel Interference Factor

Channel interference factor between APs is defined as follows; where is the channel index number allocated to , is the channel index number allocated to , , is the transmitting power distribution of AP, is the receiving power distribution of AP, and is off-set frequency.

In order to make it easy to analyze, the paper uses the IEEE 802.11b as the WiFi to analyze, and the channel isolation is set to 5 MHz and channel bandwidth is set to 22 MHz. The transmitting power distribution is defined as follows [7]: where is the central frequency.

It is obvious that , and especially, when two APs’ channels are completely orthogonal.

###### 2.2.2. Physical Distance Interference

When the distance between and is bigger than the summation of and , its overlap area is illustrated in Figure 2, where the distance between adjacent and is , namely,* AB*, the communication radius of , namely, length of* AC*, is , and the interference radius of , namely, length of* BC*, is ; in Δ*ABC*, we can obtain and according to the cosine theorem:
where is the difference value that corresponding sector area of in the communication area minuses the area of Δ*AOC*, is the difference value that corresponding to sector area of in communication area minuses the area of Δ*BOC*:
According to symmetry, the expression of area is
Therefore, can be expressed as

###### 2.2.3. Signal to Interference Ratio in BSS

To facilitate analysis, we make such assumptions: AP receives the same power from the client and client obeys Poisson distribution in communication area, and each client transmits data equiprobably. Therefore, ignoring the noise, the APi’s SIR [13] can be expressed as

To guarantee the communication quality, SIR must satisfy the following condition: where is the value of SIR threshold under .

#### 3. Detection of Deployed APs

In an urban environment, a lot of the APs are located in some place which unable to be observed directly and the physical distance information of AP is hard to be measured directly, so wireless locating method is introduced [14]. It is assumed that the position of the already deployed AP is , the position of the th measuring point is , the received signal intensity measured at the th measuring point is , and the numerical relationship between AP and the measuring point can be expressed asFor simplicity, assume

According to the Least-Square Estimation, we can obtain

So, the position information of the deployed AP can be calculated and the position information of all APs in the area can be measured.

#### 4. Access Strategy in Authorized Frequency Band

We define as the primary user channel state at time slot , indicates that the primary user’s channel is busy, stands for availability of primary user’s channel, stands for busy probability of primary user’s channel, and stands for available probability of primary user’s channel. stands for the detection result of primary user’s channel from secondary user, stands for that the detection of primary user’s channel being busy, stands for that the detection of primary user’s channel being available, stands for probability that the detection of primary user’s channel is busy, and stands for probability that the detection of primary user’s channel is available. The accuracy of the secondary user detection result is mainly expressed with detection probability and false alarm probability * *. The access strategy of authorized frequency band can be expressed as [15]
where and stand for the secondary user’s state when channel state of authorized frequency band is . is the channel power gain between the secondary user’s transmitter and receiver. is the gain between the primary user’s transmitter and secondary user’s receiver. is the gain between the secondary user’s transmitter and primary user’s receiver. stands for the busy state of authorized frequency channel. stands for the available state of authorized frequency channel. is the situation that, after authorization, the real state of frequency band is and the detected result is the posterior probability of . Γ_{1} is the maximum power of secondary user. Γ_{2} is the interference threshold of the primary user corresponding to secondary user.

#### 5. The GA-Based AP Deployment Algorithm

In order to solve the optimal solution of the target channel allocation function reasonably, we introduce genetic algorithm [16] to solve the optimal channel allocation problem of AP.

Genetic algorithm is viewed as a classic bionic algorithm, which imitates the selection process of the biological nature and selects the more adaptive individuals to reproduce with the rule of the survival of the fittest in order to form a new solution space through crossover and mutation and finally get the optimal solution of the problem. Each kind of AP deployment is viewed as an individual, and a limited kind of AP deployment constitutes a population.

##### 5.1. Fitness Function

In order to obtain the optimal solution, we first build the fitness function. Fitness function reflects how adaptively an individual responds to the restricted conditions, and individuals with larger function values adapt better.

Assuming the positions of and are and , respectively, so the distance between and is

is defined as the whole interference factor in the area, and , so can be expressed as where is the number of APs in the area.

The system interference is minimized when the whole interference factor in the area is the minimum. To make the influence on the throughput of the whole area minimum, fitness function is defined as

The probability that one individual is selected for crossover and mutation is defined as where is the number of individuals in the population.

##### 5.2. The Pseudocode of the Algorithm

The pseudocode of the algorithm is as in Algorithm 1.

The input of the algorithm is the position information of deployed AP, the number of new AP, and information of AP-usable position. First, it allocates channels randomly for the AP and then allocates deployment point for the new APs using the deployable positions and generate a not completely same allocation result to constitutes a population, and calculate the adaptability function value of each individual in the population, and the number of the iteration is initialized as 0. When the number of the iteration is smaller than the predefined maximum iteration number, calculating the selection probability according to (18), uses the Roulette method to select individual pair for hybrid processing, uses the Roulette method to select a single individual for mutation processing to get rid of individuals less adaptive individuals, and finally it refreshes the population and the number of iterations.

#### 6. Simulations

To illustrate the performance of the algorithm, DPDCI algorithm is to be compared with the NOFA-2 algorithm [17] and the NOOCA algorithm [18].

The simulation parameters are shown in Table 1.

To estimate the interference of channel allocation algorithm over system performance, we define the average interference ratio of system user from channel interference as follows:

The simulation results are as in Figure 3.

In Figure 3, the horizontal coordinate indicates the accessed number of AP and the vertical coordinate indicates the average interference of all the system users due to channel interference. At the first halves of the three algorithms, the tendencies of average interference are the same; this is due to the fact that the ISM band resource is relatively abundant under the situation that the number of AP is small. In particular, when the channel number is fewer than 3, the system average interference is 0 since ISM band owns three orthogonal channels (1/6/11). When AP takes orthogonal channel, there has no mutually interference.

With the increase of the number of AP, the average interference of NOFA-2 is always higher than NOOCA and DPDCI since NOFA-2 only assigns channel in ISM band, while, in the lower part of ISM band, AP’s SIR is over its threshold value; if AP number increases on this base, it will increase the channel interference and lead to the increase of average interference. Moreover, the average interference of NOOCA is bigger than that of DPDCI, which is because the fact that when the NOOCA algorithm assigns channel in hybrid band, it fails to consider that the AP in unauthorized channel cannot interfere with AP in ISM band, which results in suboptimal allocation result of certain ISM band channel.

The comparison of normalization throughput of the three algorithms is shown in Figure 4. NOOCA and DPDCI algorithms introduce authorized band channel. When the number of communication channels increases, it decreases the interference between APs. Therefore, they are better than NOFA-2 algorithm in normalization throughput. The DPDCI algorithm considers that the AP in unauthorized channel cannot interfere with AP in ISM band which makes the channel allocation in ISM band more optimal. Therefore, it has a higher normalization throughput over NOOCA algorithm. As the accessing client increases, the advantage of DPDCI and NOOCA algorithms is highlighted and they are obviously higher than NOFA-2 algorithm.

Figure 5 shows the normalized throughput of DPDCI algorithm in the cases of detecting already deployed APs and not detecting already deployed APs. Because detecting already deployed AP can effectively avoid the strong interference between new AP and already deployed AP due to too close physical distance, the optimization result of this case is better than the case of not detecting already deployed AP. From the whole point of view, the normalized throughput is improved about 3.7%.

#### 7. Conclusion

This paper gives a deep discussion on the new AP deployment in city area that has been deployed APs and uses the wireless locating method to detect the position of the already deployed APs that cannot be observed directly. Adopting genetic algorithm deploys new AP and allocates channels for AP; a new algorithm for AP deployment based on physical distance and channel isolation is proposed. The simulation results show that the new algorithm can minimize the mutual interference between BSS and ensure the maximum of throughput based on QoS in BSS and can also effectively improve the system performance. In order to achieve more practical oriented results, such as achieving dynamic configuration for the AP deployment, future work in the research will consider data-driven (measurements) framework [19–22].

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

The authors would like to thank the editors and the anonymous referees for their suggestions and comments. This work was supported in part by the National Natural Science Foundation of China (Grant no. 61263030), the Natural Science Foundation Project of CQCSTC (Grant no. 2010BB2240), and the Fundamental Research Funds for the Central Universities of China (Grants no. CDJZR12160018, no. CDJZR12160019).

#### References

- E. Amaldi, S. Bosio, F. Malucelli, and D. Yuan, “Solving nonlinear covering problems arising in WLAN design,”
*Operations Research*, vol. 59, no. 1, pp. 173–187, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus - X.-N. Yue, C.-F. Wong, and S.-H. G. Chan, “CACAO: distributed client-assisted channel assignment optimization for uncoordinated WLANs,”
*IEEE Transactions on Parallel and Distributed Systems*, vol. 22, no. 9, pp. 1433–1440, 2011. View at Publisher · View at Google Scholar · View at Scopus - A. Farsi, N. Achir, and K. Boussetta, “Heuristic approaches for access points deployment and Frequency Assignment in WLANs,” in
*Proceedings of the Global Information Infrastructure Symposium (GIIS '11)*, pp. 1–7, IEEE Computer Society, Da Nang, Vietnam, August 2011. View at Publisher · View at Google Scholar · View at Scopus - F. Novillo, M. Churchman, R. Ferrús, and R. Agusti, “A channel allocation algorithm for OSA-enabled IEEE 802.11 WLANs,” in
*Proceedings of the 6th International Symposium on Wireless Communication Systems (ISWCS '09)*, pp. 468–472, Tuscany, Italy, September 2009. View at Publisher · View at Google Scholar · View at Scopus - A. Mishra, S. Banerjee, and W. Arbaugh, “Weighted coloring based channel assignment for WLANs,”
*Sigmobile Mobile Computing and Communications Review*, vol. 3, no. 11, pp. 19–31, 2005. - H. Zhang, H. Ji, and W.-D. Ge, “Channel assignment with fairness for multi-AP WLAN based on distributed coordination function,” in
*Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC '11)*, pp. 392–397, Cancun, Mexico, March 2011. View at Publisher · View at Google Scholar · View at Scopus - Y. Cui, W. Li, and X. Cheng, “Partially overlapping channel assignment based on “node orthogonality” for 802.11 wireless networks,” in
*Proceedings of the IEEE International Conference on Computer Communications (INFOCOM '11)*, pp. 361–365, Shanghai , China, April 2011. View at Publisher · View at Google Scholar · View at Scopus - C. Wang, T. Lin, and J.-L. Chen, “A cross-layer adaptive algorithm for multimedia QoS fairness in WLAN environments using neural networks,”
*IET Communications*, vol. 1, no. 5, pp. 858–865, 2007. View at Publisher · View at Google Scholar · View at Scopus - K.-L. Du, M. N. S. Swamy, and Q. Ni, “A dynamic spectrum access scheme for cognitive radio networks,” in
*Proceedings of the Canadian Conference on Electrical and Computer Engineering (CCECE '09)*, pp. 450–454, IEEE Computer Society, St. John's, Canada, May 2009. View at Publisher · View at Google Scholar · View at Scopus - M. R. Javan and A. R. Sharafat, “Efficient and distributed SINR-based joint resource allocation and base station assignment in wireless CDMA networks,”
*IEEE Transactions on Communications*, vol. 59, no. 12, pp. 3388–3399, 2011. View at Publisher · View at Google Scholar · View at Scopus - M. Haidar, R. Akl, H. Al-Rizzo, and Y. Chan, “Channel assignment and load distribution in a power-managed WLAN,” in
*Proceedings of the 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC '07)*, pp. 1–5, IEEE Computer Society, Athens, Greece, September 2007. View at Publisher · View at Google Scholar · View at Scopus - F. Novillo, M. Churchman, R. Ferrús, and R. Agustí, “A channel allocation algorithm for OSA-enabled IEEE 802.11 WLANs,” in
*Proceedings of the 6th International Symposium on Wireless Communication Systems (ISWCS '09)*, pp. 468–472, Tuscany, Italy, September 2009. View at Publisher · View at Google Scholar · View at Scopus - T. Kwon and J.-W. Choi, “Multi-group random access resource allocation for M2M devices in multicell systems,”
*IEEE Communications Letters*, vol. 16, no. 6, pp. 834–837, 2012. View at Publisher · View at Google Scholar · View at Scopus - J. Koo and H. Cha, “Localizing WiFi access points using signal strength,”
*IEEE Communications Letters*, vol. 15, no. 2, pp. 187–189, 2011. View at Publisher · View at Google Scholar · View at Scopus - W. Yuan, D. H. K. Tsang, L. Qian, and L. Meng, “Sensing based joint rate and power allocations for cognitive radio systems,”
*IEEE Communications Letters*, vol. 1, no. 2, pp. 113–116, 2012. View at Publisher · View at Google Scholar - Y. Yang and X.-J. Yu, “Cooperative coevolutionary genetic algorithm for digital IIR filter design,”
*IEEE Transactions on Industrial Electronics*, vol. 54, no. 3, pp. 1311–1318, 2007. View at Publisher · View at Google Scholar · View at Scopus - W. El-Hajj and H. Alazemi, “Optimal frequency assignment for IEEE 802.11 wireless networks,”
*Wireless Communications and Mobile Computing*, vol. 9, no. 1, pp. 131–141, 2009. View at Publisher · View at Google Scholar · View at Scopus - F. Novillo, M. Churchman, R. Ferrús, and R. Agustí, “A channel allocation algorithm for OSA-enabled IEEE 802.11 WLANs,” in
*Proceedings of the 6th International Symposium on Wireless Communication Systems (ISWCS '09)*, pp. 468–472, Tuscany, Italy, September 2009. View at Publisher · View at Google Scholar · View at Scopus - M. de la Sen, “On the characterization of hankel and toeplitz operators describing switched linear dynamic systems with point delays,”
*Abstract and Applied Analysis*, vol. 2009, Article ID 670314, 34 pages, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus - H. Li, X. Jing, and H. R. Karimi, “Output-feedback-based ${H}_{\infty}$ control for vehicle suspension systems with control delay,”
*IEEE Transactions on Industrial Electronics*, vol. 1, no. 61, pp. 436–446, 2014. - S. Yin, H. Luo, and S. X. Ding, “Real-time implementation of fault-tolerant control systems with performance optimization,”
*IEEE Transactions on Industrial Electronics*, vol. 5, no. 61, pp. 2402–2411, 2014. - H. Li, X. Jing, H.-K. Lam, and P. Shi, “Fuzzy sampled-data control for uncertain vehicle suspension systems,”
*IEEE Transactions on Cybernetics*, no. 99, pp. 2168–2267, 2013. View at Publisher · View at Google Scholar