Paper Info
Title
On The Degrees Of Freedom For Multi-Hop Wireless Networks Under Layered Tdd Constraint
Abstract
Degrees of freedom (DoF) of a network build a new scaling law characterizing the scalability of capacity at high signal-to-noise region. In this paper, we extend our recent work from cascaded network to the general K-hop layered network. The main framework is based on the assumption of layered TDD, where all nodes at each layer work with the same on/off status. By this approach we decompose the DoF analysis into two steps: 1) apply the result of cascaded networks; 2) analyze / design the transmission of each hop. The upper and lower bounds on DoF are deduced. By viewing the network as cascaded X channels, we find an inner bound of the DoF region, applicable to many message topologies. The detail of message splitting is demonstrated. Finally ultimate analysis shows if the number of antennas/nodes at each relay layer goes to infinity, the lower bound reaches the upper bound. As a by-product, when K > 2 the network can alleviate the effect of TDD with the increase of relay antennas/nodes.
Year
DOI
Venue
2014
10.4108/sis.1.3.e4
EAI ENDORSED TRANSACTIONS ON SCALABLE INFORMATION SYSTEMS
Keywords
DocType
Volume
Multi-hop networks, degree of freedom (DoF), layered TDD, decode-and-forward, Fibonacci
Journal
1
Issue
ISSN
Citations 
3
2032-9407
0
PageRank 
References 
Authors
0.34
20
3
Name
Order
Citations
PageRank
Feng Liu196.42
Xiaofeng Wang200.34
Liansun Zeng382.69