A RCHITECTURE AND E VALUATION OF AN U NPLANNED 802.11 B M ESH N ETWORK John Bicket, Daniel Aguayo, Sanjit Biswas, Robert Morris.

Slides:



Advertisements
Similar presentations
LAN Devices 5.3 IT Essentials.
Advertisements

Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks Richard Draves, Jitu Padhye, Brian Zill Microsoft Research.
ExOR : Opportunistic Multi-hop Routing for Wireless Networks Sanjit Biswas and Robert Morris M.I.T. Computer Science and Artificial Intelligence Laboratory.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
Routing Protocol.
Fault Tolerant Routing in Tri-Sector Wireless Cellular Mesh Networks Yasir Drabu and Hassan Peyravi Kent State University Kent, OH
Wireless in the real world Gabriel Weisz October 8, 2010.
Arsitektur Jaringan Terkini
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
CCNA 2 v3.1 Module 6.
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL Presented by: Ao-Jan Su.
1 Sustaining Cooperation in Multi-Hop Wireless Networks Ratul Mahajan, Maya Rodrig, David Wetherall and John Zahorjan University of Washington Presented.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
Introduction to Management Information Systems Chapter 5 Data Communications and Internet Technology HTM 304 Fall 07.
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL
CS 672 Paper Presentation Presented By Saif Iqbal “CarNet: A Scalable Ad Hoc Wireless Network System” Robert Morris, John Jannotti, Frans Kaashoek, Jinyang.
ExOR: Opportunistic Multi-Hop Routing For Wireless Networks Sanjit Biswas & Robert Morris.
Eric Rozner - ETX.ppt1 A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S.J. Couto Daniel Aguayo John Bicket Robert Morris Presented.
Comparison of Routing Metrics for a Static Multi-Hop Wireless Network Richard Draves, Jitendra Padhye, Brian Zill Microsoft Research Presented by: Jón.
Network Measurement Bandwidth Analysis. Why measure bandwidth? Network congestion has increased tremendously. Network congestion has increased tremendously.
ExOR: Opportunistic Multi-Hop Routing for Wireless Networks Sigcomm 2005 Sanjit Biswas and Robert Morris MIT Computer Science and Artificial Intelligence.
Wireless MESH network Tami Alghamdi. Mesh Architecture – Mesh access points (MAPs). – Mesh clients. – Mesh points (MPs) – MP uses its Wi-Fi interface.
ECE 544 Project3 Kush Patel Siddharth Paradkar Ke Dong.
Dr. John P. Abraham Professor University of Texas Pan American Internet Routing and Routing Protocols.
Chapter 2 The Infrastructure. Copyright © 2003, Addison Wesley Understand the structure & elements As a business student, it is important that you understand.
Lecture 2 TCP/IP Protocol Suite Reference: TCP/IP Protocol Suite, 4 th Edition (chapter 2) 1.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
ITED 328 Lecture 4 12 Feb 2004 Loosely covering Chapter 5 Internet and LAN Technology.
Roofnet: An b Mesh Network Brad Karp UCL Computer Science CS 4C38 / Z25 23 rd January, 2006.
MIT Roofnet Robert Morris Daniel Aguayo, John Bicket, Sanjit Biswas, Douglas De Couto MIT Computer Science and Artificial Intelligence Laboratory
Module 2: Information Technology Infrastructure
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Introduction – Part II.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Network Services Networking for Home and Small Businesses – Chapter 6.
A High-Throughput Path Metric for Multi-Hop Wireless Routing Presenter: Gregory Filpus Slides borrowed and modified from: Douglas S. J. De Couto MIT CSAIL.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 3.
Communication Networks Fourth Meeting. Types of Networks  What is a circuit network?  Two people are connected and allocated them their own physical.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S. J. De Couto, Daniel Aguayo, John Bicket, Robert Morris MIT Computer Science and.
A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S. J. De Couto MIT CSAIL (LCS) Daniel Aguayo, John Bicket, and Robert Morris
Page 110/27/2015 A router ‘knows’ only of networks attached to it directly – unless you configure a static route or use routing protocols Routing protocols.
Robert Morris Daniel Aguayo, John Bicket, Sanjit Biswas, Douglas De Couto MIT Roofnet Performance.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S. J. De Couto, Daniel Aguayo, John Bicket, Robert Morris MIT CSAIL Presented by Valentin.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
Link-level Measurements from an b Mesh Network Daniel Aguayo John Bicket Sanjit Biswas Glenn Judd † Robert Morris M.I.T. Computer Science and Artificial.
NETWORKING FUNDAMENTALS. Network+ Guide to Networks, 4e2.
Rate-Based Channel Assignment Algorithm for Multi-Channel Multi- Rate Wireless Mesh Networks Sok-Hyong Kim and Young-Joo Suh Department of Computer Science.
Chapter 21 Multicast Routing
Routing Metrics and Protocols for Wireless Mesh Networks Speaker : 吳靖緯 MA0G0101.
ITE PC v4.0 Chapter 8 1 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public  Networks are systems that are formed by links.  People use different.
Distance Vector Routing
Cisco 3 - Switch Perrine. J Page 17/3/2016 Chapter 3 Which of the following are found in the EIGRP neighbor table? (Choose two.) 1.routes installed by.
15-1 Networking Computer network A collection of computing devices that are connected in various ways in order to communicate and share resources Usually,
Routing Metrics for Wireless Mesh Networks
Distributed Mesh Wireless Networks
Routing Metrics for Wireless Mesh Networks
Wireless Mesh Networks
Intra-Domain Routing Jacob Strauss September 14, 2006.
Architecture and Evaluation of an Unplanned b Mesh Network
CS222 Web Programming Course Outline
Wireless Mesh Networks
Routing Metrics for Wireless Mesh Networks
Opportunistic Routing in Multi-hop Wireless Networks
A High-Throughput Path Metric for Multi-Hop Wireless Routing
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Computer Networking A computer network, often simply referred to as a network, is a collection of computers and devices connected by communications channels.
Computer Networking A computer network, often simply referred to as a network, is a collection of computers and devices connected by communications channels.
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
Opportunistic Routing in Multi-hop Wireless Networks*
Presentation transcript:

A RCHITECTURE AND E VALUATION OF AN U NPLANNED B M ESH N ETWORK John Bicket, Daniel Aguayo, Sanjit Biswas, Robert Morris

T WO APPROACHES TO CONSTRUCTING COMMUNITY NETWORKS ARE COMMON. Multi-hop chosen locations directional an high-quality radio linkstennas well-coordinated groups with technical expertise high throughput good connectivity „hot-spot" access po operate independentlyints loosely connected if it works smaller coverage per wired connection

A MORE AMBITIOUS VISION FOR COMMUNITY NETWORKS WOULD COMBINE THE BEST CHARACTERISTICS OF BOTH NETWORK TYPES Unconstrained node placement Omni-directional antennas Multi-hop routing Optimization of routing for throughput in a slowly changing network with many links of intermediate quality

R ISKS radio ranges might be too short to connect some nodes many links might be low quality nodes might interfere with each other standard TCP might interact poorly with low- quality radio links the outdoor omni-directional antennas might pick up unacceptable levels of interference from other ISM-band users throughout the city

R OOFNET ( MULTI - HOP B I NTERNET ACCESS NETWORK ) 37 nodes spread over about four square kilometers of a city the average throughput between nodes is 627 kbits/second. eighthop routes average 160 kbits/second Single-flow throughput increases with node density radio links are between 500 and 1300m long performance and robustness do not greatly depend on any small set of nodes multi-hop forwarding improves coverage and throughput

R OOFNET IS DEPLOYED OVER AN AREA OF ABOUT FOUR SQUARE KILOMETERS IN C AMBRIDGE, M ASSACHUSETTS

R OOFNET D ESIGN This area is urban and densely populated. three- or four-story apartment buildings Each Roofnet node is hosted by a volunteer user Each volunteer installed his or her own node, including the roof-mounted antenna The resulting node locations are neither truly random nor selected according to any particular plan

H ARDWARE Each Roofnet node consists of a PC, an b card, and a roof-mounted omni-directional antenna The PC‘s Ethernet port provides Internet service to the user Each PC has a hard drive for collecting traces and a CD reader in case an over-the-network upgrade fails An entire Roofnet kit (PC, antenna, mounting hardware, and cable) can be carried by one person

T HE ANTENNA Each 8 dBi omni-directional antenna has a 3-dB vertical beam width of 20 degrees The antenna is connected to its node with coaxial cable which introduces 6 to 10 dB of attenuation Three nodes, located on the roofs of tall buildings, have 12 dBi Yagi directional antennas with 45- degree horizontal and vertical beam widths

S OFTWARE AND A UTO C ONFIGURATION Linux, routing software, DHCP server, web server Most users pick up nodes from us at our lab with software pre-installed From the user's perspective, the node acts like a cable or DSL modem allocating addresses finding a gateway between Roofnet and the Internet choosing a good multi-hop route to that gateway

A DDRESSING Roofnet carries IP packets inside its own header format and routing protocol A Roofnet node must also allocate IP addresses via DHCP to user hosts attached to the node's Ethernet port prevents hosts from connecting to each other through Roofnet

G ATEWAYS AND I NTERNET A CCESS Roofnet's design assumes that a small fraction of Roofnet users will voluntarily share their wired Internet access links On start-up, each Roofnet node checks to see if it can reach the Internet through its Ethernet port If this succeeds, the node advertises itself to Roofnet as an Internet gateway Otherwise the node acts as a DHCP server and default router for hosts on its Ethernet, and connects to the Internet via Roofnet

G ATEWAYS AND I NTERNET A CCESS When a node sends traffic through Roofnet to the Internet, the node selects the gateway to which it has the best route metric If the routing protocol later decides that a different gateway has the best metric, the node continues to forward data on existing TCP connections to those connections’ original gateways but new connections will use a different gateway Roofnet currently has four Internet gateways

R OUTING P ROTOCOL ( S RCR ) Omnidirectional antennas give Srcr many choices source-routes data packets (avoid loops) Dijkstra‘s algorithm A node that forwards a packet over a link includes the link's current metric DSRstyle flooded query and adds the link metrics learned from any responses to its database dummy query that allows all other nodes to learn about links on the way to that gateway

R OUTING M ETRIC „estimated transmission time” (ETT) metric „estimated transmission count” (ETX) Srcr chooses the route with the lowest ETT The ETT metric for a given link is the expected time to successfully send a 1500-byte packet at that link's highestthroughput bit-rate The ETT metric for a route is the sum of the ETTs for each of the route's links

B IT R ATE S ELECTION ( S AMPLE R ATE ) Roofnet has its own algorithm to choose among the b transmit bit-rates of 1, 2, 5.5, and 11 megabits/second SampleRate sends most data packets at the bit- rate it currently believes will provide the highest throughput

About 10% of pairs failed to find a working route in the multi-hop TCP measurements The reason for this is that flooded routing queries sometimes do not reach distant nodes due to link losses Srcr re-floods every five seconds if needed, but in many cases even this was not enough

T HEORETICAL LOSS - FREE MAXIMUM THROUGHPUT OVER ONE, TWO, AND THREE HOPS FOR EACH B TRANSMIT BIT - RATE, WITH BYTE PACKETS

A VERAGE TCP THROUGHPUT AND ROUND - TRIP PING LATENCY (33 NODE )

L INK Q UALITY AND D ISTANCE

Fast short hops are the best policy: for example, four 250-meter hops that individually run at three megabits/second yield a route with a throughput of 750 kbits/second, which is faster than most of the single meter links

E FFECT OF D ENSITY

NUMBER OF NEIGHBORS PER NODE. A NODE COUNTS AS A \ NEIGHBOR " IF IT HAS GREATER THAN 40% DELIVERY PROBABILITY FOR 1 MEGABIT PER SECOND PACKETS

NUMBER OF DIFFERENT FIRST HOPS THAT R OOFNET NODES USE IN ALL - PAIRS ROUTES

S IMULATED AVERAGE THROUGHPUT AND CONNECTIVITY AMONG ALL PAIRS VERSUS THE NUMBER OF LINKS ELIMINATED. E ACH CURVE SHOWS THE RESULT OF ELIMINATING LINKS IN A PARTICULAR ORDER

T HE EFFECT ON THROUGHPUT OF ELIMINATING THE BEST - CONNECTED R OOFNET NODES.

O PTIMAL C HOICE

O PTIMAL C HOICEPTIMAL C HOICE in a single-hop architecture, five gateways are needed to cover all Roofnet nodes. For any given set of gateways, multi-hop forwarding provides higher average throughput The five optimal gateways turn out to be nodes located on three-story residences, not the tallest buildings in the network

O PTIMAL C HOICE

R ANDOM C HOICE If Roofnet were a single-hop network, 25 gateways would be required to cover all the nodes. About 90% of the nodes are covered with 10 gateways, but there are a few nodes which are difficult to reach: the histogram in Figure 6 shows these last ten percent of nodes are within the range of three or fewer neighboring nodes. As with optimal gateway choice, multi-hop routing improves connectivity and throughput

NETWORK USE In one 24-hour period, the gateway forwarded an average of 160 kbits/second between Roofnet and the Internet This is the sum of the traffic in both directions This data accounted for about 94% of the wireless traffic that the gateway sent or received; the other 5% were protocol control packets 48% one hop from the gateway 36% two hops 16%, was forwarded over three hops or more

NETWORK USE radio was busy for about 70% Almost all of the packets forwarded were TCP less than1% were UDP 30% of the total data transferred, was the BitTorrent peer-to-peer file-sharing program 68% of the connections through the gateway were web connections Just 3% were BitTorrent 16 Roofnet hosts that accessed the Internet eight opened more than 100 TCP connections to the Internet during that time

RELATED WORK There have been a number of evaluations of deployed or test-bed multi-hop wireless networks. [14, 13] have focused on evaluating route metrics intended to increase throughput in static mesh networks [27, 19] have primarily considered route repair in the face of mobility [16, 25, 23, 7] have investigated link-level behavior in order to guide the design of higher- layer protocols

RELATED WORK Many of the basic ideas in wireless mesh networking were first developed for the DARPA Packet Radio Network [21]. Srcr is loosely based on DSR [20] and MCL [14]. [27, 26, 28, 25, 11] A number of research groups maintain wireless testbeds with which to valuate real-world performance of MANET protocols Commercial mesh Internet access services and technologies exist, such as MeshNetworks Inc., Ricochet [30], and Tropos Networks

RELATED WORK A number of community wireless mesh network efforts exist, such as Seattle Wireless, the San Francisco BAWUG, the Southampton Open Wireless Network, Wireless Leiden [31], and the Digital Gangetic Plains project [29] Many of these mesh nets use directional antennas and the OSPF routing protocol.

RELATED WORK You can read the numbers meaning here at the last two pages: jegyzet/k%C3%B6telez%C5%91en%20v%C3%A1l szthat%C3%B3%20feladatok/Vezet%C3%A9k%2 0n%C3%A9lk%C3%BCli%20h%C3%A1l%C3%B3 zatok/roofnet-mobicom05.pdf jegyzet/k%C3%B6telez%C5%91en%20v%C3%A1l szthat%C3%B3%20feladatok/Vezet%C3%A9k%2 0n%C3%A9lk%C3%BCli%20h%C3%A1l%C3%B3 zatok/roofnet-mobicom05.pdf

CONCLUSIONS the unplanned mesh architecture of Roofnet works well Average throughput between nodes is 627 kbits/second the entire network is well served by just a few Internet gateways Compared to a hypothetical single-hop network, Roofnet's multi-hop mesh increases both connectivity and throughput