Scheduling in omnidirectional relay wireless networks
The capacity of multiuser wireless network, including the achievable rate region and the converse part, has always been a hot research topic.
This thesis mainly works on the achievable region of the all-source all-cast problem 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.