## A Probabilistic Model of the LMAC Protocol for Concurrent Wireless Sensor Networks

Publication: Research - peer-review › Article in proceedings – Annual report year: 2011

### Standard

**A Probabilistic Model of the LMAC Protocol for Concurrent Wireless Sensor Networks.** / Esparza, Luz Judith R; Zeng, Kebin; Nielsen, Bo Friis.

Publication: Research - peer-review › Article in proceedings – Annual report year: 2011

### Harvard

*2011 11th International Conference on Application of Concurrency to System Design (ACSD).*pp. 98-107. Uden navn, , 10.1109/ACSD.2011.20

### APA

*2011 11th International Conference on Application of Concurrency to System Design (ACSD).*(pp. 98-107). (Uden navn). 10.1109/ACSD.2011.20

### CBE

### MLA

*2011 11th International Conference on Application of Concurrency to System Design (ACSD).*2011. 98-107. (Uden navn). Available: 10.1109/ACSD.2011.20

### Vancouver

### Author

### Bibtex

}

### RIS

TY - GEN

T1 - A Probabilistic Model of the LMAC Protocol for Concurrent Wireless Sensor Networks

A1 - Esparza,Luz Judith R

A1 - Zeng,Kebin

A1 - Nielsen,Bo Friis

AU - Esparza,Luz Judith R

AU - Zeng,Kebin

AU - Nielsen,Bo Friis

PY - 2011

Y1 - 2011

N2 - We present a probabilistic model for the network setup phase of the Lightweight Medium Access Protocol (LMAC) for concurrent Wireless Sensor Networks. In the network setup phase, time slots are allocated to the individual sensors through resolution of successive collisions. The setup phase involving collisions should preferably be as short as possible for efficiency and energy consumption reasons. This concurrent stochastic process has inherent internal nondeterminism, and we model it using combinatorics. The setup phase is modeled by a discrete time Markov chain such that we can apply results from the theory of phase type distributions. Having obtained our model we are able to find optimal protocol parameters. We have simultaneously developed a simulation model, partly to verify our analytical derivations and partly to be able to deal with systems of excessively high order or stiff systems that might cause numerical challenges. Our abstracted model has a state space of limited size where the number of states are of the order binomial (n+r+1n), where n is number of sensors, and r is the maximum back off time. We have developed a tool, named LMAC analyzer, on the MATLAB platform to assist automatic generation and analysis of the model.

AB - We present a probabilistic model for the network setup phase of the Lightweight Medium Access Protocol (LMAC) for concurrent Wireless Sensor Networks. In the network setup phase, time slots are allocated to the individual sensors through resolution of successive collisions. The setup phase involving collisions should preferably be as short as possible for efficiency and energy consumption reasons. This concurrent stochastic process has inherent internal nondeterminism, and we model it using combinatorics. The setup phase is modeled by a discrete time Markov chain such that we can apply results from the theory of phase type distributions. Having obtained our model we are able to find optimal protocol parameters. We have simultaneously developed a simulation model, partly to verify our analytical derivations and partly to be able to deal with systems of excessively high order or stiff systems that might cause numerical challenges. Our abstracted model has a state space of limited size where the number of states are of the order binomial (n+r+1n), where n is number of sensors, and r is the maximum back off time. We have developed a tool, named LMAC analyzer, on the MATLAB platform to assist automatic generation and analysis of the model.

UR - http://conferences.ncl.ac.uk/pn-acsd-11/

U2 - 10.1109/ACSD.2011.20

DO - 10.1109/ACSD.2011.20

SN - 978-1-61284-974-4

BT - 2011 11th International Conference on Application of Concurrency to System Design (ACSD)

T2 - 2011 11th International Conference on Application of Concurrency to System Design (ACSD)

T3 - Uden navn

T3 - en_GB

SP - 98

EP - 107

ER -