Unreliable sensor grids: coverage, connectivity and diameter

We consider an unreliable wireless sensor grid-network with n nodes placed in a square of unit area. We are interested in the coverage of the region and the connectivity of the network. We first show that the necessary and sufficient conditions for the random grid network to cover the unit square re...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) Jg. 2; S. 1073 - 1083 vol.2
Hauptverfasser: Shakkottai, S., Srikant, R., Shroff, N.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 2003
Schlagworte:
Intelligent sensors
Large-scale systems
Monitoring
Queueing analysis
Routing
Sensor systems
Stochastic processes
Sufficient conditions
Surges
Wireless sensor networks
ISBN:9780780377523, 0780377524
ISSN:0743-166X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider an unreliable wireless sensor grid-network with n nodes placed in a square of unit area. We are interested in the coverage of the region and the connectivity of the network. We first show that the necessary and sufficient conditions for the random grid network to cover the unit square region as well as ensure that the active nodes are connected are of the form p(n)r 2 (n) ~ log(n)/n, where r(n) is the transmission radius of each node and p(n) is the probability that a node is "active" (not failed). This result indicates that, when n is large, even if each node is highly unreliable and the transmission power is small, we can still maintain connectivity with coverage. We also show that the diameter of the random grid (i.e., the maximum number of hops required to travel from any active node to another) is of the order √{n/log(n)}. Finally, we derive a sufficient condition for connectivity of the active nodes (without necessarily having coverage). If the node success probability p(n) is small enough, we show that connectivity does not imply coverage.
ISBN:9780780377523
0780377524
ISSN:0743-166X
DOI:10.1109/INFCOM.2003.1208944