Design and Evaluation of a new MAC Protocol for Long- Distance Mesh Networks by Bhaskaran Raman & Kameswari Chebrolu ACM Mobicom 2005

Similar documents
The 2P MAC Protocol for WiFi Mesh Networks: Design and Evaluation

The 2P MAC for Rural WiFi Networks

FRACTEL Design, Implementation And

Design, Implementation, and Evaluation of new MAC Protocols for Long Distance Networks

Rahman 1. Application

original standard a transmission at 5 GHz bit rate 54 Mbit/s b support for 5.5 and 11 Mbit/s e QoS

Mohamed Khedr.

6.9 Summary. 11/20/2013 Wireless and Mobile Networks (SSL) 6-1. Characteristics of selected wireless link standards a, g point-to-point

CHAPTER 7 SIMULATION OBSERVATIONS

Agenda. What are we looking at? Introduction. Aim of the project. IP Routing

A Measurement Study of Multiplicative Overhead Effects in Wireless Networks

Final Exam: Mobile Networking (Part II of the course Réseaux et mobilité )

CDMA-Based MAC Protocol for Wireless Ad Hoc Networks

Wireless Internet Routing. Learning from Deployments Link Metrics

Reminder: Datalink Functions Computer Networking. Datalink Architectures

Wake-on-WLAN. Power management for mesh networks using Kameswari Chebrolu Department of Electrical Engineering, IIT Kanpur

Intelligent Transportation Systems. Medium Access Control. Prof. Dr. Thomas Strang

The Importance of Being Opportunistic

Wireless Mesh Networks

CSE 6811 Ashikur Rahman

Co-existence of WiFi and ZigBee

Subject: Adhoc Networks

Logical Link Control (LLC) Medium Access Control (MAC)

CS 268: Computer Networking. Taking Advantage of Broadcast

CS698T Wireless Networks: Principles and Practice

Medium Access Control. IEEE , Token Rings. CSMA/CD in WLANs? Ethernet MAC Algorithm. MACA Solution for Hidden Terminal Problem

XORs in the Air: Practical Wireless Network Coding

Wireless TCP Performance Issues

Wireless and Mobile Networks

IEEE , Token Rings. 10/11/06 CS/ECE UIUC, Fall

Chapter 16 Networking

standards like IEEE [37], IEEE [38] or IEEE [39] do not consider

CSMA based Medium Access Control for Wireless Sensor Network

CSE 473 Introduction to Computer Networks. Final Exam. Your Name: 12/17/2014 PLEASE WRITE LEGIBLY NO POINTS FOR ILLEGIBLE ANSWERS

Multiple Access Links and Protocols

COMPUTER NETWORKS - Local area networks

Local area networks. Copyright

Architecture and Evaluation of an Unplanned b Mesh Network

Packet-Level Diversity From Theory to Practice: An based Experimental Investigation

A Spatio-temporal Access Network for Area Event Monitoring p.1

SENSOR-MAC CASE STUDY

ECSE 414 Fall 2014 Final Exam Solutions

Introduction to IEEE

Sensor Network Protocols

Impact of IEEE n Operation on IEEE Operation

TCP over wireless links

Lecture 16: QoS and "

ECE 4450:427/527 - Computer Networks Spring 2017

Link Estimation and Tree Routing

Implementing a Cooperative MAC Protocol for Wireless LANs

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card

Wireless Sensor Networks

Sample solution to Midterm

MAC protocols. Lecturer: Dmitri A. Moltchanov

ENGI 4557 Digital Communications Practice Problems 2017 (Part 2)

Congestions control through cloud computing with MANET

CARA: Collision-Aware Rate Adaptation for IEEE WLANs. Presented by Eric Wang

Wireless Sensor Networks

Implementation Based Evaluation of a Full-Fledged Multi-Hop TDMA-MAC for WiFi Mesh Networks

TCP challenges in multi-hop wireless networks. Why multi-hop?

MAC LAYER. Murat Demirbas SUNY Buffalo

CHAPTER 4 CROSS LAYER INTERACTION

PIP: A Connection-Oriented, Multi-Hop, Multi-Channel TDMA-based MAC for High Throughput Bulk Transfer

Implementation Based Evaluation of a Full-Fledged Multi-Hop TDMA-MAC for WiFi Mesh Networks

CMPE 257: Wireless and Mobile Networking

Multicasting in ad hoc networks: Energy efficient

TCP over Wireless. Protocols and Networks Hadassah College Spring 2018 Wireless Dr. Martin Land 1

Topics. Link Layer Services (more) Link Layer Services LECTURE 5 MULTIPLE ACCESS AND LOCAL AREA NETWORKS. flow control: error detection:

Access Technologies! Fabio Martignon

Wireless Networks (CSC-7602) Lecture 8 (22 Oct. 2007) Seung-Jong Park (Jay) Fair Queueing

MAC in /20/06

Topic 2b Wireless MAC. Chapter 7. Wireless and Mobile Networks. Computer Networking: A Top Down Approach

H-MMAC: A Hybrid Multi-channel MAC Protocol for Wireless Ad hoc Networks

ECE 158A: Lecture 13. Fall 2015

Strengthening Unlicensed Band Wireless Backhaul

MULTIPLE ACCESS PROTOCOLS 2. 1

CS 123: Lecture 12, LANs, and Ethernet. George Varghese. October 24, 2006

Measurement Driven Admission Control on Wireless Backhaul Networks

Mobile & Wireless Networking. Lecture 7: Wireless LAN

Last Lecture: Data Link Layer

CSE 461: Wireless Networks

Interactions Between the Physical Layer and Upper Layers in Wireless Networks: The devil is in the details

Computer Networks Medium Access Control. Mostafa Salehi Fall 2008

TCP Congestion Control

Interference avoidance in wireless multi-hop networks 1

Wireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking

Chapter 12 Multiple Access 12.1

CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca

MSHCS-MAC: A MAC Protocol for Multihop Cognitive Radio Networks based on Slow Hopping and Cooperative Sensing approach

Attack & Defense in Wireless Networks

Chapter 6 Medium Access Control Protocols and Local Area Networks

Data Communications. Data Link Layer Protocols Wireless LANs

Computer Network Fundamentals Spring Week 3 MAC Layer Andreas Terzis

Exercises TCP/IP Networking With Solutions

Wireless Sensor Networks

MAC protocols for ad hoc networks

CSCI 466 Midterm Networks Fall 2011

Collisions & Virtual collisions in IEEE networks

QoS Routing and Traffic Scheduling in Long-Distance Wireless Mesh Networks

Resource Estimation on Wireless Backhaul Networks (Invited Paper)

Transcription:

Design and Evaluation of a new MAC Protocol for Long- Distance 802.11 Mesh Networks by Bhaskaran Raman & Kameswari Chebrolu ACM Mobicom 2005 Reviewed by Anupama Guha Thakurta CS525M - Mobile and Ubiquitous Computing Seminar, Spring 2006

OUTLINE Introduction Background Protocol Design and Implementation Topology Construction Evaluation Discussion and Conclusions Comments 2

INTRODUCTION Motivations for new protocol: low cost internet access to rural areas achieve performance improvement over 802.11 CSMA/CA in long distance mesh networks 802.11 CSMA/CA MAC was designed to resolve contentions in indoor environments Use of wire-line, cellular or 802.16 currently prohibitive because of costs 3

INTRODUCTION (Cont.): Issues Addressed Find an alternative to 802.11 CSMA/CA MAC protocol that allows simultaneous synchronous transmission / reception of multiple links at single node Propose a new MAC protocol: 2P Cost advantages with off-the-shelf 802.11 hardware Show dependence of 2P on network topology Show that more UDP throughput than CSMA/CA is achievable (achieved 3-4 times) Show that more TCP throughput than CSMA/CA is achievable (achieved 20 times) 4

INTRODUCTION (Cont.): Mesh NW Characteristics Multiple radios per node (one radio per link) High-gain directional antennae Long distance point-to-point links of several kilometers Landline node 5

OUTLINE Introduction Background Protocol Design and Implementation Topology Construction Evaluation Discussion and Conclusions Comments 6

BACKGROUND SynOp: Simultaneous Synchronous Operation (SynRx / SynTx) Syn-Rx: R1 and R2 receive simultaneously; Feasible Syn-Tx: T1 and T2 transmit simultaneously; Feasible Mix-Rx-Tx: R1 receives and T2 transmits; Not feasible 7

BACKGROUND (Cont.): SynOp: Simultaneous Synchronous Operation (SynRx / SynTx) In 802.11 Mix-Rx-Tx is not feasible because of: physical proximity and side lobes of directional antennae In 802.11 SynOp is feasible but not allowed because: SynRx: IFS based immediate ACK mechanism SynTx: Carrier sense mechanism of interfaces give rise to backoffs 8

OUTLINE Introduction Background Protocol Design and Implementation Topology Construction Evaluation Discussion and Conclusions Comments 9

2P PROTOCOL DESIGN & IMPLEMENTATION SynOp is possible by disabling ACK and Carrier sense mechanisms Simple Concept: each node switches between SynRx & SynTx When a node is in SynRx its neighbors are in SynTx phase and vice the versa Bipartite Topology 10

2P PROTOCOL DESIGN & IMPLEMENTATION (Cont.): Solutions for SynRx in existing hardware: Disable immediate ACKs by: Independent Basic Service Set mode for interface operations, with separate SSID Convert IP unicast pkts. to MAC broadcast pkts. at the driver level Send ACKs in the LLC implemented by the driver, by piggybacking them on data packets 11

2P PROTOCOL DESIGN & IMPLEMENTATION (Cont.): Solutions for SynTx in existing hardware: Disable carrier-sense backoffs by: utilizing the two antennae connector feature provided by Intersil Prism chipset How it works: Select receiving antenna at driver level by antsel_rx command Connect external antenna to, say LEFT connector of radio card During transmission, the receiving antenna connector which is not connected to any external antenna is set to RIGHT This forces carrier-sense to happen on the RIGHT connector which sees only negligible noise Switch the receiving antenna to LEFT connector before switching from SynTx to SynRx OVERHEAD? 12

2P PROTOCOL DESIGN & IMPLEMENTATION (Cont.): Loose Synchrony An interface sends B bytes in SynTx, then sends a marker packet as a token Enter the SynRx phase Switch to SynTx upon receiving a marker packet or upon timeout OVERHEAD? 13

2P PROTOCOL DESIGN & IMPLEMENTATION (Cont.): Problems in Loose Synchrony Temporary loss of synchrony (marker loss) Link intialisation (link recovery after failure) Solution: On entering SynRx, ifa starts a timer to control timeout 14

2P PROTOCOL DESIGN & IMPLEMENTATION (Cont.): Problems in Loose Synchrony Two ends of a link get out of synchrony and timeout at the same time Solution: Add random perturbation (bumping) to the timeout value each time 15

2P PROTOCOL DESIGN & IMPLEMENTATION (Cont.): Communication Across Interfaces Coordination of interfaces to switch from SynRx to SynTx Once an ifa decides to switch to Tx, it sends a notification (NOTIF) to other ifa-nbrs, and waits for NOTIF from them. Aware of UP / DOWN status of other ifa-nbrs. (observation of 3 consecutive time-outs implies DOWN) Coordination of interfaces to switch from SynTx to SynRx Not necessary since all ifas begin Tx simultaneously and with the same duration of B bytes 16

OUTLINE Introduction Background Protocol Design and Implementation Topology Construction Evaluation Discussion and Conclusions Comments 17

TOPOLOGY CONSTRUCTION Constraints in Topology Bipartite Constraint: If a node is in SynRx its neighbors should be in SynTx and vice versa Implies no odd cycles are present Power Constraint: For proper reception we require that the signal level is above min. reqd. power level P min SINR has to be above the interference by SIR reqd 18

TOPOLOGY CONSTRUCTION (Cont.): For a given topology Power transmission P i s, (i = 1,2, N A ) are variables d(i, j), distance between the nodes corresponding to antennae a i and a j is known g(i, j), effective gain when a i is transmitting and a j is receiving, is known 19

TOPOLOGY CONSTRUCTION (Cont.): Power Equations Transmission power Considered as interference from all other nodes Eq. 1 and 3 are power equations. 20

TOPOLOGY CONSTRUCTION (Cont.): Parameters in the Power Equations P_min: -85 db for 11Mbps reception SIR_reqd: 10 db for the 10-6 BER level, set to 14-16 db in topology construction The antenna radiation pattern that decides the gain in different angles. 21

TOPOLOGY CONSTRUCTION (Cont.): Topology Formation Construct a tree topology that satisfies the two constraints Suppose all (or most) traffic passes through the land-line node and don t do multi-path routing A tree rooted at the land-line node satisfies the bipartite constraint Fault tolerance can be solved by morphing 22

TOPOLOGY CONSTRUCTION (Cont.): Topology Formation Form a spanning tree with following heuristics (H1) Reduce length of links used Interference and power consumption (H2) Avoid short angles between links Side-lobe leakage ang_thr of 30 to 45 degrees (H3) Reduce hop-count Deep trees = bad latency 23

TOPOLOGY CONSTRUCTION (Cont.): Algorithm 1. Set of Unconnected nodes is U, set of all possible connection links is S, create links at h i 2. Order the links in S in increasing order of distance 3. For each link do angle threshold check: ignore if angle < ang_thr, else add Feasibility check (power constraint equation) 4. If all nodes connected, stop. 5. If successful in adding link in step 3, continue with step 1 6. If not successful in adding link in step 3, and link formed in h i, go to next link, go to step 1. 7. If not successful in adding any link, and no link formed for h i, declare failure, and stop. 24

OUTLINE Introduction Background Protocol Design and Implementation Topology Construction Evaluation Discussion and Conclusions Comments 25

EVALUATION: of topology creation Purpose The effectiveness of the algorithm The effect of varying the parameter SIR reqd Evaluation subjects 4 collections of villages from a local district map Q1, Q2, Q3 and Q4 Q1 has 31 nodes Q2-Q4 have 32 nodes, respectively Topologies randomly generated 50 nodes in an area of 44Km X 44Km 26

EVALUATION: of topology creation 27

EVALUATION: of topology creation 28

EVALUATION: of topology creation 29

EVALUATION: simulation studies Goals: To measure the impact that step by step link establishment has on loosely synchronized network Saturation throughput performance compared to CSMA/CA protocol Performance of TCP over 2P operated networks 30

EVALUATION: extensions to ns-2 ns-2 extended for: Multiple interface support Directional antenna support MAC modifications LLC modifications 31

EVALUATION: Simulation results Link Establishment: Method: add links one after another to an already synchronized network Results: Took 12.9ms for first link establishment Reason: first transmission of both ends of link coincide and had to use bumping to establish link Took 4.9ms for rest of the links to establish No noticeable difference in throughput of already synchronized links while adding new links 32

EVALUATION: Simulation results Saturation throughput UDP traffic One packet every 2ms Packet size: 1400 bytes Results: Nodes operated in 2P achieve around 3-4 times more bandwidth than operated in the CSMA/CA protocol 33

EVALUATION: Simulation results TCP Performance In loss free: Up to 20 times better performance than CSMA/CA 34

EVALUATION: Implementation based results Prototype implementation on HostAP v0.2.4 on Linux v2.4.20-8 Confirmation of SynOp with Prism2 cards: 6.5Mbps throughput on each link at the same time. 2P performance on a single link: 3.05Mbps average throughput lower than 4.4Mbps observed in simulations Overheads of marker pkts. And changing of antsel_rx in Prism2 cards give a combined throughput of 6.1Mbps which is less than 6.5Mbps observed. 35

EVALUATION: Implementation based results (Cont.) Sub-optimal performance of 2P on a pair of links: Per interface throughput is lower than 3.05 Mbps because contention window set at 32 instead of 1 hence random backoff even in the absence of carrier sense Limitations in driver level approach to 2P implementation Stress of CPU scheduling involved in copying of rx/tx bytes to/from hardware as PCMCIA cards used didn t have Direct Memory Access 36

OUTLINE Introduction Background Protocol Design and Implementation Topology Construction Evaluation Discussion and Conclusions Comments 37

Discussion and Conclusions Prior work involves Spatial reuse Time Division Multiple Access (STDMA) scheduling The present work differs in: Multiple radios per node Directional antennae Exact location of nodes Fault tolerance and Morphing Trees are not very fault tolerant Morph the topology in the event of a failure -Provision additional links, but turn them on only as needed Morphing can be used to create new routes when network equipment is turned off 38

OUTLINE Introduction Background Protocol Design and Implementation Topology Construction Evaluation Discussion and Conclusions Comments 39

COMMENTS Pros: 1.Performance enhancement 2.Low cost implementation 3. Fault tolerance solution 4. Feasible protocol Cons: 1. Requires one dedicated transceiver for each link 2. Reconfigure on node s joining / removal / relocation 3. Topology is centralized with multiple landlines 4. Transmit empty pkts fairness & security 40

QUESTIONS 41