Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE 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
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Distributed Detection and Data Fusion
Distributed Detection and Data Fusion
Distributed Algorithms
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
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
A Basis for 3-D Cellular Networks
ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Integrated coverage and connectivity configuration in wireless 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
Data collection, storage, and retrieval with an underwater sensor network
Proceedings of the 3rd international conference on Embedded networked sensor systems
Exploring in-situ sensing irregularity in wireless sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
Review: Coverage and connectivity issues in wireless sensor networks: A survey
Pervasive and Mobile Computing
Energy-efficient topology control for three-dimensional sensor networks
International Journal of Sensor Networks
The d-hop k-data coverage query problem in wireless sensor networks
Proceedings of the 5th workshop on Data management for sensor networks
Delivery Guarantee of Greedy Routing in Three Dimensional Wireless Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Low-connectivity and full-coverage three dimensional wireless sensor networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Self-deployment of sensors for maximized coverage in underwater acoustic sensor networks
Computer Communications
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
Randomized 3-D Routing in Fully- and Partially-Covered Sensor Networks
Mobile Networks and Applications
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Algorithms for the m-coverage problem and k-connected m-coverage problem in wireless sensor networks
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
Wireless sensor deployment for 3D coverage with constraints
INSS'09 Proceedings of the 6th international conference on Networked sensing systems
Distributed coverage and connectivity in three dimensional wireless sensor networks
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Connectivity optimization for wireless sensor networks applied to forest monitoring
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A holistic approach to wireless sensor network routing in underground tunnel environments
Computer Communications
Constructing low-connectivity and full-coverage three dimensional sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Energy-efficient restricted greedy routing for three dimensional random wireless networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
Coverage analysis for target localization in camera sensor networks
Wireless Communications & Mobile Computing
Localization and synchronization for 3D underwater acoustic sensor networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Generic coverage verification without location information using dimension reduction
IEEE/ACM Transactions on Networking (TON)
A 3-dimensional broadcast protocol with optimised transmission efficiency in wireless networks
International Journal of Ad Hoc and Ubiquitous Computing
Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch
IEEE/ACM Transactions on Networking (TON)
Distributed adaptive interference control in 4G small cell networks
WiFlex'13 Proceedings of the First international conference on Wireless Access Flexibility
Partial sensing coverage with connectivity in lattice wireless sensor networks
International Journal of Sensor Networks
Hi-index | 0.00 |
Although most wireless terrestrial networks are based on two-dimensional (2D) design, in reality, such networks operate in three-dimensions (3D). Since most often the size (i.e., the length and the width) of such terrestrial networks is significantly larger than the differences in the third dimension (i.e., the height) of the nodes, the 2D assumption is somewhat justified and usually it does not lead to major inaccuracies. However, in some environments, this is not the case; the underwater, atmospheric, or space communications being such apparent examples. In fact, recent interest in underwater acoustic ad hoc and sensor networks hints at the need to understand how to design networks in 3D. Unfortunately, the design of 3D networks is surprisingly more difficult than the design of 2D networks. For example, proofs of Kelvin's conjecture and Kepler's conjecture required centuries of research to achieve breakthroughs, whereas their 2D counterparts are trivial to solve. In this paper, we consider the coverage and connectivity issues of 3D networks, where the goal is to find a node placement strategy with 100% sensing coverage of a 3D space, while minimizing the number of nodes required for surveillance. Our results indicate that the use of the Voronoi tessellation of 3D space to create truncated octahedral cells results in the best strategy. In this truncated octahedron placement strategy, the transmission range must be at least 1.7889 times the sensing range in order to maintain connectivity among nodes. If the transmission range is between 1.4142 and 1.7889 times the sensing range, then a hexagonal prism placement strategy or a rhombic dodecahedron placement strategy should be used. Although the required number of nodes in the hexagonal prism and the rhombic dodecahedron placement strategies is the same, this number is 43.25% higher than the number of nodes required by the truncated octahedron placement strategy. We verify by simulation that our placement strategies indeed guarantee ubiquitous coverage. We believe that our approach and our results presented in this paper could be used for extending the processes of 2D network design to 3D networks.