Abstract
Abstract Three-dimensional (3D) wireless sensor networks have attracted a lot of attention due to their great potential usages in both commercial and civilian applications, such as environmental data collection, pollution monitoring, space exploration, disaster prevention, and tactical surveillance. Topology control in 3D sensor networks has been studied recently, and different 3D geometric topologies were proposed to be the underlying network topologies to achieve the sparseness of the communication networks. However, most of these proposed 3D topologies cannot bound the maximum node degree, i.e., some nodes may need to maintain a large number of neighbors in the constructed topologies, which is not energy efficient and may lead to large contention. In this article, we extend several existing 3D geometric topologies to a set of new 3D topologies with bounded node degree. We provide both theoretical analysis and simulation evaluation on their power efficiency and node degree distributions. Our simulation results over random 3D sensor networks confirm nice performances of these proposed 3D topologies.
Highlights
Due to its wide-range potential applications, 3D wireless sensor network has recently emerged as a premier research topic
We propose two general frameworks: 3D Symmetric Yao Graph and 3D Yao and Reverse Yao Graph, which are based on any existing 3D Yao structures
The number of links in the constructed topology is significantly reduced compared with that of the original communication graph which contains all links supported by the maximum transmission power. Among these 2D structures, some are planar structures, some are power spanners, and some are with bounded node degree
Summary
Due to its wide-range potential applications (such as environmental data collection, pollution monitoring, space exploration, disaster prevention, and tactical surveillance), 3D wireless sensor network has recently emerged as a premier research topic. Among these 2D structures, some are planar structures (such as LMST, RNG, GG, and Delaunay-based graphs), some are power spanners (such as GG, Yao graph, CBTC, and Delaunay-based graphs), and some are with bounded node degree (such as Yao graph) Besides these localized geometrical structures, there are other various techniques proposed by researchers for topology control in 2D sensor networks, such as how to construct a virtual backbone for routing [27,28,29,30] and how to minimize the total transmission power while maintaining connectivity or other properties [31,32,36,37].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
