摘要
在无线传感器网络多种应用中,各节点需要在短时间内将采集的数据传输至汇聚节点,从而形成多对一的汇聚传输。针对网络汇聚传输的实时性,提出了一种分布式的节点传输调度算法。各节点只需要根据一跳范围内的邻居信息进行传输调度。仿真和分析表明该算法可以有效避免数据碰撞,并使得完成一次全网数据收集所需要的时隙数基本在网络节点总数的1.6到1.8倍左右,比目前其他调度算法在实时性和复杂度方面更具有优势。
In some applications of wireless sensor networks, data packets generated by every node have to reach the sink node in short time. It resulted in a many-to-one communication paradigm referred to as convergecast. For the real-time of convergecast, a distributed scheduling algorithm was proposed. According to the algorithm, every node was scheduled by itself with information of one-hop range neighbor nodes. Some simulation and analysis prove that the algorithm can avoid data collisions, and the total number of timeslots needed to complete the convergecast once was around 1.6N to 1.8N, where N represents the number of nodes in the network.
出处
《通信学报》
EI
CSCD
北大核心
2007年第4期44-50,共7页
Journal on Communications
基金
国家自然科学基金资助项目(60673178)
国家重点基础研究发展计划("973"计划)基金资助项目(2006CB303007)
国家高技术研究发展计划("863"计划)基金资助项目(2006AA01Z218)~~