TY - JOUR
T1 - Distributed protocols for interference management in cooperative networks
AU - Hunter, Christopher
AU - Sabharwal, Ashutosh
N1 - Funding Information:
Manuscript received 20 January 2011; revised 20 June 2011. This work was partially funded by NSF grants CNS-0551692, CNS-0619767, CNS-0923479 and CNS-1012921. C. Hunter and A. Sabharwal are with the Department of Electrical and Computer Engineering, Rice University, Houston, TX, 77005 USA (e-mail: {chunter,ashu}@rice.edu). Digital Object Identifier 10.1109/JSAC.2012.121006.
PY - 2012
Y1 - 2012
N2 - In scenarios where devices are too small to support MIMO antenna arrays, symbol-level cooperation may be used to pool the resources of distributed single-antenna devices to create a virtual MIMO antenna array. We address design fundamentals for distributed cooperative protocols where relays have an incomplete view of network information. A key issue in distributed networks is potential loss in spatial reuse due to the increased radio footprint of flows with cooperative relays. Hence, local gains from cooperation have to balance against network level losses. By using a novel binary network model that simplifies the space over which cooperative protocols must be designed, we develop a mechanism for the systematic and computational development of cooperative protocols as functions of the amount of network state information available at relay nodes. Through extensive network analysis and simulations, we demonstrate the successful application of this method to a series of protocols that span a range of network information availability at cooperative relays.
AB - In scenarios where devices are too small to support MIMO antenna arrays, symbol-level cooperation may be used to pool the resources of distributed single-antenna devices to create a virtual MIMO antenna array. We address design fundamentals for distributed cooperative protocols where relays have an incomplete view of network information. A key issue in distributed networks is potential loss in spatial reuse due to the increased radio footprint of flows with cooperative relays. Hence, local gains from cooperation have to balance against network level losses. By using a novel binary network model that simplifies the space over which cooperative protocols must be designed, we develop a mechanism for the systematic and computational development of cooperative protocols as functions of the amount of network state information available at relay nodes. Through extensive network analysis and simulations, we demonstrate the successful application of this method to a series of protocols that span a range of network information availability at cooperative relays.
KW - Cooperative communications
KW - distributed protocols
KW - network state information
KW - spatial reuse
UR - http://www.scopus.com/inward/record.url?scp=84866905748&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84866905748&partnerID=8YFLogxK
U2 - 10.1109/JSAC.2012.121006
DO - 10.1109/JSAC.2012.121006
M3 - Article
AN - SCOPUS:84866905748
SN - 0733-8716
VL - 30
SP - 1633
EP - 1640
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 9
M1 - 6311220
ER -