首页 | 本学科首页   官方微博 | 高级检索  
     

视角受限传感器网络强栅栏覆盖判定算法
引用本文:陶丹,陈后金. 视角受限传感器网络强栅栏覆盖判定算法[J]. 北方交通大学学报, 2011, 0(5): 8-11
作者姓名:陶丹  陈后金
作者单位:北京交通大学电子信息工程学院,北京100044
基金项目:基金项目:国家自然科学基金资助项目(60872081,60972093);教育部博士点基金项目资助(20100009120004);中央高校基本科研业务费专项资金资助(2011JBM011);北京交通大学红果园人才培育计划项目资助;智能通信软件与多媒体北京市重点实验室开放课题项瞵助(W10L00350)
摘    要:
栅栏覆盖研究如何分配网络时空资源来确保移动目标穿越监控区域时被监测.本文通过视角受限节点传感方向的调整,设计一种分布式算法以判定网络能否提供强栅栏覆盖.算法主要思想是利用节点及邻居节点的物理位置关系构建强/弱栅栏对.另外,本文设计贪心策略优先选择邻居节点数多的候选节点构建强栅栏路径.仿真实验证明:本算法可以较小代价判定并改善网络强栅栏覆盖性能.

关 键 词:传感器网络  视角受限感知模型  栅栏覆盖  强栅栏

Strong barrier coverage detection algorithm for directional field of view sensor networks
TAO Dan,CHEN Houjin. Strong barrier coverage detection algorithm for directional field of view sensor networks[J]. Journal of Northern Jiaotong University, 2011, 0(5): 8-11
Authors:TAO Dan  CHEN Houjin
Affiliation:(School of Electronics and Information Engineering, Beijing J iaotong University, BeijinN 100044, China)
Abstract:
Barrier coverage focuses on how to assign space-time resource to detect the intruders that attempt to cross the network. By resetting the sensing orientations of directional field of view sensors, we propose a distributed algorithm to detect whether a given sensor network can provide strong barrier coverage or not. The basic idea is defining strong/weak barrier pair by sensor neighbors' position information. Moreover, we design a greedy algorithm with priority to select candidate node(s) with the maximum number of neighbor nodes in order to build up the strong barrier path. Experimental data testify that our algorithm can effectively detect in order and improve strong barrier coverage for a directional field of view sensor network with small cost.
Keywords:sensor network  directional field of view sensing model  barrier coverage  strong barrier
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号