Skip to main content

Distributed Computations in Wireless Sensor Networks by Local Interactions

  • Conference paper
  • First Online:
Ad-hoc, Mobile, and Wireless Networks (ADHOC-NOW 2018)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 11104))

Included in the following conference series:

Abstract

A Wireless Sensor Network (WSN) is an important wireless technology that is widely used in the Internet of things and that has wide variety of applications. In fact, a WSN consists of independent sensors, communicating with each other in a distributed way to monitor the environment. In this network, most of the existing distributed algorithms are designed without referring to a computations model. As a consequence, the study, the comparison and the proof of these algorithms become a difficult task. In this paper, we propose a new computations model based on local interactions. This model relies on Graph Relabelling System (GRS), a graph transformation model suitable for encoding distributed algorithms. We show that using our model simplifies the specification and the proof of distributed algorithms for WSN. We illustrate our proposed model through an example of distributed algorithm for WSN. Proofs are given in this paper to demonstrate the correctness of the selected algorithm.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bauderon, M., Métivier, Y., Mosbah, M., Sellami, A.: Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms. Electron. Notes Theor. Comput. Sci. 51(Suppl. 1), 93–107 (2002). GETGRATS Closing Workshop

    Article  Google Scholar 

  2. Litovsky, I., Sopena, É.: Graph relabelling systems and distributed algorithms. In: Handbook of Graph Grammars and Computing by Graph Transformation, pp. 1–56. World Scientific, Singapore (2001)

    Google Scholar 

  3. Bauderon, M., Métivier, Y., Mosbah, M., Sellami, A.: From local computations to asynchronous message passing systems. Technical report RR-1271-02, LaBRI (2002)

    Google Scholar 

  4. Métivier, Y., Sopena, É.: Graph relabelling systems: a general overview. Comput. Artif. Intell. 16(2), 167–185 (1997)

    MathSciNet  MATH  Google Scholar 

  5. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235–253 (2006)

    Article  Google Scholar 

  6. Filou, V., Mosbah, M., Tounsi, M.: Towards proved distributed algorithms through refinement, composition and local computations. In: 2013 Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, Hammamet, Tunisia, 17–20 June 2013, pp. 353–358. IEEE Computer Society (2013)

    Google Scholar 

  7. Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279–304 (2007)

    Article  Google Scholar 

  8. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, pp. 290–299. ACM, New York (2004)

    Google Scholar 

  9. Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Mediated population protocols. Theor. Comput. Sci. 412(22), 2434–2450 (2011)

    Article  MathSciNet  Google Scholar 

  10. Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.G.: Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. 412(46), 6469–6483 (2011)

    Article  MathSciNet  Google Scholar 

  11. Métivier, Y., Saheb, N., Zemmari, A.: Randomized local elections. Inf. Process. Lett. 82(6), 313–320 (2002)

    Article  MathSciNet  Google Scholar 

  12. Fontaine, A., Mosbah, M., Tounsi, M., Zemmari, A.: A fault-tolerant handshake algorithm for local computations. In: 30th International Conference on Advanced Information Networking and Applications Workshops, AINA 2016 Workshops, Crans-Montana, Switzerland, 23–25 March 2016, pp. 475–480 (2016)

    Google Scholar 

  13. Abrial, J.R.: Modeling in Event-B: System and Software Engineering. Cambridge University Press, New York (2013)

    MATH  Google Scholar 

  14. Filippas, A., Nikolaou, S., Pavlogiannis, A., Michail, O., Chatzigiannakis, I., Spirakis, P.: Computational models for wireless sensor networks: a survey. In: 1st International Conference for Undergraduate and Postgraduate Students in Computer Engineering, Informatics, Related Technologies and Applications (Eureka!), October 2010

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Emna Taktak .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Taktak, E., Tounsi, M., Mosbah, M., Kacem, A.H. (2018). Distributed Computations in Wireless Sensor Networks by Local Interactions. In: Montavont, N., Papadopoulos, G. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2018. Lecture Notes in Computer Science(), vol 11104. Springer, Cham. https://doi.org/10.1007/978-3-030-00247-3_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00247-3_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00246-6

  • Online ISBN: 978-3-030-00247-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics