A Reliable and QoS Aware Multi-path Routing Algorithm in WSNs

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.

Popularity of Mobile Wireless Sensor Network (MWSN) has increased tremendously due to the ability to connect the physical world with the virtual world. In MWSN, Sensor nodes move freely in a target area without the need of any special infrastructure. MWSN has attracted many researchers as it has introduced unique challenges in aspects like resource management, coverage, routing protocols, security in many applications such as target tracking in military applications, detection of catastrophic events, environment monitoring, health applications etc. Due to mobility, routing process in MWSN has become more complicated as connections in the network can change dynamically. This paper proposes a Mobility-Aware Multi-Objective Hybrid Routing Algorithm (MMOHRA) for Wireless Sensor Network (WSN). MMOHRA selects the best route and forwards the data packets from source to sink using multiple metrics such as Average Energy consumption, Control Overhead, Reaction Time, LQI, and HOP Count. Performance of MMOHRA is compared with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-objective Routing Algorithm (DyMORA) using metrics such as Average Energy Consumption, Packet Delivery Ratio, and Jitter. MMOHRA improves the Average Energy Consumption (AEC) by a factor of 14.1% as compared with SHRP and 8.13 % as compared to DyMORA. MMOHRA outperformed SHRP and DyMORA in terms of packet Delivery Ratio (PDR) by 10.17 % and 9.83 % respectively.

Objectives: To propose a group-based QoS aware proactive multipath routing based on OLSR protocol. Methodology: This work proposes a group-based proactive multipath routing based on the OLSR protocol, which is designed to be adaptive for a big crowded Mobile Ad-hoc Network to satisfy the desire for real-time multimedia applications. This approach will restrict mobile nodes to be participated in the cluster head selection process based on the mobility and energy of a node. It uses a grouping strategy to manage the network topology and performing route maintenance, and preserve multiple prioritized routes with the support of Quality of Service (QoS) aware computation. Findings: The study evaluated the performance of the proposed group-based QoS aware multipath Optimal Link State Routing (GMP-OLSR) routing through the OMNET++ network simulation environment. Within different network density, the proposed approach offered a significant reduction in end to end delay, overhead and an increment in data packet delivery ratio Applications: Using an appropriate groupbased QoS aware multipath routing strategy for mobile ad hoc networks provides better performance and improves the services of mobile applications. Keywords: MANET, GMP-OLSR, Clustering, Multipath Routing, QoS Aware Routing.

The traditional ant routing protocol provides an efficient way for dynamic routing in continuously changing networks. Due to their social behaviour, ants tend to find optimized paths based on network status information such as the path length and capacity. However, the conventional ant routing protocol tends to satisfy acceptable Quality of Service (QoS) requirements for the whole network traffic. The major problem is that different traffic types request different QoS requirements, and the traditional ant routing lacks the ability of providing different levels of QoS parameters for these different traffic types. In this paper, a novel technology is proposed to satisfy the requirements of different traffic types which vary in terms of bandwidth, latency and security. Oyster Optics Technology has been used to introduce the security as a new significant QoS factor.

Wireless Sensor Networks (WSNs) are usually comprised of a large number of sensor nodes which have limited power resources and require energy efficient routing algorithms. We have presented an Adaptive Transmission Power - Geographical and Energy Aware Routing (ATP-GEAR) algorithm in this paper, which routes the packet towards the destination by calculating the cost of the neighbors of a node in terms of their location and current battery level and transmitting the packet to the lowest costing node with the minimum required transmission power. We analyze the performance of our algorithm based on total power consumption and end-to-end delay from source to destination. Simulation results show that ATP-GEAR yields almost 25% less power consumption and 17% less end-to-end delay when compared with traditional Cluster Based Routing (CBR).

Wireless mobile radio systems have to serve users with different quality of service (QoS) requirements. Scheduling algorithms like weighted proportional fair (WPF) have been proposed considering channel gains to improve the system capacity in terms of sector throughput as well as user priorities to fulfill QoS requirements. These scheduling algorithms allow assigning different priority factors to users and services so that different QoS requirements can be fulfilled. This paper provides an analysis of the influence of users with different priorities on the sector and user throughput. It is shown analytically and by system level simulations that the average user throughput can be adjusted by choosing a specific priority factor. Furthermore, it is shown that the sector throughput decreases if WPF scheduling for users with different priorities and full buffer model are considered compared to a scenario with users having equal priority. If QoS requirements for realistic traffic models, e.g. FTP, have to be fulfilled, for each high priority user low priority users have to be removed from the system in order not to exceed an acceptable number of unsatisfied users. It is shown that the decrease in sector throughput with a realistic traffic model and QoS requirements is higher than for the full buffer model.

An Quality of Service(QOS) secure routing algorithm based on ant colony optimization is put forward to solve a variety of security problems in wireless sensor networks. The algorithm combines the ant colony optimization algorithm with the credit evaluation mechanism, and introduces the node 's credit as the control factor to obtain better security performance. The algorithm first cuts the network topology according to the QOS requirements, kicks out the nodes that do not meet the QOS requirements, and then quickly converges the route to the optimal route according to the ant colony optimization method. Finally, the security analysis of the algorithm is carried out from various aspects of network layer attack. The experimental results show that the algorithm has very good performance in wireless sensor networks. As a result, it is concluded that it can be widely applied in 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>

Component-based development (CBD) techniques have been widely used to enhance the productivity and reduce the cost for software systems development. However, applying CBD techniques to embedded software development faces additional challenges. For embedded systems, it is crucial to consider the quality of service (QoS) attributes, such as timeliness, memory limitations, output precision, battery constraints. Frequently, multiple components implementing the same functionality with different QoS properties can be used to compose a system. Also, software components may have parameters that can be configured to satisfy different QoS requirements. Composition analysis, which is used to determine the most suitable component selections and parameter settings to best satisfy the system QoS requirement, is very important in embedded software development process. In this paper, we present a model and the methodologies to facilitate composition analysis. We define QoS requirements as constraints and objectives. Composition analysis is performed based on the QoS properties and requirements to find solutions (component selections and parameter settings) that can optimize the QoS objectives while satisfying the QoS constraints. We use a multiobjective concept to model the composition analysis problem and use an evolutionary algorithm to determine the Pareto-optimal solutions efficiently.

The growing emergence of a variety of network applications have stringent Quality of Service (QoS) requirements which cannot be always met by the best-effort Internet. To provide QoS, several QoS frameworks have been explored over last two decades, but none of them has been truly successful and globally implemented. This paper proposes QOF, a novel QoS framework based on the OpenFlow. It uses the superior control capabilities of OpenFlow network to transmit business having QoS requirements. On receiving QoS requirements of an application, QOF employs network status information provided by the measurement system (bandwidth, delay, packet loss), then uses QoS routing algorithm implemented by path computation module to guarantee QoS. Finally, QOF is simulated and verified, simulation results show that QOF can find a path satisfying QoS requirements of application according to network status information, and can improve resource usage.

End-to-end network slicing in unmanned aerial vehicle (UAV) networks has attracted significant attention for delivering differentiated services tailored to the quality of service (QoS) requirements of user terminals (UTs). In a sliced UAV network, the dual mobility of both UTs and UAVs, combined with the three-layer association of UT-UAV-network slice (NS), makes handoff a critical and challenging problem for maintaining the communication performance of UTs. This paper proposes a sequential handoff process where a central controller makes handoff decisions for each UT sequentially according to the UT queue. This process is modeled as a Markov decision process (MDP). In the MDP, the state space includes NS available resources, UTs' QoS requirements, and UT queue information. Additionally, the reward function accounts for UTs' QoS and handoff overhead. The double deep Q-network (DDQN) technique is then employed to design a handoff algorithm. This algorithm achieves the optimization goal of ensuring UTs' QoS requirements while avoiding frequent handoffs by maximizing the total reward of the MDP. Additionally, a state-dependent exploration technique with adaptive intensity adjustment, called noisy network (NoisyNet), is utilized to drive the DDQN for effective exploration, thereby enhancing the performance of the handoff algorithm. Finally, the runtime complexity of the proposed NoisyNet-DDQN-based sequential handoff (NoisyNet-DDQN-SH) algorithm is analyzed. The simulation results show that the NoisyNet-DDQN-SH algorithm converges well. Moreover, it exhibits strong robustness. Additionally, the NoisyNet technique effectively enhances the algorithm's performance, making the NoisyNet-DDQN-SH algorithm superior to the vanilla DDQN (with an ϵ-greedy strategy), greedy, maximum signal-to-interference-plus-noise ratio (MaxSINR), and random algorithms.

Now a day's use of wireless communication is very common and growing faster. There are different types of wireless networks which are designed as per the requirement of data rate and coverage. In this paper scope is limited to widely study and used network called Mobile Ad hoc Network (MANET). MANET is collection of wireless devices which communicate among each other without need of any physical infrastructure as well as centralize administrations. Each mobile node in MANET acts as peer node. The communication is MANET is based on routing methods and hence since from last 2 decade there are number of routing methods designed with objective of improving the Quality of Service (QoS) performance of MANET. As the mobile nodes in MANET are moving randomly with varying mobility speed, this can leads the challenging tasks to achieve the guaranteed QoS performance. Therefore it is required to have efficient routing protocol with load balancing and dynamic behaviour of mobile nodes handling in MANET. In this paper, our goal first is to present the study on different QoS aware routing methods and non-routing methods designed by various research groups for MANET. Second objective is to design novel QoS Aware routing protocol for improving the QoS performance in MANET. Additionally, we are presenting the current research gap based on analysis of all recent methods of QoS improvement. The outcome of this paper is the current research problems and efficient QAODV routing method.

With the development of wireless communication, people have put forward higher requirements for train-ground communications in the high-speed railway (HSR) scenarios. With the help of mobile relays (MRs) installed on the roof of the train, the application of Millimeter-Wave (mm-wave) communication which has rich spectrum resources to the train-ground communication system can realize high data rate, so as to meet users’ increasing demand for broad-band multimedia access. Also, full-duplex (FD) technology can theoretically double the spectral efficiency. In this paper, we formulate the user association and transmission scheduling problem in the mm-wave train-ground communication system with MR operating in the FD mode as a nonlinear programming problem. In order to maximize the system throughput and the number of users meeting quality of service (QoS) requirements, we propose an algorithm based on coalition game to solve the challenging NP-hard problem, and also prove the convergence and Nash-stable structure of the proposed algorithm. Extensive simulation results demonstrate that the proposed coalition game based algorithm can effectively improve the system throughput and meet the QoS requirements of as many users as possible, so that the communication system has a certain QoS awareness.

Many wireless sensor network (WSN) applications require both security and quality-of-service (QoS) to be guaranteed simultaneously. However, ensuring both security and QoS is not trivial in WSNs since security normally has bad impact on QoS. In this paper, we propose an energy-efficient secure forwarding method that minimizes energy consumption while meeting both security and QoS requirements at the same time. To accomplish this goal, we alternatively use hop-by-hop security for conserving energy through data aggregation and end-to-end security to satisfy the QoS requirement. We further analyze why hop-by-hop security with data aggregation provide better energy efficiency than end-to-end security without aggregation in detail. The simulation result shows that our proposed method outperforms other scheme in terms of energy efficiency while meeting both QoS and security.

IEEE 802.16 is a standardisation for a broadband wireless access in metropolitan area networks (MAN). Since the IEEE 802.16 standard defines the concrete quality of service (QoS) requirement, a scheduling scheme is necessary to achieve the QoS requirement. Many scheduling schemes are proposed with the purpose of throughput optimisation and fairness enhancement, however, few scheduling schemes support the delay requirement. In this study, the authors propose a new scheduling scheme reflecting the delay requirement. Specifically, the authors add the delay requirement term in the proportional fair scheduling scheme and the scheduling parameters are optimised with respect to the QoS requirement. Therefore the QoS requirement is achieved without the excessive resource consumption.