An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks

Abstract

Data aggregation is an efficient primitive in wireless sensor network (WSN) applications. This paper focuses on data aggregation scheduling problem to minimize the latency. We propose an efficient distributed method that produces a collision-free schedule for data aggregation in WSNs. We prove that the latency of the aggregation schedule generated by our algorithm is at most 16R+Δ−14 time-slots. Here R is the network radius and Δ is the maximum node degree in the communication graph of the original network. Our method significantly improves the previously known best data aggregation algorithm [3], that has a latency bound of 24D + 6Δ + 16 time-slots, where D is the network diameter (Note that D can be as large as 2R). We conduct extensive simulations to study the practical performances of our proposed data aggregation method. Our simulation results corroborate our theoretical results and show that our algorithms perform better in practice.We prove that the overall lower-bound of latency of data aggregation under any interference model is max{log n, R} where n is the network size. We provide an example to show that the lowerbound is (approximately) tight under protocol interference model when r I = r, where rI is the interference range and r is the transmission range. We also derive the lower-bound of latency under protocol interference model when r < rI < 3r and rI ≥ 3r.

Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model

“…[20] proposes an aggregation schedule for a distributed solution and proves a lower-bound of max{log n, R} on the latency of data aggregation under any graph-based interference model; n is the network size.…”

Fast Group Communication Scheduling in Duty-Cycled Multihop Wireless Sensor Networks

“…Data Aggregation/Collection Scheduling with minimum delay has been proven to be NP-hard [2] and well studied in [10,16,[18][19][20].…”

Locating malicious nodes for data aggregation in wireless networks

“…For the well-studied minimum latency data aggregation problem, there is a series of results focusing on either the protocol wireless interference model [5], [10], [13] or the physical interference model [11], [12]. There is also a recent work [6] for data aggregation scheduling in duty-cycled network.…”

“…Note that most data aggregation schemes adopt a tree routing structure [10], [13], then a malicious node closer to the sink node could access a large percentage of the whole network data and would have a larger impact on the manipulation of final result as observed in [14]. Our protocol can reduce the trust on high-level nodes and perceive all low-cost wireless nodes as evenly trustable, which is realized by the principle of divide-and-conquer (or grouping).…”