<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-03-14T02:24:29Z</responseDate>
  <request metadataPrefix="jpcoar_2.0" identifier="oai:ir.soken.ac.jp:00000860" verb="GetRecord">https://ir.soken.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ir.soken.ac.jp:00000860</identifier>
        <datestamp>2023-06-20T16:10:38Z</datestamp>
        <setSpec>2:429:19</setSpec>
      </header>
      <metadata>
        <jpcoar:jpcoar xmlns:datacite="https://schema.datacite.org/meta/kernel-4/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcndl="http://ndl.go.jp/dcndl/terms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:jpcoar="https://github.com/JPCOAR/schema/blob/master/2.0/" xmlns:oaire="http://namespace.openaire.eu/schema/oaire/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:rioxxterms="http://www.rioxx.net/schema/v2.0/rioxxterms/" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns="https://github.com/JPCOAR/schema/blob/master/2.0/" xsi:schemaLocation="https://github.com/JPCOAR/schema/blob/master/2.0/jpcoar_scm.xsd">
          <dc:title>Strategic Pricing to Stimulate Node Cooperation in Wireless Ad Hoc Networks</dc:title>
          <dc:title xml:lang="en">Strategic Pricing to Stimulate Node Cooperation in Wireless Ad Hoc Networks</dc:title>
          <jpcoar:creator>
            <jpcoar:creatorName>李, 明媚</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>リ, ミングメイ</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">LI, Mingmei</jpcoar:creatorName>
          </jpcoar:creator>
          <datacite:description descriptionType="Other">In wireless ad hoc networks, all nodes cooperate to provide network services. &lt;br /&gt;Due to the limited radio transmission range, data packets are usually forwarded &lt;br /&gt;through multiple relay nodes before they reach the destinations. If a node always &lt;br /&gt;serves as a relay to transmit the packets, it may quickly use up its own energy and &lt;br /&gt;other resources. Therefore, some nodes use a selfish approach: they try to avoid &lt;br /&gt;forwarding the packets. Such selfish behavior would probably cause the network to &lt;br /&gt;break down. Selfish nodes are common within ad hoc networks because they are &lt;br /&gt;managed by different authorities. &lt;br /&gt;   In this thesis, the node cooperation problems are analyzed in two steps: 1) &lt;br /&gt;a game theoretic analysis is provided to stimulate node to cooperate; 2) a price- &lt;br /&gt;demand function based incentive model is proposed to optimize the nodes' service &lt;br /&gt;demand and service provision, and encourage the relay nodes to be honest. &lt;br /&gt;   Firstly, a game theoretic analysis is proposed to study node cooperation. In the &lt;br /&gt;related chapter, a "payment and compensation" scheme is used as a less-aggressive &lt;br /&gt;way to avoid nodes' non-cooperative behavior. It is assumed that once a packet is &lt;br /&gt;sent from a source node, the packet is associated with a sending fee, i.e, when a node &lt;br /&gt;needs sending the packets as a source node, a sending fee is required (e.g. reasonably &lt;br /&gt;some money). The fee is adjustable according to the network status, whereas the &lt;br /&gt;node can also accept or reject the fee. In order to induce voluntary forwarding, the &lt;br /&gt;network will also compensate the nodes who consume their energy in forwarding the &lt;br /&gt;packets for others. If I think the sending fee as the penalties to the source nodes and &lt;br /&gt;the compensation fee as the encouragement to relay nodes, then local optimization &lt;br /&gt;of the node, (the desired performance plus the compensat,ion then minus the cost &lt;br /&gt;to be paid) will yield an optimal point. Each node can only select its own packet &lt;br /&gt;generation strategy, however the final utility of each node is determined by the &lt;br /&gt;strategy set constituted by the other nodes. With the game theoretic analysis, I &lt;br /&gt;found that by introducing an incentive pricing policy "payment and compensation"&lt;br /&gt;the relay nodes have less motivation to drop the packets. However, I also found &lt;br /&gt;that game theoretic literature may not be directly applicable in the scenario where &lt;br /&gt;cheating nodes exist and how to reasonably charge the source nodes and compensates &lt;br /&gt;the relay nodes.&lt;br /&gt;     Therefore, secondly, a price-demand function based incentive model (PDM) is &lt;br /&gt;proposed. In the PDM model, the network is modeled as a market, where the pricing&lt;br /&gt;is determined by the source node's demahd and the relay node's service supply. The&lt;br /&gt;source nodes make use of a price-demand function, which allocates payments to &lt;br /&gt;the service provider (relay nodes). The relay nodes are encouraged to cooperate &lt;br /&gt;in the PDM model, which is based on the assumption that each relay node wishes &lt;br /&gt;to maximize its payoff. Then the source nodes can optimize their prices and the &lt;br /&gt;number of sending packets to satisfy the relay nodes' payoff requirement. Once &lt;br /&gt;the payoff requirements of the relay nodes are satisfied, the relay nodes have no &lt;br /&gt;reason to be selfish. In the PDM model, a source node that has packets to send &lt;br /&gt;initially broadcasts RREQ in the network. Once the relay node(s) are selected, each &lt;br /&gt;relay node replies to the source node for its forwarding cost. Then the source node &lt;br /&gt;calculates the price of the sendihg packets it will pay for each relay node and the &lt;br /&gt;number of packets it will send. According to the source nodes' demand, it chooses &lt;br /&gt;the route with the lowest payment or the route with the la'rgest number of sending &lt;br /&gt;packets. The PDM pricing model seeks to address two main issues: 1) to determine &lt;br /&gt;how much to charge the source nodes and how much to compensate the relay nodes; &lt;br /&gt;2)to avoid the relay nodes to dishonestly report their forwarding costs. Hence, the &lt;br /&gt;contributions are summarized as follows: 1) The relay nodes intend to dishonestly &lt;br /&gt;report their forwarding cost to gain a high payoff from the source nodes, which &lt;br /&gt;obviously contradicts with the motivation to stimulate cooperation. In the PDM &lt;br /&gt;model, however, the relay nodes will have no reason to report a false forwarding cost, &lt;br /&gt;since only telling the truth guarantees the relay nodes' final payoff. Such a property &lt;br /&gt;is shown by the proof. 2) The PDM pricing model reflects the relationship between &lt;br /&gt;the service demand of the source nodes and the service supply of the relay nodes. &lt;br /&gt;The PDM model can save money for the source nodes for sending the packets, which &lt;br /&gt;is indicated by the simulation results. &lt;br /&gt;</datacite:description>
          <datacite:description descriptionType="Other">application/pdf</datacite:description>
          <datacite:description descriptionType="Other">総研大甲第1050号</datacite:description>
          <dc:language>eng</dc:language>
          <dc:type rdf:resource="http://purl.org/coar/resource_type/c_46ec">thesis</dc:type>
          <jpcoar:identifier identifierType="URI">https://ir.soken.ac.jp/records/860</jpcoar:identifier>
          <dcndl:degreeName>博士（情報学）</dcndl:degreeName>
          <dcndl:dateGranted>2007-03-23</dcndl:dateGranted>
          <jpcoar:degreeGrantor>
            <jpcoar:degreeGrantorName>総合研究大学院大学</jpcoar:degreeGrantorName>
          </jpcoar:degreeGrantor>
          <jpcoar:file>
            <jpcoar:URI label="要旨・審査要旨">https://ir.soken.ac.jp/record/860/files/甲1050_要旨.pdf</jpcoar:URI>
            <jpcoar:mimeType>application/pdf</jpcoar:mimeType>
            <jpcoar:extent>288.6 kB</jpcoar:extent>
            <datacite:date dateType="Available">2016-02-17</datacite:date>
          </jpcoar:file>
          <jpcoar:file>
            <jpcoar:URI label="本文">https://ir.soken.ac.jp/record/860/files/甲1050_本文.pdf</jpcoar:URI>
            <jpcoar:mimeType>application/pdf</jpcoar:mimeType>
            <jpcoar:extent>14.0 MB</jpcoar:extent>
            <datacite:date dateType="Available">2016-02-17</datacite:date>
          </jpcoar:file>
        </jpcoar:jpcoar>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
