基于覆盖与连通的WSN节点调度算法  

Node scheduling algorithm based on coverage and connectivity in Wireless Sensor Networks

作　　者：曾凡仔[1] 杨丹[2] 沈连丰[1] 罗娟[2] 

机构地区：[1]东南大学移动通信国家重点实验室,南京210096 [2]湖南大学计算机与通信学院,长沙410082

出　　处：《计算机工程与应用》2008年第14期107-110,154,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(the National Natural Science Foundation of China under Grant No.60673061);湖南省自然科学基金(the Natural Science Foundation of Hunan Province of China under Grant No.06JJ50113,No.06JJ50111);教育部博士点基金(No.20070532089,No.20060532024);江苏省高技术研究资助项目(No.BG2006002)

摘　　要：在维护区域覆盖和网络连通性的前提下,提出了一种基于最小跳数的分布式节点调度算法(MBNS)。距网关最小跳数相等的节点形成以网关为中心的最小跳数环,将网络划分为环状层次拓扑结构;每个节点根据其上行和下行节点维护了一条到网关节点的最短跳数路径,解决数据路由的同时有效降低了数据发送延迟。理论分析和仿真实验表明,MBNS能有效减少工作节点个数,降低数据发送延迟和延长网络寿命等。This paper presents a Minimal-hop-to-sink Based Node-Scheduling algorithm（MBNS） under the constraints of field coverage and network connectivity. Sensors of the same hop to the sink form a Minimal-Hop-Ring（MHR） while all sensors construct a ring-leveled topology. Besides,each node maintains a sbertest path to the sink by knowing its upstream and downstream nodes, which solves data routing problem as well as decreases the data send delay greatly. The analytical and experimental results prove MBNS can minimize the active nodes, decrease data send delay and prolong network life greatly.

关 键 词：区域覆盖 网络连通性 最小跳数环 数据发送延迟 延长网络寿命 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]