An Efficient Bandwidth Estimation Schemes used in Wireless Mesh Networks
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2012, Vol 1, Issue 6
Abstract
wireless mesh networks (WMNs) has been widely used for the new generation wireless network. The capability of self-organization in WMNs reduces the complexity of wireless network deployment and maintenance. So, the perfect estimation of the bandwidth available of the mesh nodes is the required to admission control mechanism which provides QOs confirmation in wireless mesh networks. The bandwidth estimation of schemes do not give clear output. Here we are proposing bandwidth scheme estimation for decreasing the parallel transmission will cause the accurate and it will solve the maximum clique problem in the theory of graph. The hop by hop routing protocol is integrated by the admission control mechanism. Finally the implementation phase was simulated by the mechanism based on BEPTC will effectively control the traffic load and offer QoS guarantee for admitted new flows all these lead the network to accommodate more flows with QOS guarantee and obtain higher system throughput make difference with other conservative approaches.
Authors and Affiliations
A. Sandeep Kumar , Dr S. N. Tirumala Rao
Keywords
Related Articles
- EP ID EP157023
- DOI -
- Views 117
- Downloads 0
STUDY OF NONLINEAR POLEMETRIC MIXTURE BY S.R. METHOD
Lquid crystals are states of condensed matter whose symmetries lie between crystals and isotropic liquids Thermotropic liquid crystalline phases are exhibited by a large number of organic compounds shows molecu...
A Survey on Algorithms for Cluster Head Selection in WSN
Wireless Sensor Network is a resource constraint network, in which all sensor nodes have limited resources. In order to save resources and energy data must be aggregated to reduce the amount of traffic in the netwo...
An ACO Approach to Solve a Variant of TSP
This study is an investigation on the application of Ant Colony Optimization to a variant of TSP. This paper presents an Ant Colony Optimization (ACO) approach to solve a randomly generated TSP problem known as RTS...
Grid Density Based Clustering Algorithm
Clustering is the one of the most important task of the data mining. Clustering is the unsupervised method to find the relations between points of dataset into several groups. It can be done by using various types...
A Tailored Ontology Sculpt For Web Information Congregation
As a sculpt for acquaintance explanation and exemplification, ontologies are extensively used to symbolize consumer profiles in tailored web information congregation. Conversely, when representing consumer profiles...