摘要
对数据收集时延进行研究,先将最小收集时延问题进行形式化表述,并建立目标函数;依据节点剩余能量,并结合克鲁斯卡尔(Kruskal)算法构成最小生成树;依据最小生成树分配数据收集时隙。实验数据表明:提出的时隙分配算法能够有效地降低收集时延,并降低了能耗。
Study on data collection delay. The minimal data collection delay issue is formally represented,and the objective function is constructed. According to residual energy of node,the spanning tree is constructed by Kruskal algorithm. The time slots of collecting data are allocated by the spanning tree. Experimental results show that the proposed time slot allocation algorithm can effectively reduce data collection delay and reduce energy consumption.
作者
白秋产
王亮明
BAI Qiu-chan;WANG Liang-ming(College of Automation,Huaiyin Institute of Technology,Huai’an,223003 China;School of Computer Science&Engineering,South China University of Technology,Guangzhou 510006,China)
出处
《传感器与微系统》
CSCD
2019年第4期146-148,153,共4页
Transducer and Microsystem Technologies
基金
江苏省自然科学基金青年科学基金资助项目(BK20140457)
关键词
无线传感器网络
数据收集
最小生成树
能耗
分配时隙
wireless sensor networks(WSNs)
data collection
minimum spanning tree
energy consumption time slot allocation