P. 1
Bandwidth Estimation for IEEE 802

Bandwidth Estimation for IEEE 802

|Views: 14|Likes:
Published by Niranjan Hn
networking mangement
networking mangement

More info:

Published by: Niranjan Hn on Feb 02, 2013
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PPT, PDF, TXT or read online from Scribd
See more
See less

06/06/2015

pdf

text

original

Under the guidance of: Ms.Pallavi B.V Lecturer, Dept of ISE B.G.S.I.

T

Presented by: Manasa K.C(4bw06is019) Shwetha T.S(4bw06is047) Usharani S(4bw06is053) Padmapriya H.N(4bw07is401)

• • • •


• •

Abstract Analysis Design and Implementation Screen Shots Conclusion Future Enhancement Reference

IEEE 802.11-based networks have been able to provide a certain level of quality of service (QoS).

However, no mechanism or method has been standardized to

accurately evaluate the amount of resources remaining on a
given channel.

Such an evaluation would, however, be a good asset for bandwidth-constrained applications.

 In this project.11-based ad hoc networks. In multihop ad hoc networks. such evaluation becomes even more difficult. . we propose an improved mechanism to estimate the available bandwidth in IEEE 802.

.

 They do not require setting up any fixed infrastructure such as access points. and mobile networks.  These applications may benefit from a quality of service (QoS) support in the network. wireless. AD hoc networks are autonomous. as the nodes organize themselves automatically to transfer data packets and manage topology changes due to mobility. . self-organized.

The scope of the project is to reduce the collision and we want to improve the Throughput value and finally we find the Bandwidth. .

. and it is therefore not perfectly suited to this type.The ad hoc networking community assumes that the underlying wireless technology is the IEEE 802. The performance of wireless multihop ad hoc networks is very poor because of medium contention and network congestion. This standard has not been targeted especially for multihop ad hoc operation.11 standard due to the broad availability of interface cards and simulation models.

but it has a chance for collision so that the throughput value is not good. . Distributed Routing Protocol is allowing for long distance communications.

 In this system we are using 802.11 MAC layer to evaluate the correct bandwidth.  We propose the multihop flows are admitted more accurately. . resulting in a better stability.  We propose to detect the presence of congestion by monitoring the channel continuously and avoid the contention problem.  This method combines channel monitoring to estimate each node’s medium occupancy.

Software Requirements: Front End : Java. Swing Tools Used Operating System Back End : JFrameBuilder : Windows-XP : MS Access .

Processor RAM Monitor Hard disk : : : : PENTIUM IV 2.6 GHz 512 MB DD RAM 15” COLOR 20 GB .

.

 It is an on demand algorithm. The Ad hoc On Demand Distance Vector (AODV) routing algorithm is a routing protocol designed for ad hoc mobile networks. It maintains these routes as long as they are needed by the sources. meaning that it builds routes between nodes only as desired by source nodes. .

    Packet Creation Apply the RREQ and RREP Admission Control Mechanism Utilized Bandwidth .

Packet Creation: In this module we split the Data in to N number of Fixed size packet with Maximum length of 48 Characters. .

. two flows with the same source and destination can follow different routes depending on the network state. Therefore.The aim of the RREQ is to find a route between the sender and the receiver that meets the constraints specified by the application level in terms of Bandwidth.

the destination address. otherwise. The RREQ packet contains the address of the sender. The Intermediate Node or Destination Node sends RREP if it is free. and a sequence number. it broadcasts a route request (RREQ) to its neighbors. and the requirements at the application level. it silently discards the message .When a source node has data to send.

. The Admission Control Mechanism has the all status of the node so if the nodes want to send RREP or discard the message. The particular node check the status by using the Admission Control Mechanism.The Admission Control Mechanism is done in the receiver side.

After the source nodes send the total message to the Destination Node finally we calculate the end to end delivery of the Bandwidth and Time delay .

The source node selects the destination node first and then by using the browse button we select some text file and this text file is send to the destination side. .

First Process: P1 Packets DATA P2 Pn Pn+1 Fig:Packet creation .

Source Node Apply the RREQ to Neighbor to Destination Node Get the RREP from the neighbor or destination node Destination node Fig : Direct data transmission between nodes .

Source Node Packet Creation Intermediate Node Destination node Fig : Transmission of Data using Intermediate Node .

RREQ Node1 RREP+ Node2 Fig: Data Flow Diagram for Direct Transmission between two nodes .

NODE2 NODE1 NODE4 NODE3 Fig : Data Flow Diagram for transmission using Intermediate nodes .

  It is a Peer To Peer Process Now the data send from Node1 to Node4  Node1 send the RREQ to neighbor node (Node2 or Node3 )and find which node is free by using RREP+. In this diagram Node2 is free and send the RREP+ signal to Node1 and now the transmit taken place. All the data received by Node2 and then transmit to Node4 by doing the process again.  RREP+ signal send by neighbor node only it is free. .

.

.

.

.

.

.

.

.

Direct Transmission of Data from Node1 to Node2 .

.

.

.

.

.

.

Data Transmission from Node1 to Node4 through Intermediate Nodes .

.

.

.

.

.

.

.

.

.

 Lower getting-started cost because no need to install base stations  We reduce the collision and network congestion problem .

Peer to Peer:   No centralized authority at the application level Direct communication between peers is mandatory Ad-hoc networks are suited for use in situations where an infrastructure is unavailable or to deploy one is not cost effective. .

 Estimation of the collision probability between each couple of nodes. . and variable overhead’s impact estimation. This project has new technique to compute the available bandwidth between two neighbor nodes and by extension along a path.  Estimate each node’s medium occupancy including distant emissions. probabilistic combination of these values to account for synchronization between nodes.

it may be possible that a node considers its available bandwidth on a link as almost null whereas the whole bandwidth is consumed by best effort flows. In future. it may be possible that a node considers its available bandwidth on a link as almost null whereas the whole bandwidth is consumed by best effort flows. Decreasing the rate of these flows may lead to a higher acceptance rate of QoS flows.  Therefore. .

2003. M. Jain and C. 17. Gunningberg. vol. [1] R. 6. C. and Tools. Nov. Bjorkman. Measurement Techniques. pp.” . Dovrolis.  [3] B. Claffy. “Bandwidth Estimation: Metrics. and K. Melander. Dovrolis. 27-35. Prasad. and P. Murray.  [2] M. Method for Estimating Bandwidth Bottlenecks.” IEEE Network. no. M. “End-to-End Available Bandwidth: Measurement Methodology.

THANK YOU .

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->