1 resultado para ELSE
em Boston University Digital Common
Filtro por publicador
- Academic Archive On-line (Karlstad University; Sweden) (1)
- Academic Archive On-line (Stockholm University; Sweden) (1)
- Adam Mickiewicz University Repository (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (8)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Aquatic Commons (10)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (3)
- Archive of European Integration (11)
- Aston University Research Archive (25)
- B-Digital - Universidade Fernando Pessoa - Portugal (1)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (5)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (10)
- Blue Tiger Commons - Lincoln University - USA (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (21)
- Boston University Digital Common (1)
- Brock University, Canada (5)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- CaltechTHESIS (2)
- Cambridge University Engineering Department Publications Database (1)
- CentAUR: Central Archive University of Reading - UK (35)
- Center for Jewish History Digital Collections (20)
- Central European University - Research Support Scheme (2)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (6)
- Cochin University of Science & Technology (CUSAT), India (2)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- CUNY Academic Works (2)
- Dalarna University College Electronic Archive (11)
- Deakin Research Online - Australia (56)
- Digital Archives@Colby (4)
- Digital Commons - Michigan Tech (2)
- Digital Commons @ Winthrop University (3)
- Digital Commons at Florida International University (2)
- Digital Peer Publishing (3)
- DigitalCommons@The Texas Medical Center (4)
- DigitalCommons@University of Nebraska - Lincoln (4)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (349)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (4)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- Glasgow Theses Service (2)
- Harvard University (1)
- Helda - Digital Repository of University of Helsinki (9)
- Indian Institute of Science - Bangalore - Índia (8)
- Instituto Politécnico de Castelo Branco - Portugal (1)
- Instituto Politécnico de Leiria (1)
- Instituto Politécnico de Viseu (1)
- Instituto Politécnico do Porto, Portugal (1)
- Instituto Superior de Psicologia Aplicada - Lisboa (2)
- Memoria Académica - FaHCE, UNLP - Argentina (54)
- Memorial University Research Repository (1)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (2)
- Nottingham eTheses (4)
- Portal de Revistas Científicas Complutenses - Espanha (5)
- Publishing Network for Geoscientific & Environmental Data (21)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (35)
- Queensland University of Technology - ePrints Archive (62)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositorio Académico de la Universidad Nacional de Costa Rica (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (11)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional da Universidade Tecnológica Federal do Paraná (RIUT) (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (36)
- Repositorio Institucional Universidad EAFIT - Medelin - Colombia (1)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- Scientific Open-access Literature Archive and Repository (1)
- South Carolina State Documents Depository (1)
- Universidad de Alicante (3)
- Universidad del Rosario, Colombia (5)
- Universidad Politécnica de Madrid (9)
- Universidade de Lisboa - Repositório Aberto (4)
- Universidade Federal do Pará (3)
- Universidade Federal do Rio Grande do Norte (UFRN) (6)
- Universidade Metodista de São Paulo (5)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (2)
- Université de Montréal, Canada (11)
- University of Connecticut - USA (2)
- University of Michigan (20)
- University of Queensland eSpace - Australia (6)
- University of Southampton, United Kingdom (8)
- University of Washington (3)
- Worcester Research and Publications - Worcester Research and Publications - UK (2)
Resumo:
Routing protocols for ad-hoc networks assume that the nodes forming the network are either under a single authority, or else that they would be altruistically forwarding data for other nodes with no expectation of a return. These assumptions are unrealistic since in ad-hoc networks, nodes are likely to be autonomous and rational (selfish), and thus unwilling to help unless they have an incentive to do so. Providing such incentives is an important aspect that should be considered when designing ad-hoc routing protocols. In this paper, we propose a dynamic, decentralized routing protocol for ad-hoc networks that provides incentives in the form of payments to intermediate nodes used to forward data for others. In our Constrained Selfish Routing (CSR) protocol, game-theoretic approaches are used to calculate payments (incentives) that ensure both the truthfulness of participating nodes and the fairness of the CSR protocol. We show through simulations that CSR is an energy efficient protocol and that it provides lower communication overhead in the best and average cases compared to existing approaches.