秦宁宁^1,,,
金磊¹,
许健¹,
徐帆²,
杨乐³
1.江南大学轻工过程先进控制教育部重点实验室 ??无锡 ??214122
2.南京航空航天大学雷达成像与微波光子教育部重点实验室 南京 210016
3.坎特伯雷大学电气与计算机工程系 克赖斯特彻奇 新西兰 8011
基金项目:国家自然科学基金(61702228)，江苏省自然科学基金(BK20170198)，雷达成像与微波光子教育部重点实验室开放基金(NJ20170001-7)，江苏省博士后科研资助计划(1601012A)，江苏省“六大人才高峰”计划(DZXX-026)，中央高校基本科研业务费专项资金(JUSRP1805XNC)

详细信息

作者简介:秦宁宁：女，1980年生，副教授，硕士生导师，研究方向为无线传感器网络及应用
金磊：男，1993年生，硕士生，研究方向为无线传感器网络覆盖
许健：男，1992年生，硕士生，研究方向为无线传感器网络覆盖
徐帆：男，1988年生，讲师，硕士生导师，研究方向为信号处理与应用
杨乐：男，1979年生，副教授，硕士生导师，研究方向为无线信号统计与应用

通讯作者:秦宁宁　ningning801108@163.com

中图分类号:TN929.5

计量

文章访问数:2096
HTML全文浏览量:690
PDF下载量:50
被引次数:0

出版历程

收稿日期:2019-02-17
修回日期:2019-06-09
网络出版日期:2019-06-14
刊出日期:2019-10-01

Neighbor Information Constrained Node Scheduling in Stochastic Heterogeneous Wireless Sensor Networks

Ningning QIN^1,,,
Lei JIN¹,
Jian XU¹,
Fan XU²,
Le YANG³
1. Key Laboratory of Advanced Process Control for Light Industry of Ministry of Education, Jiangnan University, Wuxi 214122, China
2. Key Laboratory of Radar Imaging and Microwave Photonics, Ministry of Education, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
3. Department of Electrical and Computer Engineering, University of Canterbury, Christchurch 8011, New Zealand
Funds:The National Natural Science Foundation of China (61702228), The Natural Science Foundation of Jiangsu Province (BK20170198), The Open Fund of Key Laboratory of Radar Imaging and Microwave Photonics of Ministry of Education (NJ20170001-7), Jiangsu Province Planned Projects for Postdoctoral Research Funds (1601012A), The Eleventh Batch High-level Talents Project of “Six Talent Peaks” in Jiangsu Province(DZXX-026), Fundamental Research Funds for the Central Universities (JUSRP1805XNC)


摘要
摘要:针对高密度部署的随机异构传感器网络内部存在的覆盖冗余问题，该文提出一种随机异构无线传感器网络的节点调度算法(NSSH)。在网络原型拓扑的支撑下构建Delaunary三角剖分，规划出节点进行本地化调度的局部工作子集。通过折中与邻近节点的空外接圆半径，完成对感知半径的独立配置；引入几何线、面概念，利用重叠面积和有效约束圆弧完成对灰、黑色节点的分类识别，使得节点仅依赖本地及邻居信息进行半径调整和冗余休眠。仿真结果表明，NSSH能以低复杂度的代价，近似追平贪婪算法的去冗余性能，并表现出了对网络规模、异构跨度和参数配置的低敏感性。
关键词:传感器网络/
随机异构/
覆盖/
节点调度/
邻近信息
Abstract:Considering coverage redundancy problem existed in random heterogeneous sensor networks with high density deployment, a Node Scheduling algorithm for Stochastic Heterogeneous wireless sensor networks(NSSH) is proposed. The Delaunary triangulation is constructed based on the network prototype topology to work out a local subset of nodes for localization scheduling. Independent configuration of the perceived radius is achieved by discounting the radius of the circumcircle with the adjacent node. The concept of geometric line and plane is introduced, and the overlapping area and the effective constrained arcs are used to classify and identify the grey and black nodes. So the node only relies on local and neighbor information for radius adjustment and redundant node sleep. The simulation results show that NSSH can approximately match the dropping redundancy of greedy algorithm at the cost of low complexity, and exhibit low sensitivity to network size, heterogeneous span and parameter configuration.
Key words:Sensor network/
Stochastic heterogeneous/
Coverage/
Node scheduling/
Neighbor information



PDF全文下载地址:

https://jeit.ac.cn/article/exportPdf?id=d77dbcf2-f429-4f2f-8b25-14f7a9cf4b57