A Delay-Aware Data Collection Network Structure for Wireless Sensor Networks

Cheng, Chi‐Tsun; Tse, Chi Kong; Lau, Francis C. M.

doi:10.1109/jsen.2010.2063020

Cited by 120 publications

(90 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [6], Cheng et al studied the possibility of overlapping transmission schedules in order to reduce the time for q consecutive DCPs. For transmission schedules to be partly overlapped, some connections in the original DADCNS in [1] are regarded as conflicting and needed to be removed. In-network data fusion may not be applicable in all scenarios.…”

Section: Related Workmentioning

confidence: 99%

“…After dividing S into two clusters, the larger cluster (i.e. S 2 ) will be organized into a DADCNS using the top-down approach proposed in [1]. The result will be a tree structure with its CH communicating with the BS directly.…”

Section: Inmentioning

confidence: 99%

“…In [1], Cheng et al proposed a delay-aware data collection network structure (DADCNS), which is aimed to minimize the duration of a DCP in WSNs. The proposed structure assumes packets collected from wireless sensor nodes are highly fusible such that multiple packets can be fused into one [2], [3].…”

Section: Introductionmentioning

confidence: 99%

“…The proposed structure assumes packets collected from wireless sensor nodes are highly fusible such that multiple packets can be fused into one [2], [3]. Two network formation algorithms are proposed in [1] to construct the proposed network structure in single or multiple-tree forms.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

To Split or Not to Split? From the Perspective of a Delay-Aware Data Collection Network Structure

Cheng

Ganganath

2013

2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery

Self Cite

View full text Add to dashboard Cite

Abstract-Collecting data from massive numbers of individual nodes is always a challenging task in wireless sensor networks. The duration of a data collection process, which can greatly affect the detection capabilities of a network, should be reduced whenever possible. For scenarios where only a single cluster is allowed, the delayaware data collection network structure can minimize the duration of a data collection process. The aim of this paper is to explore the possibilities of improving the original delay-aware network structure by splitting the single tree structure into multiple clusters. Analyses on the conditions and effects of splitting the aforementioned structure are presented. Based on the analyses, two novel network splitting algorithms using k-means clustering algorithms are proposed. Simulation results show that the proposed network splitting algorithms may further reduce the duration of a data collection process. With the help of the k-means algorithms, communication distance among sensor nodes can be further reduced especially for networks with large numbers of wireless sensor nodes.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Inmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

To Split or Not to Split? From the Perspective of a Delay-Aware Data Collection Network Structure

Cheng

Ganganath

2013

2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [18] it is shown that the problem remains NP-hard even for 3-regular planar graphs. Polynomial-time algorithms for the exact solution are known only for few special graphs: trees [8], complete graphs [19], and unicyclic graphs [20]. An algorithm based on a combinatorial approach with O(log n) approximated ratio were presented in [21].…”

Section: Related Workmentioning

confidence: 99%

Convergecast with Unbounded Number of Channels

2017

View full text Add to dashboard Cite

Abstract. We consider a problem of minimum length scheduling for the conflict-free aggregation convergecast in wireless networks in a case when each element of a network uses its own frequency channel. This problem is equivalent to the well-known NP-hard problem of telephone broadcasting since only the conflicts between the children of the same parent are taken into account. We propose a new integer programming formulation and compare it with the known one by running the CPLEX software package. Based on the results of a numerical experiment, we concluded that our formulation is more preferable in practice to solve the considered problem by CPLEX than the known one. We also propose a novel heuristic algorithm, which is based on a genetic algorithm and a local search metaheuristic. The simulation results demonstrate the high quality of the proposed algorithm compared to the best known approaches.

show abstract

Sparse random compressive sensing based data aggregation in wireless sensor networks

Yin

Liu

Guo

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

SummaryIn wireless sensor networks (WSNs), the volume of data is increasing at an unpredictable rate, which inevitably leads to high spatial‐temporal correlation. To eliminate data redundancy, some researchers have proposed many data aggregation methods. However, a few of aggregation approaches can handle energy consumption and latency simultaneously. Therefore, in this paper, we propose an efficient algorithm, called Delay‐Minimum Energy‐Balanced (DMEB) data aggregation, which benefits from the superiority of the sparse random measurement matrix and minimum delay algorithm. Owing to the sparsity characteristics of the measurement matrix, only the nodes whose corresponding elements in the matrix are non‐zero take part in the measurement. Each measurement can form an aggregation tree with minimum delay. After a sink node receives all the measurements, original readings can be recovered precisely. In addition, we adopt a novel scheduling method to avoid information interference. Experiment results demonstrate that, under recovering the original data accurately, the proposed data aggregation algorithm can not only shorten delay in data collection process but also reduce communication cost and prolong network lifetime during data transmission process.

show abstract

A Delay-Aware Data Collection Network Structure for Wireless Sensor Networks

Cited by 120 publications

References 14 publications

To Split or Not to Split? From the Perspective of a Delay-Aware Data Collection Network Structure

To Split or Not to Split? From the Perspective of a Delay-Aware Data Collection Network Structure

Convergecast with Unbounded Number of Channels

Sparse random compressive sensing based data aggregation in wireless sensor networks

Contact Info

Product

Resources

About