DeepAI AI Chat
Log In Sign Up

Robot Subset Selection for Swarm Lifetime Maximization in Computation Offloading with Correlated Data Sources

by   Siqi Zhang, et al.

Consider robot swarm wireless networks where mobile robots offload their computing tasks to a computing server located at the mobile edge. Our aim is to maximize the swarm lifetime through efficient exploitation of the correlation between distributed data sources. The optimization problem is handled by selecting appropriate robot subsets to send their sensed data to the server. In this work, the data correlation between distributed robot subsets is modelled as an undirected graph. A least-degree iterative partitioning (LDIP) algorithm is proposed to partition the graph into a set of subgraphs. Each subgraph has at least one vertex (i.e., subset), termed representative vertex (R-Vertex), which shares edges with and only with all other vertices within the subgraph; only R-Vertices are selected for data transmissions. When the number of subgraphs is maximized, the proposed subset selection approach is shown to be optimum in the AWGN channel. For independent fading channels, the max-min principle can be incorporated into the proposed approach to achieve the best performance.


Optimal Impartial Correspondences

We study mechanisms that select a subset of the vertex set of a directed...

Min-cost-flow preserving bijection between subgraphs and orientations

Consider an undirected graph G=(V,E). A subgraph of G is a subset of its...

Absolute Expressiveness of Subgraph Motif Centrality Measures

In graph-based applications, a common task is to pinpoint the most impor...

Hierarchical b-Matching

A matching of a graph is a subset of edges no two of which share a commo...

Vertex arboricity of cographs

Arboricity is a graph parameter akin to chromatic number, in that it see...

Graph-based Cooperative Caching in Fog-RAN

In this paper, the cooperative caching problem in fog radio access netwo...