2011 Proceedings IEEE INFOCOM 2011
DOI: 10.1109/infcom.2011.5934994
|View full text |Cite
|
Sign up to set email alerts
|

An optimal link layer model for multi-hop MIMO networks

Abstract: The rapid advances of MIMO to date have mainly stayed at the physical layer. Such fruits have not been fully benefited at the network layer mainly due to the computational complexity associated with the matrix-based model that MIMO involves. Recently, there are some efforts to simplify link layer model for MIMO so as to ease research for the upper layers. These models only require numeric computations on MIMO's degrees-of-freedom (DoFs) for spatial multiplexing (SM) and interference cancellation (IC) to obtain… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
53
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 26 publications
(53 citation statements)
references
References 21 publications
0
53
0
Order By: Relevance
“…Further, we employ DoF to represent MIMO resources at a node. A detailed discussion of DoF allocation for spatial multiplexing and interference cancellation is given in [19]. Simply put, when there is no interference, we need to allocate DoFs at both transmitter Tx( ) and receiver Rx( ) to achieve data streams on link .…”
Section: B Mathematical Modelingmentioning
confidence: 99%
“…Further, we employ DoF to represent MIMO resources at a node. A detailed discussion of DoF allocation for spatial multiplexing and interference cancellation is given in [19]. Simply put, when there is no interference, we need to allocate DoFs at both transmitter Tx( ) and receiver Rx( ) to achieve data streams on link .…”
Section: B Mathematical Modelingmentioning
confidence: 99%
“…Now we have all the constraints needed in an optimization framework for a multi-hop network, which include scheduling constraints (14), (26), joint PHY-Link constraints (21), (22), (23), (24), (25), and flow routing constraints (8), (9), (11). We summarize them in Fig.…”
Section: Discussionmentioning
confidence: 99%
“…Both were proposed to resolve packet collisions, and they require that some bits in one of the collision packets be known in advance. SIC also differs from smart antenna-based interference cancellation schemes, such as Zero-Forcing Beam Forming (ZFBF) [2], [23], [31] in MIMO 1 and directional antennas [14], [19], [24]. Very recently, there is a growing interest to exploit SIC at the physical layer to improve performance of upper layers in a wireless network [3], [7], [9], [15], [16], [30].…”
Section: Related Workmentioning
confidence: 99%
“…both r [k] and t [l] include this interference in the computation of their weights. With this modification, we can use (8) and (9) to compute the MMSE combining weights at r [k] in the context of bilateral interference cancellation.…”
Section: B Minimum Mean-squared-error Combining For Unilateral and Bmentioning
confidence: 99%
“…Many existing strategies for managing interference in a network of MIMO links adopt a unilateral approach. Examples of unilateral strategies include the SRP/SRMP-CiM [4], SPACE-MAC [5], CAS [6], OBIC [7,8], ExtendedGreedy [9], OSTM [10], and CLOM [11].…”
Section: Introductionmentioning
confidence: 99%