On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
IEEE Transactions on Mobile Computing
A Clustered Wireless Sensor Network Model Based on Log-Distance Path Loss
CNSR '08 Proceedings of the Communication Networks and Services Research Conference
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Wireless Sensor and Actuator Networks: Technologies, Analysis and Design
Wireless Sensor and Actuator Networks: Technologies, Analysis and Design
A mathematical model for performance of IEEE 802.15.4 beacon-enabled mode
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Area throughput and energy consumption for clustered wireless sensor networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Optimal Distributed Detection in Clustered Wireless Sensor Networks
IEEE Transactions on Signal Processing - Part II
On reconfiguration in case of node mobility in clustered wireless sensor networks
IEEE Wireless Communications
IEEE Communications Magazine
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Collision-minimizing CSMA and its applications to wireless sensor networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.