Combinatorial Channel Signature Modulation for Wireless ad-hoc Networks

TL;DR

This paper introduces Combinatorial Channel Signature Modulation (CCSM), a novel, efficient multiplexing method for wireless ad-hoc networks that enables simultaneous full-duplex communication with minimal overhead, leveraging sparse modeling and compressive sampling.

Contribution

The paper presents CCSM, a new modulation technique for ad-hoc networks that significantly improves throughput using sparse modeling and a novel Group Subspace Pursuit algorithm.

Findings

CCSM doubles the throughput compared to existing methods.

CCSM operates efficiently in highly dispersive environments.

The Group Subspace Pursuit algorithm reduces decoding complexity.

Abstract

In this paper we introduce a novel modulation and multiplexing method which facilitates highly efficient and simultaneous communication between multiple terminals in wireless ad-hoc networks. We term this method Combinatorial Channel Signature Modulation (CCSM). The CCSM method is particularly efficient in situations where communicating nodes operate in highly time dispersive environments. This is all achieved with a minimal MAC layer overhead, since all users are allowed to transmit and receive at the same time/frequency (full simultaneous duplex). The CCSM method has its roots in sparse modelling and the receiver is based on compressive sampling techniques. Towards this end, we develop a new low complexity algorithm termed Group Subspace Pursuit. Our analysis suggests that CCSM at least doubles the throughput when compared to the state-of-the art.