Low Complexity Power and Scheduling Policies for Wireless Networks to Provide Quality of Service

We consider optimal power allocation policies for a single server, multiuser system. The power is consumed in transmission of data only. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity.

Simultaneous perturbation methods for adaptive labor staffing in service systems

We consider the problem of optimizing the workforce of a service system. Adapting the staffing levels in such systems is non-trivial due to large variations in workload and the large number of system parameters do not allow for a brute force search. Further, because these parameters change on a weekly basis, the optimization should not take longer than a few hours. Our aim is to find the optimum staffing levels from a discrete high-dimensional parameter set, that minimizes the long run average of the single-stage cost function, while adhering to the constraints relating to queue stability and service-level agreement (SLA) compliance. The single-stage cost function balances the conflicting objectives of utilizing workers better and attaining the target SLAs. We formulate this problem as a constrained parameterized Markov cost process parameterized by the (discrete) staffing levels. We propose novel simultaneous perturbation stochastic approximation (SPSA)-based algorithms for solving the above problem. The algorithms include both first-order as well as second-order methods and incorporate SPSA-based gradient/Hessian estimates for primal descent, while performing dual ascent for the Lagrange multipliers. Both algorithms are online and update the staffing levels in an incremental fashion. Further, they involve a certain generalized smooth projection operator, which is essential to project the continuous-valued worker parameter tuned by our algorithms onto the discrete set. The smoothness is necessary to ensure that the underlying transition dynamics of the constrained Markov cost process is itself smooth (as a function of the continuous-valued parameter): a critical requirement to prove the convergence of both algorithms. We validate our algorithms via performance simulations based on data from five real-life service systems. For the sake of comparison, we also implement a scatter search based algorithm using state-of-the-art optimization tool-kit OptQuest. From the experiments, we observe that both our algorithms converge empirically and consistently outperform OptQuest in most of the settings considered. This finding coupled with the computational advantage of our algorithms make them amenable for adaptive labor staffing in real-life service systems.

Renormalization group invariants and sum rules in the deflected mirage mediation supersymmetry breaking

We examine the deflected mirage mediation supersymmetry breaking (DMMSB) scenario, which combines three supersymmetry breaking scenarios, namely anomaly mediation, gravity mediation and gauge mediation using the one-loop renormalization group invariants (RGIs). We examine the effects on the RGIs at the threshold where the gauge messengers emerge, and derive the supersymmetry breaking parameters in terms of the RGIs. We further discuss whether the supersymmetry breaking mediation mechanism can be determined using a limited set of invariants, and derive sum rules valid for DMMSB below the gauge messenger scale. In addition we examine the implications of the measured Higgs mass for the DMMSB spectrum.

CheepSync: A Time Synchronization Service for Resource Constrained Bluetooth LE Advertisers

Clock synchronization is highly desirable in distributed systems, including many applications in the Internet of Things and Humans. It improves the efficiency, modularity, and scalability of the system, and optimizes use of event triggers. For IoTH, BLE - a subset of the recent Bluetooth v4.0 stack - provides a low-power and loosely coupled mechanism for sensor data collection with ubiquitous units (e.g., smartphones and tablets) carried by humans. This fundamental design paradigm of BLE is enabled by a range of broadcast advertising modes. While its operational benefits are numerous, the lack of a common time reference in the broadcast mode of BLE has been a fundamental limitation. This article presents and describes CheepSync, a time synchronization service for BLE advertisers, especially tailored for applications requiring high time precision on resource constrained BLE platforms. Designed on top of the existing Bluetooth v4.0 standard, the CheepSync framework utilizes low-level time-stamping and comprehensive error compensation mechanisms for overcoming uncertainties in message transmission, clock drift, and other system-specific constraints. CheepSync was implemented on custom designed nRF24Cheep beacon platforms (as broadcasters) and commercial off-the-shelf Android ported smartphones (as passive listeners). We demonstrate the efficacy of CheepSync by numerous empirical evaluations in a variety of experimental setups, and show that its average (single-hop) time synchronization accuracy is in the 10 mu s range.

Gravitational rescue of minimal gauge mediation

Gravity mediated supersymmetry breaking becomes comparable to gauge mediated supersymmetry breaking contributions when messenger masses are close to the GUT scale. By suitably arranging the gravity contributions, one can modify the soft supersymmetry breaking sector to generate a large stop mixing parameter and a light Higgs mass of 125 GeV. In this kind of hybrid models, however, the nice features of gauge mediation like flavor conservation, etc. are lost. To preserve the nice features, gravitational contributions should become important for lighter messenger masses and should be important only for certain fields. This is possible when the hidden sector contains multiple (at least two) spurions with hierarchical vacuum expectation values. In this case, the gravitational contributions can be organized to be ``just right.'' We present a complete model with two spurion hidden sector where the gravitational contribution is from a warped flavor model in a Randall-Sundrum setting. Along the way, we present simple expressions to handle renormalization group equations when supersymmetry is broken by two different sectors at two different scales.