论文:2012,Vol:30,Issue(6):931-935
引用本文:
马超, 史浩山, 黄亮. 传感器网络中基于抑制点过程的随机调度覆盖控制算法[J]. 西北工业大学
Ma Chao, Shi Haoshan, Huang Liang. An Effective IRSCCA (Inhibiton Point Process Based Random Scheduling Coverage Control Algorithm) Algorithm in Wireless Sensor Networks[J]. Northwestern polytechnical university

传感器网络中基于抑制点过程的随机调度覆盖控制算法
马超, 史浩山, 黄亮
西北工业大学 电子信息学院, 陕西 西安 710072
摘要:
现有随机调度覆盖控制算法由于节点加入不相交覆盖子集的完全随机性,会出现节点分布不均匀、额外唤醒节点过多的问题。文章通过理论分析给出了存在边界效应时满足覆盖质量要求的随机覆盖集节点数量的下界,然后根据抑制点过程理论对节点分布均匀性进行了量化建模,并给出了最优抑制距离搜索方法,在此基础上提出了一种基于抑制点过程的随机调度覆盖控制算法(IRSCCA),IRSCCA算法采用基于抑制机制的不相交覆盖子集划分规则来改善各覆盖子集节点分布的均匀性,通过自适应额外唤醒规则保证各覆盖子集到Sink的连通性。仿真结果表明,与现有算法相比IRSCCA算法可以显著改善覆盖子集中节点分布的均匀性,提供更好的覆盖质量,并能有效减少额外唤醒节点数量。
关键词:    传感器网络    随机调度    抑制点过程   
An Effective IRSCCA (Inhibiton Point Process Based Random Scheduling Coverage Control Algorithm) Algorithm in Wireless Sensor Networks
Ma Chao, Shi Haoshan, Huang Liang
Department of Electronics Engineering,Northwestern Polytechnical University,Xi'an 710072,China
Abstract:
Aiming at non-uniformity of node distribution and excessive extra-on nodes due to full randomization innodes’joining disjoint cover subsets in traditional algorithms,we propose our IRSCCA algorithm. Sections 1through 4 of the full paper explain our IRSCCA algorithm mentioned in the title,which we believe is effective andwhose core consists of: (1) we analyze theoretically the minimal number of nodes that belong to random cover sub-set satisfying required coverage quality; (2) we model quantitatively the spatial regularity of node distribution ac-cording to inhibition point process theory and present an optimal inhibition distance search approach; (3) IRSCCAalgorithm utilizes disjoint cover subset partition rule based on inhibition mechanism to improve the uniformity ofnode distribution in each cover subset and to ensure each cover subset's connectivity from source to sink by an a-daptive extra-on rule. Simulation results, presented in Figs. 2 and 3,and their analysis show preliminarily that IR-SCCA algorithm can indeed provide higher coverage quality as a result of more uniform node distribution in eachcover subset while reducing the number of extra-on nodes as compared with the traditional algorithm.
Key words:    algorithms    computer simulation    energy conservation    mathematical models    optimization    schedu-ling    wireless sensor networks    inhibition point process based random scheduling coverage control al-gorithm (IRSCCA)   
收稿日期: 2011-12-27     修回日期:
DOI:
通讯作者:     Email:
作者简介: 马超(1978-),西北工业大学博士研究生,主要从事无线传感器网络通信协议以及覆盖控制、定位等算法研究。
相关功能
PDF(838KB) Free
打印本文
把本文推荐给朋友
作者相关文章
马超  在本刊中的所有文章
史浩山  在本刊中的所有文章
黄亮  在本刊中的所有文章

参考文献:
[1] Liu C,Wu K,Xiao Y,et al.Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks.IEEE Trans on Parallel and Distributed Systems, 2006, 17(6): 562-575
[2] Jin Y,Jo J Y,et al.ECCRA: An Energy-Efficient Coverage and Connectivity Preserving Routing Algorithm under BorderEffects in Wireless Sensor Networks.Computer Communications, 2008, 31: 2398-2407
[3] Xiao Y,Chen H,et al.Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks.IEEETrans on Computers, 2010, 59(4): 507-520
[4] Choi W,Das S K.Coverage-Adaptive Random Sensor Scheduling for Application-Aware Data Gathering in Wireless Sensor Net-works.Computer Communications, 2006, 29(17): 3467-3482
[5] Miller L E.Distributional Properties of Inhibited Random Positions of Mobile Radio Terminals.Proc of Information Sciences andSystems (CISS),Princeton University,New Jersey,USA, 2002
[6] Yu C W,Yen L H.Estimating the Number of Links in Ad Hoc Mobile Networks with Applications.Tech Rep CHU-CSIE-TR-2003-002,CSIE,Chung Hua Univ,Taiwan, 1-8
[7] Zhang H H,Hou J C.Maintaining Sensing Coverage and Connectivity in Large Sensor Networks.Ad Hoc & Sensor Networks,2005, 89-124