32,000 research outputs found
Derandomized Distributed Multi-resource Allocation with Little Communication Overhead
We study a class of distributed optimization problems for multiple shared
resource allocation in Internet-connected devices. We propose a derandomized
version of an existing stochastic additive-increase and multiplicative-decrease
(AIMD) algorithm. The proposed solution uses one bit feedback signal for each
resource between the system and the Internet-connected devices and does not
require inter-device communication. Additionally, the Internet-connected
devices do not compromise their privacy and the solution does not dependent on
the number of participating devices. In the system, each Internet-connected
device has private cost functions which are strictly convex, twice continuously
differentiable and increasing. We show empirically that the long-term average
allocations of multiple shared resources converge to optimal allocations and
the system achieves minimum social cost. Furthermore, we show that the proposed
derandomized AIMD algorithm converges faster than the stochastic AIMD algorithm
and both the approaches provide approximately same solutions
Game Theoretic Approaches to Massive Data Processing in Wireless Networks
Wireless communication networks are becoming highly virtualized with
two-layer hierarchies, in which controllers at the upper layer with tasks to
achieve can ask a large number of agents at the lower layer to help realize
computation, storage, and transmission functions. Through offloading data
processing to the agents, the controllers can accomplish otherwise prohibitive
big data processing. Incentive mechanisms are needed for the agents to perform
the controllers' tasks in order to satisfy the corresponding objectives of
controllers and agents. In this article, a hierarchical game framework with
fast convergence and scalability is proposed to meet the demand for real-time
processing for such situations. Possible future research directions in this
emerging area are also discussed
Optimizing Wirelessly Powered Crowd Sensing: Trading energy for data
To overcome the limited coverage in traditional wireless sensor networks,
\emph{mobile crowd sensing} (MCS) has emerged as a new sensing paradigm. To
achieve longer battery lives of user devices and incentive human involvement,
this paper presents a novel approach that seamlessly integrates MCS with
wireless power transfer, called \emph{wirelessly powered crowd sensing} (WPCS),
for supporting crowd sensing with energy consumption and offering rewards as
incentives. The optimization problem is formulated to simultaneously maximize
the data utility and minimize the energy consumption for service operator, by
jointly controlling wireless-power allocation at the \emph{access point} (AP)
as well as sensing-data size, compression ratio, and sensor-transmission
duration at \emph{mobile sensor} (MS). Given the fixed compression ratios, the
optimal power allocation policy is shown to have a \emph{threshold}-based
structure with respect to a defined \emph{crowd-sensing priority} function for
each MS. Given fixed sensing-data utilities, the compression policy achieves
the optimal compression ratio. Extensive simulations are also presented to
verify the efficiency of the contributed mechanisms.Comment: arXiv admin note: text overlap with arXiv:1711.0206
- …