Strong Barrier Coverage Detection and Mending Algorithm for Directional Sensor Networks

April 2013
Adhoc & Sensor Wireless Networks;2013, Vol. 18 Issue 1/2, p17
Academic Journal
In this paper, we investigate strong barrier coverage using directional sensors with arbitrarily tunable orientations to provide good coverage. Firstly, we introduce the concept of virtual node to divide the original continuous solution space into finite set of discrete spaces. We then construct a directional barrier graph to model this barrier coverage question such that we can quickly answer whether there are directional sensors' orientations that can provide strong barrier coverage over a given belt region. If such orientations exist, we develop a solution to find strong barrier path(s) that will minimize the number of active directional sensors. Otherwise, we design an efficient algorithm based on directional barrier graph to find barrier gaps and mend these gaps with the minimum number of extra directional sensors. Finally, we evaluate the performance of our solution through extensive simulations.


Related Articles

  • GRAPH MINOR THEORY. Lovász, László // Bulletin (New Series) of the American Mathematical Society;Jan2006, Vol. 43 Issue 1, p75 

    A monumental project in graph theory was recently completed. The project, started by Robertson and Seymour, and later joined by Thomas, led to entirely new concepts and a new way of looking at graph theory. The motivating problem was Kuratowski's characterization of planar graphs, and a...

  • Leveraging 1-hop Neighborhood Knowledge for Connected Dominating Set in Wireless Sensor Networks. Wenyong Wang; Jun Zhang; Yong Tang; Yu Xiang; Ting Yang // Journal of Computers;Jan2012, Vol. 7 Issue 1, p11 

    To improve the efficiency of routing and broadcast and reducing energy consumption in the process of data transmission, calculating minimum connected dominating set is always used to construct virtual backbone network in wireless sensor networks. Calculating the minimum connected dominating set...

  • Approximation Two Independent Sets Based Connected Dominating Set Construction Algorithm for Wireless Sensor Networks. Z. Liu; B. Wang; Q. Tang // Information Technology Journal;2010, Vol. 9 Issue 5, p864 

    No abstract available.

  • An Improved Farmland WSN Topology Based on YG and Clustering Algorithm. Feng Huang; Chunjiang Zhao; Feifei Li; Huarui Wu // Information Technology Journal;2013, Vol. 12 Issue 21, p6463 

    The large scale farmland WSN monitoring has the characteristics of wide area and energy constraint. Nodes around sink node undertake lots of data transfer work, so these nodes have the problems of excessive energy consumption and some of them are inclined to early death. This study gives an...

  • A SELF-ORGANIZATIONAL BACK-OFF ALGORITHM BASED ON LOCAL TOPOLOGY ANALYSIS. Huibin Wang; Lili Zhang; Jie Shen; Jie Yang // Intelligent Automation & Soft Computing;Dec2011, Vol. 17 Issue 8, p1099 

    The back-off algorithm is the key point that directly affects the message transmission delay, during the design of the MAC layer of the vehicular ad hoc network communication protocol. However, thanks to the back-off time is inversely proportional to the seizing channel ability of the nodes, the...

  • Graph Rigidity Application for Localization in WSN. Rai, B. Shamantha; Varma, Shirshu // International Journal of Computer Applications;7/1/2012, Vol. 50, p15 

    Localization in WSN involves the global discovery of node coordinates. In a network topology, a few nodes are deployed to known nodal locations and remaining node nodal location information are dynamically estimated using with algorithms. The nodes of sensor network are of random type and the...

  • CONNECTIVITY-AWARE TOPOLOGY CONTROL WITH CYCLIC-LIKE STRUCTURES IN WIRELESS SENSOR NETWORKS. HUANG Zhiwei; ZHENG Zimu; LI Zhicheng; PENG Xinyi // International Journal on Smart Sensing & Intelligent Systems;Dec2014, Vol. 7 Issue 4, p1663 

    Connectivity offers the foundation for achieving required quality of service in all WSN applications. By the concept of cyclic-like topologies proposed and their property proved, we find a new searching method based on cyclic paths on nodes and their combination, which cuts down the cost of...

  • The Flip-Graph of the 4-Dimensional Cube is Connected. Pournin, Lionel // Discrete & Computational Geometry;Apr2013, Vol. 49 Issue 3, p511 

    Flip-graph connectedness is established here for the vertex set of the 4-dimensional cube. It is found as a consequence that this vertex set has 92,487,256 triangulations, partitioned into 247,451 symmetry classes.

  • A Fault-tolerant Routing Control for Double Loop Networks. Hongmei Liu // Journal of Systems Science & Information;Mar2006, Vol. 4 Issue 1, p141 

    This paper divides the vertex set into several disjoined subsets and provides an optimal fault-tolerance routing algorithm based on the vertex set partition. This algorithm is efficient and convergent, in polynomial time, we can get the output if the vertex is given.


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics