A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs

Table 2

The set of notations used in Section 6.

Notation	Description
	The time slot at which th node enters SS state.
	Number of time slots between times and
	The probability that only one node transmits a REQ message in a slot after and the message is received successfully.
	The probability of a node entering SS state, in a round (frame).
	The probability of a node with ID 1 entering SS state, in a round (the subscript 1 omitted from sake of clarity).
	Minimum value of .
	The probability of node with ID 1 entering SS state at slot in a round.
	.
	The number of 1’s in row of matrix .
	The number of 1’s in column of matrix , excluding first row.
	The transition probability from state to state of DTMC, presented in Section 6.
	The number of rounds required to reach state “” in DTMC, starting from state “.”