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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 7th International Wireless Communications and Mobile Computing Conference s. 89 - 94
Hlavní autoři: Soysal, O., Aydin, B. I., Demirbas, M.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2011
Témata:
Color
Concurrency control
Concurrent computing
optimistic concurrency control
Programming
programming abstractions
Safety
Spread spectrum communication
Transactions
Wireless sensor networks
ISBN:9781424495399, 1424495393
ISSN:2376-6492
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:9781424495399
1424495393
ISSN:2376-6492
DOI:10.1109/IWCMC.2011.5982512