|
ABSTRACT
There has been a great deal of attention on cooperative communication which exploits the spatial diversity among antennas belonging to multiple terminals. Most of the existing work focuses on the physical layer and shows how message relaying can improve the Shannon capacity region, outage probability, diversity order, etc. But it is possible to use relays in simple, innovative ways that depend on the protocol properties at the medium access control (MAC) and network layers. In this paper we build upon prior work on such relay use by considering sets of nodes in simple topology configurations in which reaching a common destination is accomplished through direct links as well as relayed transmissions. Each non-destination node generates its own traffic for the destination but the nodes that are closer to the destination have the capability and option to relay packets from nodes farther afield. Channel quality is modeled by a reception probability which injects the physical layer property into upper layer design and analysis. We consider bursty arrival processes and we characterize the stable throughput region and delay performance at each node. We show that a proposed cooperation strategy can lead to improved performance for both work-conserving and Time Division Multiple Access (TDMA) MAC protocols. The innovative elements in this work are the balance between own and relayed traffic at each node and the fact that the performance improvement is in part due to the concentration of the queues of failed packets into fewer virtual queues.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
I. Telatar, "Capacity of multi-antenna Gaussian channels", Eur. Trans. Telecommun., vol. 10, no. 6, pp. 585--595, Nov./Dec. 1999.
|
| |
3
|
J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks", In Proc. IEEE INFOCOM, pp. 586--594, Tel Aviv, Israel, Mar. 2000.
|
| |
4
|
A. Sendonaris, E. Erkip, and B. Aazhang, "User cooperation diversity-Part I: System description", IEEE Trans. Commun., vol. 51, pp. 1927--1938, Nov. 2003.
|
| |
5
|
A. Sendonaris, E. Erkip, and B. Aazhang, "User cooperation diversity-Part II: Implementation aspects and performance analysis", IEEE Trans. Commun., vol. 51, pp. 1939--1948, Nov. 2003.
|
| |
6
|
J. N. Laneman, D. N. C. Tse, and G. W. Wornell, "Cooperative diversity in wireless networks: efficient protocols and outage behavior", IEEE Trans. Inform. Theory, vol. 50, pp. 3062--3080, Dec. 2004.
|
| |
7
|
M. Janani, A. Hedayat, T. E. Hunter, and A. Nosratinia, "Coded cooperation in wireless communications: space-time transmission and iterative decoding", IEEE Trans. Signal Processing, vol. 52, no. 2, pp. 362--371, Feb. 2004.
|
| |
8
|
G. Kramer, M. Gastpar, and P. Gupta, "Cooperative strategies and capacity theorems for relay networks", IEEE Trans. Inform. Theory, vol. 51, no. 9, pp. 3037--3063, Sep. 2005.
|
| |
9
|
A. K. Sadek, K. J. R. Liu, and A. Ephremides, "Cognitive multiple access via cooperation: protocol design and performance analysis", IEEE Trans. Inform. Theory, vol. 53, no. 10, pp. 3677--3696, Oct. 2007.
|
| |
10
|
R. Rao and A. Ephremides, "On the stability of interacting queues in a multiple-access system", IEEE Trans. Inform. Theory, vol. 34, no. 5, pp. 918--930, Sep. 1988.
|
| |
11
|
W. Szpankowski, "Stability conditions for some distributed systems: Buffered random access systems", Adv. Appl. Probab., vol. 26, pp. 498--515, 1994.
|
| |
12
|
M. Sidi and A. Segall, "Two interfering queues in packet-radio networks", IEEE Trans. Commun., vol. COM-31, no. 1, pp. 123--129, Jan. 1983.
|
|