Searcharxiv⌕ Search

arXiv subjects

Sheng Zhou

Publications and source records attributed to Sheng Zhou.

At least 217 records · Page 12Linked to original sources

Software-Defined Hyper-Cellular Architecture for Green and Elastic Wireless Access

To meet the surging demand of increasing mobile Internet traffic from diverse applications while maintaining moderate energy cost, the radio access network (RAN) of cellular systems needs to take a green path into the future, and the key lies in providing elastic service to dynamic traffic demands. To achieve this, it is time to rethink RAN architectures and expect breakthroughs. In this article, we review the state-of-art literature which aims to renovate RANs from the perspectives of control-traffic decoupled air interface, cloud-based RANs, and software-defined RANs. We then propose a software-defined hyper-cellular architecture (SDHCA) that identifies a feasible way of integrating the above three trends to enable green and elastic wireless access. We further present key enabling technologies to realize SDHCA, including separation of the air interface, green base station operations, and base station functions virtualization, followed by our hardware testbed for SDHCA. Besides, we summarize several future research issues worth investigating.

cs.NI↗

A Cooperative Scheduling Scheme of Local Cloud and Internet Cloud for Delay-Aware Mobile Cloud Computing

With the proliferation of mobile applications, Mobile Cloud Computing (MCC) has been proposed to help mobile devices save energy and improve computation performance. To further improve the quality of service (QoS) of MCC, cloud servers can be deployed locally so that the latency is decreased. However, the computational resource of the local cloud is generally limited. In this paper, we design a threshold-based policy to improve the QoS of MCC by cooperation of the local cloud and Internet cloud resources, which takes the advantages of low latency of the local cloud and abundant computational resources of the Internet cloud simultaneously. This policy also applies a priority queue in terms of delay requirements of applications. The optimal thresholds depending on the traffic load is obtained via a proposed algorithm. Numerical results show that the QoS can be greatly enhanced with the assistance of Internet cloud when the local cloud is overloaded. Better QoS is achieved if the local cloud order tasks according to their delay requirements, where delay-sensitive applications are executed ahead of delay-tolerant applications. Moreover, the optimal thresholds of the policy have a sound impact on the QoS of the system.

cs.NI↗

Topic Model Based Behaviour Modeling and Clustering Analysis for Wireless Network Users

User behaviour analysis based on traffic log in wireless networks can be beneficial to many fields in real life: not only for commercial purposes, but also for improving network service quality and social management. We cluster users into groups marked by the most frequently visited websites to find their preferences. In this paper, we propose a user behaviour model based on Topic Model from document classification problems. We use the logarithmic TF-IDF (term frequency - inverse document frequency) weighing to form a high-dimensional sparse feature matrix. Then we apply LSA (Latent semantic analysis) to deduce the latent topic distribution and generate a low-dimensional dense feature matrix. K-means++, which is a classic clustering algorithm, is then applied to the dense feature matrix and several interpretable user clusters are found. Moreover, by combining the clustering results with additional demographical information, including age, gender, and financial information, we are able to uncover more realistic implications from the clustering results.

cs.SI↗

A Block Regression Model for Short-Term Mobile Traffic Forecasting

Accurate mobile traffic forecast is important for efficient network planning and operations. However, existing traffic forecasting models have high complexity, making the forecasting process slow and costly. In this paper, we analyze some characteristics of mobile traffic such as periodicity, spatial similarity and short term relativity. Based on these characteristics, we propose a \emph{Block Regression} ({BR}) model for mobile traffic forecasting. This model employs seasonal differentiation so as to take into account of the temporally repetitive nature of mobile traffic. One of the key features of our {BR} model lies in its low complexity since it constructs a single model for all base stations. We evaluate the accuracy of {BR} model based on real traffic data and compare it with the existing models. Results show that our {BR} model offers equal accuracy to the existing models but has much less complexity.

cs.NI↗

Seeing the Unobservable: Channel Learning for Wireless Communication Networks

Wireless communication networks rely heavily on channel state information (CSI) to make informed decision for signal processing and network operations. However, the traditional CSI acquisition methods is facing many difficulties: pilot-aided channel training consumes a great deal of channel resources and reduces the opportunities for energy saving, while location-aided channel estimation suffers from inaccurate and insufficient location information. In this paper, we propose a novel channel learning framework, which can tackle these difficulties by inferring unobservable CSI from the observable one. We formulate this framework theoretically and illustrate a special case in which the learnability of the unobservable CSI can be guaranteed. Possible applications of channel learning are then described, including cell selection in multi-tier networks, device discovery for device-to-device (D2D) communications, as well as end-to-end user association for load balancing. We also propose a neuron-network-based algorithm for the cell selection problem in multi-tier networks. The performance of this algorithm is evaluated using geometry-based stochastic channel model (GSCM). In settings with 5 small cells, the average cell-selection accuracy is 73% - only a 3.9% loss compared with a location-aided algorithm which requires genuine location information.

cs.IT↗

Spatial Traffic Shaping in Heterogeneous Cellular Networks with Energy Harvesting

Energy harvesting (EH), which explores renewable energy as a supplementary power source, is a promising 5G technology to support the huge energy demand of heterogeneous cellular networks (HCN). However, the random arrival of renewable energy brings great challenges to network management. By adjusting the distribution of traffic load in spatial domain, traffic shaping helps to balance the cell-level power demand and supply, and thus improves the utilization of renewable energy. In this paper, we investigate the power saving performance of traffic shaping in an analytical way, based on the statistic information of energy arrival and traffic load. Specifically, an energy-optimal traffic shaping scheme (EOTS) is devised for HCNs with EH, whereby the on-off state of the off-grid small cell and the amount of offloading traffic are adjusted dynamically with the energy variation, to minimize the on-grid power consumption. Numerical results are given to demonstrate that for the daily traffic and solar energy profiles, EOTS scheme can significantly reduce the energy consumption, compared with the greedy method where users are always offloaded to the off-grid small cell with priority.

cs.NI↗

How Many Small Cells Can Be Turned off via Vertical Offloading under a Separation Architecture?

To further improve the energy efficiency of heterogeneous networks, a separation architecture called hyper-cellular network (HCN) has been proposed, which decouples the control signaling and data transmission functions. Specifically, the control coverage is guaranteed by macro base stations (MBSs), whereas small cells (SCs) are only utilized for data transmission. Under HCN, SCs can be dynamically turned off when traffic load decreases for energy saving. A fundamental problem then arises: how many SCs can be turned off as traffic varies? In this paper, we address this problem in a theoretical way, where two sleeping schemes (i.e., random and repulsive schemes) with vertical inter-layer offloading are considered. Analytical results indicate the following facts: (1) Under the random scheme where SCs are turned off with certain probability, the expected ratio of sleeping SCs is inversely proportional to the traffic load of SC-layer and decreases linearly with the traffic load of MBS-layer; (2) The repulsive scheme, which only turns off the SCs close to MBSs, is less sensitive to the traffic variations; (3) deploying denser MBSs enables turning off more SCs, which may help to improve network energy-efficiency. Numerical results show that about 50% SCs can be turned off on average under the predefined daily traffic profiles, and 10% more SCs can be further turned off with inter-layer channel borrowing.

cs.NI↗

Redesigning Fronthaul for Next-Generation Networks: Beyond Baseband Samples and Point-to-Point Links

The fronthaul (FH) is an indispensable enabler for 5G networks. However, the classical fronthauling method demands for large bandwidth, low latency, and tightly synchronized on the transport network, and only allows for point-to-point logical topology. This greatly limits the usage of FH in many 5G scenarios. In this paper, we introduce a new perspective to understand and design FH for next-generation wireless access. We allow the renovated FH to transport information other than time-domain I/Q samples and to support logical topologies beyond point-to-point links. In this way, different function splitting scheme could be incorporated into the radio access network to satisfy the bandwidth and latency requirements of ultra-dense networks, control/data (C/D) decoupling architectures, and delay-sensitive communications. At the same time, massive cooperation and device-centric networking could be effectively enabled with point-to-multi-point FH transportation. We analyze three unique design requirements for the renovated FH, including the ability to handle various payload traffic, support different logical topology, and provide differentiated latency guarantee. Following this analysis, we propose a reference architecture for designing the renovated FH. The required functionalities are categorized into four logical layers and realized using novel technologies such as decoupled synchronization layer, packet switching, and session-based control. We also discuss some important future research issues.

cs.IT↗

GreenDelivery: Proactive Content Caching and Push with Energy-Harvesting-based Small Cells

The explosive growth of mobile multimedia traffic calls for scalable wireless access with high quality of service and low energy cost. Motivated by the emerging energy harvesting communications, and the trend of caching multimedia contents at the access edge and user terminals, we propose a paradigm-shift framework, namely GreenDelivery, enabling efficient content delivery with energy harvesting based small cells. To resolve the two-dimensional randomness of energy harvesting and content request arrivals, proactive caching and push are jointly optimized, with respect to the content popularity distribution and battery states. We thus develop a novel way of understanding the interplay between content and energy over time and space. Case studies are provided to show the substantial reduction of macro BS activities, and thus the related energy consumption from the power grid is reduced. Research issues of the proposed GreenDelivery framework are also discussed.

cs.IT↗

HyCell: Enabling GREEN Base Station Operations in Software-Defined Radio Access Networks

The radio access networks (RANs) need to support massive and diverse data traffic with limited spectrum and energy. To cope with this challenge, software-defined radio access network (SDRAN) architectures have been proposed to renovate the RANs. However, current researches lack the design and evaluation of network protocols. In this paper, we address this problem by presenting the protocol design and evaluation of hyper-cellular networks (HyCell), an SDRAN framework making base station (BS) operations globally resource-optimized and energy-efficient (GREEN). Specifically, we first propose a separation scheme to realize the decoupled air interface in HyCell. Then we design a BS dispatching protocol which determines and assigns the optimal BS for serving mobile users, and a BS sleeping protocol to improve the network energy efficiency. Finally, we evaluate the proposed design in our HyCell testbed. Our evaluation validates the feasibility of the proposed separation scheme, demonstrates the effectiveness of BS dispatching, and shows great potential in energy saving through BS sleeping control.

cs.NI↗

Outage Minimization for a Fading Wireless Link with Energy Harvesting Transmitter and Receiver

This paper studies online power control policies for outage minimization in a fading wireless link with energy harvesting transmitter and receiver. The outage occurs when either the transmitter or the receiver does not have enough energy, or the channel is in outage, where the transmitter only has the channel distribution information. Under infinite battery capacity and without retransmission, we prove that threshold-based power control policies are optimal. We thus propose disjoint/joint threshold-based policies with and without battery state sharing between the transmitter and receiver, respectively. We also analyze the impact of practical receiver detection and processing on the outage performance. When retransmission is considered, policy with linear power levels is adopted to adapt the power thresholds per retransmission. With finite battery capacity, a three dimensional finite state Markov chain is formulated to calculate the optimal parameters and corresponding performance of proposed policies. The energy arrival correlation between the transmitter and receiver is addressed for both finite and infinite battery cases. Numerical results show the impact of battery capacity, energy arrival correlation and detection cost on the outage performance of the proposed policies, as well as the tradeoff between the outage probability and the average transmission times.

cs.IT↗

Proactive Push with Energy Harvesting Based Small Cells in Heterogeneous Networks

Motivated by the recent development of energy harvesting communications, and the trend of multimedia contents caching and push at the access edge and user terminals, this paper considers how to design an effective push mechanism of energy harvesting powered small-cell base stations (SBSs) in heterogeneous networks. The problem is formulated as a Markov decision process by optimizing the push policy based on the battery energy, user request and content popularity state to maximize the service capability of SBSs. We extensively analyze the problem and propose an effective policy iteration algorithm to find the optimal policy. According to the numerical results, we find that the optimal policy reveals a state dependent threshold based structure. Besides, more than 50% performance gain is achieved by the optimal push policy compared with the non-push policy.

cs.IT↗

Graph-based Framework for Flexible Baseband Function Splitting and Placement in C-RAN

The baseband-up centralization architecture of radio access networks (C-RAN) has recently been proposed to support efficient cooperative communications and reduce deployment and operational costs. However, the massive fronthaul bandwidth required to aggregate baseband samples from remote radio heads (RRHs) to the central office incurs huge fronthauling cost, and existing baseband compression algorithms can hardly solve this issue. In this paper, we propose a graphbased framework to effectively reduce fronthauling cost through properly splitting and placing baseband processing functions in the network. Baseband transceiver structures are represented with directed graphs, in which nodes correspond to baseband functions, and edges to the information flows between functions. By mapping graph weighs to computational and fronthauling costs, we transform the problem of finding the optimum location to place some baseband functions into the problem of finding the optimum clustering scheme for graph nodes. We then solve this problem using a genetic algorithm with customized fitness function and mutation module. Simulation results show that proper splitting and placement schemes can significantly reduce fronthauling cost at the expense of increased computational cost. We also find that cooperative processing structures and stringent delay requirements will increase the possibility of centralized placement.

cs.IT↗

Dynamic Channel Acquisition in MU-MIMO

Multiuser multiple-input-multiple-output (MU-MIMO) systems are known to be hindered by dimensionality loss due to channel state information (CSI) acquisition overhead. In this paper, we investigate user-scheduling in MU-MIMO systems on account of CSI acquisition overhead, where a base station dynamically acquires user channels to avoid choking the system with CSI overhead. The genie-aided optimization problem (GAP) is first formulated to maximize the Lyapunov-drift every scheduling step, incorporating user queue information and taking channel fluctuations into consideration. The scheduling scheme based on GAP, namely the GAP-rule, is proved to be throughput-optimal but practically infeasible, and thus serves as a performance bound. In view of the implementation overhead and delay unfairness of the GAP-rule, the T-frame dynamic channel acquisition scheme and the power-law DCA scheme are further proposed to mitigate the implementation overhead and delay unfairness, respectively. Both schemes are based on the GAP-rule and proved throughput-optimal. To make the schemes practically feasible, we then propose the heuristic schemes, queue-based quantized-block-length user scheduling scheme (QQS), T-frame QQS, and power-law QQS, which are the practical versions of the aforementioned GAP-based schemes, respectively. The QQS-based schemes substantially decrease the complexity, and also perform fairly close to the optimum. Numerical results evaluate the proposed schemes under various system parameters.

cs.IT↗

Energy-Delay Tradeoffs of Virtual Base Stations With a Computational-Resource-Aware Energy Consumption Model

The next generation (5G) cellular network faces the challenges of efficiency, flexibility, and sustainability to support data traffic in the mobile Internet era. To tackle these challenges, cloud-based cellular architectures have been proposed where virtual base stations (VBSs) play a key role. VBSs bring further energy savings but also demands a new energy consumption model as well as the optimization of computational resources. This paper studies the energy-delay tradeoffs of VBSs with delay tolerant traffic. We propose a computational-resource-aware energy consumption model to capture the total energy consumption of a VBS and reflect the dynamic allocation of computational resources including the number of CPU cores and the CPU speed. Based on the model, we analyze the energy-delay tradeoffs of a VBS considering BS sleeping and state switching cost to minimize the weighted sum of power consumption and average delay. We derive the explicit form of the optimal data transmission rate and find the condition under which the energy optimal rate exists and is unique. Opportunities to reduce the average delay and achieve energy savings simultaneously are observed. We further propose an efficient algorithm to jointly optimize the data rate and the number of CPU cores. Numerical results validate our theoretical analyses and under a typical simulation setting we find more than 60% energy savings can be achieved by VBSs compared with conventional base stations under the EARTH model, which demonstrates the great potential of VBSs in 5G cellular systems.

cs.NI↗

CONCERT: A Cloud-Based Architecture for Next-generation Cellular Systems

Cellular networks are one of the corner stones of our information-driven society. However, existing cellular systems have been seriously challenged by the explosion of mobile data traffic, the emergence of machine-type communications and the flourish of mobile Internet services. In this article, we propose CONCERT (CONvergence of Cloud and cEllulaR sysTems), a converged edge infrastructure for future cellular communications and mobile computing services. The proposed architecture is constructed based on the concept of control/data (C/D) plane decoupling. The data plane includes heterogeneous physical resources such as radio interfacing equipment, computational resources, and software-defined switches. The control plane jointly coordinates physical resources to present them as virtual resources, over which software-defined services including communications, computing, and management can be deployed in a flexible manner. Moreover, we introduce new designs for physical resources placement and task scheduling, so that CONCERT can overcome the drawbacks of the existing baseband-up centralization approach and better facilitate innovations in next-generation cellular networks. These advantages are demonstrated with application examples on the radio access networks (RANs) with C/D decoupled air interface, delay sensitive machine-type communications, and real-time mobile cloud gaming. We also discuss some fundamental research issues arising with the proposed architecture to illuminate future research directions.

cs.IT↗

Geodesic structure of Janis-Newman-Winicour space-time

In the present paper we study the geodesic structure of the Janis-Newman-Winicour(JNW) space-time which contains a strong curvature naked singularity. This metric is an extension of the Schwarzschild geometry when a massless scalar field is included. We find that the strength parameter $μ$ of the scalar field effects on the geodesic structure of the JNW space-time. By solving the geodesic equation and analyzing the behavior of effective potential, we investigate all geodesic types of the test particle and the photon in the JNW space-time. At the same time we simulate all the geodesic orbits corresponding to the energy levels of the effective potential in the JNW space-time.

gr-qc↗

On the Statistical Multiplexing Gain of Virtual Base Station Pools

Facing the explosion of mobile data traffic, cloud radio access network (C-RAN) is proposed recently to overcome the efficiency and flexibility problems with the traditional RAN architecture by centralizing baseband processing. However, there lacks a mathematical model to analyze the statistical multiplexing gain from the pooling of virtual base stations (VBSs) so that the expenditure on fronthaul networks can be justified. In this paper, we address this problem by capturing the session-level dynamics of VBS pools with a multi-dimensional Markov model. This model reflects the constraints imposed by both radio resources and computational resources. To evaluate the pooling gain, we derive a product-form solution for the stationary distribution and give a recursive method to calculate the blocking probabilities. For comparison, we also derive the limit of resource utilization ratio as the pool size approaches infinity. Numerical results show that VBS pools can obtain considerable pooling gain readily at medium size, but the convergence to large pool limit is slow because of the quickly diminishing marginal pooling gain. We also find that parameters such as traffic load and desired Quality of Service (QoS) have significant influence on the performance of VBS pools.

cs.IT↗