References of "Schaffer, Peter 40000600"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailSecure and Reliable Clustering in Wireless Sensor Networks: A Critical Survey
Schaffer, Peter UL; Farkas, Károly; Horváth, Ádám et al

in Computer Networks (2012), 56(11), 27262741

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 ... [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 environments, has gained modest attention so far or has been limited only to fault tolerance. In this paper, we review the state-of-the-art of clustering protocols in WSNs with special emphasis on security and reliability issues. First, we define a taxonomy of security and reliability for cluster head election and clustering in WSNs. Then, we describe and analyze the most relevant secure and reliable clustering protocols. Finally, we propose countermeasures against typical attacks and show how they improve the discussed protocols. [less ▲]

Detailed reference viewed: 60 (0 UL)
See detailExploiting Resource Heterogeneity in DTN
Sandulescu, Gabriel UL; Schaffer, Peter UL; Nadjm-Tehrani, Simin UL

in Wireless Communications & Mobile Computing (2012), 13(3), 230-243

Detailed reference viewed: 44 (2 UL)
Full Text
Peer Reviewed
See detailComparative analysis of clustering protocols with probabilistic model checking
Li, Qian UL; Schaffer, Peter UL; Pang, Jun UL et al

in Proc. 6th International Symposium on Theoretical Aspects of Software Engineering (2012)

Detailed reference viewed: 84 (3 UL)
Full Text
Peer Reviewed
See detailWho Clicks There!: Anonymizing the Photographer in a Camera Saturated Society
Nagaraja, Shishir; Schaffer, Peter UL; Aouada, Djamila UL

in Workshop on Privacy in the Electronic Society (WPES) (2011)

Detailed reference viewed: 39 (1 UL)
Full Text
Peer Reviewed
See detailPANEL: Position-based Aggregator Node Election in Wireless Sensor Networks
Buttyán, Levente; Schaffer, Peter UL

in International Journal of Distributed Sensor Networks (2010), 2010

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 ... [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 design of PANEL was to support reliable and persistent data storage applications, such as TinyPEDS; see the study by Girao et al. (2007). PANEL ensures load balancing, and it supports intra and intercluster routing allowing sensor-to-aggregator, aggregator-to-aggregator, base station-to-aggregator, and aggregator to-base station communications. We also compare PANEL with HEED; see the study by Younis and Fahmy (2004) in the simulation environment provided by TOSSIM, and show that, on one hand, PANEL creates more cohesive clusters than HEED, and, on the other hand, that PANEL is more energy efficient than HEED. [less ▲]

Detailed reference viewed: 168 (0 UL)
Full Text
See detailVicinity Resource Cartography for Delay-Tolerant Networks: a Holistic Perspective
Sandulescu, Gabriel UL; Schaffer, Peter UL; Nadjm-Tehrani, Simin UL

in 2010 IFIP W IRELESS D AYS (2010)

In this paper we propose a distributed algorithm allowing nodes in delay-tolerant networks to construct vicinity resource maps based on past encounters. Our algorithm estimates the availability of the ... [more ▼]

In this paper we propose a distributed algorithm allowing nodes in delay-tolerant networks to construct vicinity resource maps based on past encounters. Our algorithm estimates the availability of the following resources: energy, buffer space, and bandwidth. We then show how a store-carry-forward scheme may benefit from having access to these resource estimates. While knowledge about resources available in the vicinity allows nodes to implement meaningful custodian election strategies, an evaluation of available bandwidth and contact time allows them to carry out adaptive queue management strategies. Thus, such strategies can be approached from a holistic perspective based on the availability of the three resources under consideration in node proximity.We validate our model separately in time-varying and space-varying environments. In addition to synthetic mobility models (random waypoint) we validate our resource estimation in a disaster area mobility model (using Bonn motion traces). We show that by using this information a routing protocol may dramatically improve its delivery rate and energy overhead while keeping delivery latency almost constant. [less ▲]

Detailed reference viewed: 63 (0 UL)