<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605470626</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100329.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00500-014-1269-x</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00500-014-1269-x</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Genetic algorithm with ensemble of immigrant strategies for multicast routing in Ad hoc networks</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[P. Karthikeyan, S. Baskar]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In this paper, an Ensemble of Immigrant Strategies with Genetic Algorithm (EISGA) which optimizes the combined objectives of network lifetime and delay is proposed for solving multicast routing problem. Immigrant strategies are the specific replacement operators designed for dynamic optimization problems and are naturally suited for multicast routing in ad hoc networks. The proposed system ensembles random immigrant with random replacement, random immigrant with worst replacement, elitism-based immigrant and hybrid immigrant strategies. The sequence and topological coding with genetic operators such as modified topology crossover, energy mutation and node mutation are employed in EISGA. The performance of four variants of genetic algorithms formed from these immigrant strategies is evaluated in two different network topologies, with different range of immigrant probability values. Results show that fixing of probability values for various immigrant strategies is very difficult. The proposed EISGA, with equal probability and adaptive probability, is evaluated on four different networks with 10, 20, 30 and 40 nodes on two kinds of topologies. The performance of the proposed EISGA with adaptive probability is assessed in various Learning Period (LP) to determine the suitable LP and is compared with other existing algorithms using non-parametric statistical tests with average ranking. These results endorse that the proposed EISGA improves the performance of GA in solving multicast routing problems effectively.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag Berlin Heidelberg, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Ad hoc networks</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Multicast routing</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Genetic operator combinations (GOCs)</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Ensemble of immigrant strategies with genetic algorithm (EISGA)</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Karthikeyan</subfield>
   <subfield code="D">P.</subfield>
   <subfield code="u">Department of Information Technology, Thiagarajar College of Engineering, 625015, Madurai, Tamilnadu, India</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Baskar</subfield>
   <subfield code="D">S.</subfield>
   <subfield code="u">Department of Electrical and Electronics Engineering, Thiagarajar College of Engineering, 625015, Madurai, Tamilnadu, India</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Soft Computing</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">19/2(2015-02-01), 489-498</subfield>
   <subfield code="x">1432-7643</subfield>
   <subfield code="q">19:2&lt;489</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">500</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00500-014-1269-x</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00500-014-1269-x</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Karthikeyan</subfield>
   <subfield code="D">P.</subfield>
   <subfield code="u">Department of Information Technology, Thiagarajar College of Engineering, 625015, Madurai, Tamilnadu, India</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Baskar</subfield>
   <subfield code="D">S.</subfield>
   <subfield code="u">Department of Electrical and Electronics Engineering, Thiagarajar College of Engineering, 625015, Madurai, Tamilnadu, India</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Soft Computing</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">19/2(2015-02-01), 489-498</subfield>
   <subfield code="x">1432-7643</subfield>
   <subfield code="q">19:2&lt;489</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">500</subfield>
  </datafield>
 </record>
</collection>
