无线传感器网络中多Sink节点位置部署研究  

Research on position deployment of multiple sink nodes in WSNs

作　　者：韩凯州 马福昌[2] 

机构地区：[1]太原理工大学新型传感器与智能控制教育部重点实验室,山西太原030024 [2]太原理工大学测控技术研究所,山西太原030024

出　　处：《传感器与微系统》2014年第3期37-39,43,共4页Transducer and Microsystem Technologies

基　　金：教育部科学技术研究重点资助项目(210270);教育部博士点新教师基金资助项目(20091402120006)

摘　　要：通过对随机分布的无线传感器网络节点密度和能量消耗的关系的分析,提出了无线传感器网络中多异构节点位置部署的区域密度优先(RDF)算法。此算法采用密度优先原则来决定Sink节点的放置位置,通过栅格和异构节点通信范围对网络进行区域划分。该算法比递归算法的异构节点放置位置优越,虽然在网络寿命上相接近,但远大于随机分布策略的寿命,且RDF更适合实际应用。通过仿真验证:该算法能够有效延长网络寿命和快速实现部署。A region density first（ RDF） algorithm for multiple heterogeneous nodes position deployment is presented,through analysis on relationship between density and energy consumption of randomly distributed wireless sensor networks（ WSNs） node.This algorithm uses principle of density priority to decide placement position of the sink node,the proposed algorithm can determine the density placement of the heterogeneous nodes in the areas with diverse node density,network area is divided into some small cells based on both regular grids and the comunication coverage ranges of heterogeneous nodes.The algorithm is superior to the recursive algorithm of heterogeneous nodes placement position,although it is close to the network lifetime,it is much longer than the life of a random distribution strategy and RDF is more suitable for practical applications.The simulation verifies that the RDF algorithm can extend the network lifetime effectively and rapidly realize deployment of WSNs.

关 键 词：区域密度优先算法 无线传感器网络 网络寿命 

分 类 号：TN92[电子电信—通信与信息系统]