An RSSI gradient-based AP localization algorithm

Precise localization of Wi-Fi Access Point (AP) is becoming increasingly important with the rise of diverse location-based services based on smartphone. In this article, we propose a new method for precise Wi-Fi AP localization using GPS information of smartphone. The idea is that the possible area of Wi-Fi AP location, called AP_Area, is first determined by measuring GPS information and the Received Signal Strength (RSS) of smartphones from Wi-Fi AP. As the number of measurement points from users' smartphones increases, the AP_Area can be successively narrowed down to the actual AP location. Simulation results show that the proposed algorithm can detect the Wi-Fi AP localization within 5 m (probability over than 80%).

We consider a communication cell comprised of Internet-of-Things (IoT) nodes transmitting to a common Access Point (AP). The nodes in the cell are assumed to generate data samples periodically, which are to be transmitted to the AP. The AP hosts a machine learning model, such as a neural network, which is trained on the received data samples to make accurate inferences. We address the following tradeoff: The more often the IoT nodes transmit, the higher the accuracy of the inference made by the AP, but also the higher the energy expenditure at the IoT nodes. We propose a data filtering scheme employed by the IoT nodes, which we refer to as distributed importance filtering in order to filter out redundant data samples already at the IoT nodes. The IoT nodes do not have large on-device machine learning models and the data filtering scheme operates under periodic instructions from the model placed at the AP. The proposed scheme is evaluated using neural networks on a benchmark machine vision dataset, as well as in two practical scenarios: leakage detection in water distribution networks and air-pollution detection in urban areas. The results show that the proposed scheme offers significant benefits in terms of network longevity as it preserves the devices' resources, whilst maintaining high inference accuracy. Our approach reduces the the computational complexity for training the model and obviates the need for data pre-processing, which makes it highly applicable in practical IoT scenarios.

The access point (AP) deployment is a fundamental task for constructing an accurate localization system. Existing literature mainly deals with the AP placement problem using optimal geometry analysis since the target-AP geometry will affect the localization performance. However, some non-ideal phenomena in practical scenario, e.g., the existence of obstacles, array orientation and path loss, will degrade the accuracy of angle-of-arrival (AoA) estimation as well as the localization accuracy. In this article, we reformulate the AP planning incorporating these factors. We decompose the problem into two subproblems, namely AP selection problem and error minimization problem. The AP selection problem selects the minimum number of APs to satisfy a desired localization accuracy, aided by a refined orientation updating procedure. We design a centralized and a distributed error minimization algorithm to further decrease the localization error. The centralized algorithm shows superiority in time efficiency. Nevertheless, the case with large number of APs may lead to excessive computational cost. Accordingly, we further devise the distributed algorithm which is adaptive to large-scale deployment. Numerical studies in indoor environments with barriers are conducted to verify our proposed approach.

Wi-Fi networks are becoming more and more ubiquitous and represent a substantial source of energy consumption around the globe, mainly when it comes to Access Points (APs). There has been some work done on the characterization of the power consumption of Wi-Fi APs and network interface cards (NICs), and the power usage of these devices under different configurations and standards but mostly using legacy standards. A detailed AP power consumption analysis, exploring the whole set of degrees of freedom and capabilities of these devices is lacking in the state of the art. In this paper, we present a thorough power consumption analysis, covering the configuration options available in enterprise Wi-Fi APs from the three major vendors on the market. The goal is to understand how the power consumption of an AP varies with the different configurations, and provide insights on the parameters that significantly affect the AP power consumption. The obtained experimental results confirm previous state-of-the-art conclusions but contradict some of the studies and results found in the literature, while updating results and conclusions taken in the past to the most recent standards, configurations, and data rates available today. The analysis provided herein is a valuable source of information for deriving new AP power consumption models and designing energy-efficient Wi-Fi networks.

In indoor positioning system, the user’s location is estimated based on user fingerprints database collected. The received signal from a user at a certain location is compared with all database entries and the best match is selected as the correct estimation. For a given number of access points (APs), optimizing the locations of APs can significantly improve the performance of user location estimation. In this work, the probability of correct estimation is analyzed based on APs location. Both analytical expressions and numerical results are presented and discussed. It has been shown that the probability of correct estimation is highly affected by the APs locations. Furthermore, a new technique is proposed to remarkably reduce the search-cost when comparing a received user signal to the data-base. The performance of the system is analyzed considering different APs locations, different user locations, and different noise variances. It is shown that user’s location estimation is significantly improved when compared to existing techniques.

It is usually possible to associate with more than one Access Point (AP) in IEEE 802.11 Wireless LANs. AP selection is a crucial issue because the performance achieved by a user heavily depends on the AP selected. A received signal strength (RSS)-based association mechanism is specified by the IEEE 802.11 standard. However, this does not consider the channel conditions and AP load, which leads to a low throughput and a low user transmission rate. An alternative to using the RSS is to exploit the airtime metric, which provides users with information on how busy the channel is, but the results of our simulations show that the airtime metric cannot indicate the exact status of the channel. In this paper, we present a new association framework using channel occupancy in order to provide users with exact channel status information of APs. Via the proposed scheme, users can compare the achievable throughput provided by each AP and select the best AP. We validate our proposed association method via simulation results, which show that the throughput improvement of the method is worthy of notice.

Wireless fidelity (WiFi) networks are deployed in several varied environments all around the World. Usually, the wireless fidelity access points are always on in houses and other small companies. In buildings of large companies and public organizations and in university campuses the number of access points is elevated; they are powered using power over the ethernet and are always on. Consequently, they consume a considerable amount of electric energy. The last versions of the International Electric and Electronic Engineers 802.11 standardized procedures to save energy in a wireless fidelity terminal but not in the access point. We designed a formal method to show when energy can be saved in wireless fidelity access points considering different power supplies for the access point: an electric energy battery and a standard voltage supply. We use an external battery that stores electric energy during an interval of time from a standard voltage supply (Charge period). After that interval (Discharge period), the energy supply for the access point is the external battery. Those intervals of time are repeated sequentially (Charge and Discharge cycles). We verified our formal model implementing a hardware circuit that controls the power supply for the access point. The amount of energy saving for a large number of of access points during a long period of time is considerably high.

With the advantage of high bandwidth and low cost, WLAN is widely regarded as an appealing technology for wireless access. However, WLAN only provides very limited coverage which is no more than hundreds of meters, making users experience intermittent connectivity when they move near Wi-Fi access points (AP). To fill in the gaps between APs, we present a new framework, which combines infrastructure composed of APs with the concept of DTN to improve network performance. In particular, when a mobile client has moved out of the reach of the infrastructure, our framework predicts the trajectory of this client and lets the APs in the proximity identify suitable relay nodes among the mobile clients that happen to visit those APs. If some passing by mobile clients have a chance to encounter the target client soon, the corresponding AP(s) will transfer the data destined to the target client to those mobile clients, in the hope that they will accomplish the delivery in a store-carry-forward fashion. In this way, the target client may be able to receive data even before it arrives at an AP. Our evaluation shows that our framework fairly improves the performance in terms of both delivery delay and delivery ratio, with controlled overhead.

In this work, we investigate the problem of channel and rate allocation for LTE-Unlicensed (LTE-U) to efficiently coexist with WiFi access points (APs). Specifically, we formulate an auction mechanism where LTE-U first announces an aggregation number (number of WiFi channels that LTE-U wishes to aggregate) and a reserve rate (maximum rate that LTE-U is willing to allocate to an AP), following which the APs decide their mode of operation—cooperation or competition. In cooperation mode, an AP allows LTE-U to exclusively occupy its channel (in return for a rate) while in the competition mode both LTE-U and AP simultaneously contend for channel access. We characterize the solution to the auction problem in terms of Symmetric Bayesian Nash Equilibrium (SBNE) and prove results illustrating its structure. We then optimize the auction mechanism by evaluating the optimal aggregation number and reserve rate that maximizes the total rate achieved by LTE-U subject to a constraint on APs’ rates. Finally, through simulation experiments we demonstrate the efficacy of our algorithm in comparison with (1) the strategy of aggregating a fixed number of channels and (2) a heuristic algorithm where a random number of channels are aggregated.

The recent ubiquitous deployment of Wi-Fi access points (APs) has offered vehicles to use the high-speed and low-cost Internet service via the roadside APs. However, the high mobility of vehicles and the limited coverage of APs render some challenges. First, it results in frequent handoffs, thus leading to long delay and low service availability. Second, the available AP sets and their channel quality change dynamically, making the AP selection problem even harder. Therefore, there is a strong need to develop an efficient association control mechanism that provides efficient vehicular Wi-Fi access. In this paper, we present a theoretical framework to formulate the optimal association problem through non-linear integer programming, whose objective function is to maximize the throughput or to minimize the handoff overhead. We show that this problem holds the totally unimodular (TU) property and is thus solvable in polynomial time. Then, we study the optimality of association control by comparing existing online algorithms through real trace-based simulations. The results show that there exists a large performance gap between the performance of existing online algorithms and the optimal one. We also observe that the association control algorithm can be further improved if it has access to future knowledge. Particularly, the offline optimal with future AP information improves the performance of the local optimal by up to 10%.

In this paper, we study the physical-layer security in a 3-D multiuser visible light communication (VLC) network. The locations of access points (APs) and mobile users are modeled as two 2-D, independent and homogeneous Poisson point processes at distinct heights. Using mathematical tools from stochastic geometry, we provide a new analytical framework to characterize the secrecy performance in multiuser VLC networks. Closed-form results for the outage probability and the ergodic secrecy rate are derived for networks without AP cooperation. Considering the cooperation among APs, we give tight lower and upper bounds on the secrecy outage probability and the ergodic secrecy rate. To further enhance the secrecy performance at the legitimate user, a disk-shaped secrecy protected zone is implemented in the vicinity of the transmit AP. Based on the obtained results, it is shown that cooperating neighboring APs in a multiuser VLC network can bring performance gains on the secrecy rate, but only to a limited extent. We also show that building an eavesdropper-free protected zone around the AP significantly improves the secrecy performance of legitimate users, which appears to be a promising solution for the design of multiuser VLC networks with high security requirements.

With the fast-growing demand for mobile services, where to place the access points (APs) for providing uniformly and appropriately distributed signals in a wireless local area network (WLAN) becomes an important issue in the wireless network planning. Basically, AP placement will affect the coverage and strength of signals in a WLAN. The number and locations of APs in a WLAN are often decided on the basis of the trial-and-error method. Based on this method, the network planner first selects suitable locations to place APs through observation, and then keeps changing the locations to improve the signal strength based on the received signal. Such process is complicated, laborious and time-consuming. To overcome this problem, we investigate the back-propagation neural network (BPNN) algorithm to improve over the traditional trial-and-error method. Without increasing the number of APs, our approach only needs to adjust AP locations to overcome weak signal problems and thus increase the signal coverage for the Internet connection anywhere within the area. In our experiment, we established a WLAN on a C campus. Our experiments also indicate that placing APs according to the BPNN provided better signal coverage and met the students’ demands for connecting to the Internet from anywhere in the classroom.

How many small cell (SC) access points (APs) are required to guarantee a chosen quality of service in a heterogeneous network? In this chapter, we answer this question considering two different network models. The first is the downlink of a finite-area SC network where the locations of APs within the chosen area are uniformly distributed. A key step in obtaining the closed-form expressions is to generalize the well-accepted moment matching approximation for the linear combination of lognormal random variables. For the second model, we focus on a two-layer downlink heterogeneous network with frequency reuse-1 hexagonal macro cells (MCs), and SC APs that are placed at locations that do not meet a chosen quality of service from macro base stations (BSs). An important property of this model is that the SC AP locations are coupled with the MC coverage. Here, simple bounds for the average total interference within an MC makes the formulation possible for the percentage of MC area in outage, as well as the required average number of SCs (per MC) to overcome outage, assuming isolated SCs. Introduction Heterogeneous cellular networks (HCNs) are being considered as an efficient way to improve system capacity as well as effectively enhance network coverage [1, 2]. Comprising multiple layers of access points (APs), HCNs encompass a conventional macro cellular network (first layer) overlaid with a diverse set of small cells (SCs) (higher layers). Cell deployment is an important problem in heterogeneous networks, both in terms of the number and positioning of the SCs. Traditional network models are either impractically simple (such as the Wyner model [3]) or excessively complex (e.g., the general case of random user locations in a hexagonal lattice network [4]) to accurately model SC networks. A useful mathematical model that accounts for the randomness in SC locations and irregularity in the cells uses spatial point processes, such as Poisson point process (PPP), to model the location of SCs in the network [5–10]. The independent placement of SCs from the MC layer, has the advantage of analytical tractability and leads to many useful SINR and/or rate expressions. However, even assuming that wireless providers would deploy SCs to support mobile broadband services, the dominant assumption remains that SCs are deployed randomly and independent of the MC layer [11].

Energy harvesting (EH), which refers to replenishing energy from the environment, is demonstrated to be a promising approach in reducing the operational expenses (OPEX) and increasing the network lifetime of emerging wireless communication technologies by eliminating the need for frequent battery replacing or recharging of wireless devices. Among various ambient energy sources, the focus of this dissertation is on wireless power transfer (WPT) considering the unique characteristic of radio frequency (RF) signals; that is, they inherently carry both information and energy. A particularly interesting scenario arises when sources support simultaneous wireless information and power transfer (SWIPT) to provide a remote, controllable, and on-demand energy source. In this context, one of the promising deployment approaches is SWIPT-enabled cognitive radio networks (CRNs), which offer significant gains in terms of spectral and energy efficiencies. One of the practical scenarios of RF-powered CRN is deploying a number of distributed cognitive sensor nodes, equipped with RF EH modules, to sense a specific area and send the sensed data to an access point while coexisting with a primary licensed network. However, exploiting the full potentials of SWIPT-enabled CRNs is subject to carefully aligning the requirements of the EH unlicensed secondary receivers (SRs) with those of the legitimate primary receivers (PRs). In light of this, the first contribution of this thesis focuses on investigating the problem of beamforming for the downlink of multi-user multiple-input single-output (MU-MISO) CRNs. With the objective of minimising the transmission power of the secondary base station (SBS), optimal and suboptimal solutions for the formulated optimisation problem are provided by jointly optimising the transmit beamforming vector at the SBS and adjusting the parameters of the energy harvesters at the SRs. It is shown that the obtained solutions are efficient in meeting the EH and quality-of-service (QoS) requirements of the SRs and the levels of interference accepted by the PRs. Apart from SWIPT-enabled CRNs, relay-assisted SWIPT networks are envisioned to be a promising framework offering extended coverage, diversity gains, and enhanced energy efficiency. In this case, the relay network itself can benefit from the relayed transmissions in terms of saving energy, and the harvested energy can be used to charge relay nodes and extend their lifetime as compensation for their role of data forwarding. Nonetheless, a concrete performance analysis on the impact of the involved system parameters such as, the energy conversion efficiency and the location of the EH relay terminal, on the trade-off between the achievable information transfer efficiency and the harvested energy level is crucial for the successful implementation of SWIPT in this context. This inspired the research work in the next two contributions with the main focus on developing novel comprehensive analytical frameworks for the investigation and evaluation of SWIPT relaying systems. Specifically, the second contribution is dedicated to examining the application of noncoherent modulation, which is recognised as an energy efficient modulation scheme for SWIPT, due to its ability to eliminate the need of instantaneous channel state information (CSI) estimation/tracking. Through adopting a moments-based approach, novel expressions are derived for the outage probability, achievable throughput, and average symbol error rate (ASER) of dual-hop SWIPT relaying systems. Furthermore, new asymptotic analytical results are derived for the high SNR regime and are then utilised to analytically quantify the achievable diversity order. The proposed mathematical tools are demonstrated to be an accurate and efficient means by which one can conduct a thorough analysis on the system performance without the burden of Monte Carlo simulations. Finally, the third contribution focuses on SWIPT relaying systems operating in the presence of impulsive non-Gaussian noise, which is typical in several practical scenarios. Several studies show sufficient evidences that impulse man-made noise is encountered in various metropolitan, indoor, and underwater wireless applications. Examples of these sources include automotive ignition, electronic devices, household appliances, medical equipment, and industrial equipment. To characterise the behavior of the system performance under this type of noise, an efficient analytical framework is developed where novel closed-form xpressions for the pairwise error probability (PEP) are derived for two relaying schemes, namely, blind relaying and CSI-assisted relaying, employed under two assumptions imposed on the deployed EH process; namely, instantaneous EH (IEH) and average EH (AEH). Apart from being accurate, the derived expressions are shown to be efficient in quantifying the diversity order of the system and providing a comprehensive study on the impact of the severity of impulsive noise on the behavior of the system.

The deployment of access points (APs) imposes a great impact on the performance of wireless local area networks (WLANs). Although there have been plenty of works on the optimal AP deployment (OAD), however, the issue remains open that how to deploy APs energy-savingly in 3-D environments while considering some practical demands. Therefore, this article investigates the OAD with the objective of minimizing the total AP transmission power while guaranteeing the effective coverage by jointly optimizing the transmission power and location of each AP. Different from existing works, our article fully considers not only real 3-D environments with various obstacles but also the differentiated coverage demand and the restrictions on AP locations. To solve this NP-hard optimization problem, this article first proposes a novel hybrid swarm intelligence optimization algorithm, named PSO-Lévy-DFOA. The computational results on 16 benchmark functions and comprehensive comparisons with other algorithms demonstrate the superior global convergence performance of PSO-Lévy-DFOA. The proposed PSO-Lévy-DFOA-based OAD method is then applied to WLAN planning in a two-story building. It has been shown that the total AP transmission power can be considerably reduced compared to the current deployment while still fulfilling the effective coverage.