26 September 2017 in IEEE Transactions on Mobile Computing
Accurate cellular link bandwidth prediction can benefit upper-layer protocols significantly. In this paper, we investigate how to predict cellular link bandwidth in LTE networks. We first conduct an extensive measurement study in two major commercial LTE networks in the US, and identify five types of lower-level information that is correlated with cellular link bandwidth. We then develop a machine learning based prediction framework, LinkForecast, that identifies most important features (from both upper and lower layers) and uses these features to predict link bandwidth in real time. Our evaluation shows that LinkForecast is lightweight and the prediction is highly accurate: at the time granularity of one second, the average prediction error is in the range of 3.9% to 17.0% for all the scenarios we explore. We further investigate the prediction performance when using lower-layer features obtained through standard APIs provided by the operating system, instead of specialized tools. Our results show that, while features thus obtained have lower fidelity, they lead to similar prediction accuracy as that using higher fidelity features, indicating that our approach can be easily used over commercial off-the-shelf mobile devices.
1 February 2013 in International Journal of Parallel, Emergent and Distributed Systems
As the number of electric vehicles (EVs) grows, their electricity demands may have significant detrimental impacts on electric power grid when not scheduled properly. In this paper, we model an EV charging system as a cyber-physical system, and design a decentralised online EV charging scheduling algorithm for large populations of EVs, where the EVs can be highly heterogeneous and may join the charging system dynamically. The algorithm couples a clustering-based strategy that dynamically classifies heterogeneous EVs into multiple groups and a sliding-window iterative approach that schedules the charging demand for the EVs in each group in real time. Extensive simulation results demonstrate that our approach provides near-optimal solutions at significantly reduced complexity and communication overhead. It flattens the aggregated load on the power grid and reduces the costs of both the users and the utility.
17 July 2019 in IEEE Transactions on Mobile Computing
Adaptive bitrate streaming (ABR) has become the de-facto technique for video streaming over the Internet. Despite a flurry of techniques, achieving high quality ABR streaming over cellular networks remains a tremendous challenge. ABR streaming can be naturally modeled as a control problem. There has been some initial work on using PID, a widely used feedback control technique, for ABR streaming. Existing studies, however, either use PID control directly without fully considering the special requirements of ABR streaming, leading to suboptimal results, or conclude that PID is not a suitable approach. In this paper, we take a fresh look at PID-based control for ABR streaming. We design a framework called PIA (PID-control based ABR streaming) that strategically leverages PID control concepts and incorporates several novel strategies to account for the various requirements of ABR streaming. We evaluate PIA using simulation based on LTE network traces, as well as using real DASH implementation. The results demonstrate that PIA outperforms state-of-the-art schemes in providing high average bitrate with significantly lower bitrate changes (reduction up to 40%) and stalls (reduction up to 85%), while incurring very small runtime overhead. We further design PIA-E to improve the performance of PIA in the initial playback phase.
9 September 2015 in IEEE Transactions on Mobile Computing
Detecting node failures in mobile wireless networks is very challenging because the network topology can be highly dynamic, the network may not be always connected, and the resources are limited. In this paper, we take a probabilistic approach and propose two node failure detection schemes that systematically combine localized monitoring, location estimation and node collaboration. Extensive simulation results in both connected and disconnected networks demonstrate that our schemes achieve high failure detection rates (close to an upper bound) and low false positive rates, and incur low communication overhead. Compared to approaches that use centralized monitoring, our approach has up to 80 percent lower communication overhead, and only slightly lower detection rates and slightly higher false positive rates. In addition, our approach has the advantage that it is applicable to both connected and disconnected networks while centralized monitoring is only applicable to connected networks. Compared to other approaches that use localized monitoring, our approach has similar failure detection rates, up to 57 percent lower communication overhead and much lower false positive rates (e.g., 0.01 versus 0.27 in some settings).
1 August 2020 in IEEE Transactions on Wireless Communications
Neighbor discovery is a fundamental problem in wireless networks. In this paper, we study asynchronous neighbor discovery on duty-cycled mobile devices. Most existing studies develop integer schedules where time proceeds in discrete slots and a node is awake or asleep for an entire slot duration. We show that integer schedules can lead to significant waste of resources, and develop a generalized non-integer model, where time is continuous and a node may become awake or asleep at any point of time (subject to a few constraints) so that the resultant schedules can be significantly more efficient than integer schedules. In addition, we provide a reduction that transforms any schedule in the integer model to a corresponding schedule in the generalized non-integer model while reducing the discovery latency by up to a factor of two. Applying this reduction, an optimal schedule in the integer model becomes an optimal schedule in the non-integer model. We further demonstrate the practicality of non-integer schedules in a testbed, and compare the worst-case discovery latency of several existing schemes under both integer and non-integer models. Last, we establish a family of lower bounds for the best achievable latency guarantee. These lower bounds are applicable to both integer and non-integer models, covering both symmetric and asymmetric settings, and encompassing the existing lower bounds that are only for a subset of settings as special cases.