%0 Journal Article
%T Double Barrier Coverage in Dense Sensor Networks
%A Cheng-Dong Jiang Guo-Liang Chen
%A <br>蒋承东
%A 陈国良
%J 计算机科学技术学报
%D 2008
%I 
%X When a sensor network is deployed to detect objects penetrating a protected region, it is not necessary to have every point in the deployment region covered by a sensor. It is enough if the penetrating objects are detected at some point in their trajectory. If a sensor network guarantees that every penetrating object will be detected by two distinct sensors at the same time somewhere in this area, we say that the network provides double barrier coverage (DBC). In this paper, we propose a new planar structure of Sparse Delaunay Triangulation (SparseDT), and prove some elaborate attributes of it. We develop theoretical foundations for double barrier coverage, and propose efficient algorithms with NS2 simulator using which one can activate the necessary sensors to guarantee double barrier coverage while the other sensors go to sleep. The upper and lower bounds of number of active nodes are determined, and we show that high-speed target will be detected efficiently with this configuration. Electronic Supplementary Material The online version of this article (doi:) contains supplementary material, which is available to authorized users. This paper is supported by the National Grand Fundamental Research 973 Program of China under Grant No. 2006CB303006.
%K wireless sensor network
%K barrier coverage
%K Delaunay triangulation
%K distributed algorithm<br>无线传感网络
%K 网络覆盖
%K 三角测量
%K 分布式算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=EC035281690A8295996010C7A8F7A447&yid=67289AFF6305E306&vid=EA389574707BDED3&iid=CA4FD0336C81A37A&sid=E2546871E5B846EF&eid=5FA33A46A0F3E2E3&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=12