Robust Communication via Decentralized Processing With Unreliable Backhaul Links

被引：21

作者：

Simeone, Osvaldo ^{[1
]}

Somekh, Oren ^{[2
]}

Erkip, Elza ^{[3
]}

Poor, H. Vincent ^{[2
]}

Shamai , Shlomo ^{[4
]}

机构：

[1] New Jersey Inst Technol, CWCSPR, Newark, NJ 07102 USA

[2] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA

[3] Polytech Inst New York Univ, Dept ECE, Brooklyn, NY 11201 USA

[4] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2011年 / 57卷 / 07期

基金：

美国国家科学基金会; 以色列科学基金会;

关键词：

Broadcast coding; distributed source coding; erasure channel; relay channel; robust channel coding; SYMMETRIC MULTIPLE DESCRIPTIONS; BROADCAST; DISTORTION;

D O I：

10.1109/TIT.2011.2145830

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A source communicates with a remote destination via a number of distributed relays. Communication from source to relays takes place over a (discrete or Gaussian) broadcast channel, while the relays are connected to the receiver via orthogonal finite-capacity links. Unbeknownst to the source and relays, link failures may occur between any subset of relays and the destination in a nonergodic fashion. Upper and lower bounds are derived on average achievable rates with respect to the prior distribution of the link failures, assuming the relays to be oblivious to the source code-book. The lower bounds are obtained by proposing strategies that combine the broadcast coding approach, previously investigated for quasi-static fading channels, and different robust distributed compression techniques. Numerical results show that lower and upper bounds are quite close over most operating regimes, and provide insight into optimal transmission design choices for the scenario at hand. Extension to the case of nonoblivious relays is also discussed.

引用

页码：4187 / 4201

页数：15

共 50 条

[21] Decentralized binary detection with noisy communication links
Ferrari, Gianluigi
Pagliari, Roberto
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2006, 42 (04) : 1554 - 1563
[22] Multi-Server Secure Aggregation with Unreliable Communication Links
Liang, Kai
Li, Songze
Ding, Ming
Wu, Youlong
IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 2560 - 2565
[23] Design of a Wireless Control System With Unreliable Nodes and Communication Links
Al-Dabbagh, Ahmad W.
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (01) : 315 - 327
[24] CAPACITY ASSIGNMENT IN COMPUTER-COMMUNICATION NETWORKS WITH UNRELIABLE LINKS
SAHA, D
MUKHERJEE, A
DUTTA, SK
COMPUTER COMMUNICATIONS, 1994, 17 (12) : 871 - 875
[25] Optimal control of LTI systems over unreliable communication links
Imer, Orhan C.
Yueksel, Serdar
Basar, Tamer
AUTOMATICA, 2006, 42 (09) : 1429 - 1439
[26] RFL: Robust fault localization on unreliable communication channels
Wu, Bo
Xu, Ke
Li, Qi
Liu, Bingyang
Ren, Shoushou
Yang, Fan
Shen, Meng
Ren, Kui
COMPUTER NETWORKS, 2019, 158 : 158 - 174
[27] ON THE EXISTENCE AND CONSTRUCTION OF ROBUST COMMUNICATION PROTOCOLS FOR UNRELIABLE CHANNELS
DEBRAY, SK
FRANK, AJ
SMOLKA, SA
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 181 : 136 - 151
[28] Decentralized detection in sensor networks with noisy communication links
Ferrari, Gianluigi
Pagliari, Roberto
DISTRIBUTED COOPERATIVE LABORATORIES: NETWORKING, INSTRUMENTATION, AND MEASUREMENTS, 2006, : 233 - +
[29] Stabilization of a networked control system under bounded disturbances with unreliable communication links via common Lyapunov function
Ohori, Akihiro
Kogiso, Kiminao
Sugimoto, Kenji
PROCEEDINGS OF SICE ANNUAL CONFERENCE, VOLS 1-8, 2007, : 1893 - 1898
[30] Error Probability Bounds for Binary Relay Trees with Unreliable Communication Links
Zhang, Zhenliang
Pezeshki, Ali
Moran, William
Howard, Stephen D.
Chong, Edwin K. P.
2011 CONFERENCE RECORD OF THE FORTY-FIFTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS (ASILOMAR), 2011, : 1869 - 1873

← 1 2 3 4 5 →