Dimitrios Zorbas

Learn More
To achieve power-efficient monitoring of targets in a terrain covered by a sensor network, it is sensible to divide the sensors into cover sets and make each of these sets responsible for covering the targets for a certain period of time. Generating the maximum number of such cover sets, has been proved to be an NP-complete problem, and thus algorithms(More)
Controlled mobility is one of the most complex challenges in Wireless Sensor Networks (WSN). Only a few routing protocols consider controlled mobility in order to extend the network lifetime. They are all designed to optimize the physical route topology from a source to a destination. However, there is often more than one sensor which reports an event to(More)
One of the main problems in wireless sensor networks is the successful coverage of a number of targets lying on a field and at the same time the maximization of the lifetime of the network. Many algorithms have been proposed in the literature in order to find the maximum number of disjoint or non-disjoint sets of sensors (cover sets), where one set can be(More)
A critical problem of wireless sensor networks is the efficient handling of the nodes energy under the target coverage constraint. The sensors are randomly deployed in the field covering a set of targets. Due to the randomness of the deployment some targets are covered by a few only sensors and, thus, the maximum achieved network lifetime is upper bounded(More)
In this paper, we propose an algorithm to efficiently (re)-deploy the wireless mobile routers of a substitution network by considering the energy consumption, a fast deployment scheme and a mix of the network metric. We consider a scenario where we have two routers in a fixed network and where a robust connection must be restored between those two routers(More)