Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks. <s> BIB001 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> Future sensor networks will be composed of a large number of densely deployed sensors/actuators. A key feature of such networks is that their nodes are untethered and unattended. Consequently, energy efficiency is an important design consideration for these networks. Motivated by the fact that sensor network queries may often be geographical, we design and evaluate an energy efficient routing algorithm that propagates a query to the appropriate geographical region, without flooding. The proposed Geographic and Energy Aware Routing (GEAR) algorithm uses energy aware neighbor selection to route a packet towards the target region and Recursive Geographic Forwarding or Restricted Flooding algorithm to disseminate the packet inside the destina- <s> BIB002 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> We provide an in-depth study of applying wireless sensor networks to real-world habitat monitoring. A set of system design requirements are developed that cover the hardware design of the nodes, the design of the sensor network, and the capabilities for remote data access and management. A system architecture is proposed to address these requirements for habitat monitoring in general, and an instance of the architecture for monitoring seabird nesting environment and behavior is presented. The currently deployed network consists of 32 nodes on a small island off the coast of Maine streaming useful live data onto the web. The application-driven design exercise serves to identify important areas of further work in data sampling, communications, network retasking, and health monitoring. <s> BIB003 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> Advances in microsensor and radio technology enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low-per node cost allows these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks coordinate to perform the distributed sensing and actuation tasks. Moreover, as described in this paper, the nodes can also coordinate to exploit the redundancy provided by high density so as to extend overall system lifetime. The large number of nodes deployed in this systems preclude manual configuration, and the environmental dynamics precludes design-time preconfiguration. Therefore, nodes have to self-configure to establish a topology that provides communication under stringent energy constraints. ASCENT builds on the notion that, as density increases, only a subset of the nodes is necessary to establish a routing forwarding backbone. In ASCENT, each node assesses its connectivity and adapts its participation in the multihop network topology based on the measured operating region. This paper motivates and describes the ASCENT algorithm and presents analysis, simulation, and experimental measurements. We show that the system achieves linear increase in energy savings as a function of the density and the convergence time required in case of node failures while still providing adequate connectivity. <s> BIB004 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> With EvalVid we present a complete framework and tool-set for evaluation of the quality of video transmitted over a real or simulated communication network. Besides measuring QoS parameters of the underlying network, like loss rates, delays, and jitter, we support also a subjective video quality evaluation of the received video based on the frame-by-frame PSNR calculation. The tool-set has a modular construction, making it possible to exchange both the network and the codec. We present here its application for MPEG-4 as example. EvalVid is targeted for researchers who want to evaluate their network designs or setups in terms of user perceived video quality. The tool-set is publicly available [11]. <s> BIB005 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> In this paper, we present a real-time communication protocol for sensor networks, called SPEED. The protocol provides three types of real-time communication services, namely, real-time unicast, real-time area-multicast and real-time area-anycast. SPEED is specifically tailored to be a stateless, localized algorithm with minimal control overhead End-to-end soft real-time communication is achieved by maintaining a desired delivery speed across the sensor network through a novel combination of feedback control and non-deterministic geographic forwarding. SPEED is a highly efficient and scalable protocol for sensor networks where the resources of each node are scarce. Theoretical analysis, simulation experiments and a real implementation on Berkeley motes are provided to validate our claims. <s> BIB006 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> In this paper we present a routing scheme for on-demand construction of multiple non-interfering paths in wireless sensor networks. One usage of this multipath scheme is to provide a source the ability to increase the likelihood that its data reaches the sink by sending a copy of a packet on more than one path. The routing scheme is based on the assumption that the sensor nodes are aware of their geographic position. <s> BIB007 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> In this paper, we present a novel packet delivery mechanism called Multi-Path and Multi-SPEED Routing Protocol (MMSPEED) for probabilistic QoS guarantee in wireless sensor networks. The QoS provisioning is performed in two quality domains, namely, timeliness and reliability. Multiple QoS levels are provided in the timeliness domain by guaranteeing multiple packet delivery speed options. In the reliability domain, various reliability requirements are supported by probabilistic multipath forwarding. These mechanisms for QoS provisioning are realized in a localized way without global network information by employing localized geographic packet forwarding augmented with dynamic compensation, which compensates for local decision inaccuracies as a packet travels towards its destination. This way, MMSPEED can guarantee end-to-end requirements in a localized way, which is desirable for scalability and adaptability to large scale dynamic sensor networks. Simulation results show that MMSPEED provides QoS differentiation in both reliability and timeliness domains and, as a result, significantly improves the effective capacity of a sensor network in terms of number of flows that meet both reliability and timeliness requirements up to 50 percent (12 flows versus 18 flows). <s> BIB008 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> Geographic routing is a useful and scalable point-to-point communication primitive for wireless sensor networks. However, previous work on geographic routing makes the unrealistic assumption that all the nodes in the network are awake during routing. This overlooks the common deployment scenario where sensor nodes are duty-cycled to save energy. In this paper we investigate several important aspects of geographic routing over duty-cycled nodes. First, we extend existing geographic routing algorithms to handle the highly dynamic networks resulting from duty-cycling. Second, we provide the first formal analysis of the performance of geographic routing on duty-cycled nodes. Third, we use this analysis to develop an efficient decentralized sleep scheduling algorithm for reducing the number of awake nodes while maintaining both network coverage and a (tunable) target routing latency. Finally, we evaluate via simulation the performance of our approach versus running existing geographic routing algorithms on sensors duty-cycled according to previous sleep scheduling algorithms. Our results show, perhaps surprisingly, that a network of duty-cycled nodes can have slightly better routing performance than a static network that uses comparable energy. Our results further show that, compared to previous algorithms, our sleep scheduling algorithm significantly improves routing latency and network lifetime. <s> BIB009 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> Owing to the growing demand for low-cost 'networkable' sensors in conjunction with recent developments of micro-electro mechanical system (MEMS) and radio frequency (RF) technology, new sensors come with advanced functionalities for processing and communication. Since these nodes are normally very small and powered with irreplaceable batteries, efficient use of energy is paramount and one of the most challenging tasks in designing wireless sensor networks (WSN). A new energy-aware WSN routing protocol, reliable and energy efficient protocol (REEP), which is proposed, makes sensor nodes establish more reliable and energy-efficient paths for data transmission. The performance of REEP has been evaluated under different scenarios, and has been found to be superior to the popular data-centric routing protocol, directed-diffusion (DD) (discussed by Intanagonwiwat et al. in 'Directed diffusion for wireless sensor networking' IEEE/ACM Trans. Netw., 2003, 11(1), pp. 2-16), used as the benchmark. <s> BIB010 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> Image and video sensing data in the multimedia wireless sensor networks make many requirements in the resource of bandwidth and energy. For the purpose of real-time transmission of multimedia data, this paper proposes a new QoS protocol applied to multimedia wireless sensor networks REAR. In this protocol metadata is used to establish multi-path routing for reducing the energy consumption and a cost function is constructed to evaluate the consumption of the transmission links which trades off the relationship of energy and delay, and then a QoS routing is chosen. The experiments show that the protocol could ensure the real-time transmission of multimedia data and prolong the lifetime of sensor networks. <s> BIB011 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> In this paper, we propose multimedia-enabled improved adaptive routing (M-IAR) that is optimized for single-source-to- single-destination multimedia sensory data traffic. It is an extension of the improved adaptive routing (IAR) algorithm presented in our earlier work, in response to the increasing number of applications incorporating wireless multimedia sensors such as wireless microphones and cameras. M-IAR is a swarm-intelligent- based algorithm exploiting the concept of ant colony optimization to optimize end-to-end delay, jitter, latency, energy consumption, packet survival rate, and routing path, within the multimedia wireless sensor network. The presented algorithm is proven to satisfy its goals through a series of computer simulations. <s> BIB012 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> In wireless sensor networks, bandwidth is one of precious resources to multimedia applications. To get more bandwidth, multipath routing is one appropriate solution provided that inter-path interferences are minimized. In this paper, we address the problem of interfering paths in the context of wireless multimedia sensor networks and consider both intra-session as well as inter-session interferences. Our main objective is to provide necessary bandwidth to multimedia applications through non-interfering paths while increasing the network lifetime. To do so, we adopt an incremental approach where for a given session, only one path is built at once. Additional paths are built when requi red, typically in case of congestion or bandwidth shortage. Interference awareness and energy saving are achieved by switching a subset of sensor nodes in a passive state in which they do not take part in the routing process. Despite the routing overhead introduced by the incremental approach we adopt, our simulations show that this can be compensated by the overall achieved throughput and the amount of consumed energy per correctly received packet especially for relatively long sessions such as multimedia ones. This is mainly due to the fact that a small number of non-interfering paths allows for better performances than a large number of interfering ones. <s> BIB013 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> Wireless Multimedia Sensor Networks (WMSNs) are composed of small devices that are able to capture video or audio information and to transmit it over wireless channels. The development of wireless technologies, such as: WiFi, Bluetooth, Zigbee, and UWB, encourages the emergence of heterogeneous networks. However, only a few existing solutions take into account the constraints of multi-tier and multi-MAC wireless sensor networks. In this paper, we propose a cost function coupled to a new generic (i.e. independent from any MAC protocol) cross-layer routing protocol adapted to multimedia traffic over hierarchical and heterogeneous networks. The goal of our proposed protocol is to dynamically assess the routing process cost and the requirement of the multimedia application in order to ensure a sufficient quality of service (Soft QoS). Furthermore, the cross-layer approach is needed to use the physical and MAC parameters on the routing operation. Simulation results show that our solution is efficient and gives better results than classical protocols. <s> BIB014 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <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> BIB015 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> This paper focuses on studying the impacts of a duty-cycle based CKN sleep scheduling algorithm for our previous designed TPGF geographical multipath routing algorithm in wireless sensor networks (WSNs). It reveals the fact that waking up more sensor nodes cannot always help to improve the exploration results of TPGF in a duty-cycle based WSN. Furthermore, this study provides the meaningful direction for improving the application-requirement based QoS of stream data transmission in duty-cycle based wireless multimedia sensor networks. <s> BIB016 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> Automated information gathering in military, industrial, environmental and surveillance applications which requires improved QoS guarantees as well as high reliability is well supported with Wireless Multimedia Sensor Networks (WMSNs). In this paper, we propose a more reliable energy efficient multi-path routing scheme for multimedia-traffic. The proposed protocol quickly chooses partial disjoint paths in case of node failure to minimize routing overhead. Hence increases the reliability of the packets reaching the destination with minimum delay. Extensive simulations are carried out to show that proposed protocol achieves an efficient tradeoff among reliability, energy consumption and end to end delay. It provides higher packet delivery ratios and lower routing overheads compared to the Maximally Radio disjoint Multipath Routing (MR2) and Hop Count Multipath routing (HCMR) protocols. <s> BIB017 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> The increase in the usefulness of WSNs, have lead to the transmission of multimedia content over these networks. This has escorted to the concept of Wireless Multimedia Sensor networks (WMSNs). Due to resource constrained structure of WSNs, special attention is required to route data in these networks. In this paper, we propose a novel routing protocol for WMSNs which establishes paths on the basis of traffic load, hop count and node energy. The protocol aims to find completely or partially disjoint paths for routing multimedia traffic with relatively minimum distance. Simulation results have shown that the proposed protocol is capable of finding intelligent path such that it increases throughput and avoid creation of network holes near the sink. <s> BIB018 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> In Wireless multimedia sensor networks (WMSNs), new metrics are required in order to accurately measure and evaluate link quality of nodes residing along a routing path comprehensively considering end-to-end delay, throughput and radio interference. Moreover, it is important to develop a routing algorithm that can find an optimal path to meet a QoS requirement based on the metrics. This study presents a QoS routing method taking into account congestion, which is aimed at minimizing end-to-end delay and increasing throughput. With a use of congestion control technique and least cost-based routing mechanism, the proposed routing method increases packet transmission rate whereas it reduces packet loss and delay. Ultimately, it contributes to longer network lifetime of sensor networks, which could result to offering better reliability of the network. <s> BIB019 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Single-Metric Link/Path <s> Graphical abstractDisplay Omitted HighlightsA new multi-objective approach for the routing problem in Wireless Multimedia Sensor Networks (WMSNs) is proposed.Classical approximations optimize a single objective or Quality of Service (QoS) parameter.Classical approximations do not take into account the conflicting nature of QoS parameters which leads to sub-optimal solutions.The proposed approach takes into account multiple QoS requirements such as delay and the Expected Transmission Count (ETX).The case studies applying the proposed approach shows clear improvements on the QoS routing solutions. In this paper, a new multi-objective approach for the routing problem in Wireless Multimedia Sensor Networks (WMSNs) is proposed. It takes into account Quality of Service (QoS) requirements such as delay and the Expected Transmission Count (ETX). Classical approximations optimize a single objective or QoS parameter, not taking into account the conflicting nature of these parameters which leads to sub-optimal solutions. The case studies applying the proposed approach show clear improvements on the QoS routing solutions. For example, in terms of delay, the approximate mean improvement ratios obtained for scenarios 1 and 2 were of 15 and 28 times, respectively. <s> BIB020
Cost-Dependent Routing Protocols. These types of QoS routing protocols make routing decision based on a single metric. Such schemes which determine link/path cost with only one metric are categorized as single-metric link/path cost-dependent routing schemes. Due to paucity of single metric schemes in context of WMSNs, only one protocol is available for survey in this subsection. Two-Phase Geographic Greedy Forwarding (TPGF) is the first pure geographic greedy forwarding routing protocol that supports multipath data transmission and hole bypassing features BIB015 . TPGF consists of two phases, namely, geographic forwarding and path optimization. In the first phase, the next hop is selected based on the shortest distance from the 1-hop neighbor to the sink. Static holes and dynamic holes are handled by using a step-back-and-mark method instead of face routing. The path optimization phase removes all path circles from the path, releasing redundant unnecessary nodes. These released nodes can be considered during the next path exploration. Therefore, TPGF can be executed multiple times to obtain more node-disjoint paths. This protocol is a good candidate for multimedia transmissions but requires knowledge of the entire topology before transmission. Additionally, it selects the same path in a fixed topology, which reduces network lifetime. Along with other details,  GPSR BIB001 DSR  GPSR BIB001 (  AODV  DSR   TPGF BIB015 (1) Low delay BIB003  TPGF BIB015 (  TPGF BIB015 ASCENT BIB004 GAF   REEP BIB010  TPGF BIB015 GPSR BIB001 NI BIB007 (  Evalvid BIB005 GPSR BIB001 SPEED BIB006  GEAR BIB002 (  SPEED BIB006 (  MMSPEED BIB008 (  Self-baseline  REAR BIB011 M-IAR BIB012 (1) Reliable (2) Secure (3) Low latency (1) More complexity (2) Extra overhead (3) Energy consumption due to extra overhead EEIAMR BIB017 IEEE 2011 MR2 BIB013 (1) Reliable (2) Interference aware transmission (1) Partial node-disjoint paths (2) Less number of paths TINY AODV (1) Increasing throughput (2) Traffic load aware (3) Avoid creation of holes near sink (1) At low data rates more energy consumption (2) Partial node-disjoint paths  HQAX BIB014 (1) Low delay (2) High PDR (3) Less packet drops (4) Adaptive multiconstraint (1) Clock synchronization problem (2) More energy consumption due to flooding SPEA BIB020 Elsevier 2015 DSR   GPSR BIB001 HLEAR BIB018  GPSR BIB001  GPSR BIB001  Min hop algorithm (1) Low delay (2) High throughput (2) Increase in probability to find optimal solution (1) Output depends on Pareto solution set (2) More complexity Bae et al. BIB019 IJMUE 2014  AODV   (1) Reliable (2) Low delay (1) Extra overhead (2) Results shown with very less number of nodes and packets or in active state. Based on CKN BIB009 scheduling, the effect of the duty cycle is studied using the TPGF algorithm BIB016 . The results show that there is little effect from sensors waking up on the total number of transmission paths or the average length of transmission paths between the source and the sink. However, the lifetime of the network is improved.