The only tree-based data gathering algorithm we have come across for WMSNs is a shortest path-based spanning tree algorithm  wherein each sensor node is constrained to have at most a certain number of child nodes.
j], we run the Prim's minimum-weight spanning tree algorithm on the mobile graph G(i, j).
Stability-DG algorithm is the sum of the time complexity to construct the mobile graphs, the time complexity to run the spanning tree algorithm on these mobile graphs and the time complexity to transform these spanning trees to data gathering trees using BFS.
2]*logn) Prim's algorithm to construct a spanning tree, the complexity to run the spanning tree algorithm on the T mobile graphs becomes O([n.
k] and the number of mobile graphs that we have to construct and run the spanning tree algorithm increases by j-k+1.
The sequence of MST-DG trees for the duration of the data gathering session is generated as follows: If a MST-DG tree is not known for a particular round, we run the Prim's minimum-weight spanning tree algorithm on the static graph representing the snapshot of the network topology generated at the time instant corresponding to the round.
The ISS-Metro release offers advanced spanning tree algorithms
, Ethernet Operations, Administration and Management (OAM) capabilities, Ethernet in the First Mile (EFM), Provider Backbone Bridges (PBB), Provider Backbone Bridge Traffic Engineering (PBB-TE), virtualization of switching components, fault tolerant high availability, and Ethernet protection switching.