Bandwidth Estimation for IEEE 802.11-Based Ad Hoc Networks.

Slides:



Advertisements
Similar presentations
ACHIEVING NETWORK LEVEL PRIVACY IN WIRELESS SENSOR NETWORKS.
Advertisements

A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
Abstract There is significant need to improve existing techniques for clustering multivariate network traffic flow record and quickly infer underlying.
ABSTRACT Due to the Internets sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes.
MultiNet: Connecting to Multiple IEEE Networks Using a Single Radio Ranveer Chandra, Cornell University joint work with: Victor Bahl (MSR) and Pradeep.
Page 1 Approximately Maximum Bandwidth Routing for Slotted Wireless Ad Hoc Networks Approximately Maximum Bandwidth Routing for Slotted Wireless Ad Hoc.
IEEE INFOCOM 2004 MultiNet: Connecting to Multiple IEEE Networks Using a Single Wireless Card.
CS541 Advanced Networking 1 Dynamic Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks Neil Tang 3/10/2009.
Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Vikram Kanodia.
1 Expected Data Rate (EDR): An Accurate High-Throughput Path Metric For Multi- Hop Wireless Routing Jun Cheol Park Sneha Kumar Kasera.
Selected Data Rate Packet Loss Channel-error Loss Collision Loss Reduced Packet Probing (RPP) Multirate Adaptation For Multihop Ad Hoc Wireless Networks.
On the Node Clone Detection inWireless Sensor Networks.
Toward a Statistical Framework for Source Anonymity in Sensor Networks.
Energy-Optimum Throughput and Carrier Sensing Rate in CSMA-Based Wireless Networks.
A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation.
Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks.
Minimum Cost Blocking Problem in Multi-path Wireless Routing Protocols.
Layered Approach using Conditional Random Fields For Intrusion Detection.
Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya University of Illinois.
Incentive Based Data Sharing in Delay Tolerant Mobile Networks.
Reducing Traffic Congestion in ZigBee Networks: Experimental Results th International Wireless Communications and Mobile Computing Conference (IWCMC)
Improving Network I/O Virtualization for Cloud Computing.
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
Tweet Analysis for Real-Time Event Detection and Earthquake Reporting System Development.
EAACK—A Secure Intrusion-Detection System for MANETs
Combining Cryptographic Primitives to Prevent Jamming Attacks in Wireless Networks.
Protecting Sensitive Labels in Social Network Data Anonymization.
MARCH : A Medium Access Control Protocol For Multihop Wireless Ad Hoc Networks 성 백 동
Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks.
Content Sharing over Smartphone-Based Delay- Tolerant Networks.
Abstract Link error and malicious packet dropping are two sources for packet losses in multi-hop wireless ad hoc network. In this paper, while observing.
A System for Denial-of- Service Attack Detection Based on Multivariate Correlation Analysis.
Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links.
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
An Energy Efficient MAC Protocol for Wireless LANs Eun-Sun Jung Nitin H. Vaidya IEEE INFCOM 2002 Speaker :王智敏 研二.
Anomaly Detection via Online Over-Sampling Principal Component Analysis.
A Highly Scalable Key Pre- Distribution Scheme for Wireless Sensor Networks.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Facilitating Document Annotation using Content and Querying Value.
Full auto rate MAC protocol for wireless ad hoc networks Z. Li, A. Das, A.K. Gupta and S. Nandi School of Computer Engineering Nanyang Technological University.
Preventing Private Information Inference Attacks on Social Networks.
Video Dissemination over Hybrid Cellular and Ad Hoc Networks.
Robust MANET Design John P. Mullen, Ph.D. Timothy I. Matis, Ph.D. Smriti Rangan Karl Adams Center for Stochastic Modeling New Mexico State University May.
Abstract We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable.
DCIM: Distributed Cache Invalidation Method for Maintaining Cache Consistency in Wireless Mobile Networks.
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power.
A Multi-Channel Cooperative MIMO MAC Protocol for Wireless Sensor Networks(MCCMIMO) MASS 2010.
Evaluation of ad hoc routing over a channel switching MAC protocol Ethan Phelps-Goodman Lillie Kittredge.
Securing Broker-Less Publish/Subscribe Systems Using Identity-Based Encryption.
Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.
Ad hoc Routing for Multilevel Power Saving Protocols Matthew J. Miller, Nitin H. Vaidya Ad Hoc Networks 2008 January University of Illinois at Urbana-Champaign,
Routing Performance in the Presence of Unidirectional Links in Multihop Wireless Networks Mahesh K. Marina and Samir R. Das ACM MOBIHOC’02.
Energy-Efficient Protocol for Cooperative Networks.
Fen Hou 、 Lin X. Cai, University of Waterloo Xuemin Shen, Rutgers University Jianwei Huang, Northwestern University IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY,
Whole Test Suite Generation. Abstract Not all bugs lead to program crashes, and not always is there a formal specification to check the correctness of.
ONLINE INTRUSION ALERT AGGREGATION WITH GENERATIVE DATA STREAM MODELING.
Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks.
Facilitating Document Annotation Using Content and Querying Value.
Risk-Aware Mitigation for MANET Routing Attacks Submitted by Sk. Khajavali.
Fast Transmission to Remote Cooperative Groups: A New Key Management Paradigm.
Dynamic Query Forms for Database Queries. Abstract Modern scientific databases and web databases maintain large and heterogeneous data. These real-world.
Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.
Under the Guidance of V.Rajashekhar M.Tech Assistant Professor
Under Guidance- Internal Guide- Ms. Shruti T.V
ABSTRACT   Recent work has shown that sink mobility along a constrained path can improve the energy efficiency in wireless sensor networks. Due to the.
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
NYMBLE: BLOCKING MISBEHAVING USERS IN ANONYMIZING NETWORKS
Presentation transcript:

Bandwidth Estimation for IEEE Based Ad Hoc Networks

ABSTRACT Since 2005, IEEE 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 e 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. Since 2005, IEEE 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 e 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 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, BRuIT, AAC, and QoS-AODV. 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 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, BRuIT, AAC, and QoS-AODV.

EXISTING SYSTEM The ad hoc networking community assumes that the underlying wireless technology is the IEEE standard due to the broad availability of interface cards and simulation models. The ad hoc networking community assumes that the underlying wireless technology is the IEEE 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. 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. 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.

PROPOSED SYSTEM In this system we are using MAC layer to evaluate the correct bandwidth. In this system we are using MAC layer to evaluate the correct bandwidth. This method combines channel monitoring to estimate each nodes medium occupancy. This method combines channel monitoring to estimate each nodes 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 overheads impact estimation. Probabilistic combination of the values is to account for synchronization between nodes, estimation of the collision probability between each couple of nodes, and variable overheads impact estimation. This mechanism only requires one-hop information communication and may be applied without generating a too high additional overhead. This mechanism only requires one-hop information communication and may be applied without generating a too high additional overhead. We show the accuracy of the available bandwidth measurement through NS-2 simulations. We show the accuracy of the available bandwidth measurement through NS-2 simulations. These results show that single-hop flows and multihop flows are admitted more accurately, resulting in a better stability and overall performance. These results show that single-hop flows and multihop flows are admitted more accurately, resulting in a better stability and overall performance.

MODULES Packet Creation Packet Creation Apply the RREQ and get RREP Apply the RREQ and get RREP Admission Control Mechanism Admission Control Mechanism Bandwidth Utilized Bandwidth Utilized

SYSTEM REQUIREMENT SPECIFICATION Hardware Requirements Processor :Pentium IV Processor :Pentium IV Hard Disk:80 GB Hard Disk:80 GB Ram:1 GB Ram:1 GB Software Requirements Front End : Java, Swing Front End : Java, Swing Back End : MS Access Back End : MS Access Operating System : Windows XP Operating System : Windows XP

THANK YOU