Research Article
Error performance bounds for routing algorithms in wireless cooperative networks
@INPROCEEDINGS{10.4108/chinacom.2010.134, author={Zhengguo Sheng and Zhiguo Ding and Kin K Leung}, title={Error performance bounds for routing algorithms in wireless cooperative networks}, proceedings={5th International ICST Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2011}, month={1}, keywords={Diversity methods Diversity reception Fading Relays Routing Signal to noise ratio Simulation}, doi={10.4108/chinacom.2010.134} }- Zhengguo Sheng
Zhiguo Ding
Kin K Leung
Year: 2011
Error performance bounds for routing algorithms in wireless cooperative networks
CHINACOM
ICST
DOI: 10.4108/chinacom.2010.134
Abstract
Cooperative diversity has emerged as a promising approach to improving reception reliability by realizing spatial diversity gains for nodes with single antenna. We consider here cooperative ad-hoc wireless networks where communications between two nodes can be assisted by a single relay using two time slots. This paper continues our investigation of PHY techniques and cross-layer routing algorithms in such networks. Specifically, we investigate here the optimal relay location for cooperative link in networks with infinite node density. By using this result, we analyze the error performance bound for routing algorithms in infinitely dense networks. Furthermore, we study the performance bounds for regularly dense networks with linear topology. Theoretical analysis shows that the proposed routing algorithm performs close to the optimal error performance.
