Péter Schaffer

Learn More
In this paper, we introduce PANEL, a position-based aggregator node election protocol for wireless sensor networks. The novelty of PANEL with respect to other aggregator node election protocols is that it supports asynchronous sensor network applications where the sensor readings are fetched by the base stations after some delay. In particular, the(More)
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, which is well-known in computer vision and in automated cartography. The RANSAC paradigm gives us a hint on how to instantiate a model if there are a lot of compromised data(More)
In this paper we consider the problem of resilient data aggregation, namely, when aggregation has to be performed on a compromised sample. We present a statistical framework that is designed to mitigate the effects of an attacker who is able to alter the values of the measured parameters of the environment around some of the sensor nodes. Our proposed(More)
In this paper, we propose a new model of resilient data aggregation in sensor networks, where the aggre-gator analyzes the received sensor readings and tries to detect unexpected deviations before the aggregation function is called. In this model, the adversary does not only want to cause maximal distortion in the output of the aggregation function, but it(More)
In the past few years, research interest has been increased towards wireless sensor networks (WSNs) and their application in both the military and civil domains. To support scalability in WSNs and increase network lifetime, nodes are often grouped into disjoint clusters. However, secure and reliable clustering, which is critical in WSNs deployed in hostile(More)
Sensor networks are large scale networks consisting of several nodes and some base stations. The nodes are monitoring the environment and send their measurement data towards the base stations possibly via multiple hops. Since the nodes are often battery powered, an important design criterion for sensor networks is the maximization of their lifetime. In this(More)
We recorded transmembrane potential in whole cell recording mode from small clusters (2-4 cells) of spontaneously beating 7-day embryonic chick ventricular cells after 1-3 days in culture and investigated effects of the blockers D-600, diltiazem, almokalant, and Ba2+. Electrical activity in small clusters is very different from that in reaggregates of(More)
We introduce PANEL a position-based aggregator node election protocol for wireless sensor networks. The novelty of PANEL with respect to other aggregator node election protocols is that it supports asynchronous sensor network applications where the sensor readings are fetched by the base stations after some delay. In particular, the motivation for the(More)
Routing in delay and disruption-tolerant networks (DTNs) relies on intermediary nodes, called custodians, to deliver messages to destination. However, nodes usually differ significantly in terms of available resources: energy, buffer space, and bandwidth. Routing algorithms need to make the most efficient use of custodian resources while also making sure(More)
—In this paper we propose a distributed approach to construct vicinity resource maps at each node in a delay-tolerant network. The scheme uses recent encounters to estimate the availability of the following resources: energy, buffer space, and bandwidth, in the vicinity of a given node. We then show how a store-carry-forward scheme may benefit from having(More)