Optimal coloring for data collection in tree-based wireless sensor networks
檔案
本條目沒有附加檔案。
日期
2017-11-14
類型
期刊名稱
THEORETICAL COMPUTER SCIENCE
卷期與頁次
第 700 卷,頁 23–36
ISSN
0304-3975
語言
英文
摘要
Data collection is an important operation in a wireless sensor network (WSN). During data collection, the interference among nodes cannot be ignored. In a multi-hop WSN, one conventional way of defining interference neighbors is to prohibit a node from using the same time slot as those of its 1-hop and 2-hop neighbors. Recently, it is proved that for data collection in a WSN, since the set of communication nodes is limited and the transmission directions are toward the sink, a less strict set of interference neighbors can be defined [16]. The interference problem in a duty-cycle WSN (DC-WSN) with a corona structure is studied in [7]. In this paper, we solve the same problem by using the relaxed interference set defined in [16]. In particular, we give a complete classification of non-interference sets in 2-hop neighbors. We also propose a distributed 6-coloring algorithm. We prove a lower bound of six colors that every tree-based data collection algorithm requires in a dense DC-WSN, which proves our algorithm to be optimal. (C) 2017 Elsevier B.V. All rights reserved.
所屬典藏
期刊論文引用此條目
Lo, S.-M., Lin, W.-H., Chen, C., & Tseng, Y.-G. (2017). Optimal coloring for data collection in tree-based wireless sensor networks. THEORETICAL COMPUTER SCIENCE, 700, 23–36. https://doi.org/10.1016/j.tcs.2017.07.024
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/144171