Improving Ad Hoc Network Performances by Estimating Available Bandwidth
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 8
Abstract
The term bandwidth refers to the data rate that a network link or a network path can transfer. Bandwidth is one of the uarantee attribute to measure the performance of the network. Measuring available bandwidth in ad hoc networks is a challenging issue in Mobile Ad hoc Network (MANET). In this paper, the new technique is proposed to evaluate the accurate available bandwidth in ad hoc networks. This technique considers reducing backoff time, node’s and link’s capability. By these network flows, the amount of bandwidth is wasted. Estimating accurate available bandwidth allows a node to make an optimal decision before sending a packet in networks
Authors and Affiliations
K. Mohideen Vahitha Banu,
Smart phone Application using Morse Code and Inaudible Frequency
In this paper, the wireless communication using Morse code and inaudible frequency has been discussed. The application of this project is to transfer the limited information with the help of inaudible frequency and AAC....
Correlating Dimensions of Inheritance Hierarchy with Complexity & Reuse
Inheritance is the vital feature of any object oriented software which provides reuse of exiting classes for designing new classes. Higher reuse provides higher productivity and greater quality. Inheritance hierarchy is...
Cluster Analysis Research Design model, problems, issues, challenges, trends and tools
Clustering is the process of grouping a set of objects into classes. In the last decade cluster analysis research gained significant interest among researchers. This paper is intended to propose research design model for...
Android in opposition to iPhone
The paper is an analysis and comparison of the android mobile OS with the iPhone which have ruled the mobile market in past years today is facing a downfall just because of the introduction of this new OS. Android with i...
A New Look to Traversal Algorithms Using Set Construct Data Structure
Tree traversal refers to the process of visiting or examining or updating each node in a tree data structure, exactly once, in a systematic way. Such traversals are classified by the order in which the nodes of the tree...