OPTIMIZED QUALITY OF SERVICE (QoS) ROUTING IN MOBILE ADHOC NETWORKS USING SELF-HEALING TECHNIQUES

2007 ◽  
Vol 04 (03) ◽  
pp. 291-304 ◽  
Author(s):  
R. ASOKAN ◽  
A. M. NATARAJAN ◽  
C. VENKATESH
Author(s):  
R. Asokan ◽  
A.M. Natarajan

Mobile adhoc network (MANET) is a collection of mobile devices which form a communication network with no pre-existing wiring or infrastructure. Multiple routing protocols have been developed for MANETs. As MANETs gain popularity, their need to support real time applications is growing as well. Quality of service(QoS) provisioning is becoming a critical issue in designing mobile adhoc networks due to the necessity of providing multimedia applications.These applications have stringent QoS requirements such as throughput, end-to-end delay, and energy. Due to dynamic topology and bandwidth constraint supporting QoS is a challenging task. QoS aware routing is an important building block for QoS support. The primary goal of the QoS aware protocol is to determine the path from source to destination that satisfies the QoS requirements. This article proposes a new energy and delay aware protocols called, energy and delay aware Adhoc On demand Distance Vector Routing (EDAODV) and energy and delay aware Dynamic Source Routing(EDDSR) based on extension of AODV and DSR. Simulation results show that the proposed protocols have a better performance than AODV and DSR in terms of energy, packet delivery ratio and end-to-end delay.


Author(s):  
Amit Gupta ◽  
◽  
Mahesh Motwani ◽  
J. L. Rana

— In an Adhoc Network, every node is mobile and self-contained. As these networks lack infrastructure, highly adaptive algorithms are required to deal with frequent mobility changes by member nodes as well as Cluster Head (CH) nodes. The weighted clustering algorithms contribute significantly to cluster-based routing. In these algorithms, the selection of cluster heads is the most important task. In weighted clustering methods, the selected CH did their best to serve the network. However, the CH may become overloaded due to the arrival of nodes greater than their desired threshold value. In this case, the CH can become a bottleneck as it is unable to cope with rapidly increasing loads which ultimately degrade the network performance. In this paper, we address three network issues (i) Member Node movement (ii) Cluster head Node movement, and (iii) Overload at the Cluster head node caused due to mobility of nodes. Our proposed method Cluster Formation and Maintenance Techniques for Mobile Adhoc Networks with Improved Quality of Service (CFMIQS) include various adaptive algorithms to provide solutions to deal with these network issues and improve network Quality of Service (QoS). The Simulated Results are compared with the K-means AODV algorithm, the results showed better Packet Delivery Fraction (PDF) and Throughput values. Keywords— Cluster partition, MANET, Primary Cluster head, QoS, Secondary Cluster head


Author(s):  
F. W. Albalas ◽  
B. A. Abu-Alhaija ◽  
A. Awajan ◽  
A. Awajan ◽  
Khalid Al-Begain

New web technologies have encouraged the deployment of various network applications that are rich with multimedia and real-time services. These services demand stringent requirements are defined through Quality of Service (QoS) parameters such as delay, jitter, loss, etc. To guarantee the delivery of these services QoS routing algorithms that deal with multiple metrics are needed. Unfortunately, QoS routing with multiple metrics is considered an NP-complete problem that cannot be solved by a simple algorithm. This paper proposes three source based QoS routing algorithms that find the optimal path from the service provider to the user that best satisfies the QoS requirements for a particular service. The three algorithms use the same filtering technique to prune all the paths that do not meet the requirements which solves the complexity of NP-complete problem. Next, each of the three algorithms integrates a different Multiple Criteria Decision Making method to select one of the paths that have resulted from the route filtering technique. The three decision making methods used are the Analytic Hierarchy Process (AHP), Multi-Attribute Utility Theory (MAUT), and Kepner-Tregoe KT. Results show that the algorithms find a path using multiple constraints with a high ability to handle multimedia and real-time applications.


Sign in / Sign up

Export Citation Format

Share Document