Exploiting Non-Causal CPU-State Information for Energy-Efficient Mobile Cooperative Computing

Scavenging the idling computation resources at the enormous number of mobile devices can provide a powerful platform for local mobile cloud computing. The vision can be realized by peer-to-peer cooperative computing between edge devices, referred to as co-computing. This paper considers a co-computing system where a user offloads computation of input-data to a helper. The helper controls the offloading process for the objective of minimizing the user's energy consumption based on a predicted helper's CPU-idling profile that specifies the amount of available computation resource for co-computing. Consider the scenario that the user has one-shot input-data arrival and the helper buffers offloaded bits. The problem for energy-efficient co-computing is formulated as two sub-problems: the slave problem corresponding to adaptive offloading and the master one to data partitioning. Given a fixed offloaded data size, the adaptive offloading aims at minimizing the energy consumption for offloading by controlling the offloading rate under the deadline and buffer constraints. By deriving the necessary and sufficient conditions for the optimal solution, we characterize the structure of the optimal policies and propose algorithms for computing the policies. Furthermore, we show that the problem of optimal data partitioning for offloading and local computing at the user is convex, admitting a simple solution using the sub-gradient method. Last, the developed design approach for co-computing is extended to the scenario of bursty data arrivals at the user accounting for data causality constraints. Simulation results verify the effectiveness of the proposed algorithms.Comment: Submitted to possible journa

Joint Computation and Communication Cooperation for Mobile Edge Computing

This paper proposes a novel joint computation and communication cooperation approach in mobile edge computing (MEC) systems, which enables user cooperation in both computation and communication for improving the MEC performance. In particular, we consider a basic three-node MEC system that consists of a user node, a helper node, and an access point (AP) node attached with an MEC server. We focus on the user's latency-constrained computation over a finite block, and develop a four-slot protocol for implementing the joint computation and communication cooperation. Under this setup, we jointly optimize the computation and communication resource allocation at both the user and the helper, so as to minimize their total energy consumption subject to the user's computation latency constraint. We provide the optimal solution to this problem. Numerical results show that the proposed joint cooperation approach significantly improves the computation capacity and the energy efficiency at the user and helper nodes, as compared to other benchmark schemes without such a joint design.Comment: 8 pages, 4 figure

Computing and relaying : utilizing mobile edge computing for P2P communications

Besides increasing the computing capacity of edge devices, mobile edge computing (MEC) can also be utilized to help communication. This paper proposes an MEC-assisted computing and relaying scheme to enhance the throughput of uncompressed data for mobile peer-to-peer (P2P) communications. We assume that the target data has a dynamic compression rate during the transmission from one mobile device to another through a relay node with MEC. In order to obtain the optimal transmission and compression strategy for the mobile devices and the relay node, a cost function that defines the tradeoff between energy consumption and latency time is investigated first. Then a closedform solution is derived by minimizing the cost function with respect to practical constraints. Compared with conventional P2P communications without MEC, the proposed model breaks the bottleneck of P2P communications by decoupling the data compression rates at the two sides of MEC server. Numerical results verify the effectiveness of the proposed scheme

Morphological Computation: Nothing but Physical Computation

The purpose of this paper is to argue against the claim that morphological computation is substantially different from other kinds of physical computation. I show that some (but not all) purported cases of morphological computation do not count as specifically computational, and that those that do are solely physical computational systems. These latter cases are not, however, specific enough: all computational systems, not only morphological ones, may (and sometimes should) be studied in various ways, including their energy efficiency, cost, reliability, and durability. Second, I critically analyze the notion of “offloading” computation to the morphology of an agent or robot, by showing that, literally, computation is sometimes not offloaded but simply avoided. Third, I point out that while the morphology of any agent is indicative of the environment that it is adapted to, or informative about that environment, it does not follow that every agent has access to its morphology as the model of its environment