Tree-forming schemes for overload control in Wireless Sensor Networks

Node placement in Wireless Sensor Networks (WSNs) is frequently redundant and massive. Massive and dense deployments require efficient and effective, topology control algorithms in order to reduce the number of active nodes and ease the transportation of data from sources to sinks. Tree-forming is a common strategy in topology control algorithms that can be employed for such purpose. The most common tree-forming scheme, is shared, core-based tree, which initiates from the sink. In this work, we study how tree-forming schemes that initiate from sources can affect the performance of congestion/overload control algorithms. Specifically, we study source-based routing trees in comparison with shared-, core-based trees, under traffic and resource congestion control algorithms.