TY - GEN
T1 - Adaptive duty cycling in sensor networks via Continuous Time Markov Chain modelling
AU - Chan, Ronald
AU - Zhang, Pengfei
AU - Zhang, Wenyu
AU - Nevat, Ido
AU - Valera, Alvin
AU - Tan, Hwee Xian
AU - Gautam, Natarajan
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/9/9
Y1 - 2015/9/9
N2 - The dynamic and unpredictable nature of energy harvesting sources that are used in wireless sensor networks necessitates the need for adaptive duty cycling techniques. Such adaptive control allows sensor nodes to achieve energy-neutrality, whereby both energy supply and demand are balanced. This paper proposes a framework enabling an adaptive duty cycling scheme for sensor networks that takes into account the operating duty cycle of the node, and application-level QoS requirements. We model the system as a Continuous Time Markov Chain (CTMC), and derive analytical expressions for key QoS metrics - such as latency, loss probability and power consumption. We then formulate and solve the optimal operating duty cycle as a non-linear optimization problem, using latency and loss probability as the constraints. Simulation results show that a Markovian duty cycling scheme can outperform periodic duty cycling schemes.
AB - The dynamic and unpredictable nature of energy harvesting sources that are used in wireless sensor networks necessitates the need for adaptive duty cycling techniques. Such adaptive control allows sensor nodes to achieve energy-neutrality, whereby both energy supply and demand are balanced. This paper proposes a framework enabling an adaptive duty cycling scheme for sensor networks that takes into account the operating duty cycle of the node, and application-level QoS requirements. We model the system as a Continuous Time Markov Chain (CTMC), and derive analytical expressions for key QoS metrics - such as latency, loss probability and power consumption. We then formulate and solve the optimal operating duty cycle as a non-linear optimization problem, using latency and loss probability as the constraints. Simulation results show that a Markovian duty cycling scheme can outperform periodic duty cycling schemes.
UR - http://www.scopus.com/inward/record.url?scp=84953717851&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84953717851&partnerID=8YFLogxK
U2 - 10.1109/ICC.2015.7249388
DO - 10.1109/ICC.2015.7249388
M3 - Conference contribution
AN - SCOPUS:84953717851
T3 - IEEE International Conference on Communications
SP - 6669
EP - 6674
BT - 2015 IEEE International Conference on Communications, ICC 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE International Conference on Communications, ICC 2015
Y2 - 8 June 2015 through 12 June 2015
ER -