参与感知网络中转发节点抽样优化算法.pdfVIP

计算机工程与设计 Oct. 2016 2016 年 10 月 CO岛1PUTER ENGINEERING AND DESIGN Vo l. 37 No.10 第 37 卷第10 期 参与感知网络中转发节点抽样优化算法 杜景林，侯大俊+ (南京信息工程大学电子与信息工程学院，江苏南京 210044) 摘 要2 针对参与式感知网络中转发节点的筛选问题，设计一种时空优化算法，利用聚类算法的思想，通过 AP 节点对移 动传感器节点在空间上进行聚类抽样，设计一种转发节点夹角最小化算法 (MANF) ，对聚类之后区域AP 节点间传输的物 理路径问题进行优化。在转发节点的抽取上考虑夫角和距离两个因素的影响，缩短AP 节点对之间传输延迟。通过仿真实 验与现有的最短路径算法 (SSP) 进行比较，验证了该算法能够很好地优化抽取的网络节点数量，缩短了抽样l$-径的距离。 关键词:参与感知网络:聚类:时间优化;抽样z 贪婪 中固法分类号: TP393 文献标识号:A 文章编号: 1000-7024 (2016) 10-2597-05 doi: 10. 16208/j. issnlOOO-7024. 2016. 10.004 Optimal selection of forwarding node algorithm in participatory sensing networks DU Jing-lin , HOU Da-jun+ (College of Electronic and Information Engineering , Nanjing University of Information Science and Technology , Nanjing 210044 , China) Abstract: There are a number of sensing nodes in the participatory sensing networks and most of them do not have the valid for- warding condition. To find some efficient aggregation regions and an optimal path to reduce transmission delay between a pair of APs from participatory sensing networks , first , a mechanism was designed to determine aggregation regions based on the loca- tion of access points , and a time optimization algorithm called MANF was presented , which considered the effects of both angle and distance. This algorithm improved the performance of existing algorithrn. Results of simulation show that the proto∞1 has lower number of nodes and it shortens the distance of the sampling path , compared to the SSP algorit hrn. Keyw创由: participatory sensing networks; clustering; time optirnization; sample; greedy