Return to search

Using topological information in opportunistic network coding / by Magdalena Johanna (Leenta) Grobler

Recent advances in methods to increase network utilization have lead to the introduction of a relatively new method called Network Coding. Network Coding is a method that can reduce local congestion in a network by combining information sent over the network. It is commonly researched in the information theory field after it was first introduced by Ahlswede et al in 2000.
Network Coding was proven in 2003, by Koetter & Medard to be the only way to achieve the throughput capacity defined by the Min cut Max flow theorem of Shannon. It was applied deterministically in wired networks and randomly in wireless networks. Random Network Coding however requires a lot of overhead and may cause possible delays in the network.
We found that there is an open question as to determine where in a wireless network, Network Coding can be implemented. In this thesis we propose to find opportunities for the implementation of Network Coding, by searching for known deterministic Network Coding topologies in larger Networks. Because a known topology is used, we will then also know how Network Coding should be implemented. This method of finding opportunities for the implementation of Network Coding using topology can be combined with a routing algorithm to improve the utilization of a wireless network.
We implemented our method on three different topologies and searched 1000 random networks for the presence of these topologies. We found that these topologies occurred frequently enough to make our method a viable method of finding opportunities for the implementation of Network Coding. / Thesis (M.Ing. (Computer and Electronical Engineering))--North-West University, Potchefstroom Campus, 2009.

Identiferoai:union.ndltd.org:NWUBOLOKA1/oai:dspace.nwu.ac.za:10394/2639
Date January 2008
CreatorsGrobler, Magdalena Johanna
PublisherNorth-West University
Source SetsNorth-West University
Detected LanguageEnglish
TypeThesis

Page generated in 0.0015 seconds