检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东北大学软件中心,辽宁沈阳110819 [2]大连东软信息学院计算机科学与技术系,辽宁大连116023
出 处:《东北大学学报(自然科学版)》2013年第10期1378-1382,共5页Journal of Northeastern University(Natural Science)
基 金:国家自然科学基金资助项目(61170169;61170168)
摘 要:针对高密度部署的无线传感器网络边界节点邻居数量低于内部节点而导致休眠概率不均等进而边界收缩的问题,提出了一种轻量级调度算法.根据邻居表中节点的数量以及邻居节点的工作邻居数量判定节点是否处于网络边界,对于边界节点和内部节点采用不同的调度策略,并分别计算得出处于网络边界的节点被n个邻居完全覆盖的概率和边界节点被n个邻居覆盖的面积分数的范围.仿真结果表明,该算法能够有效缓解边界收缩问题,延长网络生命周期.The number of boundary nodes neighbors is less than that of the internal nodes in high- density deployment wireless sensor network, which will lead to unequal probability of sleep and the problem of boundary contraction. To solve the problems, a nodes lightweight scheduling algorithm was proposed to prevent boundary contraction. The number of nodes in neighbor table and the number of neighbor nodes' working neighbors were used to determine whether the node was in the network boundary. For those boundary and internal nodes, different scheduling strategies were used. The probability of nodes covered completely by n neighbors in the network boundary and the range of area fraction of the boundary node covered by n neighbors were calculated, respectively. The simulation results showed that the boundary contraction can be effectively alleviated and the network life cycle can be extended by using the proposed algorithm.
关 键 词:无线传感器网络 节点休眠 防边界收缩 边界节点判定 能量
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3