Non-random wireless network coding

Ketan Rajawat; Georgios B. Giannakis

doi:10.1109/SAHCNW.2009.5172949

Non-random wireless network coding

Ketan Rajawat, Georgios B. Giannakis

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

Network coding (NC) has been shown to improve throughput, minimize delay and economize the energy requirements in wireless networks. This paper develops a non-random approach to wireless linear NC problem. The proposed approach works by "time-unwrapping" a wireless node to develop a wiredequivalent model that helps solve for the wireless NC through purely algebraic arguments. It incorporate realistic constraints, including omni directionality of transmissions, half-duplex operation and interference effects. A faster branch and bound based algorithm is also developed that, within some constraints, efficiently finds the optimal wireless NC.

Original language	English (US)
Title of host publication	2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009
DOIs	https://doi.org/10.1109/SAHCNW.2009.5172949
State	Published - 2009
Event	2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009 - Rome, Italy Duration: Jun 22 2009 → Jun 26 2009

Publication series

Name	2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009

Other

Other	2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009
Country/Territory	Italy
City	Rome
Period	6/22/09 → 6/26/09

Access

10.1109/SAHCNW.2009.5172949

OpenUrl availability

Full text

Cite this

Rajawat, K., & Giannakis, G. B. (2009). Non-random wireless network coding. In 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009 Article 5172949 (2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009). https://doi.org/10.1109/SAHCNW.2009.5172949

Non-random wireless network coding. / Rajawat, Ketan; Giannakis, Georgios B.
2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009. 2009. 5172949 (2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Rajawat, K & Giannakis, GB 2009, Non-random wireless network coding. in 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009., 5172949, 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009, 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009, Rome, Italy, 6/22/09. https://doi.org/10.1109/SAHCNW.2009.5172949

Rajawat K, Giannakis GB. Non-random wireless network coding. In 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009. 2009. 5172949. (2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009). doi: 10.1109/SAHCNW.2009.5172949

Rajawat, Ketan ; Giannakis, Georgios B. / Non-random wireless network coding. 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009. 2009. (2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009).

@inproceedings{d949d0b8875d40069358bcc8448057fc,

title = "Non-random wireless network coding",

abstract = "Network coding (NC) has been shown to improve throughput, minimize delay and economize the energy requirements in wireless networks. This paper develops a non-random approach to wireless linear NC problem. The proposed approach works by {"}time-unwrapping{"} a wireless node to develop a wiredequivalent model that helps solve for the wireless NC through purely algebraic arguments. It incorporate realistic constraints, including omni directionality of transmissions, half-duplex operation and interference effects. A faster branch and bound based algorithm is also developed that, within some constraints, efficiently finds the optimal wireless NC.",

author = "Ketan Rajawat and Giannakis, {Georgios B.}",

year = "2009",

doi = "10.1109/SAHCNW.2009.5172949",

language = "English (US)",

isbn = "9781424439386",

series = "2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009",

booktitle = "2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009",

note = "2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009 ; Conference date: 22-06-2009 Through 26-06-2009",

}

TY - GEN

T1 - Non-random wireless network coding

AU - Rajawat, Ketan

AU - Giannakis, Georgios B.

PY - 2009

Y1 - 2009

N2 - Network coding (NC) has been shown to improve throughput, minimize delay and economize the energy requirements in wireless networks. This paper develops a non-random approach to wireless linear NC problem. The proposed approach works by "time-unwrapping" a wireless node to develop a wiredequivalent model that helps solve for the wireless NC through purely algebraic arguments. It incorporate realistic constraints, including omni directionality of transmissions, half-duplex operation and interference effects. A faster branch and bound based algorithm is also developed that, within some constraints, efficiently finds the optimal wireless NC.

AB - Network coding (NC) has been shown to improve throughput, minimize delay and economize the energy requirements in wireless networks. This paper develops a non-random approach to wireless linear NC problem. The proposed approach works by "time-unwrapping" a wireless node to develop a wiredequivalent model that helps solve for the wireless NC through purely algebraic arguments. It incorporate realistic constraints, including omni directionality of transmissions, half-duplex operation and interference effects. A faster branch and bound based algorithm is also developed that, within some constraints, efficiently finds the optimal wireless NC.

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

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

U2 - 10.1109/SAHCNW.2009.5172949

DO - 10.1109/SAHCNW.2009.5172949

M3 - Conference contribution

AN - SCOPUS:71049165493

SN - 9781424439386

T3 - 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009

BT - 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009

T2 - 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009

Y2 - 22 June 2009 through 26 June 2009

ER -

Non-random wireless network coding

Abstract

Publication series

Other

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this