The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks (Articolo in rivista)

Type
Label
  • The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks (Articolo in rivista) (literal)
Anno
  • 2003-01-01T00:00:00+01:00 (literal)
Alternative label
  • Santi P., Blough D.M. (2003)
    The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Santi P., Blough D.M. (literal)
Pagina inizio
  • 25 (literal)
Pagina fine
  • 39 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#altreInformazioni
  • L’articolo, apparso in una delle riviste leader del settore delle reti wireless, e’ la versione riveduta, ampliata ed integrata di due articoli precedentemente apparsi in conferenze leader del settore (IEEE Conference on Dependable Systems and Networks e ACM MobiHoc). I risultati presentati nell’articolo apparso sulla rivista, o sulle precedenti pubblicazioni a congresso, sono citati in molti articoli apparsi negli ultimi due anni nelle principali riviste e conferenze del settore. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 2 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • In this paper, we analyze the critical transmitting range for connectivity in wireless ad hoc networks. More specifically, we consider the following problem: assume $n$ nodes, each capable of communicating with nodes within a radius of $r$, are randomly and uniformly distributed in a $d$-dimensional region with a side of length $l$; how large must the transmitting range $r$ be to ensure that the resulting network is connected with high probability? First, we consider this problem for stationary networks, and we provide tight upper and lower bounds on the critical transmitting range for one-dimensional networks, and non-tight bounds for two and three-dimensional networks. Due to the presence of the geometric parameter $l$ in the model, our results can be applied to dense {\em as well as sparse} ad hoc networks, contrary to existing theoretical results that apply only to dense networks. We also investigate several related questions through extensive simulations. First, we evaluate the relationship between the critical transmitting range and the minimum transmitting range that ensures formation of a connected component containing a large fraction (e.g. 90\%) of the nodes. Then, we consider the mobile version of the problem, in which nodes are allowed to move during a time interval and the value of $r$ ensuring connectedness for a given fraction of the interval must be determined. These results yield insight into how mobility affects connectivity (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • 1 IIT CNR, 2 Georgia Institute of Technology, Atlanta, USA (literal)
Titolo
  • The Critical Transmitting Range for Connectivity in Sparse Wireless 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