arXiv subjects

Shen

Publications and source records attributed to Shen.

At least 109 records · Page 6Linked to original sources

arXiv2019

Contention Intensity based Distributed Coordination for V2V Safety Message Broadcast

In this paper, we propose a contention intensity based distributed coordination (CIDC) scheme for safety message broadcast. By exploiting the high-frequency and periodical features of the safety message broadcast, the application-layer design of the CIDC enables each vehicle to estimate the instantaneous channel contention intensity in a fully distributed manner. With the contention intensity information, the MAC layer design of CIDC allows vehicles to adopt a better channel access strategy compared to the 802.11p. This is because CIDC selects the initial back-off counter for each new packet deterministically, i.e., based on the contention intensity, instead of randomly. The proposed CIDC is modeled, and key performance indicators in terms of the packet collision probability and average contention delay, are derived. It is shown that the proposed change in the initial counter selection leads to a system model completely different from the classic Markov chain based model. Moreover, the proposed CIDC, fully distributed and compatible with the 802.11p, can achieve both a much lower collision probability and a smaller contention delay compared with 802.11p at the cost of a small communication and computation overhead. Extensive simulation results demonstrate the effectiveness of the CIDC in both of the accurate and the erroneous contention intensity estimation scenarios.

eess.SY↗

arXiv2019

The Study of Dynamic Caching via State Transition Field -- the Case of Time-Invariant Popularity

This two-part paper investigates cache replacement schemes with the objective of developing a general model to unify the analysis of various replacement schemes and illustrate their features. To achieve this goal, we study the dynamic process of caching in the vector space and introduce the concept of state transition field (STF) to model and characterize replacement schemes. In the first part of this work, we consider the case of time-invariant content popularity based on the independent reference model (IRM). In such case, we demonstrate that the resulting STFs are static, and each replacement scheme leads to a unique STF. The STF determines the expected trace of the dynamic change in the cache state distribution, as a result of content requests and replacements, from any initial point. Moreover, given the replacement scheme, the STF is only determined by the content popularity. Using four example schemes including random replacement (RR) and least recently used (LRU), we show that the STF can be used to analyze replacement schemes such as finding their steady states, highlighting their differences, and revealing insights regarding the impact of knowledge of content popularity. Based on the above results, STF is shown to be useful for characterizing and illustrating replacement schemes. Extensive numeric results are presented to demonstrate analytical STFs and STFs from simulations for the considered example replacement schemes.

cs.OS↗

arXiv2019

The Study of Dynamic Caching via State Transition Field -- the Case of Time-Varying Popularity

In the second part of this two-part paper, we extend the study of dynamic caching via state transition field (STF) to the case of time-varying content popularity. The objective of this part is to investigate the impact of time-varying content popularity on the STF and how such impact accumulates to affect the performance of a replacement scheme. Unlike the case in the first part, the STF is no longer static over time, and we introduce instantaneous STF to model it. Moreover, we demonstrate that many metrics, such as instantaneous state caching probability and average cache hit probability over an arbitrary sequence of requests, can be found using the instantaneous STF. As a steady state may not exist under time-varying content popularity, we characterize the performance of replacement schemes based on how the instantaneous STF of a replacement scheme after a content request impacts on its cache hit probability at the next request. From this characterization, insights regarding the relations between the pattern of change in the content popularity, the knowledge of content popularity exploited by the replacement schemes, and the effectiveness of these schemes under time-varying popularity are revealed. In the simulations, different patterns of time-varying popularity, including the shot noise model, are experimented. The effectiveness of example replacement schemes under time-varying popularity is demonstrated, and the numerical results support the observations from the analytic results.

cs.OS↗

arXiv2019

Fast mmwave Beam Alignment via Correlated Bandit Learning

Beam alignment (BA) is to ensure the transmitter and receiver beams are accurately aligned to establish a reliable communication link in millimeter-wave (mmwave) systems. Existing BA methods search the entire beam space to identify the optimal transmit-receive beam pair, which incurs significant BA latency on the order of seconds in the worst case. In this paper, we develop a learning algorithm to reduce BA latency, namely Hierarchical Beam Alignment (HBA) algorithm. We first formulate the BA problem as a stochastic multi-armed bandit problem with the objective to maximize the cumulative received signal strength within a certain period. The proposed algorithm takes advantage of the correlation structure among beams such that the information from nearby beams is extracted to identify the optimal beam, instead of searching the entire beam space. Furthermore, the prior knowledge on the channel fluctuation is incorporated in the proposed algorithm to further accelerate the BA process. Theoretical analysis indicates that the proposed algorithm is asymptotically optimal. Extensive simulation results demonstrate that the proposed algorithm can identify the optimal beam with a high probability and reduce the BA latency from hundreds of milliseconds to a few milliseconds in the multipath channel, as compared to the existing BA method in IEEE 802.11ad.

eess.SP↗

arXiv2019

3D Multi-Drone-Cell Trajectory Design for Efficient IoT Data Collection

Drone cell (DC) is an emerging technique to offer flexible and cost-effective wireless connections to collect Internet-of-things (IoT) data in uncovered areas of terrestrial networks. The flying trajectory of DC significantly impacts the data collection performance. However, designing the trajectory is a challenging issue due to the complicated 3D mobility of DC, unique DC-to-ground (D2G) channel features, limited DC-to-BS (D2B) backhaul link quality, etc. In this paper, we propose a 3D DC trajectory design for the DC-assisted IoT data collection where multiple DCs periodically fly over IoT devices and relay the IoT data to the base stations (BSs). The trajectory design is formulated as a mixed integer non-linear programming (MINLP) problem to minimize the average user-to-DC (U2D) pathloss, considering the state-of-the-art practical D2G channel model. We decouple the MINLP problem into multiple quasi-convex or integer linear programming (ILP) sub-problems, which optimizes the user association, user scheduling, horizontal trajectories and DC flying altitudes of DCs, respectively. Then, a 3D multi-DC trajectory design algorithm is developed to solve the MINLP problem, in which the sub-problems are optimized iteratively through the block coordinate descent (BCD) method. Compared with the static DC deployment, the proposed trajectory design can lower the average U2D pathloss by 10-15 dB, and reduce the standard deviation of U2D pathloss by 56%, which indicates the improvements in both link quality and user fairness.

cs.NI↗

arXiv2019

Delay-Aware Flow Migration for Embedded Services in 5G Core Networks

Service-oriented virtual network deployment is based on statistical resource demands of different services, while data traffic from each service fluctuates over time. In this paper, a delay-aware flow migration problem for embedded services is studied to meet end-to-end (E2E) delay requirement with time-varying traffic. A non-convex multi-objective mixed integer optimization problem is formulated, addressing the trade-off between maximum load balancing and minimum reconfiguration overhead due to flow migrations, under processing and transmission resource constraints and QoS requirement constraints. Since the original problem is non-solvable in optimization solvers due to unsupported types of quadratic constraints, it is transformed to a tractable mixed integer quadratically constrained programming (MIQCP) problem. The optimality gap between the two problems is proved to be zero, so we can obtain the optimum of the original problem through solving the MIQCP problem with some post-processing. Numerical results are presented to demonstrate the aforementioned trade-off, as well as the benefit from flow migration in terms of E2E delay performance guarantee.

cs.NI↗

arXiv2019

Cloud-Edge Coordinated Processing: Low-Latency Multicasting Transmission

Recently, edge caching and multicasting arise as two promising technologies to support high-data-rate and low-latency delivery in wireless communication networks. In this paper, we design three transmission schemes aiming to minimize the delivery latency for cache-enabled multigroup multicasting networks. In particular, full caching bulk transmission scheme is first designed as a performance benchmark for the ideal situation where the caching capability of each enhanced remote radio head (eRRH) is sufficient large to cache all files. For the practical situation where the caching capability of each eRRH is limited, we further design two transmission schemes, namely partial caching bulk transmission (PCBT) and partial caching pipelined transmission (PCPT) schemes. In the PCBT scheme, eRRHs first fetch the uncached requested files from the baseband unit (BBU) and then all requested files are simultaneously transmitted to the users. In the PCPT scheme, eRRHs first transmit the cached requested files while fetching the uncached requested files from the BBU. Then, the remaining cached requested files and fetched uncached requested files are simultaneously transmitted to the users. The design goal of the three transmission schemes is to minimize the delivery latency, subject to some practical constraints. Efficient algorithms are developed for the low-latency cloud-edge coordinated transmission strategies. Numerical results are provided to evaluate the performance of the proposed transmission schemes and show that the PCPT scheme outperforms the PCBT scheme in terms of the delivery latency criterion.

cs.IT↗

arXiv2019

An SDN-Based Transmission Protocol with In-Path Packet Caching and Retransmission

In this paper, a comprehensive software-defined networking (SDN) based transmission protocol (SDTP) is presented for fifth generation (5G) communication networks, where an SDN controller gathers network state information from the physical network to improve data transmission efficiency between end hosts, with in-path packet retransmission. In the SDTP, we first develop a new two-way handshake mechanism for connection establishment between a pair of end host. With the aid of SDN control module, signaling exchanges for establishing E2E connections are migrated to the control plane to improve resource utilization in the data plane. A new SDTP packet header format is designed to support efficient data transmission with in-path packet caching and packet retransmission. Based on the new data packet format, a novel in-path receiver-based packet loss detection and caching-based packet retransmission scheme is proposed to achieve in-path fast recovery of lost packets. Extensive simulation results are presented to validate the effectiveness of the proposed protocol in terms of low connection establishment delay and low end-to-end packet transmission delay.

cs.NI↗

arXiv2019

Towards Edge-assisted Internet of Things: From Security and Efficiency Perspectives

As we are moving towards the Internet of Things (IoT) era, the number of connected physical devices is increasing at a rapid pace. Mobile edge computing is emerging to handle the sheer volume of produced data and reach the latency demand of computation-intensive IoT applications. Although the advance of mobile edge computing on service latency is studied solidly, security and efficiency on data usage in mobile edge computing have not been clearly identified. In this article, we examine the architecture of mobile edge computing and explore the potentials of utilizing mobile edge computing to enhance data analysis for IoT applications, while achieving data security and computational efficiency. Specifically, we first introduce the overall architecture and several promising edge-assisted IoT applications. We then study the security, privacy and efficiency challenges in data processing for mobile edge computing, and discuss the opportunities to enhance data security and improve computational efficiency with the assistance of edge computing, including secure data aggregation, secure data deduplication and secure computational offloading. Finally, several interesting directions on edge-empowered data analysis are presented for future research.

cs.CR↗

arXiv2019

Bi-Directional Mission Offloading for Agile Space-Air-Ground Integrated Networks

Space-air-ground integrated networks (SAGIN) provide great strengths in extending the capability of ground wireless networks. On the other hand, with rich spectrum and computing resources, the ground networks can also assist space-air networks to accomplish resource-intensive or power-hungry missions, enhancing the capability and sustainability of the space-air networks. Therefore, bi-directional mission offloading can make full use of the advantages of SAGIN and benefits both space-air and ground networks. In this article, we identify the key role of network reconfiguration in coordinating heterogeneous resources in SAGIN, and study how network function virtualization (NFV) and service function chaining (SFC) enable agile mission offloading. A case study validates the performance gain brought by bi-directional mission offloading. Future research issues are outlooked as the bi-directional mission offloading framework opens a new trail in releasing the full potentials of SAGIN.

cs.NI↗

arXiv2018

Vehicular Communication Networks in Automated Driving Era

Embedded with advanced sensors, cameras and processors, the emerging automated driving vehicles are capable of sensing the environment and conducting automobile operation, paving the way to modern intelligent transportation systems (ITS) with high safety and efficiency. On the other hand, vehicular communication networks (VCNs) connect vehicles, infrastructures, clouds, and all other devices with communication modules, whereby vehicles can obtain local and global information to make intelligent operation decisions. Although the sensing-based automated driving technologies and VCNs have been investigated independently, their interactions and mutual benefits are still underdeveloped. In this article, we argue that VCNs have attractive potentials to enhance the on-board sensing-based automated vehicles from different perspectives, such as driving safety, transportation efficiency, as well as customer experiences. A case study is conducted to demonstrate that the traffic jam can be relieved at intersections with automated driving vehicles coordinated with each other through VCNs. Furthermore, we highlight the critical yet interesting issues for future research, based on the specific requirements posed by automated driving on VCNs.

cs.NI↗

arXiv2018

Air-Ground Integrated Mobile Edge Networks: Architecture, Challenges and Opportunities

The ever-increasing mobile data demands have posed significant challenges in the current radio access networks, while the emerging computation-heavy Internet of things (IoT) applications with varied requirements demand more flexibility and resilience from the cloud/edge computing architecture. In this article, to address the issues, we propose a novel air-ground integrated mobile edge network (AGMEN), where UAVs are flexibly deployed and scheduled, and assist the communication, caching, and computing of the edge network. In specific, we present the detailed architecture of AGMEN, and investigate the benefits and application scenarios of drone-cells, and UAV-assisted edge caching and computing. Furthermore, the challenging issues in AGMEN are discussed, and potential research directions are highlighted.

eess.SP↗

arXiv2018

Big Data Driven Vehicular Networks

Vehicular communications networks (VANETs) enable information exchange among vehicles, other end devices and public networks, which plays a key role in road safety/infotainment, intelligent transportation system, and self-driving system. As the vehicular connectivity soars, and new on-road mobile applications and technologies emerge, VANETs are generating an ever-increasing amount of data, requiring fast and reliable transmissions through VANETs. On the other hand, a variety of VANETs related data can be analyzed and utilized to improve the performance of VANETs. In this article, we first review the VANETs technologies to efficiently and reliably transmit the big data. Then, the methods employing big data for studying VANETs characteristics and improving VANETs performance are discussed. Furthermore, we present a case study where machine learning schemes are applied to analyze the VANETs measurement data for efficiently detecting negative communication conditions.

eess.SP↗

arXiv2017

Cooperative Edge Caching in User-Centric Clustered Mobile Networks

With files proactively stored at base stations (BSs), mobile edge caching enables direct content delivery without remote file fetching, which can reduce the end-to-end delay while relieving backhaul pressure. To effectively utilize the limited cache size in practice, cooperative caching can be leveraged to exploit caching diversity, by allowing users served by multiple base stations under the emerging user-centric network architecture. This paper explores delay-optimal cooperative edge caching in large-scale user-centric mobile networks, where the content placement and cluster size are optimized based on the stochastic information of network topology, traffic distribution, channel quality, and file popularity. Specifically, a greedy content placement algorithm is proposed based on the optimal bandwidth allocation, which can achieve (1-1/e)-optimality with linear computational complexity. In addition, the optimal user-centric cluster size is studied, and a condition constraining the maximal cluster size is presented in explicit form, which reflects the tradeoff between caching diversity and spectrum efficiency. Extensive simulations are conducted for analysis validation and performance evaluation. Numerical results demonstrate that the proposed greedy content placement algorithm can reduce the average file transmission delay up to 50% compared with the non-cooperative and hit-ratio-maximal schemes. Furthermore, the optimal clustering is also discussed considering the influences of different system parameters.

cs.NI↗

arXiv2017

Self-Sustaining Caching Stations: Towards Cost-Effective 5G-Enabled Vehicular Networks

In this article, we investigate the cost-effective 5G-enabled vehicular networks to support emerging vehicular applications, such as autonomous driving, in-car infotainment and location-based road services. To this end, self-sustaining caching stations (SCSs) are introduced to liberate on-road base stations from the constraints of power lines and wired backhauls. Specifically, the cache-enabled SCSs are powered by renewable energy and connected to core networks through wireless backhauls, which can realize "drop-and-play" deployment, green operation, and low-latency services. With SCSs integrated, a 5G-enabled heterogeneous vehicular networking architecture is further proposed, where SCSs are deployed along roadside for traffic offloading while conventional macro base stations (MBSs) provide ubiquitous coverage to vehicles. In addition, a hierarchical network management framework is designed to deal with high dynamics in vehicular traffic and renewable energy, where content caching, energy management and traffic steering are jointly investigated to optimize the service capability of SCSs with balanced power demand and supply in different time scales. Case studies are provided to illustrate SCS deployment and operation designs, and some open research issues are also discussed.

cs.NI↗

arXiv2017

Energy-Sustainable Traffic Steering for 5G Mobile Networks

Renewable energy harvesting (EH) technology is expected to be pervasively utilized in the next generation (5G) mobile networks to support sustainable network developments and operations. However, the renewable energy supply is inherently random and intermittent, which could lead to energy outage, energy overflow, quality of service (QoS) degradation, etc. Accordingly, how to enhance renewable energy sustainability is a critical issue for green networking. To this end, an energy-sustainable traffic steering framework is proposed in this article, where the traffic load is dynamically adjusted to match with energy distributions in both spatial and temporal domains by means of inter- and intra-tier steering, caching and pushing. Case studies are carried out, which demonstrate the proposed framework can reduce on-grid energy demand while satisfying QoS requirements. Research topics and challenges of energy-sustainable traffic steering are also discussed.

cs.NI↗

arXiv2017

Software Defined Networking Enabled Wireless Network Virtualization: Challenges and Solutions

Next generation (5G) wireless networks are expected to support the massive data and accommodate a wide range of services/use cases with distinct requirements in a cost-effective, flexible, and agile manner. As a promising solution, wireless network virtualization (WNV), or network slicing, enables multiple virtual networks to share the common infrastructure on demand, and to be customized for different services/use cases. This article focuses on network-wide resource allocation for realizing WNV. Specifically, the motivations, the enabling platforms, and the benefits of WNV, are first reviewed. Then, resource allocation for WNV along with the technical challenges is discussed. Afterwards, a software defined networking (SDN) enabled resource allocation framework is proposed to facilitate WNV, including the key procedures and the corresponding modeling approaches. Furthermore, a case study is provided as an example of resource allocation in WNV. Finally, some open research topics essential to WNV are discussed.

cs.NI↗

arXiv2016

Catalyzing Cloud-Fog Interoperation in 5G Wireless Networks: An SDN Approach

The piling up storage and compute stacks in cloud data center are expected to accommodate the majority of internet traffic in the future. However, as the number of mobile devices significantly increases, getting massive data into and out of the cloud wirelessly inflicts high pressure on the bandwidth, and meanwhile induces unpredictable latency. Fog computing, which advocates extending clouds to network edge, guarantees low latency and location-aware service provisioning. In this article, we consider fog computing as an ideal complement rather than a substitute of cloud computing, and we propose a software defined networking (SDN) enabled framework for cloud-fog interoperation, aiming at improving quality of experience and optimizing network resource usage. Two case studies are provided to illuminate the feasibility and advantage of the proposed framework. At last, potential research issues are presented for further investigation.

cs.NI↗