Name
Abstract | ||
|---|---|---|
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.
|
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3127540.3127568 | MSWiM '17: 20th ACM Int'l Conference on Modelling, Analysis and Simulation of Wireless and Mobile Systems
Miami
Florida
USA
November, 2017 |
Keywords | Field | DocType |
In-network data aggregation, sensor query processing, serial data fusion, wireless sensor networks | Sensor node,Key distribution in wireless sensor networks,Serial memory processing,Computer science,Visual sensor network,Computer network,Mobile wireless sensor network,Wi-Fi array,Wireless sensor network,Scalability | Conference |
ISBN | Citations | PageRank |
978-1-4503-5162-1 | 0 | 0.34 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammed Amine Merzoug | 1 | 2 | 1.04 |
| Boukerche, A. | 2 | 61 | 16.98 |
| Ahmed Mostefaoui | 3 | 137 | 50.15 |