Non-cooperative Forwarding in Ad-Hoc Networks

A wireless Ad-hoc network is expected to be made up of energy aware entities (nodes) interested in their own perceived performance. An important problem in such a scenario is to provide incentives for collaboration among the participating entities. Forwarding packets of other nodes is an example of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Altman, Eitan, Kherani, Arzad A., Michiardi, Pietro, Molva, Refik
Format: Buchkapitel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 498
container_issue
container_start_page 486
container_title
container_volume
creator Altman, Eitan
Kherani, Arzad A.
Michiardi, Pietro
Molva, Refik
description A wireless Ad-hoc network is expected to be made up of energy aware entities (nodes) interested in their own perceived performance. An important problem in such a scenario is to provide incentives for collaboration among the participating entities. Forwarding packets of other nodes is an example of activity that requires such a collaboration. However, it may not be in interest of a node to always forward the requesting packets. At the same time, not forwarding any packet may adversly affect the network functioning. Assuming that the nodes are rational, i.e., their actions are strictly determined by their self-interest, we view the problem in framework of non-cooperative game theory and provide a simple punishing mechanism considering end-to-end performance objectives of the nodes. We also provide a distributed implementation of the proposed mechanism. This implementation has a small computational and storage complexity hence is suitable for the scenario under consideration.
doi_str_mv 10.1007/11422778_39
format Book Chapter
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16895206</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16895206</sourcerecordid><originalsourceid>FETCH-LOGICAL-c298t-d1c1ac53dea760f583e5e1bff087a12964f9d3f4d58441544dbaa75459aaedc03</originalsourceid><addsrcrecordid>eNpNkD1PQjEYhetXIkEm_8BdHByqffu2t-1IiIgJwUXnpvSDXMFb0hKJ_14IxniWM5wnZ3gIuQX2AIypRwDBuVLaojkjI6M0SsGQM1B4TgbQAlBEYS7-Ni41M-KSDBgyTo0SeE1GtX6wQxAMIB8Qusg99TlvY3G77is201z2roSuXzVd34wDnWXfLOJun8u63pCr5DY1jn57SN6nT2-TGZ2_Pr9MxnPqudE7GsCD8xJDdKplSWqMMsIyJaaVA25akUzAJILUQoAUIiydU1JI41wMnuGQ3J1-t656t0nF9b6rdlu6T1e-LbTaSM7aA3d_4uph6lex2GXO62qB2aMy-08Z_gBb4Fbv</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Non-cooperative Forwarding in Ad-Hoc Networks</title><source>Springer Books</source><creator>Altman, Eitan ; Kherani, Arzad A. ; Michiardi, Pietro ; Molva, Refik</creator><contributor>Boutaba, Raouf ; Black, James P. ; Almeroth, Kevin ; Puigjaner, Ramon ; Shen, Sherman</contributor><creatorcontrib>Altman, Eitan ; Kherani, Arzad A. ; Michiardi, Pietro ; Molva, Refik ; Boutaba, Raouf ; Black, James P. ; Almeroth, Kevin ; Puigjaner, Ramon ; Shen, Sherman</creatorcontrib><description>A wireless Ad-hoc network is expected to be made up of energy aware entities (nodes) interested in their own perceived performance. An important problem in such a scenario is to provide incentives for collaboration among the participating entities. Forwarding packets of other nodes is an example of activity that requires such a collaboration. However, it may not be in interest of a node to always forward the requesting packets. At the same time, not forwarding any packet may adversly affect the network functioning. Assuming that the nodes are rational, i.e., their actions are strictly determined by their self-interest, we view the problem in framework of non-cooperative game theory and provide a simple punishing mechanism considering end-to-end performance objectives of the nodes. We also provide a distributed implementation of the proposed mechanism. This implementation has a small computational and storage complexity hence is suitable for the scenario under consideration.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540258094</identifier><identifier>ISBN: 3540258094</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540320173</identifier><identifier>EISBN: 3540320172</identifier><identifier>DOI: 10.1007/11422778_39</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Game theory ; Software ; Stochastic approximation algorithm</subject><ispartof>Lecture notes in computer science, 2005, p.486-498</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c298t-d1c1ac53dea760f583e5e1bff087a12964f9d3f4d58441544dbaa75459aaedc03</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11422778_39$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11422778_39$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>310,311,781,782,786,791,792,795,4054,4055,27934,38264,41451,42520</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=16895206$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Boutaba, Raouf</contributor><contributor>Black, James P.</contributor><contributor>Almeroth, Kevin</contributor><contributor>Puigjaner, Ramon</contributor><contributor>Shen, Sherman</contributor><creatorcontrib>Altman, Eitan</creatorcontrib><creatorcontrib>Kherani, Arzad A.</creatorcontrib><creatorcontrib>Michiardi, Pietro</creatorcontrib><creatorcontrib>Molva, Refik</creatorcontrib><title>Non-cooperative Forwarding in Ad-Hoc Networks</title><title>Lecture notes in computer science</title><description>A wireless Ad-hoc network is expected to be made up of energy aware entities (nodes) interested in their own perceived performance. An important problem in such a scenario is to provide incentives for collaboration among the participating entities. Forwarding packets of other nodes is an example of activity that requires such a collaboration. However, it may not be in interest of a node to always forward the requesting packets. At the same time, not forwarding any packet may adversly affect the network functioning. Assuming that the nodes are rational, i.e., their actions are strictly determined by their self-interest, we view the problem in framework of non-cooperative game theory and provide a simple punishing mechanism considering end-to-end performance objectives of the nodes. We also provide a distributed implementation of the proposed mechanism. This implementation has a small computational and storage complexity hence is suitable for the scenario under consideration.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Game theory</subject><subject>Software</subject><subject>Stochastic approximation algorithm</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540258094</isbn><isbn>3540258094</isbn><isbn>9783540320173</isbn><isbn>3540320172</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2005</creationdate><recordtype>book_chapter</recordtype><recordid>eNpNkD1PQjEYhetXIkEm_8BdHByqffu2t-1IiIgJwUXnpvSDXMFb0hKJ_14IxniWM5wnZ3gIuQX2AIypRwDBuVLaojkjI6M0SsGQM1B4TgbQAlBEYS7-Ni41M-KSDBgyTo0SeE1GtX6wQxAMIB8Qusg99TlvY3G77is201z2roSuXzVd34wDnWXfLOJun8u63pCr5DY1jn57SN6nT2-TGZ2_Pr9MxnPqudE7GsCD8xJDdKplSWqMMsIyJaaVA25akUzAJILUQoAUIiydU1JI41wMnuGQ3J1-t656t0nF9b6rdlu6T1e-LbTaSM7aA3d_4uph6lex2GXO62qB2aMy-08Z_gBb4Fbv</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Altman, Eitan</creator><creator>Kherani, Arzad A.</creator><creator>Michiardi, Pietro</creator><creator>Molva, Refik</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Non-cooperative Forwarding in Ad-Hoc Networks</title><author>Altman, Eitan ; Kherani, Arzad A. ; Michiardi, Pietro ; Molva, Refik</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c298t-d1c1ac53dea760f583e5e1bff087a12964f9d3f4d58441544dbaa75459aaedc03</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Game theory</topic><topic>Software</topic><topic>Stochastic approximation algorithm</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Altman, Eitan</creatorcontrib><creatorcontrib>Kherani, Arzad A.</creatorcontrib><creatorcontrib>Michiardi, Pietro</creatorcontrib><creatorcontrib>Molva, Refik</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Altman, Eitan</au><au>Kherani, Arzad A.</au><au>Michiardi, Pietro</au><au>Molva, Refik</au><au>Boutaba, Raouf</au><au>Black, James P.</au><au>Almeroth, Kevin</au><au>Puigjaner, Ramon</au><au>Shen, Sherman</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Non-cooperative Forwarding in Ad-Hoc Networks</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2005</date><risdate>2005</risdate><spage>486</spage><epage>498</epage><pages>486-498</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540258094</isbn><isbn>3540258094</isbn><eisbn>9783540320173</eisbn><eisbn>3540320172</eisbn><abstract>A wireless Ad-hoc network is expected to be made up of energy aware entities (nodes) interested in their own perceived performance. An important problem in such a scenario is to provide incentives for collaboration among the participating entities. Forwarding packets of other nodes is an example of activity that requires such a collaboration. However, it may not be in interest of a node to always forward the requesting packets. At the same time, not forwarding any packet may adversly affect the network functioning. Assuming that the nodes are rational, i.e., their actions are strictly determined by their self-interest, we view the problem in framework of non-cooperative game theory and provide a simple punishing mechanism considering end-to-end performance objectives of the nodes. We also provide a distributed implementation of the proposed mechanism. This implementation has a small computational and storage complexity hence is suitable for the scenario under consideration.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11422778_39</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Lecture notes in computer science, 2005, p.486-498
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_16895206
source Springer Books
subjects Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Game theory
Software
Stochastic approximation algorithm
title Non-cooperative Forwarding in Ad-Hoc Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-02T18%3A41%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Non-cooperative%20Forwarding%20in%20Ad-Hoc%20Networks&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Altman,%20Eitan&rft.date=2005&rft.spage=486&rft.epage=498&rft.pages=486-498&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540258094&rft.isbn_list=3540258094&rft_id=info:doi/10.1007/11422778_39&rft_dat=%3Cpascalfrancis_sprin%3E16895206%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540320173&rft.eisbn_list=3540320172&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true