Differential Game for Distributed Power Control in Device-to-Device Communications Underlaying Cellular Networks

Wireless Personal Communications - In the formulating of power control for wireless networks, the radio channel is commonly formulated using static models of optimization or game theory. In these...     

Parametric network utility maximization problem

We show how to solve the parametric utility maximization problem with a continuous parameter in a finite number of steps in order to obtain a solution with given accuracy. Also, we propose a new approach for the discretization of time for the parametric utility maximization problem with Lipschitz utility function. Some numerical results are provided.     

Advanced Primary–Backup Platform with Container-Based Automatic Deployment for Fault-Tolerant Systems

Within mission-critical systems, the primary–backup scheme is a desirable approach for improving reliability and fault tolerance. It can be used to ensure a high mission success rate despite unexpected errors. However, it must cope with the need to maintain consistency between a primary and a backup whenever the primary encounters unexpected errors. We overcome this issue by introducing a platform that uses container-based light virtualization and an automatic build system to isolate an application so that it may then be deployed on different devices without manual intervention. We believe an advanced deployment procedure can retain the consistency of the primary–backup systems with low implementation complexity. Integrated with a cloud application, it can also manage mission-critical systems effectively, communicate with the redundant systems, and detect unexpected errors by using sophisticated fault-detection technologies. We demonstrate that the platform can improve the reliability of mission-critical systems through realistic experiment using a model electronic vehicle and can reduce hardware dependencies.     

Cognitive Heterogeneous Networks with Unreliable Backhaul Connections

To enhance the spectrum scarcity of cooperative heterogeneous networks (HetNets) with unreliable backhaul connections, we examine the impact of cognitive spectrum sharing over multiple small-cell transmitters in Nakagami-m fading channels. In this system, the secondary transmitters are connected to macro-cell via wireless backhaul links and communicate with the secondary receiver by sharing the same spectrum with the primary user. Integrating cognitive radio (CR) network into the system, we address the combined power constraints: 1) the peak interference power at the primary user and 2) the maximal transmit power at the secondary transmitters. In addition, to exclude the signaling overhead for exchanging channel-state-information (CSI) at the transmitters, the selection combining (SC) protocol is assumed to employ at the receivers. To evaluate the performance, we first derive the closed-form statistics of the end-to-end signal-to-noise (SNR) ratio, from which the exact outage probability, ergodic capacity and symbol error rate expressions are derived. To reveal further insights into the effective unreliable backhaul links and the diversity of fading parameters, the asymptotic expressions are also attained. The two interesting non-cooperative and Rayleigh fading scenarios are also investigated. Numerical results are conducted to verify the performance of the considered system via Monte-Carlo simulations.     

Large margin shortest path routing

A new discriminative approach to routing inspired by the large margin criterion serving as a basis for support vector machines is presented. The proposed formulation uses the benefit of the dualization convex program, and it is possible for standard solvers to learn the weighting metrics of the shortest path routing. In order to demonstrate this and due to its simplicity, the single path flow allocation problem is considered in this article. It was found that the weight settings performed within a few percent of that of the optimal general routing where the flow for each demand was optimally distributed over all paths between the source and destination.