There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
Delaunay graphs are almost as good as complete graphs
Discrete & Computational Geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Distributed Detection and Data Fusion
Distributed Detection and Data Fusion
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
Sensor deployment strategy for target detection
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On greedy geographic routing algorithms in sensing-covered networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Distance based decision fusion in a distributed wireless sensor network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Design and optimization of distributed sensing coverage in wireless sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
Scoped Bellman-Ford geographic routing for large dynamic wireless sensor networks
Journal of Computer Science and Technology
Length-based anchor-free localization in a fully covered sensor network
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Randomized 3-D Routing in Fully- and Partially-Covered Sensor Networks
Mobile Networks and Applications
A set of topological graphs for 2-D sensor ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Survey on contemporary remote surveillance systems for public safety
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Mesh-based sensor relocation for coverage maintenance in mobile sensor networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
| Hi-index | 0.00 |
Greedy geographic routing is an attractive localized routing scheme for wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may fail due to routing voids on random network topologies. We study greedy geographic routing in an important class of wireless sensor networks (e.g., surveillance or object tracking systems) that provide sensing coverage over a geographic area. Our analysis and simulation results demonstrate that an existing geographic routing algorithm, greedy forwarding (GF), can successfully find short routing paths based on local states in sensing-covered networks. In particular, we derive theoretical upper bounds on the network dilation of sensing-covered networks under GF. We also propose a new greedy geographic routing algorithm called Bounded Voronoi Greedy Forwarding (BVGF) that achieves path dilation lower than 4.62 in sensing-covered networks as long as the communication range is at least twice the sensing range. Furthermore, we extend GF and BVGF to achieve provable performance bounds in terms of total number of transmissions and reliability in lossy networks.