Advertisement

Transformations for Write-All-with-Collision Model

  • Sandeep S. Kulkarni
  • Mahesh (Umamaheswaran) Arumugam
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3144)

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.

Keywords

Model conversions Preserving stabilization Atomicity refinement Write-all-with-collision model Read/Write model 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gouda, M., Haddix, F.: The linear alternator. In: Proceedings of the Third Workshop on Self-stabilizing Systems, pp. 31–47 (1997)Google Scholar
  2. 2.
    Gouda, M., Haddix, F.: The alternator. In: Proceedings of the Fourth Workshop on Self-stabilizing Systems, pp. 48–53 (1999)Google Scholar
  3. 3.
    Nesterenko, M., Arora, A.: Stabilization-preserving atomicity refinement. Journal of Parallel and Distributed Computing 62(5), 766–791 (2002)zbMATHCrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Ioannidou, K.: Transformations of self-stabilizing algorithms. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 103–117. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., September 2001. MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  7. 7.
    Chartrand, G., Oellermann, O.R.: Applied and Algorithmic Graph Theory. McGraw-Hill Inc., New York (1993)Google Scholar
  8. 8.
    Ghosh, S., Karaata, M.H.: A self-stabilizing algorithm for coloring planar graphs. Distributed Computing 7(1), 55–59 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11) (1974)Google Scholar
  11. 11.
    Dolev, S.: Self-Stabilization. The MIT Press, Cambridge (2000)zbMATHGoogle Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    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)CrossRefGoogle Scholar
  16. 16.
    Chandy, K.M., Misra, J.: The drinking philosophers problem. ACM Transactions on Programming Languages and Systems 6(4), 632–646 (1984)CrossRefGoogle Scholar
  17. 17.
    Couvreur, J., Francez, N., Gouda, M.: Asynchronous unison. In: Proceedings of the International Conference on Distributed Computing Systems, pp. 486–493 (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Sandeep S. Kulkarni
    • 1
  • Mahesh (Umamaheswaran) Arumugam
    • 1
  1. 1.Software Engineering and Network Systems Laboratory, Department of Computer Science and EngineeringMichigan State UniversityEast LansingUSA

Personalised recommendations