检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘广怡[1] 韩哲 何中阳 陈为业 LIU Guangyi;HAN Zhe;HE Zhongyang;CHEN Weiye(Information Engineering University,Zhengzhou 450001,China;Luoyang Institute of Science and Technology,Luoyang 471023,China)
机构地区:[1]信息工程大学,河南郑州450001 [2]洛阳理工学院,河南洛阳471023
出 处:《信息工程大学学报》2021年第1期25-31,共7页Journal of Information Engineering University
摘 要:对于大规模无线传感网的工程应用,降低网络能耗、延长网络寿命和克服链路丢包成为设计传感网数据收集算法的关键因素。提出一种基于定向游走的稀疏压缩感知数据收集算法,网络节点以环状部署的方式非均匀分布在以Sink为中心的圆形区域内,每次数据收集过程由最外环内的随机唤醒节点发起,逐跳向内环定向游走,直至游走至CS数据缓冲区内结束收集过程。仿真结果表明,采用稀疏定向游走机制对全网数据进行投影采样,可以有效降低网络能耗,延长网络寿命。同时在有损链路环境下,该算法依然具有高精度的重构性能,克服了链路丢包对CS数据收集的影响。For large-scale wireless sensor networks,reducing network energy consumption,prolonging network lifetime and overcoming packet loss are the key factors in designing sensor network data collection algorithms.In this paper,a directional walk scheme based on sparse compressed sensing is proposed,in which the network nodes are inhomogeneously distributed in a circular region centered at a Sink.Each data collection process is initiated by the random wake-up node in the outermost ring,and then jumps to the inner ring and walks to the CS data buffer to finish the collection process.The simulation results show that the whole network can reduce the energy consumption and prolong the network lifetime by using the sparse directional walk mechanism to sample the whole network data.Further,the proposed algorithm still has high-precision reconstruction performance and overcomes the impact of link packet loss on CS data collection.
分 类 号:TN391[电子电信—物理电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.90