Coding theory for noiseless channels realized by anonymous oblivious mobile robots

by   Yukiko Yamauchi, et al.

We propose an information transmission scheme by a swarm of anonymous oblivious mobile robots on a graph. The swarm of robots travel from a sender vertex to a receiver vertex to transmit a symbol generated at the sender. The codeword for a symbol is a pair of an initial configuration at the sender and a set of terminal configurations at the receiver. The set of such codewords forms a code. We analyze the performance of the proposed scheme in terms of its code size and transmission delay. We first demonstrate that a lower bound of the transmission delay depends on the size of the swarm, and the code size is upper bounded by an exponent of the size of the swarm. We then give two algorithms for a swarm of a fixed size. The first algorithm realizes a near optimal code size with a large transmission delay. The second algorithm realizes an optimal transmission delay with a smaller code size. We then consider information transmission by swarms of different sizes and present upper bounds of the expected swarm size by the two algorithms. We also present lower bounds by Shannon's lemma and noiseless coding theorem.


page 9

page 10


Event-triggered stabilization of disturbed linear systems over digital channels

We present an event-triggered control strategy for stabilizing a scalar,...

Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots

We investigate a swarm of autonomous mobile robots in the Euclidean plan...

Linear Codes for Broadcasting with Noisy Side Information

We consider network coding for a noiseless broadcast channel where each ...

Swarm Bug Algorithms for Path Generation in Unknown Environments

In this paper, we consider the problem of a swarm traveling between two ...

Timeliness in Lossless Block Coding

We examine lossless data compression from an average delay perspective. ...

Breaking the Bound: Rate-2, Full Diversity, Orthogonal MIMO-STBC Transceiver Design

Space Time Block Codes (STBCs) from orthogonal designs have attracted si...

Exploiting Parallelism in Optical Network Systems: A Case Study of Random Linear Network Coding (RLNC) in Ethernet-over-Optical Networks

As parallelism becomes critically important in the semiconductor technol...

Please sign up or login with your details

Forgot password? Click here to reset