| Campo DC | Valor | Idioma |
|---|
| dc.contributor.author | Brito, Lucas Soares de | - |
| dc.contributor.author | Carvalho, Marcelo Menezes de | - |
| dc.date.accessioned | 2022-06-02T13:45:53Z | - |
| dc.date.available | 2022-06-02T13:45:53Z | - |
| dc.date.issued | 2021-02-22 | - |
| dc.identifier.citation | BRITO, Lucas S.; CARVALHO, Marcelo M. Per-hop reversed packet auctions for cooperative routing in mobile wireless networks. IEEE Access, v. 9, p. 36308 - 36327, 2021. DOI: 10.1109/ACCESS.2021.3061258. Disponível em: https://ieeexplore.ieee.org/document/9360595. Acesso em: 02 jun. 2022. | pt_BR |
| dc.identifier.uri | https://repositorio.unb.br/handle/10482/43883 | - |
| dc.language.iso | Inglês | pt_BR |
| dc.publisher | IEEE | pt_BR |
| dc.rights | Acesso Aberto | pt_BR |
| dc.title | Per-hop reversed packet auctions for cooperative routing in mobile wireless networks | pt_BR |
| dc.type | Artigo | pt_BR |
| dc.subject.keyword | Comunicação cooperativa | pt_BR |
| dc.subject.keyword | Redes sem fio | pt_BR |
| dc.rights.license | This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/ | pt_BR |
| dc.identifier.doi | 10.1109/ACCESS.2021.3061258 | pt_BR |
| dc.description.abstract1 | Many applications could benefit from multi-hop communications through users’ mobile devices. A key issue is how to incentivize users to cooperate in both routing and relay of messages by sharing their device’s precious resources. Previous works on the subject have either tackled cooperation in the relay of messages alone or in both routing and relay functionalities. In the latter case, path selection is usually carried out at the destination node, which renders significant delays because the selected path needs to be conveyed all the way back to the source node before any data packet can be transmitted. This is certainly unsuitable in
mobile scenarios. This paper presents the performance of the ‘‘Tightness’’ strategy, which allows the routing and relaying of messages ‘‘on-the-go’’, via per-hop reversed packet auctions. At each hop, the sender asks for bids from potential relays according to a ‘‘budget’’ attached to the data packet, through which the auction winner gets paid and can pay for others in subsequent auctions. The auction winner is chosen not only based on bid value, but also on the estimated relay’s likelihood to deliver the packet to destination. Likewise, each potential relay makes a bid considering its own chances to deliver the packet to destination. A fine is also announced in every auction, that must be paid by all relays if the packet is not delivered to destination within a ‘‘deadline’’ expressed in number of hops. The performance of the Tightness strategy is evaluated for both static and mobile scenarios and compared to two baseline strategies according to different performance metrics. | pt_BR |
| dc.identifier.orcid | https://orcid.org/ 0000-0001-9897-912X | pt_BR |
| Aparece nas coleções: | Artigos publicados em periódicos e afins
|
