Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Three-Dimensional Routing. <s> Geographic routing is of interest for sensor networks because a point-to-point primitive is an important building block for data-centric applications. While there is a significant body of work on geographic routing algorithms for two-dimensional (2D) networks, geographic routing for practical three-dimensional (3D) sensor networks is relatively unexplored. We show that existing 2D geographic routing algorithms like CLDP/GPSR and GDSTR perform poorly in practical 3D sensor network deployments and describe GDSTR-3D, a new 3D geographic routing algorithm that uses 2-hop neighbor information in greedy forwarding and 2D convex hulls to aggregate node location information. We compare GDSTR-3D to existing algorithms, including CLDP/GPSR, GDSTR, AODV, VRR and S4, both in a real wireless sensor testbed and with TOSSIM simulations to show that GDSTR-3D is highly scalable, requires only a modest amount of storage and achieves routing stretch close to 1. <s> BIB001 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Three-Dimensional Routing. <s> In this paper, we propose an efficient Two-Phase geographic Greedy Forwarding (TPGF) routing algorithm for WMSNs. TPGF takes into account both the requirements of real time multimedia transmission and the realistic characteristics of WMSNs. It finds one shortest (near-shortest) path per execution and can be executed repeatedly to find more on-demand shortest (near-shortest) node-disjoint routing paths. TPGF supports three features: (1) hole-bypassing, (2) the shortest path transmission, and (3) multipath transmission, at the same time. TPGF is a pure geographic greedy forwarding routing algorithm, which does not include the face routing, e.g., right/left hand rules, and does not use planarization algorithms, e.g., GG or RNG. This point allows more links to be available for TPGF to explore more routing paths, and enables TPGF to be different from many existing geographic routing algorithms. Both theoretical analysis and simulation comparison in this paper indicate that TPGF is highly suitable for multimedia transmission in WMSNs. <s> BIB002 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Three-Dimensional Routing. <s> Advances in wireless sensor network (WSN) technology has provided the availability of small and low-cost sensor nodes with capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. Variety of sensing capabilities results in profusion of application areas. However, the characteristics of wireless sensor networks require more effective methods for data forwarding and processing. In WSN, the sensor nodes have a limited transmission range, and their processing and storage capabilities as well as their energy resources are also limited. Routing protocols for wireless sensor networks are responsible for maintaining the routes in the network and have to ensure reliable multi-hop communication under these conditions. In this paper, we give a survey of routing protocols for Wireless Sensor Network and compare their strengths and limitations. <s> BIB003 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Three-Dimensional Routing. <s> The design of 2D wireless sensor network (WSN) has been mostly considered in recent research approaches, while the case of 3D sensor network has not been so much explored. In reality, most wireless sensor networks operate in three-dimensions. Moreover, the 3D scenarios of WSN represent more accurately the network design for real world applications. One of the main design challenges in WSNs is energy efficiency to prolong the network operable lifetime. An efficient planning of WSN can control the energy consumption of the whole network. In this paper, by using computational geometry theoretic, we propose a framework for dynamic topology construction of 3D WSN for a given 3D space monitoring application. <s> BIB004
In real applications, sensors are deployed on different floors of buildings, on trees with different heights, covering entire mountain areas, open mines, and so forth. Existing 2D routing techniques perform poorly in practical 3D sensor network deployments BIB001 . In addition, it is not straightforward to extend existing 2D routing techniques to support 3D space. This survey discovers that a significant amount of work carried out supports only 2D networks and the only exception being TPGF BIB002 which supports routing in both 2D and 3D spaces. Thus, QoS routing for practical 3D sensor networks is relatively unexplored. Today few simulation tools like NetTopo  , Opnet [85] , and OMNet++ [89] support 3D along with 2D space. Figure 3 shows simulation scenarios in 2D and 3D space using NetTopo  Simulator. Designing new routing protocols based on 3D space is a promising area of research BIB003 BIB004 .