The capacity region of two-way collision networks

Kenneth W. Shum; Chi Wan Sung

doi:10.1109/NETCOD.2008.4476180

The capacity region of two-way collision networks

Department of Electrical Engineering

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

The collision channel without feed-back is a system with multiple source nodes and a single destination node, where coordination among the source nodes and feedback from the destination node are not available. Its capacity region was first derived by Massey and Mathys. We generalize their model by introducing multiple destination nodes and relay nodes. In this paper, we consider linear collision networks in which the nodes lie on a straight line. The two nodes at the ends want to exchange data through the relay nodes in the middle. An outer bound on achievable rates is derived. By using a simple network code, we can show that all points within the outer bound are indeed achievable, and thus obtain the capacity region. © 2008 IEEE.

Original language	English
Title of host publication	Proceedings - 2008 4th Workshop on Network Coding, Theory, and Applications, NetCod 2008
DOIs	https://doi.org/10.1109/NETCOD.2008.4476180
Publication status	Published - 2008
Event	2008 4th Workshop on Network Coding, Theory, and Applications, NetCod 2008 - Hong Kong, Hong Kong, China Duration: 3 Jan 2008 → 4 Jan 2008

Conference

Conference	2008 4th Workshop on Network Coding, Theory, and Applications, NetCod 2008
Place	Hong Kong, China
City	Hong Kong
Period	3/01/08 → 4/01/08

Access Output

10.1109/NETCOD.2008.4476180

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{3c27fc6d03a9437a9a025eae49ed0a88,

title = "The capacity region of two-way collision networks",

abstract = "The collision channel without feed-back is a system with multiple source nodes and a single destination node, where coordination among the source nodes and feedback from the destination node are not available. Its capacity region was first derived by Massey and Mathys. We generalize their model by introducing multiple destination nodes and relay nodes. In this paper, we consider linear collision networks in which the nodes lie on a straight line. The two nodes at the ends want to exchange data through the relay nodes in the middle. An outer bound on achievable rates is derived. By using a simple network code, we can show that all points within the outer bound are indeed achievable, and thus obtain the capacity region. {\textcopyright} 2008 IEEE.",

author = "Shum, {Kenneth W.} and Sung, {Chi Wan}",

year = "2008",

doi = "10.1109/NETCOD.2008.4476180",

language = "English",

isbn = "9781424416899",

booktitle = "Proceedings - 2008 4th Workshop on Network Coding, Theory, and Applications, NetCod 2008",

note = "2008 4th Workshop on Network Coding, Theory, and Applications, NetCod 2008 ; Conference date: 03-01-2008 Through 04-01-2008",

}

TY - GEN

T1 - The capacity region of two-way collision networks

AU - Shum, Kenneth W.

AU - Sung, Chi Wan

PY - 2008

Y1 - 2008

N2 - The collision channel without feed-back is a system with multiple source nodes and a single destination node, where coordination among the source nodes and feedback from the destination node are not available. Its capacity region was first derived by Massey and Mathys. We generalize their model by introducing multiple destination nodes and relay nodes. In this paper, we consider linear collision networks in which the nodes lie on a straight line. The two nodes at the ends want to exchange data through the relay nodes in the middle. An outer bound on achievable rates is derived. By using a simple network code, we can show that all points within the outer bound are indeed achievable, and thus obtain the capacity region. © 2008 IEEE.

AB - The collision channel without feed-back is a system with multiple source nodes and a single destination node, where coordination among the source nodes and feedback from the destination node are not available. Its capacity region was first derived by Massey and Mathys. We generalize their model by introducing multiple destination nodes and relay nodes. In this paper, we consider linear collision networks in which the nodes lie on a straight line. The two nodes at the ends want to exchange data through the relay nodes in the middle. An outer bound on achievable rates is derived. By using a simple network code, we can show that all points within the outer bound are indeed achievable, and thus obtain the capacity region. © 2008 IEEE.

UR - http://www.scopus.com/inward/record.url?scp=49749148109&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-49749148109&origin=recordpage

U2 - 10.1109/NETCOD.2008.4476180

DO - 10.1109/NETCOD.2008.4476180

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781424416899

BT - Proceedings - 2008 4th Workshop on Network Coding, Theory, and Applications, NetCod 2008

T2 - 2008 4th Workshop on Network Coding, Theory, and Applications, NetCod 2008

Y2 - 3 January 2008 through 4 January 2008

ER -

The capacity region of two-way collision networks

Abstract

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this