Characterizing the impact of non-uniform deployment of APs on network performance under partially overlapped channels

Authors:
Wei Zhao;Zubair Md. Fadlullah;Hiroki Nishiyama;Nei Kato
Affiliations:
Graduate School of Information Sciences, Tohoku Univeristy, Sendai, Miyagi, Japan;Graduate School of Information Sciences, Tohoku Univeristy, Sendai, Miyagi, Japan;Graduate School of Information Sciences, Tohoku Univeristy, Sendai, Miyagi, Japan;Graduate School of Information Sciences, Tohoku Univeristy, Sendai, Miyagi, Japan
Venue:
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Year:
2013

Citing 6
Cited 0

Partially overlapped channels not considered harmful

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Exploiting partially overlapping channels in wireless networks: turning a peril into an advantage

IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Wireless sensor network survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Multiple radio channel assignement utilizing partially overlapped channels

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A survey on wireless mesh networks

IEEE Communications Magazine
Vehicle-to-vehicle wireless communication protocols for enhancing highway traffic safety

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Partially overlapped channels were demonstrated to have the potential of improving the network performance. One example is an increased capacity in a well saturated network. We address the problem of Wi-Fi network planning incorporating partially overlapped channels by more efficiently exploring the spatial reuse to increase the network capacity. We exploit that the interference ranges for separated channels are different, which can be utilized to deploy access points non-uniformly. In this paper, we formulate the problem, show that it can not be solved in polynomial time. Therefore, we propose a greedy optimization algorithm and validate the theoretical results through computer-based simulations.