M.A. Thesis:

Implement a dynamic DCUR algorithm on wireless sensor networks

In this paper, we investigate the algorithms that are implemented on wireless sensor networks. we also discuss the proposed method proposed in this paper. and we compare it with other algorithms, the most important of which are the proposed algorithms to solve the problem with the least cost and delay with their different approach. we can expect optimality in some parameters by implementing the proposed algorithm on these networks. which can be paid in the simulation results. one of the most important challenges in WSN is optimizing energy consumption at network nodes level. we can control the optimal consumption of the sensor network by implementing the proposed algorithm on these nodes. energy consumption of the nodes depends on the energy level and the voltage of the node is one of the most important and debatable issues in this regard. due to the extensions of this discussion, we have tried to deal with it and the proposed paper is about routing algorithms or algorithms that can be implemented at the network level. Our proposed algorithm WSN uses the execution of two times Dijkstra to obtain the LC and LD path tables and its storage in each node in the network. Values in each link in the proposed algorithm are updated with certain equations and the problems of load congestion in the network and the creation of bottlenecks are prevented and information packets with uniform distribution are distributed throughout the network.

Keywords: DCLC problem - Dijkstra algorithm - Optimality in node use power - LC and LD routing tables - updat