Optimistic Concurrency Control for multihop sensor networks

In this study, we provide a lightweight singlehop primitive, Read-All-Write-Self (RAWS), that achieves optimistic concurrency control. RAWS guarantees serializability, which simplifies implementation and verification of distributed algorithms, compared to the low level message passing model. We also...

Full description

Saved in:
Bibliographic Details
Main Authors: Soysal, O., Aydin, B. I., Demirbas, M.
Format: Conference Proceeding
Language:English
Subjects:
Color
Concurrency control
Concurrent computing
optimistic concurrency control
Programming
programming abstractions
Safety
Spread spectrum communication
Transactions
Wireless sensor networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this study, we provide a lightweight singlehop primitive, Read-All-Write-Self (RAWS), that achieves optimistic concurrency control. RAWS guarantees serializability, which simplifies implementation and verification of distributed algorithms, compared to the low level message passing model. We also present a self-stabilizing multihop extension of RAWS, called Multihop Optimistic Concurrency Control Algorithm (MOCCA), to address the challenges of multihop networks. We implement RAWS on motes and investigate the effects of message loss over this novel primitive.
ISSN:2376-6492
DOI:10.1109/IWCMC.2011.5982512