Energy Efficient QoS Routing Protocol based on Genetic Algorithm in MANET

Abstract- In mobile ad-hoc networks (MANETs), providing quality of service is more challenging than wired networks, because of multi hop communication, node connectivity and lack of central co-ordination. Mobile ad-hoc networks need sure distinctive characteristics which might cause difficulties providing QoS in such network. Coming up with of multi constrained QoS routing protocols remains troublesome. As a result of routing protocols must satisfy the numerous QoS metrics at a time. Genetic algorithm based routing protocol will give the solution for multi constrained QoS routing problem. In existing genetic algorithm based routing, achieving energy efficiency is the major drawback. To overcome this drawback, in this paper, we have proposed genetic algorithm based energy efficient QoS routing for MANET. Proposed GA based routing algorithm discovered the shortest path from source to destination, which can consumes less energy compare to existing algorithms. In this paper TCP,CBR and video sources are applied at a time then energy consumption of proposed algorithm is compared with existing normal GA based and AOMDV. Simulation results show that proposed algorithm consumes less energy towards given scenario. Simulations are performed in NS-2

An efficient QOS routing protocol for mobile ad-hoc networks

To satisfy the user requirements for continuous and real-time multimedia information, the concept of Quality of Service (QoS) has emerged as a main issue in mobile ad-hoc networks. QoS routing is to find a route according to the QoS requirements of the users. In this paper, we propose an efficient QoS routing protocol that is based on AODV over TDMA, one of the typical routing protocols for mobile ad-hoc networks, by making a bandwidth reservation for QoS guarantee. While the existing schemes calculate the maximum available bandwidth for each candidate path, our scheme is to check only if the bandwidth of a given path satisfies the end-to-end QoS requirement. Also, the key idea in the bandwidth reservation is to select carefully time slots without causing any conficts in the wireless environment, thereby maximizing the bandwidth efficiency. In order to evaluate the performance of the proposed QoS routing protocol, some simulations are carried out in the adhoc environment. The simulation results show that the proposed protocol provides sufficiently low and stable delay performance regardless of the offered load.1st IFIP International Conference on Ad-Hoc NetWorkingRed de Universidades con Carreras en Informática (RedUNCI

A Novel Approach to Enhance the Performance of RIP and RIPng Protocols For Ad Hoc Networks

In mobile ad hoc networks, there is a tradeoff between QOS and energy consumption because in order to achieve maximum quality of service , maximum energy has to be consumed. In this paper a novel approach is implemented ie integrating logical link control with MACto minimize the energy consumption and enhancing the performance of routing information protocol is studied in the context of best effort and QOS model in mobile ad hoc networks using EXATA Emulator.From emulation results we found that energy consumption ,jitter, end-to-end-dely decreases and throughput increases in QOSRIPngLLC

Energy Efficient QoS Routing Protocol for Handling Hidden Nodes in in Wireless Multimedia Sensor Networks

Wireless Multimedia Sensor Networks (WMSNs) are comprised of sensor nodes that form the momentary network and do not rely on the support of any orthodox centralized infrastructure or administration. Such a given situation mandates every sensor node to get the support of other sensor nodes to advance the packets to the desired destination node, and specifically to the sink node. In this poster, we introduce energy efficient quality of service protocol for WMSNs, in this work the focus will be to study hidden node problems in WMSNs (Wireless Multimedia Sensor Networks) and how it can affect the network performance

An Efficient Routing Method for Protection Data Flow in the MPLS Network

تقدم هذه الورقة طريقة فعالة لإعادة توجيه حركة المرور في شبكة الMPLS  وذلك عندما يحدث خطأ في المسار الناقل. و قد تم تصميم هذه الطريقة لمعالجة كل من الأخطاء الفردية والمتعددة استنادا إلى تقنيات الحماية وإعادة التوجيه.  حيث تؤدي الطريقة المقترحة إلى خسارة أقل للحزم (decrease packet loss)، ولها نسبة توصيل أفضل للخدمة (PDR)، وتحسين في الإنتاجية (Throughput)، وتحسين في وصول حزم البيانات بشكل منتظم (packet order). تم محاكاة الطريقة المقترحة باستخدام محاكي الشبكة (NS2) الإصدار 2.34 وقد أظهرت نتائج المحاكاة أن الطريقة المقترحة  تحسن  بشكل كبير من أداء الشبكة بالمقارنة مع الأساليب و الطرق الموجودة في الأبحاث العلمية المشابهة. الكلمات المفتاحية: شبكة الـ MPLS, عمل الـ Link, حماية البديل, إعادة التوجيه, محاكاه الشبكة.This paper presents an efficient method for rerouting traffic in the Multiprotocol Label Switching (MPLS) network, when a fault occurs in the working link. The method has been designed to handle both single and multiple faults based on the protection switching and rerouting techniques. The proposed method leads to less packets loss, has better Packet Delivery Ratio (PDR), good throughput and eliminates packet disorder. The proposed method has been simulated using the Network Simulator (NS2) version 2.34 and the simulation results have shown that the proposed method significantly improves the network performance in comparison to similar existing methods. Keywords: MPLS network, Working link, Protection switching, Rerouting, Network simulator

An efficient QOS routing protocol for mobile ad-hoc networks

To satisfy the user requirements for continuous and real-time multimedia information, the concept of Quality of Service (QoS) has emerged as a main issue in mobile ad-hoc networks. QoS routing is to find a route according to the QoS requirements of the users. In this paper, we propose an efficient QoS routing protocol that is based on AODV over TDMA, one of the typical routing protocols for mobile ad-hoc networks, by making a bandwidth reservation for QoS guarantee. While the existing schemes calculate the maximum available bandwidth for each candidate path, our scheme is to check only if the bandwidth of a given path satisfies the end-to-end QoS requirement. Also, the key idea in the bandwidth reservation is to select carefully time slots without causing any conficts in the wireless environment, thereby maximizing the bandwidth efficiency. In order to evaluate the performance of the proposed QoS routing protocol, some simulations are carried out in the adhoc environment. The simulation results show that the proposed protocol provides sufficiently low and stable delay performance regardless of the offered load.1st IFIP International Conference on Ad-Hoc NetWorkingRed de Universidades con Carreras en Informática (RedUNCI

Some new localized quality of service models and algorithms for communication networks. The development and evaluation of new localized quality of service routing algorithms and path selection methods for both flat and hierarchical communication networks.

The Quality of Service (QoS) routing approach is gaining an increasing interest in the Internet community due to the new emerging Internet applications such as real-time multimedia applications. These applications require better levels of quality of services than those supported by best effort networks. Therefore providing such services is crucial to many real time and multimedia applications which have strict quality of service requirements regarding bandwidth and timeliness of delivery. QoS routing is a major component in any QoS architecture and thus has been studied extensively in the literature. Scalability is considered one of the major issues in designing efficient QoS routing algorithms due to the high cost of QoS routing both in terms of computational effort and communication overhead. Localized quality of service routing is a promising approach to overcome the scalability problem of the conventional quality of service routing approach. The localized quality of service approach eliminates the communication overhead because it does not need the global network state information. The main aim of this thesis is to contribute towards the localised routing area by proposing and developing some new models and algorithms. Toward this goal we make the following major contributions. First, a scalable and efficient QoS routing algorithm based on a localised approach to QoS routing has been developed and evaluated. Second, we have developed a path selection technique that can be used with existing localized QoS routing algorithms to enhance their scalability and performance. Third, a scalable and efficient hierarchical QoS routing algorithm based on a localised approach to QoS routing has been developed and evaluated

Single fault tolerance method for protection data flow in the MPLS network

This paper presents efficient methods for rerouting traffic in the Multiprotocol Label Switching (MPLS) network, when a fault occurs in the working link. The proposed methods have been designed to handle single fault based on the protection switching and rerouting techniques. In this paper three algorithms are developed for fault recovery in the MPLS network based on ingress LSR, alert LSR and core LSR. The proposed methods have been simulated using the Network Simulator (NS2) and the simulation results show that the proposed methods significantly improve the network performance in comparison to similar existing methods