Optimal coloring for data collection in tree-based wireless sensor networks
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
36 | en_US |
dc.citation.spage |
23 | en_US |
dc.citation.volume |
700 | en_US |
dc.contributor.author |
Lo, Shih-Ming | en_US |
dc.contributor.author |
Lin, Wu-Hsiung | en_US |
dc.contributor.author |
Chen, Chiuyuan | en_US |
dc.contributor.author |
Tseng, Yu-Ghee | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2018-08-21T05:53:01Z | |
dc.date.available |
2018-08-21T05:53:01Z | |
dc.date.issued |
2017-11-14 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1016/j.tcs.2017.07.024 | en_US |
dc.identifier.issn |
0304-3975 | en_US |
dc.identifier.journal |
THEORETICAL COMPUTER SCIENCE | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.tcs.2017.07.024 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/144171 | |
dc.identifier.wosnumber |
WOS:000416882100002 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
Coloring | en_US |
dc.subject |
Communication network | en_US |
dc.subject |
Data collection | en_US |
dc.subject |
Graph theory | en_US |
dc.subject |
Wireless sensor network | en_US |
dc.title |
Optimal coloring for data collection in tree-based wireless sensor networks | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
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