Error performance bounds for routing algorithms in wireless cooperative networks

Zhengguo Sheng, Zhiguo Ding, Kin K. Leung

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageBritish English
Title of host publication2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010
PublisherIEEE Computer Society
ISBN (Print)9780984589333
DOIs
StatePublished - 2010

Publication series

Name2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010

Fingerprint

Dive into the research topics of 'Error performance bounds for routing algorithms in wireless cooperative networks'. Together they form a unique fingerprint.

Cite this