为了提高WMSNs中多个源节点到sink节点的数据收集效率,文章提出了一种基于树型拓扑结构的多信道快速数据收集算法.该算法有三个主要特点:基于接收方的信道分配算法有效地消除了信道间的干扰;TDMA机制消除了节点间的竞争和冲突;节点度受限的平衡路由树的构建,消除了由于单个节点度太深所造成的调度瓶颈.通过在不同节点配置密度下的深入仿真,验证了文中提出的多信道调度算法与同样基于树的多信道调度协议TMCP相比,具有更快的调度收集性能,同时,采用平衡路由树进一步缩短了收集调度长度.%The introduction of the full paper reviews some papers in the open literature and then proposes the exploration of a better scheduling algorithm, which is explained in sections 1 and 2.Section 1 addresses the interferences and conflicts in WMSNs and introduce the data collection scheduling problem.Section 2 proposes a hybrid multichannel scheduling algorithm on tree-based WMSNs to eliminate the interferences and conflicts in WMSNs; its core consists of: (1) we present a receiver-based multi-channel assignment algorithm and give its implementation; (2) we implement a breadth-first-search time slot assignment algorithm to avoid conflicts; (3) we construct a degreeconstrained balanced routing tree to further enhance the data collection rate.Section 3 simulates our receiver-based multi-channel assignment algorithm and compares it with a recent tree-based multi-channel protocol (TMCP); the simulation results, given in Figs.3 and 4, and their analysis show preliminarily that: ( 1 ) our receiver-based channel assignment algorithm can outperform much the TMCP in terms of data collection; (2) the combination of multiple channels with balanced routing trees can reduce the schedule length greatly compared with the unbalanced routing tree single channel.
展开▼
