Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> We present a suite of algorithms for self-organization of wireless sensor networks in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation of ad hoc subnetworks for carrying out cooperative signal processing functions among a set of the nodes. <s> BIB001 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <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> BIB002 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> In this paper, we study the connection between Radio Resource Management and economic parameters, whose application in multimedia communication system is a challenging task. In fact, a real network ... <s> BIB003 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <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> BIB004 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <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> BIB005 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <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> BIB006 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> The appearance of wireless multimedia sensor networks (WMSNs) requires a new generation transmission paradigm towards intelligent and ubiquitous communication. Video sensors are used in WMSNs to enhance the capability for event description. Multiple routing paths are often used for transmitting video streams. However, not every path found by multi-path routing algorithm is suitable for transmitting video, because a long routing path with a long end-to-end transmission delay may not satisfy the time constraint of the video. Furthermore, each video stream includes two kinds of information: image and audio streams. In different applications, image and audio streams play different roles, and the importance levels are different. Higher priority should be given to the more important stream (either the image stream or the audio stream) to guarantee the using of limited bandwidth and energy in WMSNs. In this paper, we propose a context-aware cross-layer optimized Multi-Path Multi-Priority (MPMP) transmission scheme, in which a Two-Phase geographic Greedy Forwarding (TPGF) multi-path routing protocol is used in network layer to explore the maximum number of node-disjoint routing paths, and a Context-Aware Multi-path Selection algorithm (CAMS) is used in transport layer to choose the maximum number of paths from all found node-disjoint routing paths for maximizing the gathering of the most valuable information to the base station. Simulation results show that the MPMP scheme can effectively maximize the gathering of the most valuable information and guarantee the end-to-end transmission delay. <s> BIB007 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> As a novel information acquiring and processing technology, wireless multimedia sensor networks (WMSNs) pose new challenges on the routing protocol. IEEE 802.11s-based WMSN that integrate with MAC-layer mesh networking protocol is an innovative implementation for WMSN which can offer high coverage, self-organization and good reliability. In this paper, we present a new routing metric based on airtime proposed in IEEE 802.11s draft standard, referred to as load balanced airtime with energy awareness (LBA-EA), for IEEE 802.11s-based WMSNs. LBA-EA not only captures the link quality, but also takes into account the load balancing and energy consumption. Simulation results prove the effectiveness of the proposed routing metric in terms of average network throughput and overall lifetime of WMSNs. <s> BIB008 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent 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> BIB009 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> This paper focuses on studying the performance of TPGF geographic routing algorithm with multi routing metric called McTPGF in random duty-cycled wireless multimedia sensor networks (WMSNs). The multi-metric contains the geographic distance and the time, which is called sleeping-delay in this paper, the forwarding node waits to forward packet to the neighbor node after it wakes up. We recognize the fact that in random duty-cycled WMSNs, geographic routing should not only consider the geographic distance of the neighbor node but also the sleeping-delay of the node at that moment. The significant difference between our work and the TPGF is that our work pays more attentions to the demand of finding a single routing path with low sleeping-delay at a certain time using TPGF while the traditional TPGF algorithm focuses on finding all node-disjoint paths in the given network topology. Simulations are conducted to evaluate that the McTPGF reduces the end-to-end delay with the cost of adding few hop counts compared with the traditional TPGF algorithm in random duty-cycled WMSNs. <s> BIB010 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> As a multimedia information acquisition and processing method, wireless multimedia sensor network(WMSN) has great application potential in military and civilian areas. Compared with traditional wireless sensor network, the routing design of WMSN should obtain more attention on the quality of transmission. This paper proposes an adaptive reliable routing based on clustering hierarchy named ARCH, which includes energy prediction and power allocation mechanism. To obtain a better performance, the cluster structure is formed based on cellular topology. The introduced prediction mechanism makes the sensor nodes predict the remaining energy of other nodes, which dramatically reduces the overall information needed for energy balancing. ARCH can dynamically balance the energy consumption of nodes based on the predicted results provided by power allocation. The simulation results prove the efficiency of the proposed ARCH routing. <s> BIB011 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> Wireless Multimedia Sensor Networks (WMSN) have an increasing variety of multimedia based applications including image and video transmission. In these types of applications, multimedia sensor nodes should ideally maximize perceptual quality and minimize energy expenditures in communication. To obtain the required perceptual quality, quality of service (QoS) support is needed at the network level. However, mapping the network parameters to the end-user's perceptual quality measures during building paths is a challenging task due to incomplete identification metrics. In this paper, we propose Image Quality Aware Routing (IQAR) for WMSN that introduces the concept of image quality awareness by considering energy issue. The proposed approach employs intra-image prioritization and an adaptive path selection scheme that adjusts reliability level during image transmission using a distortion prediction model. <s> BIB012 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> Wireless Multimedia Sensor Network(WMSN) is a blooming field due to the development of CMOS cameras and Microphones which are wirelessly interconnected devices that are able to retrieve multimedia content such as video and audio streams, still images and scalar sensor data from the environment. As of today, almost all deployed wireless sensor data networks measure scalar physical parameters like temperature, pressure humidity etc. To capture the image, video Wireless Multimedia Sensor nodes (WMSn) are to be deployed. The node of WMSn is equipped with cameras, microphones, and sensors producing multimedia content. Routing in Wireless Sensor Network is an important issue since WMS nodes that senses the data need to be communicated to the base station. The key issues in design of routing protocol in the WMSN are energy efficiency, adaptive routing, multimedia packet scheduling, Quality of service (QOS) and high bandwidth demand. Many routing protocols have been proposed for the WMSN. The design of more efficient protocols in terms of energy awareness, video packet scheduling and QOS in terms of check point arrangement is still remains a challenge. This paper discuss the design of the routing protocol in wireless multimedia sensor network which is power aware, reliable and has low latency in delivering the sensing data from source or sink node to the destination node. The new proposed architecture called ASARC: ACTUATION SENSOR ADAPTIVE ROUTING WITH CHECK POINT. ASARC provides actuation of sensor on demand basis and selection of path for communication between any two nodes such as sensor or relay node without video distortion. This feature enhances the lifetime of the network and also it supports security and QOS. <s> BIB013 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> As a new multimedia information acquisition and processing method, wireless multimedia sensor network (WMSN) has great application potential and attracts more and more attentions. Compared to traditional wireless sensor networks, the routing design of WMSN has higher requirements on the quality of service (QoS). This paper systemically analyzes the similarity between social network and WMSN, then designs a QoS trust estimation model based on social network analysis, which enables each sensor node measuring the service quality by monitoring the behaviors of neighbor nodes. An energy efficient QoS assurance routing based on cluster hierarchy (EEQAR) is proposed to achieve energy efficiency and meet the requirement of QoS. To obtain a better performance, EEQAR routing adopts cellular topology to form the cluster structure and balance the energy consumption by structure movement. The simulation results show the high performance of EEQAR routing in lifetime and quality of service. <s> BIB014 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> This paper presents an Adaptive Greedy-compass Energy-aware Multipath protocol (AGEM), a novel routing protocol for wireless multimedia sensors networks (WMSNs). AGEM uses sensors node positions to make packet forwarding decisions. These decisions are made online, at each forwarding node, in such a way that there is no need for global network topology knowledge and maintenance. AGEM routing protocol performs load-balancing to minimize energy consumption among nodes using twofold policy: (1) smart greedy forwarding, based on adaptive compass and (2) walking back forwarding to avoid holes. Performance evaluations of AGEM compared to GPSR (Greedy Perimeter Stateless Routing) show that AGEM can: (a) maximize the network lifetime, (b) guarantee quality of service for video stream transmission, and (c) scale better on densely deployed wireless sensors network. <s> BIB015 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> Meeting quality of service(QoS) is a challenging task in Wireless Multimedia Sensor Networks(WMSNs). In this paper, a new power-aware QoS routing protocol for WMSNs is proposed, which uses local information in choosing the next hop. For real-time communication, we consider both delay at the sender node and queuing delay at the receiver, and try to reach the latency requirements by minimizing the hop counts for a packet needed to be transferred towards the sink. In order to achieve reliability requirements and energy efficiency, each node dynamically adjusts it's transmission power and chooses nodes which have less remaining hops towards the sink. We consider the history of the packet in order to update these requirements at each hop. A load balancing approach is used to increase lifetime and avoid congestion. Simulation results shows that our protocol can support QoS with less energy consumption. <s> BIB016 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> The field of wireless multimedia sensor networks (WMSN) is attracting more and more research community as an interdisciplinary field of interest. This type of network is low-cost, multifunctional due to advances in micro-electromechanical systems, and the proliferation and progression of wireless communications. However transmit multimedia information captured must satisfy the criteria of QoS , which increases energy consumption, fact that should be taken into consideration in the design of any routing protocols for WMSNs. In this paper we present routing protocol which we call an Energy Aware TPGF (EA-TPGF), that improves the Two Phase geographical Greedy Forwarding (TPGF). The basic idea is to take into account the residual energy of the nodes in the identification of pathways. Simulations and statistics produced by the simulator NeTtopo showing a significant contribution with regard to the extension of the life of the network. <s> BIB017 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <s> Abstract Wireless Multimedia Sensor Networks (WMSN) have been drawing considerable attention and discussion in recent years due to its potential applications in various fields. For WMSN, how to increase the throughput in constrained environments has become the main challenge. Multipath routing is a promising solution because it can improve the channel utilization rate, reduce transmission delay and balance the transmission load. To pursue high efficiency for a multipath routing scheme, we need to take the characteristics of wireless environments and sensor networks into careful considerations. Based on such considerations, this paper introduces a Geographic Energy-Aware non-interfering Multipath (GEAM) routing scheme which divides the whole network topology into many districts and simultaneously forwards data through these districts without interfering with each other – to achieve interference-free transmissions. Our scheme will adjust the load of each district according to the energy status of their nodes; it does not establish fixed paths in advance and will hence maintain high performance even when the topology changes rapidly. We meanwhile employ a simple way to deal with the hole problem. Simulation results show that, when compared with related routing schemes, our GEAM can achieve higher performance at real-time transmission and meanwhile distribute transmission loads more evenly to most of the nodes in the network. <s> BIB018 </s> Survey of QoS routing protocols in Wireless Multimedia Sensor Networks <s> Five and More-Metric Link/Path Cost-Dependent Routing <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> Five and More-Metric Link/Path Cost-Dependent Routing <s> Multimedia sensors are attracting the attention of the researchers increasingly, and have shifted the focus from traditional scalar sensors to sensors equipped with multimedia devices. The characteristics of multimedia services impose more resource constraints that involve energy consumption, memory, buffer size, bandwidth, and processing capabilities. Existing routing solutions used in wireless multimedia sensor networks suffer from limitations in term of QoS and energy efficiency. In this paper, we propose a new QoS routing solution to increase the energy efficiency while guaranteeing the QoS requirements of the multimedia services over the wireless sensor networks. <s> BIB020
Protocols. These types of QoS routing protocols make a routing decision based on five or more metrics. Such schemes where link/path cost is decided based on five or more metrics are known as five and more-metric link/path cost-dependent routing schemes. Very few such schemes are reported and the same schemes are surveyed in this subsection. Table 5 shows comparative summary of routing schemes under this category. HQAX is a multitier, hierarchical, soft QoS-aware crosslayer routing protocol BIB006 . It improves throughput and reduces packet loss for indoor environments. To calculate the cost of the path, it considers physical and MAC layer parameters along with network layer parameters. These parameters of all three layers optimize utilization of resources resulting efficient routing. The link cost function depends on five parameter metrics, namely, delay, SNR, error rate, remaining energy of the sending node, and remaining energy of the receiving node. This link cost function is further normalized using sigmoidal functions BIB003 . HQAX is independent of the MAC layer and is compatible with existing link and network layers. However, it is not suitable for critical-time applications as it supports only soft QoS-based traffic. LBA-EA is a load-balanced and energy-aware routing scheme for WMSNs BIB008 . In this scheme, a new metric known as extended version of the airtime default-link metric is used  . This metric consists of two parts, that is, a load-aware airtime factor and an energy-aware factor. An energy-aware factor of a path is computed from residual energy, initial energy, the total number of nodes, and the total number of links along the selected path. Additionally, a load-aware airtime factor is computed from protocol overhead, frame length, link bit rate, link frame error rate, queuing delay, and interflow interference factor. As defined in 802.11s, it uses RM-AODV for path selection  . LBA-EA chooses the less congested route, balances traffic load, and considers the lower interflow interference of contending neighbors. The overall performance of the extended metric is better than the default airtime link metric, though LBA-EA causes extra overhead. POWQR, or the power-controlled QoS routing protocol, uses local information to decide the next forwarding hop BIB016 . The next hop is decided based on the remaining energy of the node, link quality, distance, delay, and number of hops (levels). Speed is derived by considering both transmitting delay at the sender and queuing delay at the receiver. The forwarding strategy distributes the load over different paths, reducing congestion and improving the lifetime of the network. Reliability of packet transmission is achieved by increasing the transmission power of a node. Simulation results show enhanced performance of POWQR to support reliability, delay, and network lifetime, but it is not scalable. Inspired by AGEM BIB015 and based on the QoS routing method BIB019 , Serhan and Diab presented QoS routing protocol that has witnessed an increase in energy efficiency and QoS guarantee for multimedia services BIB020 . The next forwarding candidate nodes are determined not only by AGEM using four different metrics but also from traffic priority. Traffic priorities (green, yellow, and red) are calculated for every node based on link quality, the residual energy of the neighboring nodes, and hop distance from the neighbor node to the sink. These nodes are sorted for each priority. Additionally, different cost functions are used to calculate the priority for the type of packet, and these packets are routed through different paths. The results presented in this work have been limited to ten nodes in the network and very few packet transmissions from the source to sink. In this section, from most of the surveyed routing protocols and detailed comparison as mentioned in Tables 1-5 , it can be summarized that the number of routing metrics used plays a significant role in the performance of a routing protocol. For example, the single metric-based TPGF BIB009 is enhanced further with the help of one additional metric in McTPGF BIB010 , MPMP BIB007 , and EA-TPGF BIB017 . The inclusion of an additional metric in the above three protocols has positive effects on the performances of the routing protocols, that is, in McTPGF BIB010 ; end-to-end delay is much lower than that in TPGF BIB009 . Additionally, average hop counts in McTPGF are almost the same as in the TPGF. Crosslayer implementation in MPMP BIB007 guarantees end-to-end transmission delay and maximizes the collection of most significant data at the receiver. EA-TPGF BIB017 significantly improves the lifetime of the network compared with TPGF BIB009 . Additionally, including one more composite metric BIB020 results in a major reduction of the end-to-end delay for high-priority traffic and less energy consumption compared with AGEM BIB015 . In another example, MMSPEED BIB004 , extended from SPEED BIB002 , shows subtle improvement in the number of flows meeting both timeliness and reliability requirements. In order to highlight optimum performance of a given protocol, each work has been compared with the previous one. From most of the surveyed papers, higher metrics-based protocols show relatively better performance, for example, TPGF BIB009 with GEAM BIB018 , SAR BIB001 with REAR BIB005 , and MMSPEED BIB004 with IQAR BIB012 . GEAM BIB018 achieves excellent load distribution with more balanced energy consumption compared with TPGF BIB009 . REAR BIB005 increases the lifetime of the network compared with SAR BIB001 . IQAR BIB012 consumes less energy, causes less delay, and has good image quality compared with MMSPEED BIB004 . In addition, keeping the same number of metrics with appropriate metric permutation also results in optimum performance with respect to the stated objective, for example, REAR BIB005 and ASARC BIB013 , ARCH BIB011 , and EEQAR BIB014 .