完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Wu, Fang-Jing | en_US |
dc.contributor.author | Tseng, Yu-Chee | en_US |
dc.date.accessioned | 2014-12-08T15:08:24Z | - |
dc.date.available | 2014-12-08T15:08:24Z | - |
dc.date.issued | 2009-11-01 | en_US |
dc.identifier.issn | 1089-7798 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1109/LCOMM.2009.090712 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/6506 | - |
dc.description.abstract | In a multi-hop wireless network, a conventional way of defining interference neighbors is to prohibit a node from using the same slot/code as those of its 1-hop and 2-hop neighbors. However, for data collection in a wireless sensor network, since the set of communication nodes is limited and the transmission directions are toward the sink, we show that a less strict set of interference neighbors can be defined. Based on this observation, we develop an efficient distributed wake-up scheduling scheme for data collection in a sensor network that achieves both energy conservation and low reporting latency. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Communication protocol | en_US |
dc.subject | power saving | en_US |
dc.subject | sensor network | en_US |
dc.subject | slot/code assignment | en_US |
dc.subject | wireless network | en_US |
dc.title | Distributed Wake-up Scheduling for Data Collection in Tree-Based Wireless Sensor Networks | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1109/LCOMM.2009.090712 | en_US |
dc.identifier.journal | IEEE COMMUNICATIONS LETTERS | en_US |
dc.citation.volume | 13 | en_US |
dc.citation.issue | 11 | en_US |
dc.citation.spage | 850 | en_US |
dc.citation.epage | 852 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000271760300012 | - |
dc.citation.woscount | 10 | - |
顯示於類別: | 期刊論文 |