TAMU Homepage TAMU Libraries Homepage TAMU Digital Library Homepage

Design and Analysis of Low Complexity Network Coding Schemes

Show simple item record

dc.contributor.advisor Savari, Serap A.
dc.creator Tabatabaei-Yazdi, Seyed
dc.date.accessioned 2012-02-20T19:43:10Z
dc.date.available 2012-02-20T19:43:10Z
dc.date.created 2011-08
dc.date.created 2011-10-21T22:03:48Z
dc.date.issued 2012-02-20
dc.date.submitted August 2011
dc.identifier.uri http://hdl.handle.net/1969.1/128797
dc.description.abstract In classical network information theory, information packets are treated as commodities, and the nodes of the network are only allowed to duplicate and forward the packets. The new paradigm of network coding, which was introduced by Ahlswede et al., states that if the nodes are permitted to combine the information packets and forward a function of them, the throughput of the network can dramatically increase. In this dissertation we focused on the design and analysis of low complexity network coding schemes for different topologies of wired and wireless networks. In the first part we studied the routing capacity of wired networks. We provided a description of the routing capacity region in terms of a finite set of linear inequalities. We next used this result to study the routing capacity region of undirected ring networks for two multimessage scenarios. Finally, we used new network coding bounds to prove the optimality of routing schemes in these two scenarios. In the second part, we studied node-constrained line and star networks. We derived the multiple multicast capacity region of node-constrained line networks based on a low complexity binary linear coding scheme. For star networks, we examined the multiple unicast problem and offered a linear coding scheme. Then we made a connection between the network coding in a node-constrained star network and the problem of index coding with side information. In the third part, we studied the linear deterministic model of relay networks (LDRN). We focused on a unicast session and derived a simple capacity-achieving transmission scheme. We obtained our scheme by a connection to the submodular flow problem through the application of tools from matroid theory and submodular optimization theory. We also offered polynomial-time algorithms for calculating the capacity of the network and the optimal coding scheme. In the final part, we considered the multicasting problem in an LDRN and proposed a new way to construct a coding scheme. Our construction is based on the notion of flow for a unicast session in the third part of this dissertation. We presented randomized and deterministic polynomial-time versions of our algorithm. en_US
dc.format.medium electronic en_US
dc.language.iso en_US en_US
dc.subject Information theory en_US
dc.subject network coding en_US
dc.subject undirected ring networks en_US
dc.subject line networks en_US
dc.subject star networks en_US
dc.subject node-constrained networks en_US
dc.subject index coding en_US
dc.subject relay networks en_US
dc.subject deterministic networks en_US
dc.subject submodular optimization en_US
dc.title Design and Analysis of Low Complexity Network Coding Schemes en_US
dc.type Thesis en_US
thesis.degree.department Electrical and Computer Engineering
thesis.degree.discipline Electrical Engineering
thesis.degree.grantor Texas A&M University
thesis.degree.name Doctor of Philosophy
thesis.degree.level Doctoral
dc.contributor.committeeMember Liu, Tie
dc.contributor.committeeMember Sprintson, Alexander
dc.contributor.committeeMember Yan, Catherine
dc.type.genre thesis
dc.type.material text en_US
dc.format.digitalOrigin born digital en_US
dc.rights.requestable false en_US


Files in this item

Files Size Format View
TABATABAEI-YAZDI-DISSERTATION_rev.pdf 1.138Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

 
-