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

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

In this project, we propose an improved mechanism to

estimate the available bandwidth in IEEE 802.11-based ad hoc

networks.

AD hoc networks are autonomous, self-organized, wireless, and mobile networks.

They do not require setting up any fixed infrastructure such as

access points, as the nodes organize themselves automatically to

transfer data packets and manage topology changes due to mobility.

These applications may benefit from a quality of service (QoS)

support in the network.

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

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 nodes 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.

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

The Ad hoc On Demand Distance Vector (AODV) routing algorithm is a routing protocol designed for ad hoc mobile networks.

It is an on demand algorithm, meaning that it builds routes

between nodes only as desired by source nodes. It maintains these routes as long as they are needed by the sources.

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.

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. Therefore, two flows with the same source and destination can follow different routes depending on the network state.

When a source node has data to send, it broadcasts a route

request (RREQ) to its neighbors.

The RREQ packet contains the address of the sender, and the requirements at the application level, the destination address,

and a sequence number.

The Intermediate Node or Destination Node sends RREP if it is free, otherwise, it silently discards the message

The Admission Control Mechanism is done in the receiver side. 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.

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+.

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.

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.

This project has new technique to compute the available bandwidth between two neighbor nodes and by extension along a path.

Estimate each nodes medium occupancy including distant

emissions, probabilistic combination of these values to account

for synchronization between nodes,

Estimation of the collision probability between each couple of nodes, and variable overheads impact estimation.

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.

Therefore, 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.

[1] R. Prasad, M. Murray, C. Dovrolis, and K. Claffy,

Bandwidth Estimation: Metrics, Measurement Techniques,

and Tools, IEEE Network, vol. 17, no. 6, pp. 27-35, Nov. 2003.

[2] M. Jain and C. Dovrolis, End-to-End Available Bandwidth: Measurement Methodology,

[3] B. Melander, M. Bjorkman, and P. Gunningberg, Method

for Estimating Bandwidth Bottlenecks,

THANK YOU