Skip to main content
. 2009 Sep 28;9(10):7711–7732. doi: 10.3390/s91007711
N The set of all sensor nodes
Psq The set of all candidate paths by which data source node s can connect to the sink node q
S The set of all data source nodes
h The maximum among all the shortest path distances from each of the data source nodes to the sink node
M An arbitraryly large number
A Maximum link delay
B Maximum end-to-end delay
δp(n,k) The indicator function which is 1 if link (n, k) is on path p and 0 otherwise
dnk Euclidean distance between node n and node k
tdata Transmission time for transmitting a data packet
RTS Transmission time for an RTS frame
CTS Transmission time for a CTS frame
SIFS Short inter-frame space time
DIFS Distributed inter-frame space time
Θ Maximum propagation delay for transmitting data packets
λ Packet arrival rate
q The sink node
Rn The set of all possible transmission radii that node n can adopt, which is a set of discrete elements
en(rn) Energy consumption function of node n, which is a function of node n's transmission radius
Eidle Energy consumption per unit time when sensor nodes are operating in the idle mode
Average random back-off time
Average network allocation vector (NAV)
T Maximum number of times for retransmissions