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

Dynamic network coding problem: an evolutionary approach

Tools
- Tools
+ Tools

Hu, Xiao-Bing, Leeson, Mark S., 1963- and Hines, Evor, 1957- (2009) Dynamic network coding problem: an evolutionary approach. In: 5th International Conference on Wireless Communications, Networking and Mobile Computing, Beijing, People's Republic of China, September 24-26, 2009. Published in: 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing, Vols. 1-8 pp. 437-444.

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

Abstract

As a relatively new information theory, network coding has already resulted in a significant influence on many research areas such as communication system, network protocol, wireless network, and network security. The optimization of network coding, which aims to minimize network coding resources such as coding nodes and links, has recently attracted the attention of some researchers, who have so far focused their efforts mainly on static network coding problem (SNCP). For instance, they make the common assumption that a target rate is always achievable at every sink as long as coding is allowed at all nodes, which is unrealistic due to the dynamic nature of most real-world networks, where any link could be disconnected at any time. This paper is concerned with how to address the dynamic network coding problem (DNCP). To this end, a general formulation of DNCP is described, and then the design of an effective Genetic Algorithm (GA) for the DNCP is reported. The new problem formulation not only considers the minimization of network coding resources, but also takes into account the maximization of the rate actually achieved. The proposed GA adopts a new permutation representation, which not only makes evolutionary operations free of feasibility problems, but also makes it easy to integrate useful problem-specific heuristic rules into the algorithm. Experimental results illustrate the effectiveness of the proposed model and algorithm for DNCP.

Item Type: Conference Item (Paper)
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Science > Engineering
Journal or Publication Title: 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing, Vols. 1-8
Publisher: IEEE
ISBN: 978-1-4244-3692-7
Date: 2009
Number of Pages: 8
Page Range: pp. 437-444
Identification Number: 10.1109/WICOM.2009.5302943
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Conference Paper Type: Paper
Title of Event: 5th International Conference on Wireless Communications, Networking and Mobile Computing
Type of Event: Conference
Location of Event: Beijing, People's Republic of China
Date(s) of Event: September 24-26, 2009
URI: http://wrap.warwick.ac.uk/id/eprint/6214

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