In this paper we present a mathematical model to study a multi-sink Wireless Sensor Network (WSN). Both sensors and sinks are assumed to be Poisson distributed in a given finite domain. Sinks send periodic queries, and each sensor transmits its sample to a sink, selected among those that are audible, thus creating a clustered network. Our aim is to describe how the Area Throughput, defined as the amount of samples per unit of time successfully transmitted to the sinks from the given area, depends on the density of sensors and the query interval. We jointly account for radio channel, Physical (PHY), Medium Access Control (MAC) and Network (NET) aspects (i.e., different network topologies, packet collisions, power losses and radio channel behaviour), and we compare the performance of two different simple data aggregation strategies. Performance is evaluated by varying the traffic offered to the network (i.e., the density of sensors deployed), the packet size, and, by considering IEEE 802.15.4 as a reference case, the number of Guaranteed Time Slots allocated, and the Superframe Order. The mathematical model shows how the Area Throughput can be optimized.

Maximizing Area Throughput in Clustered Wireless Sensor Networks

VERDONE, ROBERTO;FABBRI, FLAVIO;BURATTI, CHIARA
2010

Abstract

In this paper we present a mathematical model to study a multi-sink Wireless Sensor Network (WSN). Both sensors and sinks are assumed to be Poisson distributed in a given finite domain. Sinks send periodic queries, and each sensor transmits its sample to a sink, selected among those that are audible, thus creating a clustered network. Our aim is to describe how the Area Throughput, defined as the amount of samples per unit of time successfully transmitted to the sinks from the given area, depends on the density of sensors and the query interval. We jointly account for radio channel, Physical (PHY), Medium Access Control (MAC) and Network (NET) aspects (i.e., different network topologies, packet collisions, power losses and radio channel behaviour), and we compare the performance of two different simple data aggregation strategies. Performance is evaluated by varying the traffic offered to the network (i.e., the density of sensors deployed), the packet size, and, by considering IEEE 802.15.4 as a reference case, the number of Guaranteed Time Slots allocated, and the Superframe Order. The mathematical model shows how the Area Throughput can be optimized.
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/110927
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 16
  • ???jsp.display-item.citation.isi??? 15
social impact