In this paper, we propose a Markov chain-based analytical framework for modeling the behavior of the medium access control (MAC) protocol in IEEE 802.15.4 wireless networks. Two scenarios are of interest. First, we consider networks where the (sensor) nodes communicate directly to the network coordinator (the final sink). Then, we consider cluster-tree (CT) scenarios where the sources communicate to the coordinator through a series of intermediate relay, which forward the received packets and do not generate traffic on their own. In both scenarios, no acknowledgment messages are used to confirm successful data packet deliveries and communications are beaconed (i.e., they rely on synchronization packets denoted as ``beacons''). In all cases, our focus is on networks where the sources and the relays have finite queues (denoted as buffers) to store data packets. The network performance is evaluated in terms of aggregate network throughput and packet delivery delay. The performance predicted by the proposed analytical framework is in very good agreement with realistic ns-2 simulation results.
Markov chain-based performance analysis of multihop IEEE 802.15.4 wireless networks / M., Martalo'; S., Busanelli; Ferrari, Gianluigi. - In: PERFORMANCE EVALUATION. - ISSN 0166-5316. - 66:(2009), pp. 722-741. [10.1016/j.peva.2009.08.011]
Markov chain-based performance analysis of multihop IEEE 802.15.4 wireless networks
FERRARI, Gianluigi
2009-01-01
Abstract
In this paper, we propose a Markov chain-based analytical framework for modeling the behavior of the medium access control (MAC) protocol in IEEE 802.15.4 wireless networks. Two scenarios are of interest. First, we consider networks where the (sensor) nodes communicate directly to the network coordinator (the final sink). Then, we consider cluster-tree (CT) scenarios where the sources communicate to the coordinator through a series of intermediate relay, which forward the received packets and do not generate traffic on their own. In both scenarios, no acknowledgment messages are used to confirm successful data packet deliveries and communications are beaconed (i.e., they rely on synchronization packets denoted as ``beacons''). In all cases, our focus is on networks where the sources and the relays have finite queues (denoted as buffers) to store data packets. The network performance is evaluated in terms of aggregate network throughput and packet delivery delay. The performance predicted by the proposed analytical framework is in very good agreement with realistic ns-2 simulation results.File | Dimensione | Formato | |
---|---|---|---|
MaBuFe_PEVA09.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
3.27 MB
Formato
Adobe PDF
|
3.27 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.