Scribd
Upload
406 views31 pages

Under The Guidence of Mr. P. Rajesh .: B Tech Asst - Professor

This document presents a summary of a student project on estimating available bandwidth in IEEE 802.11-based ad hoc networks. It includes sections on contents, introduction, existing system, proposed system, system requirements, modules, design, output screens, analysis, and conclusions. The introduction discusses challenges with QoS in ad hoc networks. The proposed system improves bandwidth estimation accuracy compared to other protocols like QoS-AODV. Key modules include packet creation, route request and reply, admission control, and utilized bandwidth calculation. The project uses the AODV routing protocol and includes data flow, state, and sequence diagrams in the design section.

Uploaded by

jeffa007
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
406 views31 pages

Under The Guidence of Mr. P. Rajesh .: B Tech Asst - Professor

This document presents a summary of a student project on estimating available bandwidth in IEEE 802.11-based ad hoc networks. It includes sections on contents, introduction, existing system, proposed system, system requirements, modules, design, output screens, analysis, and conclusions. The introduction discusses challenges with QoS in ad hoc networks. The proposed system improves bandwidth estimation accuracy compared to other protocols like QoS-AODV. Key modules include packet creation, route request and reply, admission control, and utilized bandwidth calculation. The project uses the AODV routing protocol and includes data flow, state, and sequence diagrams in the design section.

Uploaded by

jeffa007
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/ 31

UNDER THE GUIDENCE OF

Mr. P. Rajesh B. Tech


Asst.Professor

PRESENTED BY:
V. Jawahar Babu
D.Aditya Nadh,
B.Venkateswara Reddy
K.Mallikarjun
CONTENTS
 ABSTRACT
 INTRODUCTION
 EXISTING SYSTEM
 PROPOSED SYSTEM
 SYSTEM REQIREMENTS
 MODULES
 DESIGN
 OUTPUT SCREENS
 ANALYSYS(SRS)
 CONCLUSIONS
 Since 2005, IEEE 802.11-based networks have been
able to provide a certain level of quality of service
(QoS) by the means of service differentiation, due to
the IEEE 802.11e amendment.
 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. Consequently, despite the various
contributions around this research topic, the estimation of
the available bandwidth still represents one of the main
issues in this field.
 In this paper, we propose an improved mechanism to
estimate the available bandwidth in IEEE 802.11-based ad
hoc networks. Through simulations, we compare the
accuracy of the estimation we propose to the estimation
performed by other state-of-the-art QoS protocols, QoS-
AODV(Ad hoc On-Demand Distance Vector ).
Introduction

 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.
 802.11standard provides an ad hoc mode,
allowing mobiles to communicate directly.
 As the communication range is limited by
regulations, a distributed routing protocol is
required to allow long distance communications.
 The Qos in Adhoc Networks will be mainly
depends upon the N/W bandwidth,delay,packet
loss,and network load.
 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.
 An accurate evaluation of the capabilities of the
routes is necessary. Most of the current QoS
proposals leave this problem aside, relying on the
assumption that the link layer protocols are able to
perform such an evaluation.
 In this system they are using 802.11 MAC
layer to evaluate the correct bandwidth.
 This method combines channel monitoring to
estimate each node’s medium occupancy.
 Probabilistic combination of the values is to
account for synchronization between nodes,
estimation of the collision probability between
each couple of nodes, and variable overhead’s
impact estimation.
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
Modules

 Packet creation
 Apply the RREQ And get 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.

p1

DATA P2

Pn
Apply the RREQ and get RREP
 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.
 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.
Source Node

Apply the RREQ to Neighbor to Destination Node

Apply the RREQ to Neighbor to


Destination Node
d

Get the RREP from the neighbor or


destination node

Destination node
Admission Control Mechanism

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.
Sourc
e node

Packet creation

Intermediate node

Destination
node
 Bandwidth Utilized
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.
Technique used or algorithm
used
 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.
Ad hoc On-Demand Distance Vector (AODV)

 Ad hoc On-Demand Distance Vector


(AODV) Routing is a routing protocol for
mobile ad hoc networks (MANETs) and other
wireless ad-hoc networks.
 AODV is capable of both unicast and
multicast routing. It is a reactive routing
protocol, meaning that it establishes a route to
a destination only on demand.
 The Ad hoc On-Demand Distance Vector
(AODV) Routing protocol uses an on-demand
approach for finding routes, that is, a route is
established only when it is required by a
source node for transmitting data packets.
 The major difference between AODV and
other on-demand routing protocols is that it
uses a destination sequence number
(DestSeqNum) to determine an up-to-date path
to the destination.
Advantages
 Lower getting-started cost because no need to install
base stations
 We reduce the collision and network congestion
problem
Applications
 Peer-to-Peer
 Direct communication between peers is mandatory
 No centralized authority at the application level

 Ad-hoc networks are suited for use in situations


where an infrastructure is unavailable or to deploy
one is not cost effective.
DATA FLOW
DIAGRAM
Node2
DESIGNING
RREQ
PHASE
RREQ
RREP+ RREP+
Node1 Node4

RREP+

Node3
STATE DIAGRAM

Sender

Packet
Creation

Apply
RRE Q

Get RREP

Des t ination
SEQUENCE DIAGRAM
Source : Network Message
(Source) Formation Tranformation
RREQ

RREP

Message transfer to the RREP node


SOFTWARE REQUIREMENT
SPECIFICATION
 In module given input and expected output
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.
Output Screens
CONCLUSION

we have presented a new technique to compute


the available bandwidth between two neighbor
nodes and by extension along a path.
REFERENCES
 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.
 S.H. Shah, K. Chen, and K. Nahrstedt, “Dynamic Bandwidth
Management for Single-Hop Ad Hoc Wireless Networks,”
Proc. First IEEE Int’l Conf. Pervasive Computing and Comm.
(PerCom ’03),Aug. 2003.
 A. Johnsson, B. Melander, and M. Bjo¨rkman, “Bandwidth

Measurement in Wireless Network,” technical report,


Ma¨lardalen
Univ., Mar. 2005.
CONCLUSION

we have presented a new technique to compute


the available bandwidth between two neighbor
nodes and by extension along a path.
END OF THE PRESENTATION

THANK U

You might also like