Please use this identifier to cite or link to this item:
|Title:||Optimal routing for decode-forward in cooperative wireless networks|
|Citation:||Ong, L., Motani, M. (2010-08). Optimal routing for decode-forward in cooperative wireless networks. IEEE Transactions on Communications 58 (8) : 2345-2355. ScholarBank@NUS Repository. https://doi.org/10.1109/TCOMM.2010.08.090134|
|Abstract:||We investigate routing in cooperative multiple-terminal wireless networks in which the nodes can collaborate with each other in data transmission. First, we motivate cooperation by showing that decode-forward, an information-theoretic cooperative coding strategy, achieves rates significantly higher than those achievable by the conventional multi-hop routing, a point-to-point non-cooperative coding strategy. We then construct an algorithm to find optimal (rate-maximizing) routes for decode-forward. We show that the algorithm is able to find shortest optimal routes and is optimal in fading channels. However, the algorithm runs in factorial time in the worst case. So, we propose a near-optimal heuristic algorithm that runs in polynomial time. The heuristic algorithm always outputs optimal routes when the nodes transmit independent codewords, and outputs optimal routes with high probability when the nodes transmit arbitrarily correlated codewords. Lastly, we implement decode-forward using low-density parity-check codes to compare the bit error rate performance of different routes. © 2010 IEEE.|
|Source Title:||IEEE Transactions on Communications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 18, 2018
WEB OF SCIENCETM
checked on Oct 10, 2018
checked on Oct 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.