Scribd
Upload
17 views

Bandwidth

Uploaded by

senthilrajaaruna
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
17 views

Bandwidth

Uploaded by

senthilrajaaruna
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 8

 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 multihop ad hoc networks, such evaluation
becomes even more difficult.

 In this paper, we propose an improved mechanism


to estimate the available bandwidth in IEEE 802.11-
based ad hoc networks.
 The ad hoc networking community assumes that the
underlying wireless technology is the IEEE 802.11 standard
due to the broad availability of interface cards and simulation
models.
 This standard has not been targeted especially for multihop ad
hoc operation, and it is therefore not perfectly suited to this
type.
 The performance of wireless multihop ad hoc networks is very
poor because of medium contention and network congestion.
 Distributed Routing Protocol is allowing for long distance
communications, but it has a chance for collision so that the
throughput value is not good.
 In this system we are using 802.11 MAC layer to
evaluate the correct bandwidth.
 This method combines channel monitoring to
estimate each node’s medium occupancy.
 We propose to detect the presence of congestion by
monitoring the channel continuously and avoid the
contention problem.
 We propose the multihop flows are admitted more
accurately, resulting in a better stability.
Data Flow Diagram

NODE2
Q RR
E EQ
RR RR
EP
+ EP
RR +

NODE1 NODE4

RR
E Q

NODE3

•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+.
•RREP+ signal send by neighbor node only it is free. 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. It is a peer
to peer process so we can send the data to any node to another node.
Software Requirements:

Front End : Java, Swing


Tools Used : JFrameBuilder
Operating System : Windows-XP
Hardware Requirements:
PROCESSOR : PENTIUM IV 2.6 GHz
RAM : 512 MB DD RAM
MONITOR : 15” COLOR
HARD DISK : 20 GB
FLOPPY DRIVE : 1.44 MB
CDDRIVE : LG 52X
KEYBOARD : STANDARD102 KEYS
MOUSE : 3 BUTTONS

You might also like