Abstract
In this paper, we consider a new atomicity model, write all with collision (WAC), and compare it with existing models considered in the literature. This model captures the computations in sensor networks. We show that it is possible to transform a program from WAC model into a program in read/write model, and vice versa. Further, we show that the transformation from WAC model to read/write model is stabilization preserving, and the transformation from read/write model to WAC model is stabilization preserving for timed systems. In the transformation from read/write model to WAC model, if the system is untimed (asynchronous) and processes are deterministic then under reasonable assumptions, we show that (1) the resulting program in WAC model can allow at most one process to execute, and (2) the resulting program in WAC model cannot be stabilizing. In other words, if a deterministic program cannot read then it is important that it can tell time.
This work was partially sponsored by NSF CAREER CCR-0092724, DARPA Grant OSURS01-C-1901, ONR Grant N00014-01-1-0744, NSF Equipment Grant EIA-0130724, and a grant from Michigan State University
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gouda, M., Haddix, F.: The linear alternator. In: Proceedings of the Third Workshop on Self-stabilizing Systems, pp. 31–47 (1997)
Gouda, M., Haddix, F.: The alternator. In: Proceedings of the Fourth Workshop on Self-stabilizing Systems, pp. 48–53 (1999)
Nesterenko, M., Arora, A.: Stabilization-preserving atomicity refinement. Journal of Parallel and Distributed Computing 62(5), 766–791 (2002)
Antonoiu, G., Srimani, P.K.: Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read/write atomicity. In: Amestoy, P.R., Berger, P., Daydé, M., Duff, I.S., Frayssé, V., Giraud, L., Ruiz, D. (eds.) Euro-Par 1999. LNCS, vol. 1685, pp. 824–830. Springer, Heidelberg (1999)
Ioannidou, K.: Transformations of self-stabilizing algorithms. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 103–117. Springer, Heidelberg (2002)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., September 2001. MIT Press, Cambridge (2001)
Chartrand, G., Oellermann, O.R.: Applied and Algorithmic Graph Theory. McGraw-Hill Inc., New York (1993)
Ghosh, S., Karaata, M.H.: A self-stabilizing algorithm for coloring planar graphs. Distributed Computing 7(1), 55–59 (1993)
Kulkarni, S.S., Arumugam, U.: Collision-free communication in sensor networks. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol. 2704, pp. 17–31. Springer, Heidelberg (2003)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACMÂ 17(11) (1974)
Dolev, S.: Self-Stabilization. The MIT Press, Cambridge (2000)
Kulkarni, S.S., Arumugam, M.: Transformations for write-all-with-collision model. Technical Report MSU-CSE-03-27, Department of Computer Science, Michigan State University (October 2003)
Heinzelman, W.B., Chandrakasan, A.P., Balakrishnan, H.: An applicationspecific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications 1(4), 660–670 (2002)
Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D.E., Pister, K.: System architecture directions for network sensors. In: Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) (November 2000)
Culler, D., Hill, J., Buonadonna, P., Szewczyk, R., Woo, A.: A network-centric approach to embedded software for tiny devices. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol. 2211, pp. 97–113. Springer, Heidelberg (2001)
Chandy, K.M., Misra, J.: The drinking philosophers problem. ACM Transactions on Programming Languages and Systems 6(4), 632–646 (1984)
Couvreur, J., Francez, N., Gouda, M.: Asynchronous unison. In: Proceedings of the International Conference on Distributed Computing Systems, pp. 486–493 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kulkarni, S.S., Arumugam, M.(. (2004). Transformations for Write-All-with-Collision Model. In: Papatriantafilou, M., Hunel, P. (eds) Principles of Distributed Systems. OPODIS 2003. Lecture Notes in Computer Science, vol 3144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27860-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-27860-3_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22667-3
Online ISBN: 978-3-540-27860-3
eBook Packages: Springer Book Archive