Mobility

A Genetic Algorithm for Source Election in Cooperative Clusters Implementing Network Coding

Free registration required

Executive Summary

Reference scenarios of the present research are clusters of cooperating wireless nodes, implementing random linear network coding to enhance the throughput performance of file downloading and information spreading services. In particular, a sub-set of cluster nodes will access, through their cellular link, parts of a file to be exchanged among all cluster members. The paper focus is on the "Source election" issue. The novelty of the research lies in the main problem constraints, which make it far different from (and more exacting than), traditional cluster head election problems: the source number can cover the whole range of nodes and all the nodes must be considered data destinations.

  • Format: PDF
  • Size: 1217.5 KB