Decentralized Compute-and-Forward for Ad Hoc Networks
Journal article, 2016

In this letter, we introduce a decentralized compute-and-forward (DCMF) protocol to solve the rank failure problem in compute-and-forward (CMF) ad hoc multi-user multi-relay networks without a central coordinator. In sufficiently strong inter-relay links, we show that the DCMF scheme can reach the same achievable rate as in the successive centralized CMF (SCCMF), which is a modified version of the previously introduced centralized CMF in using our proposed successive method for a fair comparison. We evaluate the outage probability and rate of the proposed strategy, and compare the results with those of the conventional CMF and decode-and-forward, and the SCCMF.

Decentralized

Computer Science

compute-and-forward

successive computation

rank failure

ad hoc cooperative

Engineering

Telecommunications

Author

Seyed Mohammad Azimi-Abarghouyi

Sharif University of Technology

Mohsen Hejazi

Sharif University of Technology

Behrooz Makki

Chalmers, Signals and Systems, Kommunikationssystem, informationsteori och antenner, Communication Systems

Masoumeh Nasiri-Kenari

Sharif University of Technology

Tommy Svensson

Chalmers, Signals and Systems, Kommunikationssystem, informationsteori och antenner, Communication Systems

IEEE Wireless Communications Letters

2162-2337 (ISSN)

Vol. 5 6 652-655

Areas of Advance

Energy

Roots

Basic sciences

Subject Categories

Electrical Engineering, Electronic Engineering, Information Engineering

DOI

10.1109/lwc.2016.2612185

More information

Created

10/8/2017