By Topic

Genetic algorithm based rainbow network flow optimization for multiple description coding in lossy network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Huseyin Kusetogullari ; School of Engineering, University of Warwick, Coventry, UK ; Amir Yavariabdi ; Mark S. Leeson ; Evor L. Hines

In this paper, multi-path optimization using genetic algorithm (GA) and rainbow network flow (RNF) for maximizing the received multiple description coding (MDCs) in a lossy network model is proposed. The network flow of multiple description codes (MDCs) is considered and the idea of routing as finding paths for a rainbow of colours (rainbow network flow or RNF) incorporated. The GA is used to find the optimum disjoint paths between source node and the destination node to optimize the amount of outgoing MDC packets. The MDCs are generated by applying the Discrete Wavelet Transform (DWT) and provide maximal performance of the bandwidth capacity of every single route for image transmission across the network. The GA based method finds the optimum solution and the effects of variations in GA parameters are investigated.

Published in:

Internet Technology and Secured Transactions (ICITST), 2010 International Conference for

Date of Conference:

8-11 Nov. 2010