Event Driven Duty Cycling with Reinforcement Learning and Monte Carlo Technique for Wireless Network

Algorithm 1

Selection of parent node for wake-up.

	Input: Node-u, NB(u) and Node-, NB()
	Output: p(u),p()
	pc(u) ← NB(u), pc()←NB();
	for ∀i ∈ NB(u) do
	sch(u).p(u) ← min{d}, wk(p(u)) ← sch(u)·wk(u) + 1;
	pc()←NB() − NB(p())∪NB()
	for ∀j ∈ pc() do
	if j ∈ NB(k), |sch(k)| > 1 & k ∈ V then
	pc() ← pc() − {j};
	if (j′) ≤ (j) then
	sch() p() ← j;
	wk(p(u)) ← sch(u)· wk(u) + 1;