GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Visualization of wormholes in sensor networks
Proceedings of the 3rd ACM workshop on Wireless security
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
MAP: medial axis based geometric routing in sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Organizing a global coordinate system from local information on an ad hoc sensor network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Sweeps over wireless sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Hole detection or: "how much geometry hides in connectivity?"
Proceedings of the twenty-second annual symposium on Computational geometry
Geometry-based reasoning for a large sensor network
Proceedings of the twenty-second annual symposium on Computational geometry
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
Approximate isocontours and spatial summaries for sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Sparse data aggregation in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Rendered path: range-free localization in anisotropic sensor networks with holes
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Map: medial axis based geometric routing in sensor networks
Wireless Networks
Topology-based on-board data dissemination approach for sensor network
Proceedings of the 5th ACM international workshop on Mobility management and wireless access
Catching elephants with mice: sparse sampling for monitoring sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
On Boundary Recognition without Location Information in Wireless Sensor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Detecting Topological Change Using a Wireless Sensor Network
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Detecting basic topological changes in sensor networks by local aggregation
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Segmenting a sensor field: Algorithms and applications in network design
ACM Transactions on Sensor Networks (TOSN)
Localised convex hulls to identify boundary nodes in sensor networks
International Journal of Sensor Networks
Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Connectivity-based localization of large-scale sensor networks with complex shape
ACM Transactions on Sensor Networks (TOSN)
Reliable Greedy Forwarding in Obstacle-Aware Wireless Sensor Networks
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Perimeter discovery in wireless sensor networks
Journal of Parallel and Distributed Computing
Catching elephants with mice: Sparse sampling for monitoring sensor networks
ACM Transactions on Sensor Networks (TOSN)
An adaptive rendezvous data dissemination for irregular sensor networks with multiple sinks
Computer Communications
Redeployment based sensing hole mitigation in wireless sensor networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Scalable continuous object detection and tracking in sensor networks
Journal of Parallel and Distributed Computing
Estimation of a population size in large-scale wireless sensor networks
Journal of Computer Science and Technology - Special section on trust and reputation management in future computing systmes and applications
On boundary recognition without location information in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Information brokerage via location-free double rulings
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Topology and routing in sensor networks
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Improved positioning scheme based on DV-hop for wireless sensor network
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Potential game model to detect holes in sensor networks
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Computer Networks: The International Journal of Computer and Telecommunications Networking
A mapping of wireless network boundaries using localised alpha-shapes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Rendered path: range-free localization in anisotropic sensor networks with holes
IEEE/ACM Transactions on Networking (TON)
Efficient greedy geographical non-planar routing with reactive deflection
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Map estimation using GPS-equipped mobile wireless nodes
Pervasive and Mobile Computing
A generalized greedy routing algorithm for 2-connected graphs
Theoretical Computer Science
A distributed routing algorithm for sensor networks derived from macroscopic models
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient algorithms for distributed detection of holes and boundaries in wireless networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Journal of Network and Computer Applications
Lifetime extension for surveillance wireless sensor networks with intelligent redeployment
Journal of Network and Computer Applications
Perimeter detection in wireless sensor networks
Robotics and Autonomous Systems
On succinct convex greedy drawing of 3-connected plane graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Schnyder greedy routing algorithm
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Obstacle detection and estimation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A simple routing algorithm based on Schnyder coordinates
Theoretical Computer Science
Design and VLSI implementation of power efficient processor for object localisation in large WSN
International Journal of High Performance Systems Architecture
Hi-index | 0.00 |
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to be monitored by the network in the first place (e.g. outbreak of a fire, destruction by an earthquakes etc.). This task of identifying holes is especially challenging since typical wireless sensor networks consist of lightweight, low-capability nodes that are unaware of their geographic location.But there is also a secondary interest in detecting holes in a network: recently routing schemes have been proposed that do not assume knowledge of the geographic location of the network nodes but rather perform routing decisions based on the topology of the communication graph. Holes are salient features of the topology of a communication graph.In the first part of this paper we propose a simple distributed procedure to identify nodes near the boundary of the sensor field as well as near hole boundaries. Our hole detection algorithm is based purely on the topology of the communication graph, i.e. the only information available is which nodes can communicate with each other. In the second part of this paper we illustrate the secondary interest of our hole detection procedure using several examples.