摘要
Convergecast is a fundamental operation in wireless sensor networks. Existing convergecast solutions have focused on reducing latency and energy consumption. However, a good design should be compliant to standards, in addition to considering these factors. Based on this observation, this paper defines a minimum delay beacon scheduling problem for quick convergecast in ZigBee tree-based wireless sensor networks and proves that this problem is NP-complete. Our formulation is compliant with the low-power design of IEEE 802.15.4. We then propose optimal solutions for special cases and heuristic algorithms for general cases. Simulation results show that the proposed algorithms can indeed achieve quick convergecast.
| 原文 | English |
|---|---|
| 頁(從 - 到) | 999-1011 |
| 頁數 | 13 |
| 期刊 | Computer Communications |
| 卷 | 31 |
| 發行號 | 5 |
| DOIs | |
| 出版狀態 | Published - 25 3月 2008 |
文獻附註
Funding Information:Y.-C. Tseng’s research is co-sponsored by Taiwan MoE ATU Program, by NSC Grants 93-2752-E-007-001-PAE, 96-2623-7-009-002-ET, 95-2221-E-009-058-MY3, 95-2221-E-009-060-MY3, 95-2219-E-009-007, 95-2218-E-009-209, and 94-2219-E-007-009, by Realtek Semiconductor Corp., by MOEA under Grant No. 94-EC-17-A-04-S1-044, by ITRI, Taiwan, by Microsoft Corp., and by Intel Corp.
指紋
深入研究「Quick convergecast in ZigBee beacon-enabled tree-based wireless sensor networks」主題。共同形成了獨特的指紋。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver