arXiv subjects

Tian Zhang

Publications and source records attributed to Tian Zhang.

At least 91 records · Page 5Linked to original sources

arXiv2017

Data offloading in mobile edge computing: A coalitional game based pricing approach

Mobile edge computing (MEC), affords service to the vicinity of mobile devices (MDs), has become a key technology for future network. Offloading big data to the MEC server for preprocessing is a attractive choice of MDs. In the paper, we investigate data offloading from MDs to MEC servers. A coalitional game based pricing scheme is proposed. We apply coalitional game to depict the offloading relationship between MDs and MEC servers, and utilize pricing as the stimuli for the offloading. A scheduled MD chooses one MEC server within the same coalition for offloading, and pays the selected MEC server for the MEC service. We formulate a coalitional game, where MDs and MEC servers are players and their utilities are respectively defined. Next, we analyze the formulated game. Specially, the core is studied. Finally, utility performance of the proposed scheme under the 2-MD and 2-MEC- server scenario are demonstrated.

cs.GT↗

arXiv2017

Spectrum sharing in energy harvesting cognitive radio networks: A cross-layer perspective

In the paper, we present a cross-layer perspective on data transmission in energy harvesting cognitive radio networks (CRNs). The delay optimal power allocation is studied while taking into account the randomness of harvested energy, data generation, channel state and the grid price. To guarantee primary user (PU)'s transmission, its Signal-Interference-Ratio (SIR) should be no less than a threshold. Each user, including PU as well as secondary user (SU), has energy harvesting devices, and the PU can also purchases the grid power. Each user is rational and selfish to minimize its own the buffer delay. We formulate a stochastic Stackelberg game in a bilevel manner. After decoupling via rewriting the objective and constraints, an equivalent tractable reconstruction is derived. First, we give a distributive algorithm to obtain the Nash equilibrium (NE) of the lower level SUs' noncooperative stochastic game. Thereafter, the stochastic Stackelberg game is discussed under the circumstances that there is no information exchange between PU and SU. Distributed iterative algorithms are designed. Furthermore, a distributive online algorithm is proposed. Finally, simulations are carried out to verify the correctness and demonstrate the effectiveness of proposed algorithms.

cs.IT↗

arXiv2016

How chemical functionalization affects the lattice thermal conductivities of antimony films?

Chemical functionalization is an effective means to tune electronic and crystal structure of two-dimensional material, which may be crucial for moder microelectronics industry. Based on the first-principle calculation and an iterative solution of Boltzmann transport equation, we find that antimony films are potential excellent thermoelectrical materials with rather low thermal conductivities $k$ ($<$ 2.5 W/mK). The chemical functionalization can induce the reduction in $k$ to some extent, which is mainly due to the reduction of phonon lifetimes limited by the anharmonic scattering. More interesting, the origin of the reduction in $k$ is not the anharmonic interaction but the harmonic interaction from the depressed phonon spectrum mechanism, and for some chemical functional atom in halogen, the flat modes appearing in the low frequency range play also a key factor in the reduction of $k$ by significantly increasing the three-phonon scattering channels. Our work analyzes the reduction mechanism in $k$ from the chemical functionalization for antimonene, and provides a new view to adjust the thermal conductivity which can benefit thermoelectric material design.

cond-mat.mtrl-sci↗

arXiv2015

Strain-induced large band-gap topological insulator in a new stable silicon allotrope: dumbbell silicene

By the generalized gradient approximation in framewok of density functional theory, we investigate a 2D topological insulator of new silicon allotrope (call dumbbell silicene synthesized recently by Cahangirov et al) through tuning external compression strain, and find a topological quantum phase transition from normal to topological insulator, i.e., the dumbbell silicene can turn a two-dimensional topological insulator with an inverted band gap. The obtained maximum topological nontrivial band gap about 12 meV under isotropic strain is much larger than that for previous silicene, and can be further improved to 36 meV by tuning anisotropic strain, which is sufficiently large to realize quantum spin Hall effect even at room-temperature, and thus is beneficial to the fabrication of high-speed spintronics devices. Furthermore, we confirm that the boron nitride sheet is an ideal substrate for the experimental realization of the dumbbell silicene under external strain, maintaining its nontrivial topology. These properties make the two-dimensional dumbbell silicene a good platform to study novel quantum states of matter, showing great potential for future applications in modern silicon-based microelectronics industry.

cond-mat.mtrl-sci↗

arXiv2015

Delay-optimal Data Transmission in Renewable Energy Aided Cognitive Radio Networks

Renewable energy powered cognitive radio (CR) network has gained much attention due to its combination of the CR's spectrum efficiency and the renewable energy's "green" nature. In the paper, we investigate the delay-optimal data transmission in the renewable energy aided CR networks. Specifically, a primary user (PU) and a secondary user (SU) share the same frequency in an area. The SU's interference to the PU is controlled by interference-signal-ratio (ISR) constraint, which means that the ISR at the PU receiver (Rx) should be less than a threshold. Under this constraint, the renewable energy powered SU aims to minimize the average data buffer delay by scheduling the renewable allocations in each slot. A constrained stochastic optimization problem is formulated when the randomness of the renewable arrival, the uncertainty of the SU's data generation, and the variability of the fading channel are taken into account. By analyzing the formulated problem, we propose two practical algorithms that is optimal for two special scenarios. And the two algorithms respectively give an upper and a lower bound for the general scenario. In addition, the availability of the PU's private information at the SU is discussed. Finally, numerical simulations verify the effectiveness of the proposed algorithm.

cs.IT↗

arXiv2015

Triplet-Polaron Interaction Induced Upconversion from Triplet to Singlet: a New Way to Obtain Highly Efficient OLEDs

The triplet harvesting is a main challenge in organic light-emitting devices (OLEDs), due to the radiative decay of triplet is spin-forbidden. Here, we designed and synthesized two D-A type molecules, TPA-TAZ and TCP. The OLEDs based on them exhibit deep-blue emission and the singlet formation ratios are higher than the simple spin-statistics of 25 %. Specially, a TPA-TAZ-based OLED achieves a maximum EQE of 6.8 %, which is the largest value of the undoped OLEDs with CIE(y)< 0.06 (the EBU blue standard) up to date. Comprehensive experiments eliminate the triplet-harvesting processes of thermally activated delayed fluorescence and triplet-triplet annihilation. Instead, the triplet-polaron interaction induced upconversion from triplet to singlet through one-electron transfer mechanism is proposed, and proven by the magneto-current measurement and quantum chemistry computation. Our results may offer a new route to break through the 25 % upper limit of IQE of fluorescent OLEDs, especially, the deep-blue fluorescent OLEDs.

physics.chem-ph↗

arXiv2015

3D Automatic Segmentation Method for Retinal Optical Coherence Tomography Volume Data Using Boundary Surface Enhancement

With the introduction of spectral-domain optical coherence tomography (SDOCT), much larger image datasets are routinely acquired compared to what was possible using the previous generation of time-domain OCT. Thus, there is a critical need for the development of 3D segmentation methods for processing these data. We present here a novel 3D automatic segmentation method for retinal OCT volume data. Briefly, to segment a boundary surface, two OCT volume datasets are obtained by using a 3D smoothing filter and a 3D differential filter. Their linear combination is then calculated to generate new volume data with an enhanced boundary surface, where pixel intensity, boundary position information, and intensity changes on both sides of the boundary surface are used simultaneously. Next, preliminary discrete boundary points are detected from the A-Scans of the volume data. Finally, surface smoothness constraints and a dynamic threshold are applied to obtain a smoothed boundary surface by correcting a small number of error points. Our method can extract retinal layer boundary surfaces sequentially with a decreasing search region of volume data. We performed automatic segmentation on eight human OCT volume datasets acquired from a commercial Spectralis OCT system, where each volume of data consisted of 97 OCT images with a resolution of 496 512; experimental results show that this method can accurately segment seven layer boundary surfaces in normal as well as some abnormal eyes.

cs.CV↗

arXiv2015

Delay-aware data transmission of multi-carrier communications in the presence of renewable energy

In the paper, we investigate the delay-aware data transmission in renewable energy aided multi-carrier system. Besides utilizing the local renewables, the transmitter can also purchase grid power. By scheduling the amount of transmitted data (The data are stored in a buffer before transmission), the sub-carrier allocation, and the renewable allocation in each transmission period, the transmitter aims to minimize the purchasing cost under a buffer delay constraint. By theoretical analysis of the formulated stochastic optimization problem, we find that transmit the scheduled data through the subcarrier with best condition is optimal and greedy renewable energy is approximately optimal. Furthermore, based on the theoretical derives and Lyapunov optimization, an on-line algorithm, which does NOT require future information, is proposed. Numerical results illustrate the delay and cost performance of the proposed algorithm. In addition, the comparisons with the delay-optimal policy and cost-optimal policy are carried out.

cs.IT↗

arXiv2015

Controlling quantum spin Hall state via strain in various stacking bilayer phosphorene

Quantum spin Hall (QSH) state of matter has a charge excitation bulk bandgap and a pair of gapless spin-filtered edge-states, which can support backscattering-free transport. Bilayer phosphorene possesses a large tunable bandgap and high carrier mobilities, and therefore has the widely potential applications in nanoelectronics and optics. Here, we demonstrate an strain-induced electronic topological phase transition from a normal to QSH state in bilayer phosphorene accompanying by a band inversion that changes $\mathbbm{Z}_{2}$ from 0 to 1, which is highly dependent on the interlayer stacking. When the bottom layer is shifted by 1/2 unit cell along axial direction with respect to the top layer, the topological bandgap reaches up to 92.5 meV, which is sufficiently large to realize the QSH effect at room temperature. Its optical absorption spectrum becomes broadened, and even extends to the far-infra-red region leading to a wider range of brightness, which is highly desirable in optic devices.

cond-mat.mtrl-sci↗

arXiv2013

A Cross-layer Perspective on Energy Harvesting Aided Green Communications over Fading Channels

We consider the power allocation of the physical layer and the buffer delay of the upper application layer in energy harvesting green networks. The total power required for reliable transmission includes the transmission power and the circuit power. The harvested power (which is stored in a battery) and the grid power constitute the power resource. The uncertainty of data generated from the upper layer, the intermittence of the harvested energy, and the variation of the fading channel are taken into account and described as independent Markov processes. In each transmission, the transmitter decides the transmission rate as well as the allocated power from the battery, and the rest of the required power will be supplied by the power grid. The objective is to find an allocation sequence of transmission rate and battery power to minimize the long-term average buffer delay under the average grid power constraint. A stochastic optimization problem is formulated accordingly to find such transmission rate and battery power sequence. Furthermore, the optimization problem is reformulated as a constrained MDP problem whose policy is a two-dimensional vector with the transmission rate and the power allocation of the battery as its elements. We prove that the optimal policy of the constrained MDP can be obtained by solving the unconstrained MDP. Then we focus on the analysis of the unconstrained average-cost MDP. The structural properties of the average optimal policy are derived. Moreover, we discuss the relations between elements of the two-dimensional policy. Next, based on the theoretical analysis, the algorithm to find the constrained optimal policy is presented for the finite state space scenario. In addition, heuristic policies with low-complexity are given for the general state space. Finally, simulations are performed under these policies to demonstrate the effectiveness.

cs.IT↗

arXiv2013

On a New Notion of Partial Refinement

Formal specification techniques allow expressing idealized specifications, which abstract from restrictions that may arise in implementations. However, partial implementations are universal in software development due to practical limitations. Our goal is to contribute to a method of program refinement that allows for partial implementations. For programs with a normal and an exceptional exit, we propose a new notion of partial refinement which allows an implementation to terminate exceptionally if the desired results cannot be achieved, provided the initial state is maintained. Partial refinement leads to a systematic method of developing programs with exception handling.

cs.LO↗

arXiv2013

DNF-AF Selection Two-Way Relaying

Error propagation and noise propagation at the relay node would highly degrade system performance in two-way relay networks. In this paper, we introduce DNF-AF selection two-way relaying scheme which aims to avoid error propagation and mitigate noise propagation. If the relay successfully decodes the exclusive or (XOR) of the messages sent by the two transceivers, it applies denoise-and-forward (DNF). Otherwise, amplify-and-forward (AF) strategy will be utilized. In this way, decoding error propagation is avoided at the relay. Meanwhile, since the relay attempts to decode the XOR of the two messages instead of explicitly decoding the two messages, the larger usable range of XOR network coding can be obtained. As XOR network coding can avoid noise propagation, DNF-AF would mitigate noise propagation. In addition, bit error rate (BER) performance of DNF-AF selection scheme with BPSK modulation is theoretically analyzed in this paper. Numerical results verify that the proposed scheme has better BER performance than existing ones.

cs.IT↗

arXiv2013

Coalitional Game Theoretic Approach for Cooperative Transmission in Vehicular Networks

Cooperative transmission in vehicular networks is studied by using coalitional game and pricing in this paper. There are several vehicles and roadside units (RSUs) in the networks. Each vehicle has a desire to transmit with a certain probability, which represents its data burtiness. The RSUs can enhance the vehicles' transmissions by cooperatively relaying the vehicles' data. We consider two kinds of cooperations: cooperation among the vehicles and cooperation between the vehicle and RSU. First, vehicles cooperate to avoid interfering transmissions by scheduling the transmissions of the vehicles in each coalition. Second, a RSU can join some coalition to cooperate the transmissions of the vehicles in that coalition. Moreover, due to the mobility of the vehicles, we introduce the notion of encounter between the vehicle and RSU to indicate the availability of the relay in space. To stimulate the RSU's cooperative relaying for the vehicles, the pricing mechanism is applied. A non-transferable utility (NTU) game is developed to analyze the behaviors of the vehicles and RSUs. The stability of the formulated game is studied. Finally, we present and discuss the numerical results for the 2-vehicle and 2-RSU scenario, and the numerical results verify the theoretical analysis.

cs.GT↗

arXiv2013

Charging Scheduling of Electric Vehicles with Local Renewable Energy under Uncertain Electric Vehicle Arrival and Grid Power Price

In the paper, we consider delay-optimal charging scheduling of the electric vehicles (EVs) at a charging station with multiple charge points. The charging station is equipped with renewable energy generation devices and can also buy energy from power grid. The uncertainty of the EV arrival, the intermittence of the renewable energy, and the variation of the grid power price are taken into account and described as independent Markov processes. Meanwhile, the charging energy for each EV is random. The goal is to minimize the mean waiting time of EVs under the long term constraint on the cost. We propose queue mapping to convert the EV queue to the charge demand queue and prove the equivalence between the minimization of the two queues' average length. Then we focus on the minimization for the average length of the charge demand queue under long term cost constraint. We propose a framework of Markov decision process (MDP) to investigate this scheduling problem. The system state includes the charge demand queue length, the charge demand arrival, the energy level in the storage battery of the renewable energy, the renewable energy arrival, and the grid power price. Additionally the number of charging demands and the allocated energy from the storage battery compose the two-dimensional policy. We derive two necessary conditions of the optimal policy. Moreover, we discuss the reduction of the two-dimensional policy to be the number of charging demands only. We give the sets of system states for which charging no demand and charging as many demands as possible are optimal, respectively. Finally we investigate the proposed radical policy and conservative policy numerically.

math.OC↗

arXiv2013

Opportunistic DF-AF Selection Relaying with Optimal Relay Selection in Nakagami-m Fading Environments

An opportunistic DF-AF selection relaying scheme with maximal received signal-to-noise ratio (SNR) at the destination is investigated in this paper. The outage probability of the opportunistic DF-AF selection relaying scheme over Nakagami-m fading channels is analyzed, and a closed-form solution is obtained. We perform asymptotic analysis of the outage probability in high SNR domain. The coding gain and the diversity order are obtained. For the purpose of comparison, the asymptotic analysis of opportunistic AF scheme in Nakagami-m fading channels is also performed by using the Squeeze Theorem. In addition, we prove that compared with the opportunistic DF scheme and opportunistic AF scheme, the opportunistic DF-AF selection relaying scheme has better outage performance.

cs.IT↗

arXiv2012

Hierarchic Power Allocation for Spectrum Sharing in OFDM-Based Cognitive Radio Networks

In this paper, a Stackelberg game is built to model the hierarchic power allocation of primary user (PU) network and secondary user (SU) network in OFDM-based cognitive radio (CR) networks. We formulate the PU and the SUs as the leader and the followers, respectively. We consider two constraints: the total power constraint and the interference-to-signal ratio (ISR) constraint, in which the ratio between the accumulated interference and the received signal power at each PU should not exceed certain threshold. Firstly, we focus on the single-PU and multi-SU scenario. Based on the analysis of the Stackelberg Equilibrium (SE) for the proposed Stackelberg game, an analytical hierarchic power allocation method is proposed when the PU can acquire the additional information to anticipate SUs' reaction. The analytical algorithm has two steps: 1) The PU optimizes its power allocation with considering the reaction of SUs to its action. In the power optimization of the PU, there is a sub-game for power allocation of SUs given fixed transmit power of the PU. The existence and uniqueness for the Nash Equilibrium (NE) of the sub-game are investigated. We also propose an iterative algorithm to obtain the NE, and derive the closed-form solutions of NE for the perfectly symmetric channel. 2) The SUs allocate the power according to the NE of the sub-game given PU's optimal power allocation. Furthermore, we design two distributed iterative algorithms for the general channel even when private information of the SUs is unavailable at the PU. The first iterative algorithm has a guaranteed convergence performance, and the second iterative algorithm employs asynchronous power update to improve time efficiency. Finally, we extend to the multi-PU and multi-SU scenario, and a distributed iterative algorithm is presented.

cs.GT↗

arXiv2012

A 3D Segmentation Method for Retinal Optical Coherence Tomography Volume Data

With the introduction of spectral-domain optical coherence tomography (OCT), much larger image datasets are routinely acquired compared to what was possible using the previous generation of time-domain OCT. Thus, the need for 3-D segmentation methods for processing such data is becoming increasingly important. We present a new 3D segmentation method for retinal OCT volume data, which generates an enhanced volume data by using pixel intensity, boundary position information, intensity changes on both sides of the border simultaneously, and preliminary discrete boundary points are found from all A-Scans and then the smoothed boundary surface can be obtained after removing a small quantity of error points. Our experiments show that this method is efficient, accurate and robust.

cs.CV↗

arXiv2012

Two-color QCD via dimensional reduction

We study the thermodynamics of two-color QCD at high temperature and/or density using a dimensionally reduced superrenormalizable effective theory, formulated in terms of a coarse grained Wilson line. In the absence of quarks, the theory is required to respect the Z(2) center symmetry, while the effects of quarks of arbitrary masses and chemical potentials are introduced via soft Z(2) breaking operators. Perturbative matching of the effective theory parameters to the full theory is carried out explicitly, and it is argued how the new theory can be used to explore the phase diagram of two-color QCD.

hep-ph↗