Search

There is a growing demand for indoor positioning systems (IPSs) in a wide range of applications. However, traditional solutions such as GPS face many technical challenges. In recent years, a promising alternative has been emerging, the visible light communication (VLC)-based IPS, which offers a combination of high accuracy, low cost, and energy efficiency. This article presents a comprehensive review of VLC-based IPSs, providing a tutorial-like overview of the system. It begins by comparing various positioning systems and providing background information on their inherent limitations. Experimental results have demonstrated that VLC-based systems can achieve localization accuracy to within 10 cm in controlled environments. The mechanisms of VLC-based IPSs are then discussed, including a comprehensive examination of their performance metrics and underlying assumptions. The complexity, operating range, and efficiency of VLC-based IPSs are examined by analyzing factors such as channel modeling, signal processing, and localization algorithms. To optimize VLC-based IPSs, various strategies are explored, including the design of efficient modulation schemes, the development of advanced encoding and decoding algorithms, the implementation of adaptive power control, and the application of state-of-the-art localization algorithms. In addition, system parameters are carefully examined. These include LED placement, receiver sensitivity, and transmit power. Their impact on energy efficiency and localization accuracy is highlighted. Altogether, this paper serves as a comprehensive guide to VLC IPSs, providing in-depth insights into their vast potential and the challenges that they present. [ABSTRACT FROM AUTHOR]

We consider collision channel without feedback in which collided packets are considered unrecoverable. For each user, the transmission of packets foHows a specific periodical pattern, called the protocol sequence. Due to the lack of feedback, the beginning of the protocol sequences cannot be synchronized and nonzero relative offsets are inevitable. It results in variation of throughput. In this paper, we investigate optimal protocol sequence sets, in the sense that the throughput variance is zero. Such protocol sequences are said to be shift-invariant (SI). The characterizing properties of SI protocol sequences are presented. We also prove that SI sequences are identifiable, meaning that the receiver is able to determine the sender of each successfully received packet without any packet header. A general construction of SI sequences that meets the lower bound on sequence length is given. Besides, we study the least periods of SI sequences, and show that the least periods must be distinct in some cases. The throughput performance is compared numerically with other protocol sequences. Index Terms--Collision channel without feedback, protocol sequences.

In this paper, we study non-orthogonal multiple access (NOMA) user scheduling and resource allocation problem for a generic downlink single-cell multiple input and single output (MISO) millimeter wave (mmWave) system. The larger number of packed antennas and the highly directional property of mmWave communications enable directional beamforming to achieve spatial diversity. Toward this end, we consider two different hybrid precoding schemes which are based on orthogonal matching pursuit (OMP). Users are assigned into different clusters and the base station (BS) transmits superposed signals that share the same precoding vector. Moreover, both fixed number of users per cluster and dynamic number of users per cluster are investigated. We aim to jointly optimize the user clustering, service scheduling, and power allocation strategy, in maximizing the proportional fairness (PF) among the users and exploring the multiuser diversity and multiplexing gain. Since the formulated joint user clustering, scheduling and power allocation problem is a mixed integer non-convex optimization problem, we propose a two-fold methodology. First, we apply a hybrid precoding and user clustering scheme, where the hybrid precoder is constructed by singular vector division (SVD) or minimum mean square error (MMSE). Then, with the obtained result, we approximate the proportional fairness power allocation problem by a sequence of Geometric Programming (GP) problems which are solved iteratively. The proposed scheme strikes a balance between the spectral efficiency and service fairness. Results show that the proposed MISO-NOMA scheme which is based on MMSE hybrid precoder and the proposed user scheduling and power allocation strategy under proportional fairness metric can outperform various conventional MISO schemes. Furthermore, our proposed dynamic number of users per cluster scheme outperforms the fixed scheme and can be considered as an upper bound in several aspects, including spectral efficiency and fairness. [ABSTRACT FROM AUTHOR]

A class of periodic unipolar binary sequences is investigated for their potential applications in defining new protocols for distributed multiple accessing. Based on linear congruence sequences, one can show that, for any finite subset of these sequences, with the total proportional rate not exceeding a specific threshold, there cannot be enough collisions to completely block any particular sequence, no matter how they are shifted with respect to one another. This property can be exploited in certain applications, such as wireless sensor and ad hoc networks. A further investigation into how to enhance the allowable rate sum is conducted. New protocol sequences with interesting and useful properties are accordingly designed. Index Terms--Collision channel without feedback, multiple access, protocol sequence, shift invariant, user unsuppressibility.

This paper deals with a class of power control problems where the system link gains are assumed to be time varying and the signal-to-interference ratio (SIR) estimates are allowed to be corrupted with bounded noises. A simple control algorithm is devised by applying a distributed, fixed step approach. It is a feedback algorithm that requires only local information. By modifying the distributed, fixed step power control algorithm proposed by Sung and Wong, we obtain here a more robust version that can handle time varying link gains and measurement noises. The convergence property of the new algorithm is established and simulation studies were carried out to show that it is effective. Index Terms--Cellular mobile system, distributed algorithm, power control, time-varying channels.

Coded Slotted ALOHA (CSA) is a random access scheme based on the application of packet erasure correcting codes to transmitted packets and the use of successive interference cancellation at the receiver. CSA has been widely studied and a common assumption is that interference cancellation can always be applied perfectly. In this paper, we study the design of CSA protocol, accounting for a non-zero probability of error due to imperfect interference cancellation (IC). A classical method to evaluate the performance of such protocols is density evolution, originating from coding theory, and that we adapt to our assumptions. Analyzing the convergence of density evolution in asymptotic conditions, we derive the optimal parameters of CSA, i.e., the set of code selection probabilities of users that maximizes the channel load. A new parameter is introduced to model the packet loss rate of the system, which is non-zero due to potential IC errors. Multi-packet reception (MPR) and the performance of 2-MPR are also studied. We investigate the trade-off between optimal load and packet loss rate, which sheds light on new optimal distributions that outperform known ones. Finally, we show that our asymptotic analytical results are consistent with simulations obtained on a finite number of slots. [ABSTRACT FROM AUTHOR]

Future wireless communication systems have been imposed high requirement on power efficiency for operator’s profitability as well as to alleviate information and communication technology (ICT) global carbon emission. To meet these challenges, the power consumption minimization problem for a generic multi-cell multiple input and single output non-orthogonal multiple access (MISO-NOMA) system is studied in this work. The associated joint user grouping, beamforming (BF) and power control problem is a mixed integer non-convex programming problem, which is tackled by an iterative distributed methodology. Towards this end, the near-optimal zero-forcing (ZF) BF is leveraged, wherein the semiorthogonal user selection (SUS) strategy is applied to select BF users. Based on these, the BF vectors and BF users are determined for each cell using only local information. Then, two distributed user grouping strategies are proposed. The first one, called channel condition based user clustering (CCUC), performs user grouping in each cell based on the channel conditions. This is conducted independently of the power control part and has low computational complexity. Another algorithm, called power consumption based user clustering (PCUC), uses both the channel conditions and inter-cell interference information to minimize each cell’s power consumption. In contrary to CCUC, PCUC is optimized jointly with the power control. Finally, with the obtained user grouping and BF vectors, the resultant power allocation problem is optimally solved via an iterative algorithm, whose convergence is mathematically proven given that the problem is feasible. We perform Monte-Carlo simulation and numerical results show that the proposed resource management methods outperform various conventional MISO schemes and the non-clustered MISO-NOMA strategy in several aspects, including power consumption, outage probability, energy efficiency, and connectivity efficiency. [ABSTRACT FROM AUTHOR]

Motivated by the needs of health monitoring at home (or a senior center) using a sensor network system, we study the problem of how to place the relay nodes so that the data collection and localization requirements of the monitoring system can be satisfied. By exploiting the inherent nature of the problem, we model it as finding a minimum connected k-dominating (k ≥ 3) set. Instead of using an idealistic disk radio model, we explicitly take into account the obstacles' effect on the radio propagation in an indoor environment. We prove that the problem is NP-hard and propose an efficient greedy algorithm ORPA (Optimal Relay Placement Algorithm) to compute in polynomial time the best locations to place the relays. Results of extensive simulations have shown that by using our proposed algorithm ORPA, the number of relays required can be substantially reduced in comparison to the random placement and two-stage placement strategies. We also study the impact of the transmission power and the grid size on the algorithm and system performance. The result and method presented in the paper is useful to today's indoor deployment of practical WSN-based monitoring system and to ensure network connectivity with minimal relay nodes. [ABSTRACT FROM AUTHOR]

This paper investigates the joint subcarrier and power allocation problem for the downlink of a multi-carrier non-orthogonal multiple access (MC-NOMA) system. A novel three-step resource allocation framework is designed to deal with the sum rate maximization problem. In Step 1, we relax the problem by assuming that each of the users can use all the subcarriers simultaneously. With this assumption, we prove the convexity of the resultant power control problem and solve it via convex programming tools to get a power vector for each user. In Step 2, we allocate the subcarriers to users by a heuristic greedy manner with the obtained power vectors in Step 1. In Step 3, the proposed power control schemes used in Step 1 are applied once more to further improve the system performance with the obtained subcarrier assignment of Step 2. To solve the maximization problem with fixed subcarrier assignments in both Step 1 and Step 3, a centralized power allocation method based on projected gradient descent algorithm and two distributed power control strategies based, respectively, on pseudo-gradient algorithm and iterative waterfilling algorithm are investigated. Numerical results show that our proposed three-step resource allocation algorithm could achieve comparable sum rate performance to the existing near-optimal solution with much lower computational complexity and outperforms power controlled OMA scheme. Besides, a tradeoff between user fairness and sum rate performance can be achieved via applying different user power constraint strategies in the proposed algorithm. [ABSTRACT FROM AUTHOR]

With the promising technology of far-field wireless power transfer, wearable devices are able to harvest radio frequency (RF) energy from RF-based chargers and thus operate continuously. Rational planning of the quantity and positions of the chargers provide an effective way to improve the recharging efficiency and save the charger deployment budget. Existing work on RF-based charger placement mainly considers the situation where the devices are static, or adopt very simple mobility model. In this paper, we consider wireless charging service provision for wearable devices worn by users in a two-dimensional area, with users having a specific stay–move behavior pattern characterized by the trajectories, stay points, and stay time distribution. Based on this mobility pattern, we formulate the problem as how to find a charger placement to minimize the charging service budget, subject to the power non-outage probability requirement of the wearable devices. We further transform this problem to several equivalent problems for easier tractability and prove that it is NP-complete. Both greedy heuristic and particle swarm optimization (PSO) based solutions are proposed to solve the problem with certain approximation ratio. Finally, performances of the proposed solutions are compared with exhaustive search and existing point provisioning algorithm through extensive simulations. Simulation results show that both greedy heuristic and PSO-based solutions outperform the baseline algorithms, while PSO-based solution requires least number of chargers and thus is the most cost-effective. [ABSTRACT FROM AUTHOR]

To obtain good network performance in Long Term Evolution-Advanced (LTE-A) heterogeneous networks (HetNets), enhanced inter-cell interference coordination (eICIC) and further eICIC (FeICIC) have been proposed by LTE standardization bodies to address the entangled inter-cell interference and the user association problems. We propose the distributed algorithms based on the exact potential game framework for both eICIC and FeICIC optimizations. We demonstrate via simulations a 64% gain on energy efficiency (EE) achieved by eICIC and another 17% gain on EE achieved by FeICIC. We also show that FeICIC can bring other significant gains in terms of cell-edge throughput, spectral efficiency, and fairness among user throughputs. Moreover, we propose a downlink scheduler based on a cake-cutting algorithm that can further improve the performance of the optimization algorithms compared with conventional schedulers. [ABSTRACT FROM PUBLISHER]

Cloud radio access network (C-RAN) is becoming more than ever timely in 5G for dense network deployments, but its design has to be adapted to 5G requirements. To ensure high-uplink throughput in cell-edge regions affected by inter-cell interference, C-RAN enables the multi-user reception techniques among cells. In this paper, we propose an efficient end-to-end uplink transmission scheme dealing with implementation and deployment constraints on both communication interfaces in C-RAN, i.e., the wireless one between the users and the remote radio heads (RRHs), and the fronthaul links between the RRHs and the central processing unit. Multi-cell non-orthogonal multiple access (NOMA) can improve spectral efficiency and cell-edge throughput, but its design needs to fit requirements regarding receiver complexity and delay. Optimizing the fronthaul rate allocation to maximize the benefit of the transmissions allows to exploit the fronthaul links effectively. Our model considers the throughput of NOMA transmissions in C-RAN and the expense related to fronthaul usage in various deployment scenarios. When the available fronthaul rate allows accurate transmission, optimizing fronthaul rate allocation results in 10% higher transmission benefit than uniform allocation. It also makes possible to involve less users in NOMA while keeping the benefit. The proposed strategy enables uplink multi-cell multi-user processing in a cost-effective manner in 5G C-RAN deployments. [ABSTRACT FROM AUTHOR]

As the demand for higher data rates is growing exponentially, homogeneous cellular networks have been facing limitations when handling data traffic. These limitations are related to the available spectrum and the capacity of the network. Heterogeneous networks (HetNets), composed of macro cells (MCs) and small cells (SCs), are seen as the key solution to improve spectral efficiency per unit area and to eliminate coverage holes. Due to the large imbalance in transmit power between MCs and SCs in HetNets, intelligent user association (UA) is required to perform load balancing and to favor some SCs attraction against MCs. As long term evolution (LTE) cellular networks use the same frequency sub-bands, user equipment may experience strong intercell interference (ICI), especially at cell edge. Therefore, there is a need to coordinate the resource allocation (RA) among the cells and to minimize the ICI. In this paper, we propose a generic algorithm to optimize UA and RA in LTE networks. Our solution, based on game theory, permits to compute cell individual offset and a pattern of power transmission over frequency and time domain for each cell. Simulation results show significant benefits in the average throughput and also cell edge user throughput of 40% and 55% gains respectively. Furthermore, we also obtain a meaningful improvement in energy efficiency. [ABSTRACT FROM PUBLISHER]

This paper proposes two novel and practical designs of angle diversity receivers to achieve multiple-input-multiple-output (MIMO) capacity for indoor visible light communications (VLC). Both designs are easy to construct and suitable for small mobile devices. By using light emitting diodes for both illumination and data transmission, our receiver designs consist of multiple photodetectors (PDs), which are oriented with different inclination angles to achieve high-rank MIMO channels and can be closely packed without the requirement of spatial separation. Due to the orientations of the PDs, the proposed receiver designs are named pyramid receiver (PR) and hemispheric receiver (HR). In a PR, the normal vectors of PDs are chosen the same as the normal vectors of the triangle faces of a pyramid with equilateral $N$-gon base. On the other hand, the idea behind HR is to evenly distribute the PDs on a hemisphere. Through analytical investigation, simulations and experiments, the channel capacity and bit-error-rate (BER) performance under various settings are presented to show that our receiver designs are practical and promising for enabling VLC-MIMO. In comparison to induced link-blocked receiver, our designs do not require any hardware adjustment at the receiver from location to location so that they can support user mobility. Besides, their channel capacities and BER performance are quite close to that of link-blocked receiver. Meanwhile, they substantially outperform spatially-separated receiver. This study reveals that using angle diversity to build VLC-MIMO system is very promising. [ABSTRACT FROM PUBLISHER]

Handover measurement is responsible for finding a handover target and directly decides the performance of mobility management. It is governed by a complex combination of parameters dealing with multicell scenarios and system dynamics. A network design has to offer an appropriate handover measurement procedure in such a multiconstraint problem. This paper proposes a unified framework for the network analysis and optimization. The exposition focuses on the stochastic modeling and addresses its key probabilistic events, namely: 1) suitable handover target found; 2) service failure; 3) handover measurement triggering; and 4) handover measurement withdrawal. We derive their closed-form expressions and provide a generalized setup for the analysis of handover measurement failure and target cell quality by the best signal quality and level crossing properties. Finally, we show its application and effectiveness in today's 3GPP-LTE cellular networks. [ABSTRACT FROM PUBLISHER]

This paper studies the problem of self-organizing heterogeneous LTE systems. We propose a model that jointly considers several important characteristics of heterogeneous LTE system, including the usage of orthogonal frequency division multiple access (OFDMA), the frequency-selective fading for each link, the interference among different links, and the different transmission capabilities of different types of base stations. We also consider the cost of energy by taking into account the power consumption, including that for wireless transmission and that for operation, of base stations and the price of energy. Based on this model, we aim to propose a distributed protocol that improves the spectrum efficiency of the system, which is measured in terms of the weighted proportional fairness among the throughputs of clients, and reduces the cost of energy. We identify that there are several important components involved in this problem. We propose distributed strategies for each of these components. Each of the proposed strategies requires small computational and communicational overheads. Moreover, the interactions between components are also considered in the proposed strategies. Hence, these strategies result in a solution that jointly considers all factors of heterogeneous LTE systems. Simulation results also show that our proposed strategies achieve much better performance than existing ones. [ABSTRACT FROM PUBLISHER]

In [1], the Acknowledgment section was inadvertently left out of the paper. The Acknowledgment should read as follows: [ABSTRACT FROM AUTHOR]

Lighting systems are undergoing a revolution from fluorescent lamps or tubes to light emitting diodes that offer greater energy efficiency and a longer lifetime. This paper considers using these light sources to provide other benefits. The proposed system has low deployment cost and most importantly, it uses the unique characteristics of visible light to complement existing wireless communication systems. This paper outlines a system design with three features. First, it can provide a provable and secure wireless communication capability. In particular, a user is authenticated according to his or her location. Second, it includes indoor positioning systems with high precision. Finally, it also supports information broadcast with a high frequency reuse factor. This paper provides both experimental and theoretical results. We build the mathematical framework for the analysis of visible light positioning systems. Experimental results and analysis are given to explain the concerns of light sensors in a mobile phone for building an indoor positioning system. A novel authentication system based on users' locations is proposed. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]