Paper Info
Title
Achievable DF rate for cascaded undirected wireless networks with TDD and hidden-terminal
Abstract
This paper investigates general Z-hop cascaded undirected wireless relay network, where the source, the relays, and the destination form an undirected chain, and each node receives radio waves from its two neighboring upstream and downstream nodes in the chain. We focus on the effect of time-division duplex and hidden-terminal constraints from two aspects: 1) finding all feasible network states (FNS) and determining the amount; 2) scheduling among FNS to maximize the transmission rate of the whole network when the decode-and-forward (DF) relay strategy is used. Firstly we define a new S sequence, which is proved to exactly characterize the number of all FNS. We provide a simple recursive construction method to get all FNS and discuss its properties. Then we formulate the scheduling problem into linear program which can be efficiently solved, and find the maximum achievable DF rate is: r* = min {1/1/cj-1 + 1/cj + 1/cj+1 | ∀j =2, 3, ..., K - 1}, where Ck, ∀k = 1, 2, ..., K, denote thecapacity of component hops.
Year
DOI
Venue
2014
10.1109/ICCChina.2014.7008372
Communications in China
Keywords
Field
DocType
cascade networks,decode and forward communication,radiowaves,relay networks (telecommunication),scheduling,time division multiplexing,df rate,df relay strategy,fns,tdd,z-hop cascaded undirected wireless relay network,component hops,decode-and-forward relay strategy,feasible network states,hidden-terminal constraints,radio waves,recursive construction method,time-division duplex,transmission rate,cascaded undirected networks,decode-and-forward,hidden-terminal,wireless communication,vectors,mathematical model
Wireless network,Wireless,Job shop scheduling,Radio wave,Computer science,Scheduling (computing),Computer network,Linear programming,Relay,Recursion
Conference
Citations 
PageRank 
References 
3
0.46
7
Authors
2
Name
Order
Citations
PageRank
Feng Liu196.42
Liansun Zeng282.69