Lately, there are many mobile networks with dynamic characteristics functioning. In these scenarios, the traditional static graph model may not completely represent the network's topology, which may vary over time. Thus, the definition of a new theoretical model which represents the connections' intermittence and allow the creation of algorithms to solve typical networks problems.One possible base for the desired model is the Evolving Graphs (EGs) theory. The EGs are graphs whose edges exist in certain time intervals. To represent a dynamic network with an EG, we only need to model each connection as an edge that exists between two nodes in the given time interval.In the original EG model, it is assumed that the knowledge is centralized, in other words, the network and all of its connections are completely known. With this base, many algorithms have been implemented to solve routing problems.This work's objective is to study the Evolving Graphs and the existing distributed systems to research a new model for dynamic networks that does not depend on the global knowledge of each node. Based on this model, we intend to build algorithms to solve the more traditional networks problems like the partition problem or the consensus problem.
News published in Agência FAPESP Newsletter about the scholarship: