Network nodes play a game – a routing alternative in multihop ad-hoc environments
A key aspect to consider in delivering data from one node to another in a communication network is finding a suitable path through the relaying nodes, i.e., routing. The standard routing solutions work well in the reliable networks, but do not achieve acceptable performance in low-power, noisy, and...
Gespeichert in:
Veröffentlicht in: | Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2017-07, Vol.122, p.96-104 |
---|---|
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 | 104 |
---|---|
container_issue | |
container_start_page | 96 |
container_title | Computer networks (Amsterdam, Netherlands : 1999) |
container_volume | 122 |
creator | Morawski, Michał Ignaciuk, Przemysław |
description | A key aspect to consider in delivering data from one node to another in a communication network is finding a suitable path through the relaying nodes, i.e., routing. The standard routing solutions work well in the reliable networks, but do not achieve acceptable performance in low-power, noisy, and dynamic environments due to the high overhead associated with establishing a consistent view of the network. The paper presents a different solution to the problem of data delivery based on an evolutionary game between the network nodes. In the proposed approach, instead of forming a fixed path, the nodes take independent forwarding decisions. The set of nodes participating in the data transfer self-adjusts to the current networking conditions by playing the game, without involvement of a control plane. As a result, a low-overhead alternative to routing is obtained. The proposed solution is particularly well suited for the ad-hoc wireless networks serving time-sensitive data, e.g., it can provide an efficient communication platform for low-cost networked control systems. |
doi_str_mv | 10.1016/j.comnet.2017.04.031 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1927144063</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1389128617301469</els_id><sourcerecordid>1927144063</sourcerecordid><originalsourceid>FETCH-LOGICAL-c334t-7621e8fe623ba04502022159ce11e0461307c945e61df5e45c6c94204bdf6fd03</originalsourceid><addsrcrecordid>eNp9kE1OwzAQhSMEEqVwAxaWWCeMHcdJNkgI8SdVsADWlutMWofELrZb1B134IachFRlzWreSO89zXxJck4ho0DFZZdpN1iMGQNaZsAzyOlBMqFVydISRH046ryqU8oqcZychNABAOesmiQvTxg_nX8n1jUYyKpXW6LIQg1Ifr6-R-ndOhq7IKqP6K2KZoPEWDKs-2iWbkVUky6dJmg3xjs7oI3hNDlqVR_w7G9Ok7e729ebh3T2fP94cz1LdZ7zmJaCUaxaFCyfK-AFMGCMFrVGShG4oDmUuuYFCtq0BfJCi3FlwOdNK9oG8mlyse9defexxhBl59bjjX2QtGYl5RxEPrr43qW9C8FjK1feDMpvJQW5wyc7uccnd_gkcDniG2NX-xiOH2wMehm0QauxMR51lI0z_xf8Avsher0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1927144063</pqid></control><display><type>article</type><title>Network nodes play a game – a routing alternative in multihop ad-hoc environments</title><source>Elsevier ScienceDirect Journals</source><creator>Morawski, Michał ; Ignaciuk, Przemysław</creator><creatorcontrib>Morawski, Michał ; Ignaciuk, Przemysław</creatorcontrib><description>A key aspect to consider in delivering data from one node to another in a communication network is finding a suitable path through the relaying nodes, i.e., routing. The standard routing solutions work well in the reliable networks, but do not achieve acceptable performance in low-power, noisy, and dynamic environments due to the high overhead associated with establishing a consistent view of the network. The paper presents a different solution to the problem of data delivery based on an evolutionary game between the network nodes. In the proposed approach, instead of forming a fixed path, the nodes take independent forwarding decisions. The set of nodes participating in the data transfer self-adjusts to the current networking conditions by playing the game, without involvement of a control plane. As a result, a low-overhead alternative to routing is obtained. The proposed solution is particularly well suited for the ad-hoc wireless networks serving time-sensitive data, e.g., it can provide an efficient communication platform for low-cost networked control systems.</description><identifier>ISSN: 1389-1286</identifier><identifier>EISSN: 1872-7069</identifier><identifier>DOI: 10.1016/j.comnet.2017.04.031</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Ad hoc networks ; Communications networks ; Computer networks ; Control systems ; Data transfer (computers) ; Game theory ; Games ; Relaying ; Routing ; Routing (telecommunications) ; Traffic control ; Wireless networks</subject><ispartof>Computer networks (Amsterdam, Netherlands : 1999), 2017-07, Vol.122, p.96-104</ispartof><rights>2017 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Jul 20, 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c334t-7621e8fe623ba04502022159ce11e0461307c945e61df5e45c6c94204bdf6fd03</citedby><cites>FETCH-LOGICAL-c334t-7621e8fe623ba04502022159ce11e0461307c945e61df5e45c6c94204bdf6fd03</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S1389128617301469$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids></links><search><creatorcontrib>Morawski, Michał</creatorcontrib><creatorcontrib>Ignaciuk, Przemysław</creatorcontrib><title>Network nodes play a game – a routing alternative in multihop ad-hoc environments</title><title>Computer networks (Amsterdam, Netherlands : 1999)</title><description>A key aspect to consider in delivering data from one node to another in a communication network is finding a suitable path through the relaying nodes, i.e., routing. The standard routing solutions work well in the reliable networks, but do not achieve acceptable performance in low-power, noisy, and dynamic environments due to the high overhead associated with establishing a consistent view of the network. The paper presents a different solution to the problem of data delivery based on an evolutionary game between the network nodes. In the proposed approach, instead of forming a fixed path, the nodes take independent forwarding decisions. The set of nodes participating in the data transfer self-adjusts to the current networking conditions by playing the game, without involvement of a control plane. As a result, a low-overhead alternative to routing is obtained. The proposed solution is particularly well suited for the ad-hoc wireless networks serving time-sensitive data, e.g., it can provide an efficient communication platform for low-cost networked control systems.</description><subject>Ad hoc networks</subject><subject>Communications networks</subject><subject>Computer networks</subject><subject>Control systems</subject><subject>Data transfer (computers)</subject><subject>Game theory</subject><subject>Games</subject><subject>Relaying</subject><subject>Routing</subject><subject>Routing (telecommunications)</subject><subject>Traffic control</subject><subject>Wireless networks</subject><issn>1389-1286</issn><issn>1872-7069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNp9kE1OwzAQhSMEEqVwAxaWWCeMHcdJNkgI8SdVsADWlutMWofELrZb1B134IachFRlzWreSO89zXxJck4ho0DFZZdpN1iMGQNaZsAzyOlBMqFVydISRH046ryqU8oqcZychNABAOesmiQvTxg_nX8n1jUYyKpXW6LIQg1Ifr6-R-ndOhq7IKqP6K2KZoPEWDKs-2iWbkVUky6dJmg3xjs7oI3hNDlqVR_w7G9Ok7e729ebh3T2fP94cz1LdZ7zmJaCUaxaFCyfK-AFMGCMFrVGShG4oDmUuuYFCtq0BfJCi3FlwOdNK9oG8mlyse9defexxhBl59bjjX2QtGYl5RxEPrr43qW9C8FjK1feDMpvJQW5wyc7uccnd_gkcDniG2NX-xiOH2wMehm0QauxMR51lI0z_xf8Avsher0</recordid><startdate>20170720</startdate><enddate>20170720</enddate><creator>Morawski, Michał</creator><creator>Ignaciuk, Przemysław</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</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></search><sort><creationdate>20170720</creationdate><title>Network nodes play a game – a routing alternative in multihop ad-hoc environments</title><author>Morawski, Michał ; Ignaciuk, Przemysław</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c334t-7621e8fe623ba04502022159ce11e0461307c945e61df5e45c6c94204bdf6fd03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Ad hoc networks</topic><topic>Communications networks</topic><topic>Computer networks</topic><topic>Control systems</topic><topic>Data transfer (computers)</topic><topic>Game theory</topic><topic>Games</topic><topic>Relaying</topic><topic>Routing</topic><topic>Routing (telecommunications)</topic><topic>Traffic control</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Morawski, Michał</creatorcontrib><creatorcontrib>Ignaciuk, Przemysław</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><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Morawski, Michał</au><au>Ignaciuk, Przemysław</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Network nodes play a game – a routing alternative in multihop ad-hoc environments</atitle><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle><date>2017-07-20</date><risdate>2017</risdate><volume>122</volume><spage>96</spage><epage>104</epage><pages>96-104</pages><issn>1389-1286</issn><eissn>1872-7069</eissn><abstract>A key aspect to consider in delivering data from one node to another in a communication network is finding a suitable path through the relaying nodes, i.e., routing. The standard routing solutions work well in the reliable networks, but do not achieve acceptable performance in low-power, noisy, and dynamic environments due to the high overhead associated with establishing a consistent view of the network. The paper presents a different solution to the problem of data delivery based on an evolutionary game between the network nodes. In the proposed approach, instead of forming a fixed path, the nodes take independent forwarding decisions. The set of nodes participating in the data transfer self-adjusts to the current networking conditions by playing the game, without involvement of a control plane. As a result, a low-overhead alternative to routing is obtained. The proposed solution is particularly well suited for the ad-hoc wireless networks serving time-sensitive data, e.g., it can provide an efficient communication platform for low-cost networked control systems.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.comnet.2017.04.031</doi><tpages>9</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1389-1286 |
ispartof | Computer networks (Amsterdam, Netherlands : 1999), 2017-07, Vol.122, p.96-104 |
issn | 1389-1286 1872-7069 |
language | eng |
recordid | cdi_proquest_journals_1927144063 |
source | Elsevier ScienceDirect Journals |
subjects | Ad hoc networks Communications networks Computer networks Control systems Data transfer (computers) Game theory Games Relaying Routing Routing (telecommunications) Traffic control Wireless networks |
title | Network nodes play a game – a routing alternative in multihop ad-hoc environments |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T06%3A04%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Network%20nodes%20play%20a%20game%20%E2%80%93%20a%20routing%20alternative%20in%20multihop%20ad-hoc%20environments&rft.jtitle=Computer%20networks%20(Amsterdam,%20Netherlands%20:%201999)&rft.au=Morawski,%20Micha%C5%82&rft.date=2017-07-20&rft.volume=122&rft.spage=96&rft.epage=104&rft.pages=96-104&rft.issn=1389-1286&rft.eissn=1872-7069&rft_id=info:doi/10.1016/j.comnet.2017.04.031&rft_dat=%3Cproquest_cross%3E1927144063%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1927144063&rft_id=info:pmid/&rft_els_id=S1389128617301469&rfr_iscdi=true |