Bounds on hop distance in greedy routing approach in wireless ad hoc networks (Articolo in rivista)

Type
Label
  • Bounds on hop distance in greedy routing approach in wireless ad hoc networks (Articolo in rivista) (literal)
Anno
  • 2006-01-01T00:00:00+01:00 (literal)
Alternative label
  • De S.; Caruso A.; Chaira T.; Chessa S. (2006)
    Bounds on hop distance in greedy routing approach in wireless ad hoc networks
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • De S.; Caruso A.; Chaira T.; Chessa S. (literal)
Pagina inizio
  • 131 (literal)
Pagina fine
  • 140 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 14 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • In: International Journal on Wireless and Mobile Computing, vol. 14 (2) pp. 131-140. Inderscience, 2006. (literal)
Titolo
  • Bounds on hop distance in greedy routing approach in wireless ad hoc networks (literal)
Abstract
  • Wireless ad hoc networks are generally characterised by random node locations and multi-hop routes. A quantitative knowledge of the relation between hop count and Euclidean distance could provide a better understanding of important network parameters such as end-to-end delay, power consumption along the route, and node localisation. In this paper, we present an analytic approach to capture the statistics on hop count for a given source-to-destination Euclidean distance in a greedy routing approach. We also show that, for a given hop count, the bounds on Euclidean distance can be computed from the distribution characteristics of per-hop progress. (literal)
Prodotto di
Insieme di parole chiave

Incoming links:


Prodotto
Insieme di parole chiave di
data.CNR.it