Skip to main content
SpringerLink
Log in

Proximity-based federation of smart objects

Its graph-rewriting framework and correctness

  • Published:
Journal of Intelligent Information Systems Aims and scope Submit manuscript

Abstract

Our real world environments today are filled with lots of embedded intelligent devices with communication capabilities like smart phone, embedded computers, sensor devices, etc., which we refer to as Smart Objects (SOs). Most ubiquitous computing applications are limited to the scope of two stereotyped scenarios, i.e., the location-transparent service continuation, and the context-aware service provision. Some researchers think that the potential of the ubiquitous and/or pervasive computing is limited because of the lack of its formal models. In our previous work, we introduced a new framework organized in a hierarchy of formal models. This framework allows the SOs to dynamically and autonomously reconstruct their federation configurations depending on their location and context change. This federation reconstruction is done without using any centralized control. A federation is modeled by a catalytic reaction which is inspired by a chemical reaction, and each application with a complex scenario of SO federations is modeled by a catalytic reaction network. We use graph rewriting rules to implement the federation mechanism, where the nodes and the edges of a graph respectively represent the SOs and their connections. This federation mechanism itself is inspired by the biological RNA (RiboNucleic Acid) replication mechanism. Here, we revise our framework and propose a new simplified set of graph rewriting rules for federating SOs as a catalytic reaction. This new set of rules is less complex and easier to understand. We also introduce an extra set of rules to deal with the exception handling that may occur during the federation process. Our main goal is to formally prove the validity of our rewriting rules for implementing any catalytic reaction. This guarantees both the generality and the correctness of out framework for implementing any complex federation scenarios that can be described as catalytic reaction networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

Notes

  1. http://www.sunspotworld.com/

  2. http://www.wi-fi.org/discover-wi-fi/wi-fi-direct

  3. Reconfiguration of connectivity: links move in the virtual space of linked processes.

  4. Spatial reconfiguration: the processes move in the physical space of computing spaces.

  5. Software-defined networking: approach that allow an administrator in the context of a computer networking to manage network services through an abstraction of lower level functionality by separating the network control plane from the forwarding plane.

References

  • Blostein, D., Fahmy, H., & Grbavec, A. (1996). Issues in the practical use of graph rewriting. In: Selected papers from the 5th international workshop on graph gramars and their application to computer science. (pp. 38–55). London: Springer.

  • Cardelli, L., & Gordon, A.D. (1998). Mobile ambients. In FoSSaCS (pp. 140–155).

  • Cech, T.R. (2011). The rna worlds in context, Cold Spring Harbor Perspectives in Biology.

  • Chetan, S., Al-Muhtadi, J., Campbell, R., & Mickunas, M. (2005). Mobile gaia: a middleware for ad-hoc pervasive computing. In Consumer Communications and Networking Conference, 2005. CCNC. 2005 Second IEEE (pp. 223?-228).

  • Crowcroft, J. (2008). Engineering global ubiquitous systems. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 366, 3833–3834.

    Article  Google Scholar 

  • Gelernter, D. (1985). Generative communication in linda. ACM Transactions on Programming Languages and Systems, 7, 80–112.

    Article  MATH  Google Scholar 

  • Grimm, R., Davis, J., Lemar, E., Macbeth, A., Swanson, S., Anderson, T., Bershad, B., Borriello, G., Gribble, S., & Wetherall, D. (2004). System support for pervasive applications. ACM Transactions on Computer Systems, 22(4), 421–486.

    Article  Google Scholar 

  • Henricksen, K., Indulska, J., & Rakotonirainy, A. (2002). Modeling context information in pervasive computing systems. In F. Mattern & M. Naghshineh (Eds.), Pervasive, 167–180.

  • Julia, J., & Tanaka, Y. (2012). Improvisational construction of a context for dynamic implementation of arbitrary smart object federation scenarios. In 2012 IEEE International Conference on Multimedia and Expo Workshops (pp. 223–229). Melbourne.

  • Julia, J., & Tanaka, Y. (2013). Specifying the federation structure among application smart objects by example through direct manipulations. In Y. Tanaka, N. Spyratos, T. Yoshida, & C. Meghini (Eds.), Information search, integration and personalization, communications in computer and information science, (Vol. 146. pp. 31–40). Berlin: Springer.

  • Julia, J., Tanaka, Y., & Spyratos, N. (2012). Formalization of an RNA-inspired middleware for complex smart object federation scenarios. Proceedings of PECCS’12 2nd Int’l Conference, 86–105.

  • Kumar, M., Shirazi, B., Das, S., Sung, B., Levine, D., & Singhal, M. (2003). Pico: a middleware framework for pervasive computing. Pervasive Computing, IEEE, 2(3), 72–79.

    Article  Google Scholar 

  • Milner, R. (1999). Communicating and mobile systems: The & Pgr;-calculus. New York: Cambridge University Press.

    Google Scholar 

  • Milner, R. (2001). Bigraphical reactive systems: Basic theory. In Proceedings of the International Congress of Mathematicians (pp. 155–169).

  • Milner, R. (2004). Theories for the global ubiquitous computer. Foundations of Software Science and Computation Structures, LNCS, 2987, 5–11.

    Article  Google Scholar 

  • Milner, R. (2006a). Scientific foundation for global computing. Transactions on Computational Systems Biology, IV, 1–13.

    Google Scholar 

  • Milner, R. (2006b). Ubiquitous computing: Shall we understand it? Computer Journal, 49, 383–389.

    Article  Google Scholar 

  • Montanari, U., & Sammartino, M. (2012). Network conscious π-calculus: A concurrent semantics. Electronic Notes Theory Computers Science, 291–306.

  • Picco, G.P., Murphy, A.L., & Roman, G.C. (1999). Lime: Linda meets mobility. In ICSE’99 (pp. 368–377).

  • Plump, D. (1998). Termination of graph rewriting is undecidable. Fundamental Information, 33(2), 201–209.

    MATH  MathSciNet  Google Scholar 

  • Plump, D. (2010). Checking graph-transformation systems for confluence. ECEASST, 26.

  • Raychoudhury, V., Cao, J., Kumar, M., & Zhang, D. (2013). Middleware for pervasive computing: A survey. Pervasive Mobile Computing, 9(2), 177–200.

    Article  Google Scholar 

  • Rodden, T. (2008). Living in a ubiquitous world. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 366, 3837–3838.

    Article  Google Scholar 

  • Sousa, J., & Garlan, D. (2002). Aura: An architectural framework for user mobility in ubiquitous computing environments. In Software Architecture: System Design, Development, and Maintenance (Proceedings of the 3rd Working IEEE/IFIP Conference on Software Architecture) (pp. 29–43), Montreal.

  • Sousa, J.P., Poladian, V., Garlan, D., Schmerl, B.R., & Steenkiste, P. (2008). Steps toward activity-oriented computing. In IPDPS (pp. 1–5).

  • Tanaka, Y. (2010). Proximity-based federation of smart objects: Liberating ubiquitous computing from stereotyped application scenarios. Proceedings of KES’10 Int’l Conference, LNCS, 6276/2010, 14–30.

  • Ueda, K. (2009). Lmntal as a hierarchical logic programming language. Theoretical Computer Science, 410(46), 4784–4800.

    Article  MATH  MathSciNet  Google Scholar 

  • Verssimo, P., Lisboa, U., Cahill, V., Casimiro, A., Lisboa, U., Cheverst, K., Friday, A., Kaiser, J., & Ulm, U. (2002). Cortex: Towards supporting autonomous and cooperating sentient entities. In Proceedings of European wireless 2002 (pp. 595–601).

Download references

Acknowledgments

We would like to thank Randy Goebel, University of Alberta, Klaus P. Jantke Fraunhofer, Institute for Digital Media Technology, Jonas Sjöbergh, Hokkaido University, and Nicolas Spyratos, University of Paris-Sud, for contributing useful ideas and helpful suggestions.

Also, we would like to thank the reviewers for their help to improve the paper, and their valuable suggestions and comments.

We would like to thank Nikki Saneyoshi Foundation for providing a scholarship to one of the author (Jérémie Julia).

Conflict of interests

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Author information

Authors and Affiliations

  1. Meme Media Laboratory, Hokkaido University, West8, North13, Kita-ku, Sapporo, Hokkaido, 060-8628, Japan

    Jérémie Julia & Yuzuru Tanaka

Authors
  1. Jérémie Julia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuzuru Tanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jérémie Julia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Julia, J., Tanaka, Y. Proximity-based federation of smart objects. J Intell Inf Syst 46, 147–178 (2016). https://doi.org/10.1007/s10844-015-0357-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10844-015-0357-4

Keywords

Search

Navigation