Slotted Aloha as a game with partial information
This paper studies distributed choice of retransmission probabilities in slotted ALOHA. Both the cooperative team problem as well as the noncooperative game problem are considered. Unlike some previous work, we assume that mobiles do not know the number of backlogged packets at other nodes. A Markov...
Gespeichert in:
| Veröffentlicht in: | Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2004-08, Vol.45 (6), p.701-713 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 713 |
|---|---|
| container_issue | 6 |
| container_start_page | 701 |
| container_title | Computer networks (Amsterdam, Netherlands : 1999) |
| container_volume | 45 |
| creator | Altman, Eitan El Azouzi, Rachid Jiménez, Tania |
| description | This paper studies distributed choice of retransmission probabilities in slotted ALOHA. Both the cooperative team problem as well as the noncooperative game problem are considered. Unlike some previous work, we assume that mobiles do not know the number of backlogged packets at other nodes. A Markov chain analysis is used to obtain optimal and equilibrium retransmission probabilities and throughput. We then investigate the impact of adding retransmission costs (which may represent the disutility for power consumption) on the equilibrium and show how this pricing can be used to make the equilibrium throughput coincide with the optimal team throughput. |
| doi_str_mv | 10.1016/j.comnet.2004.02.013 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_04553685v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1389128604000829</els_id><sourcerecordid>57597574</sourcerecordid><originalsourceid>FETCH-LOGICAL-c473t-236fa92713556b25507d195d25114ff8e9d03c84afc0be30c2ef5bf559e8fd8f3</originalsourceid><addsrcrecordid>eNqFkU9r3DAQxU1JoUmab5CDyaHQg1398VjSJbCEtAks5NDkLLTyKKvFtjaSNqHfvlpccuihPc0w_N5jZl5VXVLSUkL7b7vWhmnG3DJCupawllD-oTqlUrBGkF6dlJ5L1VAm-0_VWUo7UsCOydOK_BxDzjjUqzFsTW1SbepnM2H95vO23puYvRlrP7sQJ5N9mD9XH50ZE178qefV0_fbx5u7Zv3w4_5mtW5sJ3huGO-dUUxQDtBvGAARA1UwMKC0c06iGgi3sjPOkg1yYhk62DgAhdIN0vHz6uviuzWj3kc_mfhLB-P13WqtjzPSAfBewist7JeF3cfwcsCU9eSTxXE0M4ZD0iBACRDdf0EmuSDAeQGv_gJ34RDncrCmSoHilPcF6hbIxpBSRPe-JyX6GIze6SUYfQxGE6ZLMEV2vciwvO_VY9TJepwtDj6izXoI_t8GvwEDy5WJ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>199593136</pqid></control><display><type>article</type><title>Slotted Aloha as a game with partial information</title><source>Elsevier ScienceDirect Journals</source><creator>Altman, Eitan ; El Azouzi, Rachid ; Jiménez, Tania</creator><creatorcontrib>Altman, Eitan ; El Azouzi, Rachid ; Jiménez, Tania</creatorcontrib><description>This paper studies distributed choice of retransmission probabilities in slotted ALOHA. Both the cooperative team problem as well as the noncooperative game problem are considered. Unlike some previous work, we assume that mobiles do not know the number of backlogged packets at other nodes. A Markov chain analysis is used to obtain optimal and equilibrium retransmission probabilities and throughput. We then investigate the impact of adding retransmission costs (which may represent the disutility for power consumption) on the equilibrium and show how this pricing can be used to make the equilibrium throughput coincide with the optimal team throughput.</description><identifier>ISSN: 1389-1286</identifier><identifier>EISSN: 1872-7069</identifier><identifier>DOI: 10.1016/j.comnet.2004.02.013</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Computer Science ; Equilibrium ; Game theory ; Markov analysis ; Markov chain ; Markov models ; Nash equilibrium ; Networks ; Pricing ; Slotted Aloha ; Studies</subject><ispartof>Computer networks (Amsterdam, Netherlands : 1999), 2004-08, Vol.45 (6), p.701-713</ispartof><rights>2004 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Aug 21, 2004</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c473t-236fa92713556b25507d195d25114ff8e9d03c84afc0be30c2ef5bf559e8fd8f3</citedby><cites>FETCH-LOGICAL-c473t-236fa92713556b25507d195d25114ff8e9d03c84afc0be30c2ef5bf559e8fd8f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S1389128604000829$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>230,314,776,780,881,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttps://hal.science/hal-04553685$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Altman, Eitan</creatorcontrib><creatorcontrib>El Azouzi, Rachid</creatorcontrib><creatorcontrib>Jiménez, Tania</creatorcontrib><title>Slotted Aloha as a game with partial information</title><title>Computer networks (Amsterdam, Netherlands : 1999)</title><description>This paper studies distributed choice of retransmission probabilities in slotted ALOHA. Both the cooperative team problem as well as the noncooperative game problem are considered. Unlike some previous work, we assume that mobiles do not know the number of backlogged packets at other nodes. A Markov chain analysis is used to obtain optimal and equilibrium retransmission probabilities and throughput. We then investigate the impact of adding retransmission costs (which may represent the disutility for power consumption) on the equilibrium and show how this pricing can be used to make the equilibrium throughput coincide with the optimal team throughput.</description><subject>Computer Science</subject><subject>Equilibrium</subject><subject>Game theory</subject><subject>Markov analysis</subject><subject>Markov chain</subject><subject>Markov models</subject><subject>Nash equilibrium</subject><subject>Networks</subject><subject>Pricing</subject><subject>Slotted Aloha</subject><subject>Studies</subject><issn>1389-1286</issn><issn>1872-7069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><recordid>eNqFkU9r3DAQxU1JoUmab5CDyaHQg1398VjSJbCEtAks5NDkLLTyKKvFtjaSNqHfvlpccuihPc0w_N5jZl5VXVLSUkL7b7vWhmnG3DJCupawllD-oTqlUrBGkF6dlJ5L1VAm-0_VWUo7UsCOydOK_BxDzjjUqzFsTW1SbepnM2H95vO23puYvRlrP7sQJ5N9mD9XH50ZE178qefV0_fbx5u7Zv3w4_5mtW5sJ3huGO-dUUxQDtBvGAARA1UwMKC0c06iGgi3sjPOkg1yYhk62DgAhdIN0vHz6uviuzWj3kc_mfhLB-P13WqtjzPSAfBewist7JeF3cfwcsCU9eSTxXE0M4ZD0iBACRDdf0EmuSDAeQGv_gJ34RDncrCmSoHilPcF6hbIxpBSRPe-JyX6GIze6SUYfQxGE6ZLMEV2vciwvO_VY9TJepwtDj6izXoI_t8GvwEDy5WJ</recordid><startdate>20040801</startdate><enddate>20040801</enddate><creator>Altman, Eitan</creator><creator>El Azouzi, Rachid</creator><creator>Jiménez, Tania</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</general><general>Elsevier</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope></search><sort><creationdate>20040801</creationdate><title>Slotted Aloha as a game with partial information</title><author>Altman, Eitan ; El Azouzi, Rachid ; Jiménez, Tania</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c473t-236fa92713556b25507d195d25114ff8e9d03c84afc0be30c2ef5bf559e8fd8f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Computer Science</topic><topic>Equilibrium</topic><topic>Game theory</topic><topic>Markov analysis</topic><topic>Markov chain</topic><topic>Markov models</topic><topic>Nash equilibrium</topic><topic>Networks</topic><topic>Pricing</topic><topic>Slotted Aloha</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Altman, Eitan</creatorcontrib><creatorcontrib>El Azouzi, Rachid</creatorcontrib><creatorcontrib>Jiménez, Tania</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Altman, Eitan</au><au>El Azouzi, Rachid</au><au>Jiménez, Tania</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Slotted Aloha as a game with partial information</atitle><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle><date>2004-08-01</date><risdate>2004</risdate><volume>45</volume><issue>6</issue><spage>701</spage><epage>713</epage><pages>701-713</pages><issn>1389-1286</issn><eissn>1872-7069</eissn><abstract>This paper studies distributed choice of retransmission probabilities in slotted ALOHA. Both the cooperative team problem as well as the noncooperative game problem are considered. Unlike some previous work, we assume that mobiles do not know the number of backlogged packets at other nodes. A Markov chain analysis is used to obtain optimal and equilibrium retransmission probabilities and throughput. We then investigate the impact of adding retransmission costs (which may represent the disutility for power consumption) on the equilibrium and show how this pricing can be used to make the equilibrium throughput coincide with the optimal team throughput.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.comnet.2004.02.013</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1389-1286 |
| ispartof | Computer networks (Amsterdam, Netherlands : 1999), 2004-08, Vol.45 (6), p.701-713 |
| issn | 1389-1286 1872-7069 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_04553685v1 |
| source | Elsevier ScienceDirect Journals |
| subjects | Computer Science Equilibrium Game theory Markov analysis Markov chain Markov models Nash equilibrium Networks Pricing Slotted Aloha Studies |
| title | Slotted Aloha as a game with partial information |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T10%3A33%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Slotted%20Aloha%20as%20a%20game%20with%20partial%20information&rft.jtitle=Computer%20networks%20(Amsterdam,%20Netherlands%20:%201999)&rft.au=Altman,%20Eitan&rft.date=2004-08-01&rft.volume=45&rft.issue=6&rft.spage=701&rft.epage=713&rft.pages=701-713&rft.issn=1389-1286&rft.eissn=1872-7069&rft_id=info:doi/10.1016/j.comnet.2004.02.013&rft_dat=%3Cproquest_hal_p%3E57597574%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=199593136&rft_id=info:pmid/&rft_els_id=S1389128604000829&rfr_iscdi=true |