Critical-Path Aware Scheduling for Latency Efficient Broadcast in Duty-Cycled Wireless Sensor Networks

Table 2

Notation for the critical-path aware broadcast scheduling.

	communication graph of a network
	: set of nodes, : set of edges
	source node of the network
	length of a working period
	1-hop neighbors of node in
	set of intended receivers with level of a transmission from node
	transmitting schedule of node
	active slot of node ()
	level of node , i.e. minimum latency to receive a message from
	latency-ahead value of node
	parent node of node in
	receiving time of node