Traffic-Differentiation-Based Modular QoS Localized Routing for Wireless Sensor Networks

<span lang="EN-US">Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.</span>

Cloud systems are transforming the Information Technology trade by facultative the companies to provide admission to their structure and also software products to the membership foundation.Because of the vast range within the delivered Cloud solutions, from the customer's perspective of an aspect, it's emerged as troublesome to decide whose providers they need to utilize and then what's the thought of his or her option.Especially, employing suitable metrics is vital in assessing practices.Nevertheless, to the most popular of our knowledge, there's no methodical explanation relating to metrics for estimating Cloud products and services.QoS (Quality of Service) metrics playing an important role in selecting Cloud providers and also optimizing resource utilization efficiency.While many reports have got to devote to exploitation QoS metrics, relatively not much equipment supports the remark and investigation of QoS metrics of Cloud programs.To guarantee a specialized product is published, describing metrics for assessing the QoS might be an essential necessity.So, this text suggests various QoS metrics for service vendors, especially thinking about the consumer's worry.This article provides the metrics list may stand to help the future study and also assessment within the field of Cloud service's evaluation.

Wireless Sensor Networks (WSNs) play a necessary position in todays actual world applications. WSNs are a team of autonomous sensor nodes that are geographically distributed to accumulate information and monitor events. WSNs are similarly sense that they rely on wireless connectivity and spontaneous formation of networks so that sensor information can be transported via wireless. Sometimes called dust network, minute sensors as small as dust referring to smart dust. WSNs are spatially distributed two to screen or bodily temperature, sound, pressure, etc. and to cooperatively ignore their data via the network to different locations. Each such sensor network node has typically various parts. Routing in WSNs in one of the important technique, because all node executes its battery power, if may be one node failure it collapse entire networks. Routing in WSNs is in reality difficult due to the intrinsic characteristics that differentiate these networks from different networks. The plan of routing protocols in WSN is affected via number of exigent factors. In this paper, a review on routing protocols for Wireless Sensor Networks (WSNs) and performance of its execution.

Admission control based on multiple criteria has always been a desirable feature for computer networks. In the past, we presented such a system, but it was based on a centralised decision mechanism, which by itself constitutes a significant limitation. Here, we describe a decentralised version of the initial admission control algorithm, while still keeping the multiple-criteria aspect, with each user being able to specify their Quality of Service (QoS) metrics at the level of the individual. Our scheme decides whether a new call should be allowed to enter the network based on measurements of the QoS metrics on each link of the network before and after the transmission of probe packets. The decision is based on a novel algebra of QoS metrics, inspired by Warshall's algorithm that searches whether there is a feasible path to accommodate the new flow without affecting the existing users. The decision is made at each source node individually, based on either only personal information or also on information exchange among the nodes that are involved. The performance of the algorithm is evaluated in terms of QoS throughout the lifetime of all connections. The experiments presented in this paper were conducted in an actual laboratory test-bed of realistic topology and under highly congested circumstances. The results are particularly encouraging.

Web services orchestrations conventionally employ exhaustive comparison of runtime quality of service (QoS) metrics for decision making. The ability to incorporate more complex mathematical packages are needed, especially in case of workflows for resource allocation and queuing systems. By modeling such optimization routines as service calls within orchestration specifications, techniques such as linear programming can be conveniently invoked by non-specialist workflow designers. Leveraging on previously developed QoS theory, we propose the use of a high-level flexible query procedure for embedding optimizations in languages such as Orc. The Optima site provides an extension to the sorting and pruning operations currently employed in Orc. Further, the lack of an objective technique for consolidating QoS metrics is a problem in identifying suitable cost functions. We employ the analytical hierarchy process (AHP) to generate a total ordering of QoS metrics across various domains. With constructs for ensuring consistency over subjective judgements, the AHP provides a suitable technique for producing objective cost functions. Using the Dell Supply Chain example, we demonstrate the feasibility of decision making through optimization routines, specially when the control flow is QoS dependent.KeywordsWeb ServicesQoSOptimizationOrcAHP

MANET is a mobile ad hoc network with many mobile nodes communicating without a centralized module. Infrastructure-less networks make it desirable for many researchers to publish and bind multimedia services. Each node in this infrastructure-less network acts as self-organizing and re-configurable. It allows services to deploy and attain from another node over the ad hoc network. The service composition aims to provide a user’s requirement by combining different atomic services based on non-functional QoS parameters such as reliability, availability, scalability, etc. To provide service composition in MANET is challenging because of the node mobility, link failure, and topology changes, so a traditional protocol will be sufficient to obtain real-time services from mobile nodes. In this paper, the ad hoc on-demand distance vector protocol (AODV) is used and analyzed based on MANET’s QoS (Quality of Service) metrics. The QoS metrics for MANET depends on delay, bandwidth, memory capacity, network load, and packet drop. The requester node and provider node broker acts as a composer for this MANET network. The authors propose a QoS-based Dynamic Secured Broker Selection architecture (QoSDSBS) for service composition in MANET, which uses a dynamic broker and provides a secure path selection based on QoS metrics. The proposed algorithm is simulated using Network Simulator (NS2) with 53 intermediate nodes and 35 mobile nodes of area 1000 m × 1000 m. The comparative results show that the proposed architecture outperforms, with standards, the AODV protocol and affords higher scalability and a reduced network load.

A Mobile Ad Hoc Network represents a system of wireless mobile nodes that can freely and dynamically selforganize into arbitrary and temporary network topologies, allowing people and devices to seamlessly communicate without any pre-existing communication architecture. The growth of real time multimedia application in such environments, has drawn a lot of attention to wireless networks that support quality of service (QoS). In this work, the QoS metrics, delay and link life time (LLT) of the path are dynamically calculated. Based on these values the routing decisions are made. Here the multipath routing protocol is taken as the base protocol. The proposed algorithm finds the multiple QoS routes only, based on the QoS metrics and stores only those paths in the routing table. The route is selected based on the integrated QoS metric and is used to transmit the data. The base protocol used is multipath AODV(Ad Hoc On demand Distance Vector ) routing protocol. The proposed protocol may take extra time during route discovery process to compute the additional QoS parameters, but this time is compensated by having only QoS paths for data transmission. A few patents on the QoS Routing for MANETS have been reviewed.The simulator NS-2.34 is used to simulate and compare the performance of the protocols in terms of the QoS metrics such as end-to-end delay, PDR in the MANET. Keywords: Mobile Ad Hoc Network (MANET), Quality of Service (QoS), Destination Sequence Distance Vector (DSDV), Dynamic Source Routing (DSR), Ad Hoc On demand Distance Vector (AODV), LLT (Link Life Time), RLT (Route Life Time), PLTR (Percentage Life Time Ratio), TCP (Transmission Control Protocol), CBR (Constant Bit Rate), PDR (Packet Delivery Ratio).

Cognition is of paramount importance in modern communication systems for this brings the potential for adaptiveness and self-fine-tuning for dynamic reconfigurability. To achieve this feat, two primary tasks are to identify the influential configurable parameters and availability of comprehensive datasets representative of the real-world scenarios rather than simulated ones. For this article, an extensive dataset covering diverse settings of wireless sensor networks (WSNs) driven internet of things (IoT) is collected. It covers broad variations of 10 pre-configured communication parameters as well as some runtime information. In addition to legacy parameters (e.g., transmission power, and packet size, etc.), we also used two different medium access control protocols (i.e., carrier sense multiple access (CSMA) and time-slotted channel hopping (TSCH)), and routing metrics (i.e., objective function 0 (OF0), minimum rank with hysteresis (MRH), MRH with expected transmission count (ETX2)). Important quality of service (QoS) metrics like packet delivery ratio, throughput, and energy consumption against all combinations of the communication parameters are measured and recorded. A thorough statistical analysis is carried out to identify the correlations among the communication parameters and QoS metrics. The results lay the foundation for the design of a data-driven framework for predictive QoS control in the IoT.

In hierarchical networks, nodes are separated to play different roles such as CHs and cluster members. Each CH collects data from the cluster members within its cluster, aggregates the data and then transmits the data to the sink. Each algorithm that is used for packet routing in quality of service (QoS) based applications should be able to establish a tradeoffs between end to end delay parameter and energy consumption. Therefore, enabling QoS applications in sensor networks requires energy and QoS awareness in different layers of the protocol stack. We propose an Energy efficient and QoS based Multi-path Hierarchical Routing Protocol in wireless sensor networks namely EQMH. In this protocol, we try to satisfy the QoS requirements with the minimum energy via hierarchical methods. Our routing protocol performs cluster heads election and routes discovery using multiple criteria such as residual energy, remaining buffer size, signal-to-noise ratio and distance to sink. EQMH maximizes the network lifetime through data transmission across multiple paths as load balancing that causes energy consume uniformly throughout the network. Furthermore employs a queuing model to handle both real-time and non-real-time traffic. Simulation results show that our proposed protocol is more efficient than EAP and MCMP protocols in providing QoS requirements and minimizing energy consumption.

Wireless Sensor Networks (WSNs) comprise of groups of tiny sensor nodes that are deployed for collaborative missions such as environmental monitoring, target tracking and surveillance. Due to the miniature size of the nodes, they are typically deployed in large numbers and communicate via multiple hops through a wireless shared communication channel. The successful implementation of such networks is dependent on the enabling technologies (such as digital electronics and wireless communications), as well as the provisioning of Quality of Service (QoS) in the network. While there have been many efforts in QoS provisioning in traditional networks such as the Internet and Mobile Ad Hoc Networks (MANETs), these networks have very different characteristics from that of WSNs. Consequently, the QoS models and protocols that have been designed for the Internet and MANETs cannot be directly applied to WSNs. In this paper, we look at some of the existing QoS mechanisms in the networking literature, and the inherent characteristics of WSNs which make it challenging to provision for QoS in the network. We then identify some key performance metrics for WSN QoS and outline some mechanisms to achieve QoS in the sensor network. Finally, we propose WISER - a framework to enhance QoS in WIreless SEnsoR networks.

The existing routing protocols for wireless sensor networks were not reasonable in design, which limited their application. Most of the existing studies did not take into account the energy consumption of the network and the balanced use of the energy of sensor nodes, which led to the unsatisfactory application effect of wireless sensor networks in some fields. Therefore, from the perspective of energy balance in wireless sensor networks, this paper proposed a construction method of an energy balance routing protocol in wireless sensor networks based on a fuzzy control strategy. Firstly, based on the analysis of the basic composition of wireless sensor networks and the structure of sensor nodes, this paper expounded the basic process of wireless data transmission and summarized the classification and characteristics of routing protocols in wireless sensor networks from different angles. Secondly, according to the node data transmission characteristics of wireless sensor networks, the energy balance use model of sensor nodes was established, and the design method of the energy balance routing protocol based on fuzzy control strategy was proposed, and the data transmission link was optimized. Finally, through experimental comparative analysis, the results showed that the energy balanced routing protocol proposed in this paper can effectively realize the energy balanced use of the network data transmission process. Compared with other common routing protocols, the wireless sensor network routing protocol proposed in this paper can not only improve the data transmission efficiency and reduce the data redundancy but also save energy consumption and prolong the network running time. The design method of routing protocol proposed in this paper will be conducive to the optimization and application of routing protocol in wireless sensor networks and provide a theoretical basis for the related research of wireless sensor networks.

Wireless sensor networks congestion occurs easily due to its centralized traffic pattern. Normally, mono-sync wireless sensor network experiences multiple traffic flow congestion in the dense environment of the network, which leads to excess energy consumption and severe packet loss. To overcome these issues, a congestion detection and alleviation mechanism using cluster based heuristic optimized hierarchical routing protocol is proposed in this paper. Here, congestion detection and alleviation utilize the features of sensor nodes. The congestion is categorized into two types: (i) node level congestion and (ii) link level congestion. The node level congestion is detected by assessing the buffer utilization and the interval amid the consecutive data packets. The link level congestion is considered with computing link usage utilizing back-off step of round robin carrier sense multi-access with collision avoidance. Congestion detection and alleviation reactively affected node/link through cuckoo hosted rider search multi-hop routing algorithm. It has two phases: the cluster head selection and multi-path routing. Cluster head selection is performed through Taylor multiple random forest kernel fuzzy C-means clustering algorithm and multi-path routing is performed through cuckoo hosted rider search multi-hop routing algorithm. The simulation of the proposed method is done in network simulator tool. Here, the performance metrics, like packet delivery ratio, delay, energy consumption, packet drop, overhead, network lifetime and throughput are calculated. The experimental outcomes of the proposed technique shows 11.6%, 18.4% and 28.1% lower delay, 78.2%, 65.4% and 52.6% higher packet delivery ratio, and 29.2%, 37.4% and 40.8% lower packet drop compared with the existing methods, like congestion detection and alleviation using multi-attribute decision-making in optimization-based hybrid congestion alleviation routing protocol in wireless sensor networks, congestion detection and alleviation using hybrid K-means with greedy best first search algorithms in packet rate reduction utilizing adaptive weight firefly algorithm ant colony optimization based routing protocol in wireless sensor networks and congestion detection and alleviation using multi-input time on task optimization algorithm for altered gravitational search algorithm routing protocol in wireless sensor networks.

Vehicular ad-hoc networks (VANETs) are a significant field in the intelligent transportation system (ITS) for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments have been performed in the region of VANET improvement. A familiar challenge that occurs is obtaining various constrained quality of service (QoS) metrics. For resolving this issue, this study obtains a cost design for the vehicle routing issue by focusing on the QoS metrics such as collision, travel cost, awareness, and congestion. The awareness of QoS is fuzzified into a price design that comprises the entire cost of routing. As the genetic algorithm (GA) endures from the most significant challenges such as complexity, unassisted issues in mutation, detecting slow convergence, global maxima, multifaceted features under genetic coding, and better fitting, the currently established lion algorithm (LA) is employed. The computation is analyzed by deploying three well-known studies such as cost analysis, convergence analysis, and complexity investigations. A numerical analysis with quantitative outcome has also been studied based on the obtained correlation analysis among various cost functions. It is found that LA performs better than GA with a reduction in complexity and routing cost.

The extremely large number of devices available to the modern day user, with the increase in device intercommunication, is fuelling the latest Internet of Things (IoT) development. IoT needs to enable exchange of various types of data, from sensor data to multimedia, between numerous diverse devices differing in power, connectivity, mobility and energy, while also maintaining high levels of Quality of Service (QoS). This paper performs statistical analysis of the innovative NETworking Scheme for sMart IoT gatewayS (NETSMITS) in terms of several QoS network-related metrics with most significant impact on devices' performance. NETSMITS introduces an innovative algorithm which uses QoS and service relevance metrics in order to efficiently cluster intercommunicating IoT objects. Statistical analysis is performed on the QoS data collected in a highly relevant multi-device scenario in order to understand NETSMITS' behaviour. Interesting results were obtained, describing the relationship between the QoS metrics and different types of IoT devices.

Wireless communication is one of most active areas in modern communication researches, QoS (Quality of Service) assurance is very important for wireless communication systems design, especially for applications such as streaming video etc., which requires strict QoS assurance. The modern wireless networks multi-layer protocol stack structure results in QoS metrics layered and acting in cascade and QoS metrics vertical mapping between protocol layers. Based on virtual buffer between protocol layers and queuing technology, a unified layered QoS mapping framework is proposed in this paper, in which we first propose virtual queue concept, give a novelty united neighboring protocol layers QoS metric mapping framework, and analysis method based on dicerete-time Markov chain, and numerical results show that our proposed framework represents a significant improvement over previous model.