COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks (Rapporti tecnici, manuali, carte geologiche e tematiche e prodotti multimediali)

Type
Label
  • COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks (Rapporti tecnici, manuali, carte geologiche e tematiche e prodotti multimediali) (literal)
Anno
  • 2004-01-01T00:00:00+01:00 (literal)
Alternative label
  • Eidenbenz, Stephan; Santi, Paolo (2004)
    COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Eidenbenz, Stephan; Santi, Paolo (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • Technical report TR-01/2004 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • In this paper, we consider the problem of establishing a route and sending packets between a source/destination pair in ad hoc networks composed of rational selfish nodes,whose purpose is to maximize their own utility. In order to motivate nodes to follow the protocol specification, we use side payments that are made to the forwarding nodes. Our goal is to design a fully distributed algorithm such that: (i)a node is alwais better off participating in the protocol execution (individual rationality), and (ii) a node is always better off behaving according to the protocol specification (truthfulness). Furthemore, we require that messages are routed along the most energy-efficienth path. We introduce the COMMIT protocol for individually rational, truthful, and energy efficient routing in ad hoc networks. To the best of our knowledge, this is the first ad hoc routing protocol with these features. COMMIT exchanges at most O((|M|^2)*d) messages to find the optimal route, where |M|<= n-2, n is the number of network nodes, and d is the maximum node degree in the communication graph. As anaside, our work demonstrates the advantage of using a cross-layer approach to solving problems: leveraging the exitence of an underlyng topology control, and to reduce its message complessity. On the other hand, our investigation of the routing problem in presence of selfish nodes disclosed a new metric under which topology control protocols can be evaluated: the cost of cooperation. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#supporto
  • Altro (literal)
Titolo
  • COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Insieme di parole chiave di
data.CNR.it