Brunel University Research Archive (BURA) >
School of Engineering and Design >
School of Engineering and Design Theses >
Please use this identifier to cite or link to this item:
|Title: ||Performance analysis for network coding using ant colony routing|
|Authors: ||Sabri, Dalia|
|Advisors: ||Al-Raweshidy, H|
|Keywords: ||Ant colony optimization|
Network coding application
Traditional routing algorithm
Butterfly network system
Linear network coding
|Publication Date: ||2011|
|Publisher: ||Brunel University School of Engineering and Design PhD Theses|
|Abstract: ||The aim of this thesis is to conduct performance investigation of a combined system of Network Coding (NC) technique with Ant-Colony (ACO) routing protocol. This research analyses the impact of several workload characteristics, on system performance.
Network coding is a significant key development of information transmission and processing. Network coding enhances the performance of multicast by employing encoding operations at intermediate nodes. Two steps should realize while using network coding in multicast communication: determining appropriate transmission paths from source to multi-receivers and using the suitable coding scheme.
Intermediate nodes would combine several packets and relay them as a single packet. Although network coding can make a network achieve the maximum multicast rate, it always brings additional overheads. It is necessary to minimize unneeded overhead by using an optimization technique.
On other hand, Ant Colony Optimization can be transformed into useful technique that seeks imitate the ant’s behaviour in finding the shortest path to its destination using quantities of pheromone that is left by former ants as guidance, so by using the same concept of the communication network environment, shorter paths can be formulated.
The simulation results show that the resultant system considerably improves the performance of the network, by combining Ant Colony Optimization with network coding. 25% improvement in the bandwidth consumption can be achieved in comparison with conventional routing protocols. Additionally simulation results indicate that the proposed algorithm can decrease the computation time of system by a factor of 20%.|
|Description: ||This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.|
|Appears in Collections:||School of Engineering and Design Theses|
Electronic and Computer Engineering
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.