The work adds on the transferable belief model to a multiagent-distributed context using tree topology. An agent acting as nodes collect data independently using a graph with cycles. The cyclic structure describes the interaction among mobile units. Two different scenarios are considered: In the first one, agents provide data that do not change (static scenario), while in second case agent provide data that changes over time (dynamic scenario). For a dynamic scenario, it will use the value of a number of nodes to change the value and for the static scenario, it will keep one node fixed for routing by keeping source node fixed. A Cyclic Graph Algorithm is converged to the basic belief assignment based on the transferable belief model. The results are integrated and form four graphs to show the simulation results. The simulation results are obtained through NS2. TBM is used as an application in sensor networks our works adds on the transferable belief model to a multiagent-distributed context using tree topology. An agent acting as nodes collect data independently using a graph with cycles. The cyclic structure describes the interaction among mobile units.