Increasing Mobile Transaction Concurrency in Dynamically Configurable Environments

Brayner, Ângelo; Filho, J.A.

doi:10.1109/icdcsw.2005.76

Cited by 4 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Brayner et al define the correctness criterion Mobile Semantic Serializability [6] and describe SESAMO [5], a concurrency control algorithm which relaxes global serializability and provides mobile semantic serializability instead.…”

Section: B Concurrency Control In Mobile Ad Hoc Networkmentioning

confidence: 99%

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)

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: B Concurrency Control In Mobile Ad Hoc Networkmentioning

confidence: 99%

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)

View full text Add to dashboard Cite

show abstract

“…A correctness criterion called Mobile Semantic Serializability [1,2] was proposed for mobile database transaction management in ad hoc networks. A mobile MDBS is viewed as a collection of disjoint sets objects, each of which represents a single mobile database and is a semantic unit (SU).…”

Section: Related Workmentioning

confidence: 99%

Agent-Based Transactions Management for Mobile Multidatabase

Ongtang

Hurson

Jiao³

et al. 2007

Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2007)

View full text Add to dashboard Cite

The requirements to access and manipulate data across multiple heterogeneous existing databases and the proliferation of mobile technologies have propelled the development of mobile multidatabase system (MDBS). In that environment, transaction management is not a trivial task due to the technological constraints. This paper proposes an Agent-based Transaction Management for Mobile Multidatabase (AT3M) system. AT3M applies static and mobile agents to manage the transaction processing in mobile multidatabase system. It enables a fully distributed transaction management, accommodates mobility of the mobile clients, and allows global subtransactions to process in parallel. The proposed algorithm utilizes the hierarchical meta data structure of Summary Schema Model (SSM) which captures semantic information of data objects in the underlying local databases at different levels of abstractions. It is shown by simulation that AT3M suits well in mobile multidatabase environment and outperforms the existing V-Locking algorithm designed for the same environment in many aspects.

show abstract

“…Also, that any mobile transaction update of an object in one mobile database does not depend on the state of other mobile databases. As in [1], a mobile transaction M i , here, is modulestructured, i.e. its operations are grouped into subsequences, called modules, where each module contains the operations for one mobile database participating in the MDBC.…”

Section: Introductionmentioning

confidence: 99%

Multi-step transactions specification and verification in a mobile database community

Alshorman

Hussak

2008

2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications

View full text Add to dashboard Cite

Increasing Mobile Transaction Concurrency in Dynamically Configurable Environments

Cited by 4 publications

References 6 publications

Analysis and comparison of concurrency control protocols for wireless sensor networks

Analysis and comparison of concurrency control protocols for wireless sensor networks

Agent-Based Transactions Management for Mobile Multidatabase

Multi-step transactions specification and verification in a mobile database community

Contact Info

Product

Resources

About