Non-random wireless network coding

Ketan Rajawat, Georgios B. Giannakis

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publication2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009
DOIs
StatePublished - Nov 16 2009
Event2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009 - Rome, Italy
Duration: Jun 22 2009Jun 26 2009

Publication series

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

Other

Other2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009
CountryItaly
CityRome
Period6/22/096/26/09

Fingerprint

Dive into the research topics of 'Non-random wireless network coding'. Together they form a unique fingerprint.

Cite this