arXiv subjects

Nan Cheng

Publications and source records attributed to Nan Cheng.

149 records · Page 9Linked to original sources

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

Multi-message Authentication over Noisy Channel with Secure Channel Codes

In this paper, we investigate multi-message authentication to combat adversaries with infinite computational capacity. An authentication framework over a wiretap channel $(W_1,W_2)$ is proposed to achieve information-theoretic security with the same key. The proposed framework bridges the two research areas in physical (PHY) layer security: secure transmission and message authentication. Specifically, the sender Alice first transmits message $M$ to the receiver Bob over $(W_1,W_2)$ with an error correction code; then Alice employs a hash function (i.e., $\varepsilon$-AWU$_2$ hash functions) to generate a message tag $S$ of message $M$ using key $K$, and encodes $S$ to a codeword $X^n$ by leveraging an existing strongly secure channel coding with exponentially small (in code length $n$) average probability of error; finally, Alice sends $X^n$ over $(W_1,W_2)$ to Bob who authenticates the received messages. We develop a theorem regarding the requirements/conditions for the authentication framework to be information-theoretic secure for authenticating a polynomial number of messages in terms of $n$. Based on this theorem, we propose an authentication protocol that can guarantee the security requirements, and prove its authentication rate can approach infinity when $n$ goes to infinity. Furthermore, we design and implement an efficient and feasible authentication protocol over binary symmetric wiretap channel (BSWC) by using \emph{Linear Feedback Shifting Register} based (LFSR-based) hash functions and strong secure polar code. Through extensive experiments, it is demonstrated that the proposed protocol can achieve low time cost, high authentication rate, and low authentication error rate.

cs.CR↗

arXiv2016

Time and Frequency Injection into a Stabilized Fiber Link for Multi-clock Dissemination Network

Owing to the characteristics of ultra-low loss and anti-electromagnetic interference, using optical fiber to deliver time and frequency signal has been a preferred choice for high precise clock dissemination and comparison. As a brilliant idea, one has been able to reproduce ultra-stable signals from one local station to multiple users. In this paper, we take a step further. A concept of multi-clock (in different locations) dissemination for multi-terminals is presented. By injecting frequency signals into one stabilized ring-like fiber network, the relative stabilities of 3.4e-14@1s for a master clock dissemination and 5.1e-14@1s for a slave clock dissemination have been achieved. The proposed scheme can greatly simplify the future 'N' to 'N' time and frequency dissemination network, especially facing a multi-clock comparison situation.

physics.optics↗

arXiv2015

Joint time and frequency dissemination network over delay-stabilized fiber optic links

A precise fiber-based time and frequency dissemination scheme for multiple users with a tree-like branching topology is proposed. Through this scheme, ultra-stable signals can be easily accessed online anywhere along the fiber without affecting other sites. The scheme is tested through an experiment, in which a modulated frequency signal and a synchronized time signal are transferred to multiple remote sites over a delay-stabilized fiber optic links that are over 50 km long. Results show that the relative stabilities are 5E-14@1s and 2E-17@10000s. Meanwhile, compared with each site, time synchronization precision is less than 80 ps. These results can pave the way to practical applications in joint time and frequency dissemination network systems.

physics.optics↗