cRedit-based and reputation retrieval system

The challenge of a mobile ad-hoc network (MANET) or hybrid wireless network (HWN) is that every node must rely on others to forward its messages, but selfish nodes might refuse to forward those messages or move to other subnetworks at any time, thus degrading network speed and retrieval efficiency....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of supercomputing 2021-09, Vol.77 (9), p.10184-10225
Hauptverfasser: Chuang, Yung-Ting, Tsai, Jia-Jun
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 10225
container_issue 9
container_start_page 10184
container_title The Journal of supercomputing
container_volume 77
creator Chuang, Yung-Ting
Tsai, Jia-Jun
description The challenge of a mobile ad-hoc network (MANET) or hybrid wireless network (HWN) is that every node must rely on others to forward its messages, but selfish nodes might refuse to forward those messages or move to other subnetworks at any time, thus degrading network speed and retrieval efficiency. This paper presents a system called “cRedit-based and Reputation Retrieval system” that employs a distributed message transmission protocol to avoid censorship problems, forwarding and reliable routing algorithms to ensure reliable message routing, reputation and credit algorithms to encourage greater cooperation incentives, location and refresh algorithms to deal with nodes’ limited view even in high-churn network, and a protection algorithm to address the problem of selfish nodes. A series of experiments confirmed the system’s effectiveness in achieving superior network scalability, high retrieval rates, low transmission costs, and mobility resilience in hybrid wireless networks.
doi_str_mv 10.1007/s11227-021-03675-x
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2561939776</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2561939776</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-19726239c066fa230a78809055e761142570dd63e05c0fbe135d81f443280eda3</originalsourceid><addsrcrecordid>eNp9kEtLAzEUhYMoWKt_wFXBrdF7c_OYLKX4goIgug7pJCNT2pmapFL_vaMjuHN1z-J858LH2DnCFQKY64wohOEgkANpo_j-gE1QGeIgK3nIJmAF8EpJccxOcl4BgCRDE3ZZP8fQFr70OYaZ78Isxe2u-NL23RBLauOHX8_yZy5xc8qOGr_O8ez3Ttnr3e3L_IEvnu4f5zcLXhPawtEaoQXZGrRuvCDwpqrAglLRaEQplIEQNEVQNTTLiKRChY2UJCqIwdOUXYy729S_72IubtXvUje8dEJptGSN0UNLjK069Tmn2Lhtajc-fToE923FjVbcYMX9WHH7AaIRykO5e4vpb_of6guWAGMx</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2561939776</pqid></control><display><type>article</type><title>cRedit-based and reputation retrieval system</title><source>Springer Nature - Complete Springer Journals</source><creator>Chuang, Yung-Ting ; Tsai, Jia-Jun</creator><creatorcontrib>Chuang, Yung-Ting ; Tsai, Jia-Jun</creatorcontrib><description>The challenge of a mobile ad-hoc network (MANET) or hybrid wireless network (HWN) is that every node must rely on others to forward its messages, but selfish nodes might refuse to forward those messages or move to other subnetworks at any time, thus degrading network speed and retrieval efficiency. This paper presents a system called “cRedit-based and Reputation Retrieval system” that employs a distributed message transmission protocol to avoid censorship problems, forwarding and reliable routing algorithms to ensure reliable message routing, reputation and credit algorithms to encourage greater cooperation incentives, location and refresh algorithms to deal with nodes’ limited view even in high-churn network, and a protection algorithm to address the problem of selfish nodes. A series of experiments confirmed the system’s effectiveness in achieving superior network scalability, high retrieval rates, low transmission costs, and mobility resilience in hybrid wireless networks.</description><identifier>ISSN: 0920-8542</identifier><identifier>EISSN: 1573-0484</identifier><identifier>DOI: 10.1007/s11227-021-03675-x</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Censorship ; Compilers ; Computer Science ; Incentives ; Interpreters ; Messages ; Mobile ad hoc networks ; Nodes ; Processor Architectures ; Programming Languages ; Reputations ; Retrieval ; Wireless networks</subject><ispartof>The Journal of supercomputing, 2021-09, Vol.77 (9), p.10184-10225</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021</rights><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-19726239c066fa230a78809055e761142570dd63e05c0fbe135d81f443280eda3</citedby><cites>FETCH-LOGICAL-c319t-19726239c066fa230a78809055e761142570dd63e05c0fbe135d81f443280eda3</cites><orcidid>0000-0002-5164-9171</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11227-021-03675-x$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11227-021-03675-x$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27915,27916,41479,42548,51310</link.rule.ids></links><search><creatorcontrib>Chuang, Yung-Ting</creatorcontrib><creatorcontrib>Tsai, Jia-Jun</creatorcontrib><title>cRedit-based and reputation retrieval system</title><title>The Journal of supercomputing</title><addtitle>J Supercomput</addtitle><description>The challenge of a mobile ad-hoc network (MANET) or hybrid wireless network (HWN) is that every node must rely on others to forward its messages, but selfish nodes might refuse to forward those messages or move to other subnetworks at any time, thus degrading network speed and retrieval efficiency. This paper presents a system called “cRedit-based and Reputation Retrieval system” that employs a distributed message transmission protocol to avoid censorship problems, forwarding and reliable routing algorithms to ensure reliable message routing, reputation and credit algorithms to encourage greater cooperation incentives, location and refresh algorithms to deal with nodes’ limited view even in high-churn network, and a protection algorithm to address the problem of selfish nodes. A series of experiments confirmed the system’s effectiveness in achieving superior network scalability, high retrieval rates, low transmission costs, and mobility resilience in hybrid wireless networks.</description><subject>Algorithms</subject><subject>Censorship</subject><subject>Compilers</subject><subject>Computer Science</subject><subject>Incentives</subject><subject>Interpreters</subject><subject>Messages</subject><subject>Mobile ad hoc networks</subject><subject>Nodes</subject><subject>Processor Architectures</subject><subject>Programming Languages</subject><subject>Reputations</subject><subject>Retrieval</subject><subject>Wireless networks</subject><issn>0920-8542</issn><issn>1573-0484</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLAzEUhYMoWKt_wFXBrdF7c_OYLKX4goIgug7pJCNT2pmapFL_vaMjuHN1z-J858LH2DnCFQKY64wohOEgkANpo_j-gE1QGeIgK3nIJmAF8EpJccxOcl4BgCRDE3ZZP8fQFr70OYaZ78Isxe2u-NL23RBLauOHX8_yZy5xc8qOGr_O8ez3Ttnr3e3L_IEvnu4f5zcLXhPawtEaoQXZGrRuvCDwpqrAglLRaEQplIEQNEVQNTTLiKRChY2UJCqIwdOUXYy729S_72IubtXvUje8dEJptGSN0UNLjK069Tmn2Lhtajc-fToE923FjVbcYMX9WHH7AaIRykO5e4vpb_of6guWAGMx</recordid><startdate>20210901</startdate><enddate>20210901</enddate><creator>Chuang, Yung-Ting</creator><creator>Tsai, Jia-Jun</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-5164-9171</orcidid></search><sort><creationdate>20210901</creationdate><title>cRedit-based and reputation retrieval system</title><author>Chuang, Yung-Ting ; Tsai, Jia-Jun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-19726239c066fa230a78809055e761142570dd63e05c0fbe135d81f443280eda3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Censorship</topic><topic>Compilers</topic><topic>Computer Science</topic><topic>Incentives</topic><topic>Interpreters</topic><topic>Messages</topic><topic>Mobile ad hoc networks</topic><topic>Nodes</topic><topic>Processor Architectures</topic><topic>Programming Languages</topic><topic>Reputations</topic><topic>Retrieval</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chuang, Yung-Ting</creatorcontrib><creatorcontrib>Tsai, Jia-Jun</creatorcontrib><collection>CrossRef</collection><jtitle>The Journal of supercomputing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chuang, Yung-Ting</au><au>Tsai, Jia-Jun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>cRedit-based and reputation retrieval system</atitle><jtitle>The Journal of supercomputing</jtitle><stitle>J Supercomput</stitle><date>2021-09-01</date><risdate>2021</risdate><volume>77</volume><issue>9</issue><spage>10184</spage><epage>10225</epage><pages>10184-10225</pages><issn>0920-8542</issn><eissn>1573-0484</eissn><abstract>The challenge of a mobile ad-hoc network (MANET) or hybrid wireless network (HWN) is that every node must rely on others to forward its messages, but selfish nodes might refuse to forward those messages or move to other subnetworks at any time, thus degrading network speed and retrieval efficiency. This paper presents a system called “cRedit-based and Reputation Retrieval system” that employs a distributed message transmission protocol to avoid censorship problems, forwarding and reliable routing algorithms to ensure reliable message routing, reputation and credit algorithms to encourage greater cooperation incentives, location and refresh algorithms to deal with nodes’ limited view even in high-churn network, and a protection algorithm to address the problem of selfish nodes. A series of experiments confirmed the system’s effectiveness in achieving superior network scalability, high retrieval rates, low transmission costs, and mobility resilience in hybrid wireless networks.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11227-021-03675-x</doi><tpages>42</tpages><orcidid>https://orcid.org/0000-0002-5164-9171</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0920-8542
ispartof The Journal of supercomputing, 2021-09, Vol.77 (9), p.10184-10225
issn 0920-8542
1573-0484
language eng
recordid cdi_proquest_journals_2561939776
source Springer Nature - Complete Springer Journals
subjects Algorithms
Censorship
Compilers
Computer Science
Incentives
Interpreters
Messages
Mobile ad hoc networks
Nodes
Processor Architectures
Programming Languages
Reputations
Retrieval
Wireless networks
title cRedit-based and reputation retrieval system
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T03%3A51%3A03IST&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=cRedit-based%20and%20reputation%20retrieval%20system&rft.jtitle=The%20Journal%20of%20supercomputing&rft.au=Chuang,%20Yung-Ting&rft.date=2021-09-01&rft.volume=77&rft.issue=9&rft.spage=10184&rft.epage=10225&rft.pages=10184-10225&rft.issn=0920-8542&rft.eissn=1573-0484&rft_id=info:doi/10.1007/s11227-021-03675-x&rft_dat=%3Cproquest_cross%3E2561939776%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=2561939776&rft_id=info:pmid/&rfr_iscdi=true