Abstract

A modulation and multiplexing method which facilitates highly efficient and simultaneous communication between multiple terminals in wireless ad-hoc networks is presented. This method is termed Combinatorial Channel Signature Modulation (CCSM), and has its roots in sparse recovery and compressive sampling techniques, utilizing an efficient greedy algorithm for solving the underlying sparse recovery problem. CCSM is inherently robust to situations where communicating nodes operate in highly time dispersive environments. In addition, the scheme exhibits a minimal MAC layer overhead, since all users are allowed to transmit and receive at the same time/frequency (full simultaneous duplex). It is demonstrated that CCSM at least doubles the throughput when compared to the state-of-the art methods based on collision avoidance.

Dino Sejdinovic has been a postdoctoral fellow in machine learning at the Gatsby Computational Neuroscience Unit, University College London since 2011. Between 2009 and 2011, he was a Brunel postdoctoral fellow at the Statistics Group of the Department of Mathematics, University of Bristol. He received a PhD in Electrical and Electronic Engineering at the Centre for Communications Research, University of Bristol in 2009, in a project sponsored by Toshiba Research Europe Ltd, and a Dipl.Math.-Inf. degree in mathematics and theoretical computer science from the University of Sarajevo, Bosnia and Herzegovina in 2006.