An improved distributed data aggregation scheduling in wireless sensor networks

This paper focuses on the distributed data aggregation collision-free scheduling problem, which is one of very important issues in wireless sensor networks. Bo et al. (Proc. IEEE INFOCOM, 2009 ) proposed an approximate distributed algorithm for the problem and Xu et al. (Proc. ACM FOWANC, 2009 ) pro...

Full description

Saved in:
Bibliographic Details
Published in:Journal of combinatorial optimization Vol. 27; no. 2; pp. 221 - 240
Main Authors: Li, Deying, Zhu, Qinghua, Du, Hongwei, Li, Jianzhong
Format: Journal Article
Language:English
Published: Boston Springer US 01.02.2014
Subjects:
Combinatorics
Convex and Discrete Geometry
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Theory of Computation
Data aggregation scheduling
Distributed approximation algorithm
Wireless sensor networks
Collision-free
Latency
ISSN:1382-6905, 1573-2886
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper focuses on the distributed data aggregation collision-free scheduling problem, which is one of very important issues in wireless sensor networks. Bo et al. (Proc. IEEE INFOCOM, 2009 ) proposed an approximate distributed algorithm for the problem and Xu et al. (Proc. ACM FOWANC, 2009 ) proposed a centralized algorithm and its distributed implementation to generate a collision-free scheduling for the problem, which are the only two existing distributed algorithms. Unfortunately, there are a few mistakes in their performance analysis in Bo et al. (Proc. IEEE INFOCOM, 2009 ), and the distributed algorithm can not get the same latency as the centralized algorithm because the distributed implementation was not an accurate implementation of the centralized algorithm (Xu et al. in Proc. ACM FOWANC, 2009 ). According to those, we propose an improved distributed algorithm to generate a collision-free schedule for data aggregation in wireless sensor networks. Not an arbitrary tree in Bo et al. (Proc. IEEE INFOCOM, 2009 ) but a breadth first search tree (BFS) rooted at the sink node is adopted, the bounded latency 61 R +5Δ−67 of the schedule is obtained, where R is the radius of the network with respect to the sink node and Δ is the maximum node degree. We also correct the latency bound of the schedule in Bo et al. (Proc. IEEE INFOCOM, 2009 ) as 61 D +5Δ−67, where D is a diameter of the network and prove that our algorithm is more efficient than the algorithm (Bo et al. in Proc. IEEE INFOCOM, 2009 ). We also give a latency bound for the distributed implementation in Xu et al. (Proc. ACM FOWANC, 2009 ).
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-012-9504-9