<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     naa a22        4500</leader>
  <controlfield tag="001">510792529</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180411083324.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">180411e20130801xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11277-012-0970-2</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11277-012-0970-2</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">On Modeling The Impact of Selfish Behaviors on Limited Epidemic Routing in Delay Tolerant Networks</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Yahui Wu, Su Deng, Hongbin Huang]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Transmission opportunity in delay tolerant network (DTN) is uncertain. To improve the routing performance, DTN tries to use every contact between nodes, and one classic policy is epidemic routing algorithm (ER). Due to much energy consumption, L-hop limited ER algorithm is proposed. However, such method does not consider the energy constraint for a specific node. To overcome this problem, we propose the L-count limited ER algorithm, in which each node forwards at most $$L$$ times. Numerical results show that this new algorithm can get better performance. Both of above algorithms need nodes to work in a cooperative way. However, due to selfish nature of nodes (individual selfishness and social selfishness), they may not be willing to help others. This paper proposes an accurate theoretical framework to evaluate the impact of these behaviors based on nonlinear differential equations (ODE). Simulations based on both synthetic and real motion traces show the accuracy of our theoretical model. Numerical results show that selfish nature can decrease the flooding performance in both algorithms. Under the same selfish behaviors, the performance is decreasing with the number of communities. The deviation of the performance between two algorithms is decreasing with the value of $$L$$ .</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2012</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Delay tolerant networks</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Limited epidemic routing</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Selfish behaviors</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Performance evaluation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Wu</subfield>
   <subfield code="D">Yahui</subfield>
   <subfield code="u">Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, 410073, Changsha, Hunan, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Deng</subfield>
   <subfield code="D">Su</subfield>
   <subfield code="u">Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, 410073, Changsha, Hunan, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Huang</subfield>
   <subfield code="D">Hongbin</subfield>
   <subfield code="u">Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, 410073, Changsha, Hunan, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Wireless Personal Communications</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">71/4(2013-08-01), 2759-2782</subfield>
   <subfield code="x">0929-6212</subfield>
   <subfield code="q">71:4&lt;2759</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">71</subfield>
   <subfield code="o">11277</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11277-012-0970-2</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</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="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/s11277-012-0970-2</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">Wu</subfield>
   <subfield code="D">Yahui</subfield>
   <subfield code="u">Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, 410073, Changsha, Hunan, China</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">Deng</subfield>
   <subfield code="D">Su</subfield>
   <subfield code="u">Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, 410073, Changsha, Hunan, China</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">Huang</subfield>
   <subfield code="D">Hongbin</subfield>
   <subfield code="u">Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, 410073, Changsha, Hunan, China</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">Wireless Personal Communications</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">71/4(2013-08-01), 2759-2782</subfield>
   <subfield code="x">0929-6212</subfield>
   <subfield code="q">71:4&lt;2759</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">71</subfield>
   <subfield code="o">11277</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="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
