Adaptive service migration and transaction processing in wireless sensor networks

Reinke, Christoph

doi:10.1145/1891748.1891750

Cited by 2 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2PCwC, participants of a transaction cache messages from other participants to be able to reply in place of them if their messages get lost. We show in experiments with 20 Pacemate sensor nodes that our protocol can increase the commit rate from 53% to 84% and also significantly lowers the costs [20]. In large sensor networks containing more than about 200 nodes, one should abstain from flooding and use routing protocols with better scalability properties like georouting [24].…”

Section: Experiments With Real Sensor Nodesmentioning

confidence: 99%

See 1 more Smart Citation

Analysis and comparison of concurrency control protocols for wireless sensor networks

Reinke

Hoeller

Werner

et al. 2011

2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)

Self Cite

View full text Add to dashboard Cite

In recent years the sensor network databases TinyDB and StonesDB have emerged. While both provide a useful abstraction layer for querying data, live data in the case of TinyDB and historic data in the case of StonesDB, neither of these approaches provide transaction processing capabilities. Transaction processing capabilities are needed to guarantee the consistency, for instance, in the case of data updates at runtime or the sophisticated requirements of emerging wireless sensor and actor networks.In this paper we analyze traditional concurrency control approaches and compare them with regard to their usability in wireless sensor networks. Therefore, we implemented the traditional Strict Two Phase Locking (S2PL), Timestamp Ordering (TO) and Forward Oriented Optimistic Concurrency Control (FOCC) by validation. We show in experiments with the network simulator Shawn, that locking exhibits better commit rates and lower costs under a variety of conditions compared to timestamp ordering and validation. We also implemented locking for the sensor node platform Pacemate to show the feasibility of our approach. We believe that efficient concurrency control can broaden the application spectrum of sensor network databases and is also vital for the emerging wireless sensor and actor networks.

show abstract

Section: Experiments With Real Sensor Nodesmentioning

confidence: 99%

“…Evaluation results of 2PC obtained from simulation and experiments with real sensor nodes can be found in [20], [21], [22], [23], [24].…”

mentioning

confidence: 99%