Sotiris E. Nikoletseas

Learn More
Collecting sensory data using a mobile data sink has been shown to drastically reduce energy consumption at the cost of increasing delivery delay. Towards improved energy-latency trade-offs, we propose a biased, adaptive sink mobility scheme, that adjusts to local network conditions, such as the surrounding density, remaining energy and the number of past(More)
Summary form only given. We study the problem of energy-balanced data propagation in wireless sensor networks. The energy balance property guarantees that the average per sensor energy dissipation is the same for all sensors, during the entire execution of the protocol. This property is important since it prolongs the network's lifetime by avoiding early(More)
In wireless sensor networks data propagation is usually performed by sensors transmitting data towards a <i>static</i> control center (sink). Inspired by important applications (mostly related to ambient intelligence) and as a first step towards introducing mobility, we propose the idea of having <i>a sink moving in the network area and collecting data from(More)
In the uniform random intersection graphs model, denoted by G n,m,λ , to each vertex v we assign exactly λ randomly chosen labels of some label set M of m labels and we connect every pair of vertices that has at least one label in common. In this model, we estimate the independence number α(G n,m,λ), for the wide, interesting range m = n α , α < 1 and λ =(More)
In this paper, we survey the current state-of-the-art in middleware and systems for Wireless Sensor Networks (WSN). We provide a discussion on the definition ofWSN middleware, design issues associated with it, and the taxonomies commonly used to categorize it. We also present a categorization of a number of such middleware platforms, using middleware(More)
This paper presents an average case analysis of fully dynamic graph connectivity (when the operations are edge insertions and deletions). To this end we introduce the model of stochastic graph processes (i.e. dynamically changing random graphs with random equiprobable edge insertions and deletions). As the process continues indefinitely, all potential edge(More)
In this work we propose a new energy efficient and faulttolerant protocol for data propagation in wireless sensornetworks, the Variable Transmission Range Protocol VTRP.The basic idea of data propagation in VTRP is the varyingrange of data transmissions, ie. we allow the transmissionrange to increase in various ways. Thus data propagationin our protocol(More)
Wireless Sensor Networks are comprised of a vast numberof ultra-small, autonomous computing and communicationdevices, with restricted energy, that co-operate to accomplisha large sensing task. In this work: a) We proposeextended versions of two data propagation protocols forsuch networks: the Sleep-Awake Probabilistic ForwardingProtocol (SW-PFR) and the(More)