Degrees of freedom of sparsely connected wireless networks

We investigate how the network connectivity can affect the degrees of freedom (DoF) of wireless networks. We consider a network of n source-destination (SD) pairs and assume that any two nodes are connected with a positive probability p, independent of other node pairs. We show that, for any arbitrarily small p, a constant DoF is achievable for every SD pair with probability approaching one as n tends to infinity. The achievability is based on the two-hop transmission with decode-and-forward relaying and over each-hop we adopt interference alignment. Considering that an achievable per-user DoF for direct or one-hop transmission can be arbitrarily small as the connectivity probability p decreases, our result shows that, somewhat surprisingly, two-hop transmission is enough to guarantee non-vanishing per-user DoF for any p showing that sparsely connected networks can still provide non-vanishing per-user DoF.


Published in:
2012 IEEE International Symposium on Information Theory Proceedings, 1528-1532
Presented at:
2012 IEEE International Symposium on Information Theory - ISIT, Cambridge, MA, USA, 1-6 07 2012
Year:
2012
Publisher:
New York, IEEE
ISBN:
978-1-4673-2579-0
Laboratories:




 Record created 2012-08-02, last modified 2018-09-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)