Serial In-network Processing for Large Stationary Wireless Sensor Networks

In wireless sensor networks, a serial processing algorithm browses nodes one by one and can perform different tasks such as: creating a schedule among nodes, querying or gathering data from nodes, supplying nodes with data, etc. Apart from the fact that serial algorithms totally avoid collisions, numerous recent works have confirmed that these algorithms reduce communications and considerably save energy and time in large-dense networks. Yet, due to the path construction complexity, the proposed algorithms are not optimal and their performances can be further enhanced. To do so, in the present paper, we propose a new serial processing algorithm that, in most of the cases, approximates the optimal number of hops (i.e., it requires n - 1 communications to traverse a network of n nodes). The extensive OMNeT++ simulations confirm the outperformance and efficiency of the proposal in terms of scalability and energy/time consumption.