On maximizing the throughput of convergecast in wireless sensor networks

Nai Luen Lai, Chung Ta King, Chun-Han Lin

研究成果: 書貢獻/報告類型會議論文篇章

20 引文 斯高帕斯(Scopus)

摘要

A primary task of wireless sensor networks is collecting environmental information. In most cases, a sink node is responsible for collecting data from all sensor nodes. The radio congestion around the sink becomes the main bottleneck to maximizing the throughput of the convergecast. A general strategy to alleviating the problem is to schedule the communications among sensors to avoid interference. In this paper, we consider both routing structures and communication schedules for optimizing the scheduling length. We show that the shortest-length conflict-free scheduling is equivalent to finding a minimal vertex coloring. To solve the schedule problem, a virtual-node expansion is proposed to handle the relay operations in convergecast, and then coloring algorithms are used to obtain the communication schedule. However, scheduling only solves part of the problem. Routing structures will also affect the scheduling quality. The disjoint-strips routing is thus proposed to leverage possible parallel transmissions in convergecast. The proposed algorithms are evaluated through simulations.

原文英語
主出版物標題Advances in Grid and Pervasive Computing - Third International Conference, GPC 2008, Proceedings
頁面396-408
頁數13
DOIs
出版狀態已發佈 - 2008 六月 9
事件3rd International Conference on Grid and Pervasive Computing, GPC 2008 - Kunming, 中国
持續時間: 2008 五月 252008 五月 28

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5036 LNCS
ISSN(列印)0302-9743
ISSN(電子)1611-3349

其他

其他3rd International Conference on Grid and Pervasive Computing, GPC 2008
國家/地區中国
城市Kunming
期間2008/05/252008/05/28

ASJC Scopus subject areas

  • 理論電腦科學
  • 電腦科學(全部)

指紋

深入研究「On maximizing the throughput of convergecast in wireless sensor networks」主題。共同形成了獨特的指紋。

引用此