Home
Resource
On the dynamics of random network coding
PDF
PDF format is widely accepted and good for printing.
Plug-in required
On the dynami...(990.74 kb)
Citation & Export
View Usage Statistics
Staff View

Citation & Export
Hide

Simple citation

Zhang, Dan. On the dynamics of random network coding. Retrieved from https://doi.org/doi:10.7282/T3ZK5F8H

Export

Click here for information about Citation Management Tools at Rutgers.

Statistics
Hide

Description

TitleOn the dynamics of random network coding
NameZhang, Dan (author); Mandayam, Narayan B. (chair); Yates, Roy (internal member); Spasojevic, Predrag (internal member); Soljanin, Emina (outside member); Rutgers University; Graduate School - New Brunswick
Date Created2012
Other Date2012-10 (degree)
SubjectElectrical and Computer Engineering, Coding theory, Computer networks
Extentix, 80 p. : ill.
DescriptionAs a network transport scheme, an important quantity for random network coding (RNC) is the non-redundant information a node or a set of nodes possess over time, which is called the rank. In general, the rank is a random process that is affected by a number of factors including the random coding operation, the channel and the randomness built in the MAC and PHY. Due to its complicated nature, previous approaches to random network coding chose to focus on the asymptotic behavior of the rank processes only. For the first time, we develop a dynamical system framework for analyzing RNC in a wireless network based on differential equations (DE). It turns out under the fluid approximation, ranks of different nodes and sets are intertwined in the form of a system of differential equations. The system of DEs allow us to focus on the transient behavior of RNC, rendering a more complete picture of RNC dynamics. The DE framework can be used to reveal the throughput of RNC, or numerically solved to evaluate various performance measures. Many aspects of the network, such as topology, source and destination configuration, inter-session coding, PHY and MAC technologies that are employed, are all captured in the system as initial conditions or parameters of the equations. Consequently, the dynamical system framework proves to be powerful in modeling RNC with fine details present in the channel, in the MAC/PHY or in the topology. We will show its versatility by first discussing the theoretical application proving the throughput achievability theorem. We will then expand on its practical application in cross layer design, especially in terms of resource allocation with a throughput dependent objective.
NotePh.D.
NoteIncludes bibliographical references
NoteIncludes vita
Noteby Dan Zhang
Genretheses, ETD doctoral
Persistent URLhttps://doi.org/doi:10.7282/T3ZK5F8H
Languageeng
CollectionGraduate School - New Brunswick Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work.
Version 8.5.5
Rutgers University Libraries - Copyright ©2024