arXiv subjects

Hao Feng

Publications and source records attributed to Hao Feng.

119 records · Page 7Linked to original sources

arXiv2019

Enable Super-resolution Parameter Estimation for Mm-wave Channel Sounding

This paper investigates the capability of millimeter-wave (mmWave) channel sounders with phased arrays to perform super-resolution parameter estimation, i.e., determine the parameters of multipath components (MPC), such as direction of arrival and delay, with resolution better than the Fourier resolution of the setup. We analyze the question both generally, and with respect to a particular novel multi-beam mmWave channel sounder that is capable of performing multiple-input-multiple-output (MIMO) measurements in dynamic environments. We firstly propose a novel two-step calibration procedure that provides higher-accuracy calibration data that are required for Rimax or SAGE. Secondly, we investigate the impact of center misalignment and residual phase noise on the performance of the parameter estimator. Finally we experimentally verify the calibration results and demonstrate the capability of our sounder to perform super-resolution parameter estimation.

cs.IT↗

arXiv2018

Superior thermal conductivity of poly (ethylene oxide) for solid-state electrolytes: a molecular dynamics study

Solid-state lithium-ion batteries (SSLIBs) are considered to be the new generation of devices for energy storage due to better performance and safety. Poly (ethylene oxide) (PEO) based material becomes one of the best candidate of solid electrolytes, while its thermal conductivity is crucial to heat dissipation inside batteries. In this work, we study the thermal conductivity of PEO by molecular dynamics simulation. By enhancing the structure order, thermal conductivity of aligned crystalline PEO is obtained as high as 60 W/m-K at room temperature, which is two orders higher than the value (0.37 W/m-K) of amorphous structure. Interestingly, thermal conductivity of ordered structure shows a significant stepwise negative temperature dependence, which is attributed to the temperature-induced morphology change. Our study offers useful insights into the fundamental mechanisms that govern the thermal conductivity of PEO but not hinder the ionic transport, which can be used for the thermal management and further optimization of high-performance SSLIBs.

physics.app-ph↗

arXiv2018

Realizing Thermoelectric and Thermistor Bi-functionalities via Triggering Electron Correlations with Lattice-dipole

Establishing strong electron-correlations not only shed lights on overcoming the trade-off limitations for optimizing thermoelectric materials, but can also introduce new functionalities that extend the vision of conventional thermoelectric applications. Here, we demonstrate that the high thermoelectric and thermistor functionalities coexist in lattice distorted SrNbxTi1-xO3 films with electron correlations between carriers and ordering aligned lattice dipoles. As-grown SrNbxTi1-xO3/SrTiO3 with effectively preserved interfacial strains exhibits cross-plane charge ordering and orbital anisotropy, as indicated by the polarization dependent near edge X-ray absorption fine structures. The resultant coulomb-correlations regulate the carrier transport and enhance the Seebeck coefficient more independently via enlarging the system vibration entropy. As-achieved maximum thermoelectric power factor exceeds 100 uWcm-1K-2 measured in the bulk performance of SrNb0.2Ti0.8O3 (2.2 um)/SrTiO3 (100 um), which is comparable to the best thermoelectric materials for low temperature applications. In addition, the strong temperature dependence of the carrier scattering aroused by the lattice dipoles introduces a positive temperature dependent thermistor transportation behavior with large temperature coefficient of resistance ranging from 30 to 300 K, which is rarely seen in conventional thermistors. Combining both functionalities largely extend the horizon in exploring new Joule sensors for detection of temperature and thermal perturbations across a broad temperature range.

cond-mat.mtrl-sci↗

arXiv2017

Optimal Control of Wireless Computing Networks

Augmented information (AgI) services allow users to consume information that results from the execution of a chain of service functions that process source information to create real-time augmented value. Applications include real-time analysis of remote sensing data, real-time computer vision, personalized video streaming, and augmented reality, among others. We consider the problem of optimal distribution of AgI services over a wireless computing network, in which nodes are equipped with both communication and computing resources. We characterize the wireless computing network capacity region and design a joint flow scheduling and resource allocation algorithm that stabilizes the underlying queuing system while achieving a network cost arbitrarily close to the minimum, with a tradeoff in network delay. Our solution captures the unique chaining and flow scaling aspects of AgI services, while exploiting the use of the broadcast approach coding scheme over the wireless channel.

cs.NI↗

arXiv2017

Optimal Dynamic Cloud Network Control

Distributed cloud networking enables the deployment of a wide range of services in the form of interconnected software functions instantiated over general purpose hardware at multiple cloud locations distributed throughout the network. We consider the problem of optimal service delivery over a distributed cloud network, in which nodes are equipped with both communication and computation resources. We address the design of distributed online solutions that drive flow processing and routing decisions, along with the associated allocation of cloud and network resources. For a given set of services, each described by a chain of service functions, we characterize the cloud network capacity region and design a family of dynamic cloud network control (DCNC) algorithms that stabilize the underlying queuing system, while achieving arbitrarily close to minimum cost with a tradeoff in network delay. The proposed DCNC algorithms make local decisions based on the online minimization of linear and quadratic metrics obtained from an upper bound on the Lyapunov drift-plus-penalty of the cloud network queuing system. Minimizing a quadratic vs. a linear metric is shown to improve the cost-delay tradeoff at the expense of increased computational complexity. Our algorithms are further enhanced with a shortest transmission-plus-processing distance bias that improves delay performance without compromising throughput or overall cloud network cost. We provide throughput and cost optimality guarantees, convergence time analysis, and extensive simulations in representative cloud network scenarios.

cs.NI↗

arXiv2017

Design and Optimization of VoD schemes with Client Caching in Wireless Multicast Networks

Due to the explosive growth in multimedia traffic, the scalability of video-on-demand (VoD) services becomes increasingly important. By exploiting the potential cache ability at the client side, the performance of VoD multicast delivery can be improved through video segment pre-caching. In this paper, we address the performance limits of client caching enabled VoD schemes in wireless multicast networks with asynchronous requests. Both reactive and proactive systems are investigated. Specifically, for the reactive system where videos are transmitted on demand, we propose a joint cache allocation and multicast delivery scheme to minimize the average bandwidth consumption under the zero-delay constraint. For the proactive system where videos are periodically broadcasted, a joint design of the cache-bandwidth allocation algorithm and the delivery mechanism is developed to minimize the average waiting time under the total bandwidth constraint. In addition to the full access pattern where clients view videos in their entirety, we further consider the access patterns with random endpoints, fixed-size intervals and downloading demand, respectively. The impacts of different access patterns on the resource-allocation algorithm and the delivery mechanism are elaborated. Simulation results validate the accuracy of the analytical results and also provide useful insights in designing VoD networks with client caching.

cs.IT↗

arXiv2016

Cache-enabled Uplink Transmission in Wireless Small Cell Networks

It is starting to become a big trend in the era of social networking that people produce and upload user-generated contents to Internet via wireless networks, bringing a significant burden on wireless uplink networks. In this paper, we contribute to designing and theoretical understanding of wireless cache-enabled upload transmission in a delay-tolerant small cell network to relieve the burden, and then propose the corresponding scheduling policies for the small base station (SBS) under the infinite and finite cache sizes. Specifically, the cache ability introduced by SBS enables SBS to eliminate the redundancy among the upload contents from users. This strategy not only alleviates the wireless backhual traffic congestion from SBS to a macro base station (MBS), but also improves the transmission efficiency of SBS. We then investigate the scheduling schemes of SBS to offload more data traffic under caching size constraint. Moreover, two operational regions for the wireless cache-enabled upload network, namely, the delay-limited region and the cache-limited region, are established to reveal the fundamental tradeoff between the delay tolerance and the cache ability. Finally, numerical results are provided to demonstrate the significant performance gains of the proposed wireless cache-enabled upload network.

cs.IT↗

arXiv2015

Optimal Caching Placement for D2D Assisted Wireless Caching Networks

In this paper, we devise the optimal caching placement to maximize the offloading probability for a two-tier wireless caching system, where the helpers and a part of users have caching ability. The offloading comes from the local caching, D2D sharing and the helper transmission. In particular, to maximize the offloading probability we reformulate the caching placement problem for users and helpers into a difference of convex (DC) problem which can be effectively solved by DC programming. Moreover, we analyze the two extreme cases where there is only help-tier caching network and only user-tier. Specifically, the placement problem for the helper-tier caching network is reduced to a convex problem, and can be effectively solved by the classical water-filling method. We notice that users and helpers prefer to cache popular contents under low node density and prefer to cache different contents evenly under high node density. Simulation results indicate a great performance gain of the proposed caching placement over existing approaches.

cs.IT↗

arXiv2014

MobiCacher: Mobility-Aware Content Caching in Small-Cell Networks

Small-cell networks have been proposed to meet the demand of ever growing mobile data traffic. One of the prominent challenges faced by small-cell networks is the lack of sufficient backhaul capacity to connect small-cell base stations (small-BSs) to the core network. We exploit the effective application layer semantics of both spatial and temporal locality to reduce the backhaul traffic. Specifically, small-BSs are equipped with storage facility to cache contents requested by users. As the {\em cache hit ratio} increases, most of the users' requests can be satisfied locally without incurring traffic over the backhaul. To make informed caching decisions, the mobility patterns of users must be carefully considered as users might frequently migrate from one small cell to another. We study the issue of mobility-aware content caching, which is formulated into an optimization problem with the objective to maximize the caching utility. As the problem is NP-complete, we develop a polynomial-time heuristic solution termed {\em MobiCacher} with bounded approximation ratio. We also conduct trace-based simulations to evaluate the performance of {\em MobiCacher}, which show that {\em MobiCacher} yields better caching utility than existing solutions.

cs.NI↗

arXiv2013

Diversity Backpressure Scheduling and Routing with Mutual Information Accumulation in Wireless Ad-hoc Networks

We suggest and analyze algorithms for routing in multi-hop wireless ad-hoc networks that exploit mutual information accumulation as the physical layer transmission scheme, and are capable of routing multiple packet streams (commodities) when only the average channel state information is present and that only locally. The proposed algorithms are modifications of the Diversity Backpressure (DIVBAR) algorithm, under which the packet whose commodity has the largest "backpressure metric" is chosen to be transmitted and is forwarded through the link with the largest differential backlog (queue length). In contrast to traditional DIVBAR, each receiving node stores and accumulates the partially received packet in a separate "partial packet queue", thus increasing the probability of successful reception during a later possible retransmission. We present two variants of the algorithm: DIVBAR-RMIA, under which all the receiving nodes clear the received partial information of a packet once one or more receiving nodes firstly decode the packet; and DIVBAR-MIA, under which all the receiving nodes retain the partial information of a packet until the packet has reached its destination. We characterize the network capacity region with RMIA and prove that (under certain mild conditions) it is strictly larger than the network capacity region with the repetition (REP) transmission scheme that is used by the traditional DIVBAR. We also prove that DIVBAR-RMIA is throughput-optimum among the polices with RMIA, i.e., it achieves the network capacity region with RMIA, which in turn demonstrates that DIVBAR-RMIA outperforms traditional DIVBAR on the achievable throughput. Moreover, we prove that DIVBAR-MIA performs at least as well as DIVBAR-RMIA with respect to throughput. Simulations also confirm these results.

cs.NI↗

arXiv2013

On the Cauchy problem for axi-symmetric vortex rings

We consider the classical Cauchy problem for the 3d Navier-Stokes equation with the initial vorticity $ω_0$ concentrated on a circle, or more generally, a linear combination of such data for circles with common axis of symmetry. We show that natural approximations of the problem obtained by smoothing the initial data satisfy good a-priori estimates which enable us to conclude that the original problem with the singular initial distribution of vorticity has a solution. We impose no restriction on the size of the initial data.

math.AP↗