Minimum-latency aggregation scheduling in wireless sensor network

Longjiang Guo (), Yingshu Li () and Zhipeng Cai ()

Journal of Combinatorial Optimization, 2016, vol. 31, issue 1, No 19, 279-310

Abstract: Abstract Data aggregation is an essential yet time-consuming task in wireless sensor networks. This paper studies the well-known minimum-latency aggregation schedule problem and proposes an energy-efficient distributed scheduling algorithm named Clu-DDAS based on a novel cluster-based aggregation tree. Our approach differs from all the previous schemes where connected dominating sets or maximal independent sets are employed. This paper proves that Clu-DDAS has a latency bound of $$4R'+2 \varDelta -2$$ 4 R ′ + 2 Δ - 2 , where $$\varDelta $$ Δ is the maximum degree and $$R'$$ R ′ is the inferior network radius which is smaller than the network radius $$R$$ R . Our experiments show that Clu-DDAS has an approximate latency upper bound of $$4R'+1.085 \varDelta -2$$ 4 R ′ + 1.085 Δ - 2 with increased $$\varDelta $$ Δ . Clu-DDAS has comparable latency as the previously best centralized algorithm, E-PAS, but consumes 78 % less energy as shown by the simulation results. Clu-DDAS outperforms the previously best distributed algorithm, DAS, whose latency bound is $$16R'+\varDelta -14$$ 16 R ′ + Δ - 14 on both latency and energy consumption. On average, Clu-DDAS transmits 67 % fewer total messages than DAS. The paper also proposes an adaptive strategy for updating the schedule to accommodate dynamic network topology.

Keywords: Cluster-based aggregation tree; MLAS; Inferior network radius; Maximum degree (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9748-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:1:d:10.1007_s10878-014-9748-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9748-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().