.png){kind=icon}
.png){kind=icon}
Return
Coded Distributed Computing Over Unreliable and Insecure D2D Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2023.3345421.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the development of wireless computing devices, extending distributed computing to wireless networks deserves a closer look. This paper considers distributed computing over unreliable and insecure device-to-device (D2D) networks, in which each device is not always available to perform computation. The process of distributed devices exchanging calculated results with each other is vulnerable to eavesdropping in wireless environments. To handle the unreliable devices, we adopt repetition codes to build a novel system that supports general computations, called rho-replication system, where each device has rho -1 replicas with duplicate data. A coded computation scheme for the $\rho $ -replication system is proposed, which not only achieves the minimum communication load of the system but also ensures weak security of wireless transmissions during data exchange. Furthermore, the replication nature of the system can be exploited for beamforming transmissions, naturally leading to the idea of energy optimization. Simulation results show that increasing rho does not necessarily improve energy efficiency, as the benefit of increased beamforming gain may be outweighed by the drawback of heavier communication load.
Keywords:
Distributed computing
Wireless communication
Array signal processing
Task analysis
Security
Communication system security
Encoding
Coded distributed computing
D2D networks
computation replication
weak security
computation-communication tradeoff
energy efficiency
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W