摘要
单radio单信道无线传感器网络的最小延迟聚集调度是一个NPC问题,已提出许多解决方案。在多radio多信道网络中,节点可以同时接收多个不同节点传输的数据,降低延迟。基于上述特点,考虑树结构约束,时槽、信道和radio分配等约束条件,将多radio多信道无线传感器网络最小延迟聚集调度问题定义为一个优化问题,并分解为建立聚集树和节点调度2个子问题,针对这2个子问题分别提出启发式算法。实验结果表明,提出的算法具有良好的性能。
The problem of minimum latency data aggregation scheduling in single-radio single-channel wireless sensornetworks is a NPC problem and many solutions have been proposed. In multi-radio multi-channel networks, the latencymay be lower as a node may receive transmission data from other different nodes simultaneously. It formulates the mini-mum latency data aggregation scheduling into an optimization problem with joint consider of tree structure, time slot as-signment, channel assignment and radio assignment. The problem is divided into constructing data aggregation tree anddesigning a node schedule subproblems. For each subproblem, heuristic algorithm has been proposed. The simulation re-sults show that the proposed algorithm achieve good performance.
出处
《通信学报》
EI
CSCD
北大核心
2014年第10期192-199,共8页
Journal on Communications
基金
国家自然科学基金资助项目(61070193
61370222)
黑龙江省杰出青年基金资助项目(JC201104)
黑龙江省高校科技创新团队建设计划基金资助项目(2013TD012)
教育部新世纪优秀人才支持计划基金资助项目(NCET-11-0955)
黑龙江省教育厅高校新世纪优秀人才支持计划基金资助项目(1252-NCET-011)~~
