Frederico Paiva Quintão

Learn More
The determination of a topology that minimizes the energy consumption and assures the application requirements is one of the greatest challenges about Wireless Sensor Networks (WSNs). This work presents a dynamic mixed integer linear programming (MILP) model to solve the coverage and connectivity dynamic problems (CCDP) in flat WSNs. The model solution(More)
The recent area of Wireless Sensor Networks (WSNs) has brought new challenges to developers of network protocols. One of these challenges consists of maintaining the coverage of the monitoring area and the connectivity between the network nodes, preferably accomplishing the management of the network resources. This problem can be modeled as a Mathematical(More)
In the last decade, several technological advances in embedded systems and wireless communication allowed the arising of a new kind of ad-hoc network, the Wireless Sensor Network (WSN). A WSN is a special kind of mobile network composed by hundreds or even thousands of autonomous and compact devices, called sensor nodes, which can perform sensing,(More)
In this paper, we present two Integer Programming formulations for the k-Cardinality Tree Problem. The first is a multiflow formulation while the second uses a lifting of the Miller-Tucker-Zemlin constraints. Based on our computational experience, we suggest a two-phase exact solution approach that combines two different solution techniques, each one(More)
  • 1