A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms
Proceedings of the 3rd international symposium on Information processing in sensor networks
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
Geodesic Delaunay triangulation and witness complex in the plane
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Boundary coverage and coverage boundary problems in wireless sensor networks
International Journal of Sensor Networks
Testing contractibility in planar rips complexes
Proceedings of the twenty-fourth annual symposium on Computational geometry
Path coverage by a sensor field: The nonhomogeneous case
ACM Transactions on Sensor Networks (TOSN)
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
Distributed coordinate-free algorithm for full sensing coverage
International Journal of Sensor Networks
On Relocation of Hopping Sensors for Balanced Migration Distribution of Sensors
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Proceedings of the 15th annual international conference on Mobile computing and networking
IEEE Journal on Selected Areas in Communications - Special issue on body area networking: Technology and applications
Genetic coverage verification without location information using dimension reduction
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Multipath-based relocation schemes considering balanced assignment for hopping sensors
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Gromov-Hausdorff stable signatures for shapes using persistence
SGP '09 Proceedings of the Symposium on Geometry Processing
An underwater sensor allocation scheme for a range dependent environment
Computer Networks: The International Journal of Computer and Telecommunications Networking
Asymptotic stability of switched higher order laplacians
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Potential game model to detect holes in sensor networks
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Obstacle discovery in distributed actuator and sensor networks
ACM Transactions on Sensor Networks (TOSN)
Map estimation using GPS-equipped mobile wireless nodes
Pervasive and Mobile Computing
Topology mining of sensor networks for smart home environments
International Journal of Ad Hoc and Ubiquitous Computing
Efficient algorithms for distributed detection of holes and boundaries in wireless networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
IEEE/ACM Transactions on Networking (TON)
An iterative algorithm for homology computation on simplicial shapes
Computer-Aided Design
UNFOLD: uniform fast on-line boundary detection for dynamic 3D wireless sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Perimeter detection in wireless sensor networks
Robotics and Autonomous Systems
Failure filtrations for fenced sensor networks
International Journal of Robotics Research
Generic coverage verification without location information using dimension reduction
IEEE/ACM Transactions on Networking (TON)
Invariants for homology classes with application to optimal search and planning problem in robotics
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduce a new technique for detecting holes in coverage by means of homology, an algebraic topological invariant. The impetus for these techniques is a completion of network communication graphs to two types of simplicial complexes: the nerve complex and the Rips complex. The former gives information about coverage intersection of individual sensor nodes, and is very difficult to compute. The latter captures connectivity in terms of inter-node communication: it is easy to compute but does not in itself yield coverage data. We obtain coverage data by using persistence of homology classes for Rips complexes. These homological invariants are computable: we provide simulation results.