12,444 research outputs found
Energy-Efficient Transmission Schedule for Delay-Limited Bursty Data Arrivals under Non-Ideal Circuit Power Consumption
This paper develops a novel approach to obtaining energy-efficient
transmission schedules for delay-limited bursty data arrivals under non-ideal
circuit power consumption. Assuming a-prior knowledge of packet arrivals,
deadlines and channel realizations, we show that the problem can be formulated
as a convex program. For both time-invariant and time-varying fading channels,
it is revealed that the optimal transmission between any two consecutive
channel or data state changing instants, termed epoch, can only take one of the
three strategies: (i) no transmission, (ii) transmission with an
energy-efficiency (EE) maximizing rate over part of the epoch, or (iii)
transmission with a rate greater than the EE-maximizing rate over the whole
epoch. Based on this specific structure, efficient algorithms are then
developed to find the optimal policies that minimize the total energy
consumption with a low computational complexity. The proposed approach can
provide the optimal benchmarks for practical schemes designed for transmissions
of delay-limited data arrivals, and can be employed to develop efficient online
scheduling schemes which require only causal knowledge of data arrivals and
deadline requirements.Comment: 30 pages, 7 figure
Optimal Quality-of-Service Scheduling for Energy-Harvesting Powered Wireless Communications
XiaojingChen, Wei Ni, Xin Wang, YichuangSun, “Optimal Quality-of-Service Scheduling for Energy-Harvesting Powered Wireless Communications”, IEEE Transactions on Wireless Communications, Vol. 15 (5): 3269-3280, January 2016. © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.In this paper, a new dynamic string tautening algorithm is proposed to generate the most energy-efficient off-line schedule for delay-limited traffic of transmitters with non-negligible circuit power. The algorithm is based on two key findings that we derive through judicious convex formulation and resultant optimality conditions, specifies a set of simple but optimal rules, and generates the optimal schedule with a low complexity of O(N2) in the worst case. The proposed algorithm is also extended to on-line scenarios, where the transmit schedule is generated on-the-fly. Simulation shows that the proposed algorithm requires substantially lower average complexity by almost two orders of magnitude to retain optimality than general convex solvers. The effective transmit region, specified by the tradeoff of the data arrival rate and the energy harvesting rate, is substantially larger using our algorithm than using other existing alternatives. Significantly more data or less energy can be supported in the proposed algorithm.Peer reviewedFinal Accepted Versio
Hybrid Transceiver Optimization for Multi-Hop Communications
Multi-hop communication with the aid of large-scale antenna arrays will play
a vital role in future emergence communication systems. In this paper, we
investigate amplify-and-forward based and multiple-input multiple-output
assisted multi-hop communication, in which all nodes employ hybrid
transceivers. Moreover, channel errors are taken into account in our hybrid
transceiver design. Based on the matrix-monotonic optimization framework, the
optimal structures of the robust hybrid transceivers are derived. By utilizing
these optimal structures, the optimizations of analog transceivers and digital
transceivers can be separated without loss of optimality. This fact greatly
simplifies the joint optimization of analog and digital transceivers. Since the
optimization of analog transceivers under unit-modulus constraints is
non-convex, a projection type algorithm is proposed for analog transceiver
optimization to overcome this difficulty. Based on the derived analog
transceivers, the optimal digital transceivers can then be derived using
matrix-monotonic optimization. Numeral results obtained demonstrate the
performance advantages of the proposed hybrid transceiver designs over other
existing solutions.Comment: 32 pages, 6 figures. This manuscript has been submitted to IEEE
Journal on Selected Areas in Communications (special issue on Multiple
Antenna Technologies for Beyond 5G
Semantics-Aligned Representation Learning for Person Re-identification
Person re-identification (reID) aims to match person images to retrieve the
ones with the same identity. This is a challenging task, as the images to be
matched are generally semantically misaligned due to the diversity of human
poses and capture viewpoints, incompleteness of the visible bodies (due to
occlusion), etc. In this paper, we propose a framework that drives the reID
network to learn semantics-aligned feature representation through delicate
supervision designs. Specifically, we build a Semantics Aligning Network (SAN)
which consists of a base network as encoder (SA-Enc) for re-ID, and a decoder
(SA-Dec) for reconstructing/regressing the densely semantics aligned full
texture image. We jointly train the SAN under the supervisions of person
re-identification and aligned texture generation. Moreover, at the decoder,
besides the reconstruction loss, we add Triplet ReID constraints over the
feature maps as the perceptual losses. The decoder is discarded in the
inference and thus our scheme is computationally efficient. Ablation studies
demonstrate the effectiveness of our design. We achieve the state-of-the-art
performances on the benchmark datasets CUHK03, Market1501, MSMT17, and the
partial person reID dataset Partial REID. Code for our proposed method is
available at:
https://github.com/microsoft/Semantics-Aligned-Representation-Learning-for-Person-Re-identification.Comment: Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20),
code has been release
Complete Inverse Method Using Ant Colony Optimization Algorithm for Structural Parameters and Excitation Identification from Output Only Measurements
In vibration-based structural health monitoring of existing large civil structures, it is difficult, sometimes even impossible, to measure the actual excitation applied to structures. Therefore, an identification method using output-only measurements is crucial for the practical application of structural health monitoring. This paper integrates the ant colony optimization (ACO) algorithm into the framework of the complete inverse method to simultaneously identify unknown structural parameters and input time history using output-only measurements. The complete inverse method, which was previously suggested by the authors, converts physical or spatial information of the unknown input into the objective function of an optimization problem that can be solved by the ACO algorithm. ACO is a newly developed swarm computation method that has a very good performance in solving complex global continuous optimization problems. The principles and implementation procedure of the ACO algorithm are first introduced followed by an introduction of the framework of the complete inverse method. Construction of the objective function is then described in detail with an emphasis on the common situation wherein a limited number of actuators are installed on some key locations of the structure. Applicability and feasibility of the proposed method were validated by numerical examples and experimental results from a three-story building model
- …