Distributed computations in wireless sensor networks by local interactions

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.