ENERGY CONSERVED FAULT TOLERANT CLUSTERS WITH QoS ROUTING IN WIRELESS AD HOC NETWORK

Dr. Thangaraj. P, Renuka. M, Dr.S.N. Sivanandam

Abstract


Currently, wireless networks are fetching more fashionable and it can be employed in all genuine world applications. So it is required to present a good Quality of Service (QOS) for distributing a video, voice and data. To present diverse varieties of priority to diverse types of applications, QoS will present numerous mechanisms and the examination is chiefly utilized in the fields such as defense, military and so on. MANET, a Wireless Ad hoc network possibly would not be capable to present a good QoS as it has communications less environment. Because the mobility of nodes is self-sufficient, the topology of the network modifies recurrently. Numerous routing protocols are accessible to present the QoS service for MANET, however in all those techniques path link or communication link transparency increases. This tends to decline in the existence of the network. To progress the existence of the network and to diminish the path link failure, here in this work we are going to provide a novel technique which preserves the energy altitude of the network to balance both energy level and mobility rate. The proposed work will provide the finest QoS in MANET in the way of clustering the network based on energy consumption, fault tolerance rate, and mobility rate. The clustering approach judges only the restricted fault tolerant fairly than comprehensive fault tolerant to notice and process the rate of mobility of the nodes in the network. This energy conserved clustering on QoS for MANET will progress the life span of both the nodes and the network. An experimental evaluation is carried out to estimate the performance of the proposed Energy Conserved Fault-tolerant Clusters with QoS Routing in wireless ad-hoc networks [ECFCR] in terms of communication overhead, recovery time, failure rate.

Keywords


Clustering approach, Energy Conserved Protocol, Fault-tolerant distributed routing, mobile computing, wireless networks.

References


S.H. Alabbad and M.E. Woodward, “Localised Credit Based QoS Routing,” IEE Proc.—Comm., vol. 153, no. 6, pp. 787-796, Dec. 2006.

A.H. Mohammad and M.E. Woodward, “Localized Quality Based QoS Routing,” Proc. Performance Evaluation of Computer and Telecomm. Systems (SPECTS), pp. 209-216, 2008.

A.S. Alzahrani and M.E. Woodward, “End-to-End Delay in Localized QoS Routing,” Proc. IEEE Int’l Conf. Comm. Systems (ICCS), pp. 1700-1706, 2008.

P. Yang and B. Huang, “QoS Routing Protocol Based on Link Stability with Dynamic Delay Prediction in MANET,” Proc. Pacific- Asia Workshop Computational Intelligence and Industrial Applications (PACIIA), pp. 515-518, 2008.

A. Mellouk, “Quality of Service Dynamic Routing Schemes for Real Time Systems in IP Network,” Proc. Networking Int’l Conf.Systems and Int’l Conf. Mobile Comm. and Learning Technologies ICN/ ICONS/MCL, p. 93, 2006.

J.N. Al-Karaki, A.E. Kamal, and R. Ul-Mustafa, “On the Optimal Clustering in Mobile Ad Hoc Networks,” Proc. IEEE Consumer Comm. and Networking Conf., pp. 71-76, 2004.

Y. Wang and M.S. Kim, “Bandwidth-Adaptive Clustering for Mobile Ad Hoc Networks,” Proc. Int’l Conf. Computer Comm. And Networks, pp. 103-108, 2007.

A.H. Thamrin, H. Kusumoto, and J. Murai, “Scaling Multicast Communications by Tracking Feedback Sensors,” Proc. Int’l

Conf. Advanced Information Networking and Applications (AINA), pp. 1-6, 2006.

L. Gu, Z. Niu, J. Lv, and H. Yoshiuchi, “An NAK-Based Hierarchical ARQ Scheme for Reliable Data Multicast in Integrated Communication and Broadcast Networks,” Proc. Asia- Pacific Conf. Comm. (APCC), pp. 1-5, 2008.

Nelakuditi.S, Zhang.Z.L, Tsang.R.P, “Adaptive Proportional Routing: A Localized QoS Routing Approach,” IEEE/ ACM Trans. Networking, vol. 10, no. 6, pp. 790-804, Dec. 2002.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




 


All Rights Reserved © 2012 IJARCSEE


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.