<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     naa a22        4500</leader>
  <controlfield tag="001">510796869</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180411083339.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">180411e20131201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11277-013-1211-z</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11277-013-1211-z</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Incentive Mechanism for Multiuser Cooperative Relaying in Wireless Ad Hoc Networks: A Resource-Exchange Based Approach</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Guopeng Zhang, Kun Yang, Peng Liu, Xiaolong Feng]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This paper studies the resource allocation (RA) and the relay selection (RS) problems in cooperative relaying (CR) based multiuser ad hoc networks, and a multiuser cooperative game is proposed to stimulate selfish user nodes to participate in the CR. The novelty of the game scheme lies in that it takes explicit count of that a wireless user can act as a data-source as well as a potential relay for other users. Consider a user has the selfish incentive to consume his/her spectrum resource solely to maximize his/her own data-rate and the selection cooperation (SC) rule which restricts relaying for a user to only one relay is explicitly imposed. To stimulate user nodes to share their energy and spectrum resource efficiently in the Pareto optimal sense, first, we formulate the RA problem for multiuser CR as a bargaining game. By solving the Nash bargaining solution of the game, Pareto optimal RA for cooperative partners can be achieved. Next, to implement the SC-rule imposed RS, a simple heuristic is proposed with the main method being to maintain the long-term priority fairness for cooperative partner selection for each selfish user. The proposed RS with RA (RS-RA) algorithm has a low computational complexity of $$O(K^{2})$$ O ( K 2 ) , where $$K$$ K is the number of users in a network. Simulation results demonstrate the system efficiency and fairness properties of the proposed bargaining game theoretic RS-RA scheme.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2013</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Cooperative relaying</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Resource allocation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Relay selection</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Cooperative bargaining game</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Nash bargaining solution</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Pareto optimal</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Zhang</subfield>
   <subfield code="D">Guopeng</subfield>
   <subfield code="u">Internet of Things Research Center, China University of Mining and Technology, 221008, Xuzhou, Jiangsu, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Yang</subfield>
   <subfield code="D">Kun</subfield>
   <subfield code="u">School of Computer Science and Electronic Engineering (CSEE), University of Essex, Wivenhoe Park, CO4 3SQ, Colchester, Essex, UK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Liu</subfield>
   <subfield code="D">Peng</subfield>
   <subfield code="u">Internet of Things Research Center, China University of Mining and Technology, 221008, Xuzhou, Jiangsu, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Feng</subfield>
   <subfield code="D">Xiaolong</subfield>
   <subfield code="u">School of Information and Electrical Engineering, China University of Mining and Technology, 221116, Xuzhou, Jiangsu, 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">73/3(2013-12-01), 697-715</subfield>
   <subfield code="x">0929-6212</subfield>
   <subfield code="q">73:3&lt;697</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">73</subfield>
   <subfield code="o">11277</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11277-013-1211-z</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-013-1211-z</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">Zhang</subfield>
   <subfield code="D">Guopeng</subfield>
   <subfield code="u">Internet of Things Research Center, China University of Mining and Technology, 221008, Xuzhou, Jiangsu, 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">Yang</subfield>
   <subfield code="D">Kun</subfield>
   <subfield code="u">School of Computer Science and Electronic Engineering (CSEE), University of Essex, Wivenhoe Park, CO4 3SQ, Colchester, Essex, UK</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">Liu</subfield>
   <subfield code="D">Peng</subfield>
   <subfield code="u">Internet of Things Research Center, China University of Mining and Technology, 221008, Xuzhou, Jiangsu, 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">Feng</subfield>
   <subfield code="D">Xiaolong</subfield>
   <subfield code="u">School of Information and Electrical Engineering, China University of Mining and Technology, 221116, Xuzhou, Jiangsu, 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">73/3(2013-12-01), 697-715</subfield>
   <subfield code="x">0929-6212</subfield>
   <subfield code="q">73:3&lt;697</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">73</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>
