TY - JOUR
T1 - Are There So Many Sons per Node in a Wireless Sensor Network Data Aggregation Tree?
AU - DEE Group Author
AU - Macedo, Mário José Monteiro de
PY - 2009/1/1
Y1 - 2009/1/1
N2 - Some authors seem to believe that the average number of sons in a Wireless Sensor Network (WSN) data aggregation tree can be kept constant, even when the distances from the sink increase. But this assumption is impossible to stand in a dense and uniformly deployed network, as the number of nodes in a given level would grow exponentially, while the perimeter just grows linearly. In this letter, it is shown that the average number of sons of a given tree node is in average a quite low number, slightly higher than one, and that it tends to 1, as the distance to sink, or node depth, increases, both for 2-D, and for 3-D WSNs.
AB - Some authors seem to believe that the average number of sons in a Wireless Sensor Network (WSN) data aggregation tree can be kept constant, even when the distances from the sink increase. But this assumption is impossible to stand in a dense and uniformly deployed network, as the number of nodes in a given level would grow exponentially, while the perimeter just grows linearly. In this letter, it is shown that the average number of sons of a given tree node is in average a quite low number, slightly higher than one, and that it tends to 1, as the distance to sink, or node depth, increases, both for 2-D, and for 3-D WSNs.
U2 - 10.1109/LCOMM.2009.082003
DO - 10.1109/LCOMM.2009.082003
M3 - Article
VL - 13
SP - 245
EP - 247
JO - IEEE Communications Letters
JF - IEEE Communications Letters
SN - 1089-7798
IS - 4
ER -