Minimum Data Aggregation Time Problem in Wireless Sensor Networks

Chen, Xujin; Hu, Xiaodong; Zhu, Jianming

doi:10.1007/11599463_14

Cited by 208 publications

(180 citation statements)

References 8 publications

Supporting

Mentioning

180

Contrasting

Order By: Relevance

“…There exist a lot of exciting work trying to solve the problem [5], [10], [11], [19]- [21]. Minimizing the aggregation scheduling length is one of the most important concerns.…”

Section: A Data Aggregationmentioning

confidence: 99%

“…[5] proposed a data aggregation algorithm with latency bound of (∆ − 1)R, where R is the network radius by hop count and ∆ is the maximal node degree. The NP-hard proof of the MLAS problem is also presented.…”

Section: A Data Aggregationmentioning

confidence: 99%

“…The fundamental challenge can be stated as: How to schedule the aggregation transmissions in a wireless sensor network such that no undesired interference may occur and the total number of time slots used (referred to as aggregation latency) is minimized? This is known as the Minimum-Latency Aggregation Scheduling (MLAS) problem in the literature [5], [10], [19]- [21]. Note that we divide the time into time slots, which makes the design and analysis more tractable.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Hua

et al. 2010

Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems

View full text Add to dashboard Cite

Abstract-Minimum-Latency Aggregation Scheduling (MLAS)is a problem of fundamental importance in wireless sensor networks. There however has been very little effort spent on designing algorithms to achieve sufficiently fast data aggregation under the physical interference model which is a more realistic model than traditional protocol interference model. In particular, a distributed solution to the problem under the physical interference model is challenging because of the need for globalscale information to compute the cumulative interference at any individual node. In this paper, we propose a distributed algorithm that solves the MLAS problem under the physical interference model in networks of arbitrary topology in O(K) time slots, where K is the logarithm of the ratio between the lengths of the longest and shortest links in the network. We also give a centralized algorithm to serve as a benchmark for comparison purposes, which aggregates data from all sources in O(log 3 (n)) time slots (where n is the total number of nodes). This is the current best algorithm for the problem in the literature. The distributed algorithm partitions the network into cells according to the value K, thus obviating the need for global information. The centralized algorithm strategically combines our aggregation tree construction algorithm with the non-linear power assignment strategy in [13]. We prove the correctness and efficiency of our algorithms, and conduct empirical studies under realistic settings to validate our analytical results.

show abstract

“…There exist a lot of exciting work trying to solve the problem [5], [10], [11], [19]- [21]. Minimizing the aggregation scheduling length is one of the most important concerns.…”

Section: A Data Aggregationmentioning

confidence: 99%

Section: A Data Aggregationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Hua

et al. 2010

Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems

View full text Add to dashboard Cite

show abstract

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

Section: Related Workmentioning

confidence: 99%

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

Cao

Wan

2012

Wireless Algorithms, Systems, and Applications

View full text Add to dashboard Cite

Abstract. We study group communication scheduling in duty-cycled multi-hop wireless sensor networks. Assume that time is divided into time-slots and we group multiple consecutive time-slots into periods. Each node can transmit data at any time-slot while it only wakes up at its active time-slot of every period and thus be allowed to receive data. Under the protocol interference model, we investigate four group communication patterns, i.e., broadcast, data aggregation, data gathering, and gossiping. For each pattern, we develop a delay efficient scheduling algorithm which greatly improve the current state-of-the-art algorithm. Additionally, we propose a novel and efficient design to coherently couple the wireless interference requirement and duty cycle requirement.

show abstract

“…Therefore, all existing results in literature are heuristic algorithms for finding approximate solutions. Most of them contain two relatively independent phases: aggregation tree construction followed by link scheduling [4,5,7].…”

Section: Introductionmentioning

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

Minimum Data Aggregation Time Problem in Wireless Sensor Networks

Cited by 208 publications

References 8 publications

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

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

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

Convergecast with Unbounded Number of Channels

Contact Info

Product

Resources

About