Minimum latency data aggregation scheduling in MR-MC wireless sensor networks

被引：0
作者：
Li, Jin-Bao [1 ,2 ]
Wang, Meng [1 ,2 ]
Guo, Long-Jiang [1 ,2 ]
机构：
[1] School of Computer Science and Technology, Heilongjiang University, Harbin
[2] Key Laboratory of Database and Parallel Computing of Heilongjiang Province, Harbin
来源：
Tongxin Xuebao/Journal on Communications | 2014年 / 35卷 / 10期
基金：
中国国家自然科学基金;
关键词：
Channel; Data aggregation; Latency; Scheduling; WSN;
D O I：
10.3969/j.issn.1000-436x.2014.10.022
中图分类号：
学科分类号：
摘要：
The problem of minimum latency data aggregation scheduling in single-radio single-channel wireless sensor networks is a NPC problem and many solutions have been proposed. In multi-radio multi-channel networks, the latency may be lower as a node may receive transmission data from other different nodes simultaneously. It formulates the minimum latency data aggregation scheduling into an optimization problem with joint consider of tree structure, time slot assignment, channel assignment and radio assignment. The problem is divided into constructing data aggregation tree and designing a node schedule subproblems. For each subproblem, heuristic algorithm has been proposed. The simulation results show that the proposed algorithm achieve good performance.
引用
收藏
页码：192 / 199
页数：7
相关论文
共 15 条
  • [1] Cheng S., Li J.Z., Cai Z.P., O (ε)-approximation to physical world by sensor networks, IEEE INFOCOM 2013, pp. 3084-3092, (2013)
  • [2] Ji S.L., Cai Z.P., Distributed data collection and its capacity in asynchronous wireless sensor networks, INFOCOM 2012, pp. 2113-2121, (2012)
  • [3] Ji S.L., Beyah R., Cai Z.P., Snapshot/continuous data collection capacity for large-scale probabilistic wireless sensor networks, INFOCOM 2012, pp. 1035-1043, (2012)
  • [4] Chen X.J., Hu X.D., Zhu J.M., Minimum data aggregation time problem in wireless sensor networks, Mobile Ad-Hoc and Sensor Networks, 37, 4, pp. 133-142, (2005)
  • [5] Kuo T.W., Tsai M.J., On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms, INFOCOM 2012, pp. 2591-2595, (2012)
  • [6] Chauhan R., Gupta V., Energy efficient sleep scheduled clustering & spanning tree based data aggregation in wireless sensor network, Recent Advances in Information Technology (RAIT), 2012 1st International Conference on IEEE, pp. 536-541, (2012)
  • [7] Chen Z., Yang G., Chen L., Et al., A load-balanced data aggregation scheduling for duty-cycled wireless sensor networks, Cloud Computing Technology and Science (CloudCom), 2012 IEEE 4th International Conference on IEEE, pp. 888-893, (2012)
  • [8] Luo D., Zhu X., Wu X., Et al., Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks, INFOCOM2011, pp. 1566-1574, (2011)
  • [9] Li Z., Peng Y., Qiao D., Et al., LBA: Lifetime balanced data aggregation in low duty cycle sensor networks, INFOCOM2012, pp. 1844-1852, (2012)
  • [10] Huang S.C.H., Wan P.J., Vu C.T., Et al., Nearly constant approximation for data aggregation scheduling in wireless sensor networks, INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp. 366-372, (2007)
12