Ppt

UNDER THE GUIDENCE OF

Mr. P. Rajesh B. TechAsst.Professor

PRESENTED BY:V. Jawahar BabuD.Aditya Nadh,B.Venkateswara ReddyK.Mallikarjun

CONTENTSCONTENTS ABSTRACTABSTRACT INTRODUCTIONINTRODUCTION EXISTING SYSTEMEXISTING SYSTEM PROPOSED SYSTEMPROPOSED SYSTEM SYSTEM REQIREMENTSSYSTEM REQIREMENTS MODULESMODULES DESIGNDESIGN OUTPUT SCREENSOUTPUT SCREENS ANALYSYS(SRS)ANALYSYS(SRS) CONCLUSIONSCONCLUSIONS

Since 2005, IEEE 802.11-based networks Since 2005, IEEE 802.11-based networks have been able to provide a certain level have been able to provide a certain level of quality of service (QoS) by the means of of quality of service (QoS) by the means of service differentiation, due to the IEEE service differentiation, due to the IEEE 802.11e amendment. 802.11e amendment.

However, no mechanism or method has However, no mechanism or method has been standardized to accurately evaluate been standardized to accurately evaluate the amount of resources remaining on a the amount of resources remaining on a given channel. Such an evaluation would, given channel. Such an evaluation would, however, be a good asset for bandwidth-however, be a good asset for bandwidth-constrained applications. constrained applications.

In multihop ad hoc networks, such evaluation In multihop ad hoc networks, such evaluation becomes even more difficult. Consequently, despite becomes even more difficult. Consequently, despite the various contributions around this research the various contributions around this research topic, the estimation of the available bandwidth topic, the estimation of the available bandwidth still represents one of the main issues in this field. still represents one of the main issues in this field.

In this paper, we propose an improved mechanism In this paper, we propose an improved mechanism to estimate the available bandwidth in IEEE to estimate the available bandwidth in IEEE 802.11-based ad hoc networks. Through 802.11-based ad hoc networks. Through simulations, we compare the accuracy of the simulations, we compare the accuracy of the estimation we propose to the estimation performed estimation we propose to the estimation performed by other state-of-the-art QoS protocols, QoS-by other state-of-the-art QoS protocols, QoS-AODV(AODV(Ad hoc On-Demand Distance Vector )Ad hoc On-Demand Distance Vector ). .

IntroductionIntroduction

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

They do not require setting up any fixed They do not require setting up any fixed infrastructure such as access points, as infrastructure such as access points, as the nodes organize themselves the nodes organize themselves automatically to transfer data packets and automatically to transfer data packets and manage topology changes due to mobility.manage topology changes due to mobility.

802.11standard provides an ad hoc mode, 802.11standard provides an ad hoc mode, allowing mobiles to communicate directly.allowing mobiles to communicate directly.

As the communication range is limited by As the communication range is limited by regulations, a distributed routing protocol is regulations, a distributed routing protocol is required to allow long distance required to allow long distance communications.communications.

The Qos in Adhoc Networks will be mainly The Qos in Adhoc Networks will be mainly depends upon the N/W depends upon the N/W bandwidth,delay,packet loss,and network load.bandwidth,delay,packet loss,and network load.

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

The ad hoc networking community assumes The ad hoc networking community assumes that the underlying wireless technology is the that the underlying wireless technology is the IEEE 802.11 standard due to the broad IEEE 802.11 standard due to the broad availability of interface cards and simulation availability of interface cards and simulation models.models.

This standard has not been targeted especially This standard has not been targeted especially for multihop ad hoc operation, and it is for multihop ad hoc operation, and it is therefore not perfectly suited to this type.therefore not perfectly suited to this type.

An accurate evaluation of the capabilities of An accurate evaluation of the capabilities of the routes is necessary. Most of the current the routes is necessary. Most of the current QoS proposals leave this problem aside, QoS proposals leave this problem aside, relying on the assumption that the link layer relying on the assumption that the link layer protocols are able to perform such an protocols are able to perform such an evaluation. evaluation.

In this system they are using 802.11 MAC In this system they are using 802.11 MAC layer to evaluate the correct bandwidth.layer to evaluate the correct bandwidth.

This method combines channel monitoring This method combines channel monitoring to estimate each node’s medium to estimate each node’s medium occupancy.occupancy.

Probabilistic combination of the values is Probabilistic combination of the values is to account for synchronization between to account for synchronization between nodes, estimation of the collision nodes, estimation of the collision probability between each couple of nodes, probability between each couple of nodes, and variable overhead’s impact estimation. and variable overhead’s impact estimation.

Software Requirements:Software Requirements:

Front End Front End : : Java, SwingJava, Swing

Tools Used Tools Used :: JFrameBuilderJFrameBuilder

Operating System :Operating System : Windows-XPWindows-XP

Hardware Requirements:Hardware Requirements:PROCESSOR PROCESSOR : : PENTIUM IV 2.6 GHzPENTIUM IV 2.6 GHz

RAMRAM : : 512 MB DD RAM512 MB DD RAM

MONITORMONITOR : : 15” COLOR15” COLOR

HARD DISK HARD DISK : : 20 GB20 GB

FLOPPY DRIVE FLOPPY DRIVE : : 1.44 MB1.44 MB

CDDRIVECDDRIVE : : LG 52XLG 52X

KEYBOARD KEYBOARD : : STANDARD102 KEYSSTANDARD102 KEYS

MOUSEMOUSE : : 3 BUTTONS3 BUTTONS

ModulesModules

Packet creationPacket creation Apply the RREQ And get RREP Apply the RREQ And get RREP Admission Control MechanismAdmission Control Mechanism Utilized BandwidthUtilized Bandwidth

Packet CreationPacket Creation

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

DATA P2

Pn

p1

Apply the RREQ and get Apply the RREQ and get RREPRREP

Aim of the RREQ is to find a route between Aim of the RREQ is to find a route between the sender and the receiver that meets the the sender and the receiver that meets the constraints specified by the application level constraints specified by the application level in terms of Bandwidth. in terms of Bandwidth.

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

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

Source Node

Admission Control Admission Control MechanismMechanism

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

Source node

Packet creation

Intermediate node

Destination node

Bandwidth UtilizedBandwidth Utilized

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

Technique used or Technique used or algorithm usedalgorithm used

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

It is an on demand algorithm, meaning It is an on demand algorithm, meaning that it builds routes between nodes that it builds routes between nodes only as desired by source nodes. It only as desired by source nodes. It maintains these routes as long as they maintains these routes as long as they are needed by the sources.are needed by the sources.

Ad hoc On-Demand Distance Ad hoc On-Demand Distance Vector (AODV)Vector (AODV)

Ad hoc On-Demand Distance Vector Ad hoc On-Demand Distance Vector (AODV) Routing(AODV) Routing is a routing protocol is a routing protocol for mobile ad hoc networks (MANETs) for mobile ad hoc networks (MANETs) and other wireless ad-hoc networks.and other wireless ad-hoc networks.

AODV is capable of both unicast and AODV is capable of both unicast and multicast routing. It is a reactive multicast routing. It is a reactive routing protocol, meaning that it routing protocol, meaning that it establishes a route to a destination establishes a route to a destination only on demand.only on demand.

The Ad hoc On-Demand Distance The Ad hoc On-Demand Distance Vector (AODV) Routing protocol uses Vector (AODV) Routing protocol uses an on-demand approach for finding an on-demand approach for finding routes, that is, a route is established routes, that is, a route is established only when it is required by a source only when it is required by a source node for transmitting data packets.node for transmitting data packets.

The major difference between AODV The major difference between AODV and other on-demand routing protocols and other on-demand routing protocols is that it uses a is that it uses a destination sequence destination sequence numbernumber (DestSeqNum) to determine an (DestSeqNum) to determine an up-to-date path to the destination.up-to-date path to the destination.

AdvantagesAdvantages Lower getting-started cost because no need to Lower getting-started cost because no need to

install base stations install base stations We reduce the collision and network We reduce the collision and network

congestion problemcongestion problem

ApplicationsApplications Peer-to-PeerPeer-to-Peer

Direct communication between peers is mandatoryDirect communication between peers is mandatory No centralized authority at the application level No centralized authority at the application level

Ad-hoc networks are suited for use in Ad-hoc networks are suited for use in

situations where an infrastructure is situations where an infrastructure is unavailable or to deploy one is not cost unavailable or to deploy one is not cost effective.effective.

Node2

Node1 Node4

Node3

RREQ

RREQ

RREP+ RREP+

RREP+

DATA FLOW DIAGRAM

DESIGNING PHASE

Sender

Packet Creation

Apply RREQ

Get RREP

Destination

STATE DIAGRAM

SEQUENCE DIAGRAMSEQUENCE DIAGRAM

Source : (Source)

Network Formation

Message Tranformation

RREQ

RREP

Message transfer to the RREP node

SOFTWARE REQUIREMENT SOFTWARE REQUIREMENT SPECIFICATIONSPECIFICATION

In module given input and In module given input and expected outputexpected output

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

Output ScreensOutput Screens

CONCLUSIONCONCLUSION

we have presented a new technique we have presented a new technique to compute the available bandwidth to compute the available bandwidth between two neighbor nodes and by between two neighbor nodes and by extension along a path.extension along a path.

R. Prasad, M. Murray, C. Dovrolis, and K. Claffy, R. Prasad, M. Murray, C. Dovrolis, and K. Claffy, “Bandwidth Estimation: Metrics, Measurement “Bandwidth Estimation: Metrics, Measurement Techniques, and Tools,” IEEE Techniques, and Tools,” IEEE Network, vol. 17, no. 6, Network, vol. 17, no. 6, pp. 27-35, Nov. 2003.pp. 27-35, Nov. 2003.

S.H. Shah, K. Chen, and K. Nahrstedt, “Dynamic S.H. Shah, K. Chen, and K. Nahrstedt, “Dynamic Bandwidth Management for Single-Hop Ad Hoc Bandwidth Management for Single-Hop Ad Hoc Wireless Networks,” Proc. First IEEE Int’l Conf. Wireless Networks,” Proc. First IEEE Int’l Conf. Pervasive Computing and Comm. (PerCom ’03),Aug. Pervasive Computing and Comm. (PerCom ’03),Aug. 2003.2003.

A. Johnsson, B. Melander, and M. Bjo¨rkman, A. Johnsson, B. Melander, and M. Bjo¨rkman, “Bandwidth“Bandwidth

Measurement in Wireless Network,” technical report, Measurement in Wireless Network,” technical report, Ma¨lardalenMa¨lardalen

Univ., Mar. 2005.Univ., Mar. 2005.

REFERENCES

CONCLUSIONCONCLUSION

we have presented a new technique we have presented a new technique to compute the available bandwidth to compute the available bandwidth between two neighbor nodes and by between two neighbor nodes and by extension along a path.extension along a path.

END OF THE END OF THE PRESENTATIONPRESENTATION

THANK UTHANK U