Abstract | ||
---|---|---|
This paper presents a distributed serial data aggregation approach, called Spreading Aggregation~(SA), in which one packet hops sequentially over nodes and aggregates their data. The next hop of the aggregation packet is determined locally by each traversed node using only its one-hop neighborhood information, so no network topology information needs to be known by nodes, nor collisions are generated as only one node is communicating at any given time. This localized and distributed characteristic makes the proposed approach highly scalable and very efficient in terms of communication-reduction, energy conservation, and aggregation time, as confirmed by the numerous simulation results we obtained. These results confirm also the superiority of the proposed approach over the state-of-the-art serial approaches, particularly in very large scale network deployments. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1109/DCOSS.2017.9 | 2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS) |
Keywords | Field | DocType |
Collision-free data aggregation,Serial data aggregation,Wireless sensor networks | Serial communication,Energy conservation,Computer science,Network packet,Computer network,Network topology,Distributed database,Data aggregator,Wireless sensor network,Distributed computing,Scalability | Conference |
ISSN | ISBN | Citations |
2325-2936 | 978-1-5386-3992-4 | 1 |
PageRank | References | Authors |
0.35 | 11 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mohammed Amine Merzoug | 1 | 2 | 1.04 |
Ahmed Mostefaoui | 2 | 21 | 3.79 |
Samir Chouali | 3 | 69 | 12.57 |