Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2013, Vol. 36 ›› Issue (5): 6-9.doi: 10.13190/j.jbupt.2013.05.002

• Papers • Previous Articles     Next Articles

Barrier Coverage Algorithm for Moving Target in Directional Sensor Networks

TAO Dan1,2, MAO Xu-fei3, WU Hao2   

  1. 1. School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China;
    2. State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, China;
    3. School of Software, Tsinghua University, Beijing 100084, China
  • Received:2013-03-13 Online:2013-10-31 Published:2013-08-09

Abstract:

Strong barrier path construction for directional sensor networks was focused on by optimizing the sensing orientations of directional sensors. The intersection point set and associated intersection point set were defined to describe the relationships between directional sensors and region boundaries. The solution space from continuous domain was reduced. Graph theory was utilized to construct a global barrier graph to model the pending problem, whether the directional sensors' sensing orientations are existed that can form strong barrier. A low-cost solution with the minimal number of directional sensors was designed as well. Simulation testifies the effectiveness of the proposed algorithm.

Key words: directional sensor networks, barrier coverage, associated intersection point, global coverage graph

CLC Number: