改进的线性无线传感网络节点排序算法  

Improved Sorting Algorithm for Nodes in Linear Wireless Sensor Networks

作　　者：冉建双 杨海波 Ran Jianshuang;Yang Haibo(School of Information Science and Engineering,Shenyang University of Technology,Shenyang,China)

机构地区：[1]沈阳工业大学信息科学与工程学院,辽宁沈阳

出　　处：《科学技术创新》2023年第14期93-96,共4页Scientific and Technological Innovation

基　　金：辽宁省教育厅基本科研项目“基于线性传感自组网的铁路区间防灾监测关键技术研究”(项目编号:LJKFZ20220184)。

摘　　要：在线性无线传感器网络(LWSN)中,传感节点部署的物理顺序不仅对应用程序有益,而且对一些网络服务也很有用,如数据聚合和路由。为了更好的获取该顺序,本文针对基于质心的分布式迭代算法(分布式迭代算法)的不足进行优化和改进,提出了一种改进的节点排序算法。该算法在分布式迭代算法的基础上重新设计通信方案,利用LWSN特殊的拓扑结构来获取节点的物理顺序。模拟实验表明,改进的节点排序算法和分布式迭代算法相比显著降低了节点之间的通信量,改进的排序算法更适合大型、大规模的LWSN。In linear wireless sensor networks(LWSN),the physical deployment order of sensing nodes is beneficial not only for application programs but also for network services such as data aggregation and routing.To achieve this order more effectively,this paper optimizes and improves the shortcomings of the centroid-based distributed iterative algorithm,proposing an enhanced node sorting algorithm.By redesigning the communication scheme based on the distributed iterative algorithm and utilizing the LWSN's unique topology,this algorithm obtains the physical order of nodes.Simulation experiments demonstrate that the improved node sorting algorithm significantly reduces node communication compared to the distributed iterative algorithm,making it more suitable for large-scale LWSN.

关 键 词：LWSN 排序 算法 通信量 

分 类 号：TP212.9[自动化与计算机技术—检测技术与自动化装置]