Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

An effective genetic algorithm for the network coding problem

Tools
- Tools
+ Tools

Hu, Xiao-Bing, Leeson, Mark S., 1963- and Hines, Evor, 1957- (2009) An effective genetic algorithm for the network coding problem. In: IEEE Congress on Evolutionary Computation, Trondheim, Norway, May 18-21, 2009. Published in: 2009 IEEE Congress on Evolutionary Computation, Vols. 1-5 pp. 1714-1720.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/CEC.2009.4983148

Abstract

The optimization of network coding is a relatively new area for evolutionary algorithms, as very few efforts have so far been reported. This paper is concerned with the design of an effective Genetic Algorithm (GA) for tackling the network coding problem (NCP). Differing from previous relevant works, the proposed GA is designed based on a permutation representation, which not only allows each chromosome to record a specific network protocol and coding scheme, but also makes it easy to integrate useful problem-specific heuristic rules into the algorithm. In the new GA, a more general fitness function is proposed, which, besides considering the minimization of network coding resources, also takes into account the maximization of the rate actually achieved. This new fitness function makes the proposed GA more suitable for the case of dynamic network coding, where any link could be cut off at any time, and consequently, the target rate might become unachievable even if all nodes allow coding. Based on the new representation and fitness function, other GA related techniques are modified and employed accordingly and carefully. Comparative experiments show that the proposed GA clearly outperforms previous methods.

Item Type: Conference Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
T Technology > TA Engineering (General). Civil engineering (General)
Divisions: Faculty of Science > Engineering
Series Name: IEEE Congress on Evolutionary Computation
Journal or Publication Title: 2009 IEEE Congress on Evolutionary Computation, Vols. 1-5
Publisher: IEEE
ISBN: 978-1-4244-2958-5
Date: 2009
Number of Pages: 7
Page Range: pp. 1714-1720
Identification Number: 10.1109/CEC.2009.4983148
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Title of Event: IEEE Congress on Evolutionary Computation
Type of Event: Conference
Location of Event: Trondheim, Norway
Date(s) of Event: May 18-21, 2009
URI: http://wrap.warwick.ac.uk/id/eprint/6353

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us