Game-theoretic analysis for multibandwidth WLAN channel selection by coordinated APs

ABSTRACTUnderstanding the potential role of Smartphones and other portable wireless devices as relay nodes in message dissemination and content delivery in Delay Tolerant and Opportunistic networks depend on the knowledge about patterns and the number of encounter events among mobile nodes. One of the main challenges for extracting encounters is overlapping in the radio coverage areas of nearby access points (APs). Data about the usage of Wi-Fi networks can be used to perform an analysis of encounters among mobile devices. A realistic estimation of the number of encounters among mobile nodes is now a big challenge. In this paper, the effects of overlapping of radio coverage area among multiple APs for extracting realistic encounters among mobile devices has been discussed, and also an analytical approach has been proposed for extracting realistic encounters from overlapping in the coverage areas of multiple nearby APs. A significant difference was observed between the number of encounters by considering and ignoring overlapping. Our study finds that Wi-Fi datasets are not reliable source to estimate the number of encounters when there are overlapping in radio coverage areas of multiple APs.

We present a general framework for distributed wireless information flow allocation problem in multiple access networks, where the end users (EUs) can seek wireless flows from multiple access points (APs). We aim to minimize the power consumption while satisfying each EU's minimum data rate requirement but not violating peak power constraint of each AP and interference constraint monitored by regulatory agents. Toward this end, we model the flow allocation problem as a game which is proved to be a best-response potential game. Then based on potential game theory, we show the existence and uniqueness of Nash equilibrium in the formulated game. Moreover, we demonstrate that the Nash equilibrium is actually the globally optimal solution to our problem. Besides, we propose two distributed algorithms along with convergence analysis for the network to obtain the Nash equilibrium. Meanwhile, we reveal the interesting layered structure of the problem in question. Extensive numerical results are conducted to demonstrate the benefits obtained by flow allocation, as well as the effectiveness of our proposed algorithms.

Mobile edge computing (MEC) is an innovative computing paradigm to enhance the computing capacity of mobile devices (MDs) by offloading computation‐intensive tasks to MEC servers. With the widespread deployment of wireless local area networks, each MD can offload computation task to server via multiple wireless access points (WAPs). However, computation offloading can bring a higher system cost if all users select the same access points to offload their tasks. This study proposes a computation offloading strategy and resource allocation optimisation scheme in a multiple wireless access points network with MEC, which aims to minimise the system cost by providing the optimal computation offloading strategy, transmission power allocation, bandwidth assignment, and computation resource scheduling. The proposed scheme decouples the optimisation problem into subproblems of offloading strategy and resource allocation since the problem is NP‐hard. The offloading strategy involves the optimal access point selection, which is analysed by the potential game. The resource allocation is obtained using Lagrange multiplier. The authors' analysis and simulation results verify the convergence performance of the proposed scheme, and the proposed scheme outperforms the simple resource allocation scheme and the offloading strategy optimisation scheme in terms of the system cost.

PurposeWireless local area networks (WLANs) are the predominant option for broadband wireless access network, and multiple access points (APs) will be much more available for wireless stations (WSTAs). Call admission control (CAC) on AP selection problem over 802.11 WLAN is a critical issue. In the existing architecture, strongest‐signal‐first is the default AP selection mechanism in 802.11 WLAN which uses the single criterion, received signal strength indicator, to select AP. However, this method suffers from bandwidth deficiency and unbalanced load among APs due to the uneven distribution of user load, thus degrading the system throughput. Instead, the purpose of this paper is to propose a multi‐criteria CAC on AP selection algorithms.Design/methodology/approachThe distributed multi‐criteria considered in order are RSSI, minimum required bandwidth of WSTA, estimated effective bandwidth (EEB) and AP‐WSTA distance. A semiMarkov model considering both packet retransmission limit, packet error rate and collision effect is proposed to predict the system throughput and validated through simulation results. Two multi‐criteria AP selection algorithms after EEB is evaluated are proposed and compared based on this analytical model.FindingsThe proposed algorithms outperform the traditional SSF algorithm in terms of the balance index for AP and the average system throughput.Originality/valveThe paper presents performance analysis for multi‐criteria CAC for distributed access point selection in WLANs.

Wireless LANs have been widely deployed, and multiple access points (APs) will be much more likely to be available there for STAs, which can roam from one AP to another by some rule. We here focus on an efficient and fair way to use the wireless access resources provided by multiple APs. In particular, our major concern is to develop a decentralized way to enable each of STAs to select an appropriate one of available APs independently. A straightforward way is to select an AP with strongest signal, which will be, however, shown to need further improvement. Hence, we propose decentralized AP selection strategies to achieve an efficient and fair share of wireless access resources, and evaluate them by simulations. Through our results, the proposed strategies can attain an excellent throughput performance by use of the number of active STAs sharing each AP even if STAs employ the strategies only when entering the wireless LAN. In addition, if STAs roam from one AP to another in response to changing situation, the total throughput and fairness can be further improved very much. keyword

In an 802.11 wireless network with multiple access points (APs), for a commercial user, a prime concern is how to discover the desired AP since the AP providers maybe selfish and owned by different organization. This paper presents a generic reputation based framework for AP selection for this case. An M/M/1 queuing model is introduced to get a quantitative insight into the performance of wireless AP. Analytical expression for the transmission attempt probability of packet in an 802.11 network is derived and used to calculate the reputation value. The model also shows how the reputation values can be updated based on the result of service to eliminate the impact of misbehavior AP providers. Finally results are validated via simulation with statistical analysis.

In this paper, we present a framework for providing fair service and supporting quality of service (QoS) requirements in IEEE 802.11 networks with multiple access points (APs). These issues becomes critical as IEEE 802.11 wireless LAN are widely deployed in nationwide networks, linking tens of thousands of "hot-spots" for providing both real-time (voice) and non real-time (data) services to a large population of mobile users. However, both fairness and QoS guarantees cannot be supported in the current 802.11 standard. Our system, termed MiFi, relies on centralized coordination of the APs. During any given time of the "contention-free" period only a set of non-interfering APs is activated while the others are silenced. Moreover, the amount of service granted to an AP is proportional to its load and the system's performance is optimized by employing efficient scheduling algorithms. We show that such a system can be implemented without requiring any modification of the underlying MAC protocol standard or the behavior of the mobile stations. Our scheme is complementary to the emerging 802.11e standard for QoS and guarantees to overcome the hidden node and the overlapping cell problems. Our simulations establish that the system supports fairness and hence can provide QoS guarantees for real-time traffic, while maintaining a relative high throughput

Wireless multicast has been exploited to bridge the gap between the limited wireless bandwidth and the rapidly increasing mobile video traffic demand. Multicast of videos to a set of heterogeneous users over multiple wireless access points, however, is challenging because of the trade-offs between high transmission rate, load balancing, and multicast opportunities. In this paper, we present JurCast, a joint user and rate allocation scheme for video multicast over multiple APs. Our approach balances the trade-off between these factors by determining user to Access Points (APs) association, the video resolution version (quality) to be delivered for each session, and the transmission link rate for each video version. The aim of our solution is to maximize the overall received video quality over all users. We have implemented and evaluated our solution on a WiFi testbed as well as the simulation of a large scale deployment. The results indicate that our method considerably outperforms the baseline schemes and achieves up to 3dB and 55% improvements in terms of peak signal-to-noise ratio (PSNR) and goodput, respectively.

Sensor network with mobile access (SENMA) is an architecture in which randomly deployed low-power sensors are orchestrated by a few powerful mobile access points. This paper considers SENMA from energy-efficiency and information-theoretic perspectives. By allowing sensors to propagate data directly to mobile access points over multiaccess channels and relieving sensors from energy-consuming network functions, SENMA has the potential of offering orders of magnitude of improvement in energy efficiency over the multihop ad hoc architecture, as demonstrated by our analysis on scalability. Optimization configurations of SENMA such as the altitude, the trajectory, and the coverage of access points are considered next, using the sum-rate as the performance metric. Optimal strategies for single and multiple access points are determined. For multiple access points, the possibility of and the gain due to cooperation (i.e., joint decoding of signals received at different access points) are investigated.

With increasing popularity of wireless local area network (WLAN) and emerging real-time applications, seamless mobility has become one of the primary concerns. Hence, the choice of a proper handover algorithm is of utmost importance. Various performance evaluation metrics for handover algorithms have been proposed in this regard. We argue that in a multiple access point (AP) scenario, the load on each of the APs, the requested data rate of the mobile terminal, and the soft handover have significant impact on these metrics. In this paper, we present an analytical framework to measure various handover performance evaluation metrics under both load condition and soft handover for a specific data rate request. Our approach is based on finding the circular region centered around an AP within which the requested data rate can be satisfied. We have considered WLAN usage efficiency, handover failure probability, and unnecessary handover probability as evaluation metrics. We have analyzed the impact of load and soft handover on these metrics. The impact of velocity on these metrics has also been analyzed. We also have derived lower bounds on both handover failure probability and unnecessary handover probability by formulating the problem into three circle intersection problem. The circular coverage assumption used in the framework is also validated through simulation.

The purpose of this study is to examine the impact of information placement within the confines of the online classroom architecture. Also reviewed was the impact of other variables such as course design, teaching presence and student patterns in looking for information. The sample population included students from a major online university in their first year course sequence. Students were tasked with completing a survey at the end of the course, indicating their preference for accessing information within the online classroom. The qualitative data indicated that student preference is to receive information from multiple access points and sources within the online classroom architecture. Students also expressed a desire to have information delivered through the usage of technology such as email and text messaging. In addition to receiving information from multiple sources, the qualitative data indicated students were satisfied overall, with the current ways in which they received and accessed information within the online classroom setting. Major findings suggest that instructors teaching within the online classroom should have multiple data access points within the classroom architecture. Furthermore, instructors should use a variety of communication venues to enhance the ability for students to access and receive information pertinent to the course.

In this paper, we propose a new channel selection method for IEEE 802.11 based wireless local area network (WLAN) using the 2.4GHz band. The proposed algorithm searches the nearby access points (APs) through channel scanning. The scanned APs are classified into shared APs using the target channel and interference APs using the channels adjacent to the target channel. The proposed method evaluates the achievable rate by separately considering the losses by shared APs and interference APs, and selects the channel with the maximum achievable rate. The performance of the proposed algorithm is compared to those of existing channel selection techniques through field tests in practical WLAN environments.

Overlaid cellular technology has been considered as a promising candidate to enhance the capacity and extend the coverage of cellular networks, particularly indoors. The deployment of small cells (e.g. femtocells and/or picocells) in an overlaid setup is expected to reduce the operational power and to function satisfactorily with the existing cellular architecture. Among the possible deployments of small-cell access points is to manage many of them to serve specific spatial locations, while reusing the available spectrum universally. This contribution considers the aforementioned scenario with the objective to serve as many active users as possible when the available downlink spectrum is overloaded. The case study is motivated by the importance of realizing universal resource sharing in overlaid networks, while reducing the load of distributing available resources, satisfying downlink multi-channel assignment, controlling the aggregate level of interference, and maintaining desired design/operation requirements. These objectives need to be achieved in distributed manner in each spatial space with as low processing load as possible when the feedback links are capacity-limited, multiple small-cell access points can be shared, and data exchange between access points can not be coordinated. This contribution is summarized as follows. An adaptive downlink multi-channel assignment scheme when multiple co-channel and shared small-cell access points are allocated to serve active users is proposed. It is assumed that the deployed access points employ isotropic antenna arrays of arbitrary sizes, operate using the open-access strategy, and transmit on shared physical channels simultaneously. Moreover, each active user can be served by a single transmit channel per each access point at a time, and can sense the concurrent interference level associated with each transmit antenna channel non-coherently. The proposed scheme aims to identify a suitable subset of transmit channels in operating access points such that certain limits on the aggregate interference or number of serving access points are satisfied, while reducing the load of processing. The applicability of the results for some scenarios, including the identification of interference-free channels in operating access points is explained. Numerical and simulations results are shown to clarify achieved gains with the use of the proposed scheme under various operating conditions.

Currently, Internet of Things (IoT) has become common in various applications, including smart factories, smart cities, and smart homes. In them, wireless local-area networks (WLANs) are widely used due to their high-speed data transfer, flexible coverage ranges, and low costs. To enhance the performance, the WLAN configuration should be optimized in dense WLAN environments where multiple access points (APs) and hosts exist. Previously, we have studied the active AP configuration algorithm for dual interfaces using IEEE802.11n and 11ac protocols at each AP under non-channel bonding (non-CB). In this paper, we study the algorithm considering the channel bonding (CB) to enhance its capacity by bonding two channels together. To improve the throughput estimation accuracy of the algorithm, the reduction factor is introduced at contending hosts for the same AP. For evaluations, we conducted extensive experiments using the WIMENT simulator and the testbed system using Raspberry Pi 4B APs. The results show that the estimated throughput is well matched with the measured one, and the proposal achieves the higher throughput with a smaller number of active APs than the previous configurations.

With the increased deployment of wireless local area networks (WLAN) in many popular locations with multiple access points (AP), the limited number of usable radio channels provided by the IEEE 802.11 standard has resulted in a worse than expected network performance, such as very low throughput. The existing static radio channel allocation (RCA) schemes can only partially solve the problem in the initial planning of APs, but cannot adapt to environment changes and dynamic traffic conditions afterwards. We propose a new dynamic RCA scheme that aims to improve network performance by explicitly minimizing the cochannel interference among the neighboring APs that share a radio channel. Simulation results have demonstrated that the proposed scheme has not only significantly increased the overall network throughput, but also greatly reduced the cochannel interference among the APs