Sumeet Gujrati, Gurdip Singh


Distributed computing problems such as mutual exclusion have been studied extensively for traditional distributed systems. In traditional systems, a strict layered approach is taken wherein a set of users (application processes) U1; : : : ;Un is layered on top of a mutual exclusion algorithm with processes P1; : : : ;Pn. User Ui interacts with process Pi to request access to resources which are modeled as tokens, and users rely entirely on mutual exclusion algorithm to regulate access to the resources. In a cyber-physical system, users (physical entities) may themselves possess capabilities such as sensing, observing and mobility using which they may also attempt to locate physical resources such as wheelchairs. Thus, a mutual exclusion algorithm in a cyber-physical system must contend with the behavior of users. This paper proposes a graph-based model for cyber-physical systems which is used to describe mutual exclusion algorithm as well as user behavior. Based on this model, we present several solutions for the mutual exclusion problem. We have also conducted an extensive simulation study of our algorithms using OMNeT++ discrete event simulation system.


  1. Bapat, S. and Arora, A. (2008). Message efficient termination detection in wireless sensor networks. In Proceedings of the 2008 INFOCOM Workshops.
  2. Bulgannawar, S. and Vaidya, N. (1995). A distributed kmutual exclusion algorithm. In Proceedings of the 15th International Conference on Distributed Computing Systems, pages 153-160.
  3. Chandy, K. M. and Lamport, L. (1985). Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems, 3(1).
  4. Chinrungrueng, J., Sunantachaikul, U., and Triamlumlerd, S. (2007). Smart parking: an application of opticalwireless sensor network. In Proceedings of the 2007 International Symposium on Applications and the Internet Workshops.
  5. Conner, W. S., Heidemann, J., Krishnamurthy, L., Wang, X., and Yarvis, M. (2004). Workplace applications of sensor networks. In USC/ISI Technical Report ISI-TR2004-591.
  6. Dijkstra, E. (1965). Solution of a problem in concurrent programming control. Communications of the ACM.
  7. Dijkstra, E. (1971). Hierarchical ordering of sequential processes. Acta Informatica, 1:115-138.
  8. Gujrati, S. and Singh, G. (2011). Mutual exclusion in cyberphysical systems. Technical report, Kansas State University CIS TR 2011-2.
  9. Kaveti, L., Pulluri, S., and Singh, G. (2009). Event ordering in pervasive sensor networks. In 5th IEEE International Workshop on Sensor Networks and Systems for Pervasive Computing.
  10. Kurian, H., Rakshit, A., and Singh, G. (2009). Detecting termination in pervasive sensor networks. In 9th IEEE International Symposium on Asynchronous Decentralized Systems.
  11. Liu, M., Mihaylov, S. R., Bao, Z., Jacob, M., Ives, Z. G., Loo, B. T., and Guha, S. (2010). Smartcis: Integrating digital and physical environments. SIGMOD Record.
  12. Lynch, N. (1980). Fast allocation of nearby resources in a distributed system. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pages 70- 81.
  13. Makki, K., Banta, P., Been, K., Pissinou, N., and Park, E. (1992). A token based distributed k mutual exclusion algorithm. In IEEE Proceedings of the Symposium on Parallel and Distributed Processing, pages 408-411.
  14. Rajamani, V. and Julien, C. (2010). Blurring snapshots: Temporal inference of missing and uncertain data. In Proceedings of the IEEE International Conference on Pervasive Computing and Communications.
  15. Raymond, K. (1989). A distributed algorithm for multiple entries to a critical section. In Information Processing Letters, volume 30, pages 189-193.
  16. Reif, J. H. and Spirakis, P. (1982). Real time resource allocation in distributed systems. In Proceedings of ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 84-94.
  17. Romer, K. (2003). Temporal message ordering in wireless sensor networks. In Annual Mediterranean Ad Hoc Networking Workshop.
  18. Srimani, P. and Reddy, R. (1992). Another distributed algorithm for multiple entries to a critical section. In Information Processing Letters, volume 41, pages 51- 57.
  19. Varga, A. (2001). The omnet++ discrete event simulation system. In Proceedings of the European Simulation Multiconference (ESM 2001).
  20. Walter, J., Cao, G., and Mohanty, M. (2001). A k-mutual exclusion algorithm for wireless ad hoc networks. In Proceedings of the First Annual Workshop on Principles of Mobile Computing.
  21. Wessel, K., Swigulski, M., , Kpke, A., and Willkomm, D. (2009). Mixim: the physical layer an architecture overview. In Proceedings of the 2nd International Conference on Simulation Tools and Techniques.
  22. Wieland, M., Kopp1, O., Nicklas, D., and Leymann, F. (2007). Towards context-aware workflows. In Proceedings of the CAISE07 Workshops and Doctoral Consortium.

Paper Citation

in Harvard Style

Gujrati S. and Singh G. (2012). MUTUAL EXCLUSION IN CYBER-PHYSICAL SYSTEMS . In Proceedings of the 1st International Conference on Sensor Networks - Volume 1: SENSORNETS, ISBN 978-989-8565-01-3, pages 73-79. DOI: 10.5220/0003834800730079

in Bibtex Style

author={Sumeet Gujrati and Gurdip Singh},
booktitle={Proceedings of the 1st International Conference on Sensor Networks - Volume 1: SENSORNETS,},

in EndNote Style

JO - Proceedings of the 1st International Conference on Sensor Networks - Volume 1: SENSORNETS,
SN - 978-989-8565-01-3
AU - Gujrati S.
AU - Singh G.
PY - 2012
SP - 73
EP - 79
DO - 10.5220/0003834800730079