Scheduling in omnidirectional relay wireless networks

The capacity of multiuser wireless network, unclear for many years, has always been a hot research topic. Many different operation schemes and coding techniques have been proposed to enlarge the achievable rate region. And omnidirectional relay scheme is one of them. This thesis mainly works on the achievable region of the all-source all-cast network with omnidirectional relay scheme. In order to better understand this problem, we first describe the half-duplex model on the one-dimensional and two-dimensional regular networks. And we present an optimal operation scheme for them to have the maximum achievable rate. For the one-dimensional general network, we proposed an achievable region that indicates valued improvement compared to the previous results. In the full-duplex model of the one-dimensional general network, the maximum achievable rate is presented with a simpler proof in comparison with the previous results. In this thesis, we also show some discussions on more general networks

Omnidirectional relay in wireless networks

Abstract — For wireless networks with multiple sources, an omnidirectional relay scheme is developed, where each node can help relay multiple sources in different directions. This is accomplished by the decode-and-forward relay strategy, with each relay binning the multiple messages to be transmitted, in the same spirit of network coding. Specially for the allsource all-cast problem, where each node is an independent source to be transmitted to all the other nodes, this scheme completely eliminates interference in the whole network, and the signal transmitted by any node is used by any other node. For networks with regular topologies, assuming no beamforming is to be performed, this omnidirectional scheme is capable of achieving the maximum achievable rate. I