WSNs中数据融合树的时隙分配算法

周期工作DC(Duty-Cycling)技术,即周期地开/关通信和感测能力,能够有效降低传感节点的活动时间,进而延长无线传感网络寿命.然而,此技术给数据融合提出了挑战.为此,提出免碰撞的数据融合树的时隙分配算法CF-DGSS(Collision-Free Data Aggregation Slots Scheduling Algorithm for Duty-Cycled Wireless Sensor Networks),进而解决基于DC的WSNs的数据融合时隙分配问题.为了解决碰撞问题,CF-DGSS算法给每个节点构建冲突集.每个节点在融合时隙分配过程中,保存自己的冲突集.在分配时隙时,传感节点应当确保与冲突集内节点的数据融合不干扰.仿真结果表明,与其他的分配算法相比,提出的CF-DGSS算法具有低的融合时延.

Data aggregation slots Scheduling algorithm for Duty-Cycled Wireless sensor Networks

Duty-Cycling (DC) technique, i.e., periodically switching ON and OFF communication and sensing capabilities, has been considered to significantly reduce the active time of sensor nodes and thus extend network lifetime. However, this technique causes challenges for data aggregation. Therefore, Collision-free data aggregation slots Scheduling (CF-DGSS) algorithm for Duty-Cycled Wireless sensor Networks is proposed in this paper, which solves the aggregation-scheduling problem in DC WSNs. To solve the collision issue and guarantee that a collision-free aggregation schedule is generated, we give the definition of the conflicting set for each sensor node. Each sensor node should keep this information in the data aggregation scheduling process. When scheduling, a sensor node should check to ensure that its scheduled transmission is not conflicted with any assigned transmission of node in its conflicting set. The simulation results show that CF-DGSS algorithm outperforms other distributed schemes in terms of data aggregation delay