Wireless peer-to-peer mutual broadcast via sparse recovery

Abstract

This paper studies a problem frequently seen in wireless networks: Every node wishes to broadcast information to nodes within a single hop, which are referred to as its peers. We call this problem mutual broadcast. A novel solution is proposed, which exploits the multiaccess nature of the wireless medium and addresses the half-duplex constraint at the fundamental level. The defining feature of the scheme is to let all nodes send their messages at the same time, where each node broadcasts a codeword (selected from its unique codebook) consisting of onslots and off-slots, where it transmits only during its on-slots, and listens to its peers through its own off-slots. Decoding can be viewed as a problem of sparse support recovery based on linear measurements. In case each message consists of a small number of bits, an iterative message-passing algorithm based on belief propagation is developed, the performance of which is characterized using a state evolution formula in the limit where each node has a large number of peers. Numerical results demonstrate that, to achieve the same reliability for mutual broadcast, the proposed scheme achieves three to five times the rate of ALOHA and carrier-sensing multiple-access (CSMA) in typical scenarios.

Combinatorial channel signature modulation for wireless ad-hoc networks

“…The CCSM method is inspired by a cross-layer scheme for wireless peer-to-peer mutual broadcast considered by Zhang and Guo in [1]. In this paper each node is assigned a codebook of on-off signalling codewords, such that every possible message corresponds to a single codeword.…”

“…Moreover, in CCSM additional information can be encoded in the choice of the weights assigned to a particular combination of the codeword span. In addition, the scheme of [1] cannot cope with time dispersive environments. Our scheme, in contrast, thrives on dispersive nature of wireless systems, by adapting the sparse recovery problem to the channel signatures.…”

Choir codes: Coding for full duplex interference management

“…By switching radios between transmitting and receiving on user specific intervals, nodes could simultaneously recover data from neighbors while transmitting data themselves. This was further developed in [4] and [5]. It is upon the scheme in [3]- [5] which the work in this paper is based.…”

“…This was further developed in [4] and [5]. It is upon the scheme in [3]- [5] which the work in this paper is based. In this paper, we consider a code design for the virtual full-duplex framework of [4] for random access wireless networks.…”

“…In [4] and [5], randomly generated codewords, defining both the receive periods and transmitted symbols, were considered. It was proved that, using a group testing or messagepassing algorithm with the random codewords, data from transmitting nodes can be recovered with high probability.…”