Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (3): 79-82.

• 网络、通信、安全 • Previous Articles     Next Articles

Study on link scheduling algorithm in Dual-Radio wireless sensor networks

LI Jianjun1,WANG Yanchun2,FAN Bin3   

  1. 1.School of Science,Qiqihar University,Qiqihar,Heilongjiang 160005,China
    2.School of Communication and Electronic Engineering,Qiqihar University,Qiqihar,Heilongjiang 160005,China
    3.School of Computer Science,Heilongjiang University,Harbin 150080,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2012-01-21 Published:2012-01-21


李建军1,王艳春2,范 斌3   

  1. 1.齐齐哈尔大学 理学院,黑龙江 齐齐哈尔 160005
    2.齐齐哈尔大学 通信与电子工程学院,黑龙江 齐齐哈尔 160005
    3.黑龙江大学 计算机科学技术学院,哈尔滨 150080

Abstract: Considering the fact that both the orthogonal channels and the number of radios in a sensor node are limited in wireless sensor networks,a distributed Channel Allocation(CA) algorithm for Multi-Sink Dual-Radio WSNs is presented.Based on CA,a Link Scheduling(LS) algorithm is proposed in this paper as well.Based on the number of hops from nodes to the Sink,the networks are divided into different levels,which form hierarchical networks.CA avoids conflictions within different levels,and LS avoids conflictions within same level.CA and LS implement the data parallel transmission with zero-conflict,and it can finish the data collection in wireless sensor networks in a preferable way.Experiment results indicate that CA and LS can reduce the data collection time obviously,and hence increase the throughput of the networks.

Key words: Wireless Sensor Networks(WSNs), Channel Allocation(CA), Link Scheduling(LS), data collection

摘要: 针对传感器网络中正交信道较少和传感器节点不易配备过多Radio的特点,提出一种Multi-Sink Dual-Radio传感器网络中分布式信道分配算法(Channel Allocation,CA),并在此基础上提出一种半分布式链路调度算法(Link Scheduling,LS)。根据节点距离Sink节点的最少跳数,将网络划分为不同的层次,形成层次结构网络。CA能消除不同层次节点间的通信冲突,而LS能消除同层次节点间的通信冲突。从而CA和LS高效率地实现数据无冲突并行传输,可较好地解决传感器网络中的数据收集问题。实验结果表明,提出的算法可显著减少数据收集时间,提高网络吞吐量。

关键词: 无线传感器网络, 信道分配, 链路调度, 数据收集