Cautionary Aspects of Cross Layer Design: Context, Architecture and Interactions

Similar documents
An Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast

Lecture 13: Traffic Engineering

Cost Based Local Forwarding Transmission Schemes for Two-hop Cellular Networks

A CAUTIONARY PERSPECTIVE ON CROSS-LAYER DESIGN

Lecture 17: Wireless Networking

Ad Hoc Wireless Networks : Analysis, Protocols, Architecture and Convergence

The COMPOW Protocol for Power Control in Ad Hoc Networks

The Disciplined Flood Protocol in Sensor Networks

NETWORK PRESERVATION THROUGH A TOPOLOGY CONTROL ALGORITHM FOR WIRELESS MESH NETWORKS

REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips

Image Compression Compression Fundamentals

Lecture 4: Routing. CSE 222A: Computer Communication Networks Alex C. Snoeren. Thanks: Amin Vahdat

Lecture 14: Congestion Control

Chapter 7 TOPOLOGY CONTROL

The final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.

Collision Avoidance and Resolution Multiple Access: First-Success Protocols

A Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks

A Wireless MAC Protocol comparison.

Chapter 5 Network Layer

On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing

Addressing in Future Internet: Problems, Issues, and Approaches

The extra single-cycle adders

Comparison of memory write policies for NoC based Multicore Cache Coherent Systems

The Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment

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

StaCo: Stackelberg-based Coverage Approach in Robotic Swarms

Chapter 6 Enhancing Performance with. Pipelining. Pipelining. Pipelined vs. Single-Cycle Instruction Execution: the Plan. Pipelining: Keep in Mind

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism

Fault Tolerance in Hypercubes

Congestion-adaptive Data Collection with Accuracy Guarantee in Cyber-Physical Systems

Efficient Scheduling for Periodic Aggregation Queries in Multihop Sensor Networks

Networks An introduction to microcomputer networking concepts

Performance Evaluation of Route Failure Detection in Mobile Ad Hoc Networks

Review Multicycle: What is Happening. Controlling The Multicycle Design

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

Millimeter-Wave Multi-Hop Wireless Backhauling for 5G Cellular Networks

Wireless Local Area Networks. Networks: Wireless LANs 1

5 Performance Evaluation

ECE 158A: Lecture 13. Fall 2015

Constructing Multiple Light Multicast Trees in WDM Optical Networks

Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications

EEC 483 Computer Organization

A personalized search using a semantic distance measure in a graph-based ranking model

MultiView: Improving Trust in Group Video Conferencing Through Spatial Faithfulness David T. Nguyen, John F. Canny

IMPLEMENTATION OF OBJECT ORIENTED APPROACH TO MODIFIED ANT ALGORITHM FOR TASK SCHEDULING IN GRID COMPUTING

IP Multicast Fault Recovery in PIM over OSPF

Wireless Local Area Networks (WLANs)) and Wireless Sensor Networks (WSNs) Computer Networks: Wireless Networks 1

Review. A single-cycle MIPS processor

A sufficient condition for spiral cone beam long object imaging via backprojection

CS164 Final Exam Winter 2013

COMP3331/9331 XXXX Computer Networks and Applications Final Examination (SAMPLE SOLUTIONS)

A Highly-Digital Frequency Synthesizer Using Ring Oscillator Frequency-to-Digital Conversion and Noise Cancellation

Computer Architecture Chapter 5. Fall 2005 Department of Computer Science Kent State University

Cross-Layer Interactions and Optimizations in Wireless Networks

Ma Lesson 18 Section 1.7

Wireless and WiFi. Daniel Zappala. CS 460 Computer Networking Brigham Young University

Putting the dynamic into software security testing

A Recovery Algorithm for Reliable Multicasting in Reliable Networks

Cross Layer Design for QoS Support in Multimedia Applications over Wireless Networks. Jaydip Sen Innovation Lab TCS Kolkata

POWER-OF-2 BOUNDARIES

Lecture 16: QoS and "

Data Communication & Networks G Session 5 - Main Theme Wireless Networks. Dr. Jean-Claude Franchitti

LWIP and Wi-Fi Boost Flow Control

IoT-Cloud Service Optimization in Next Generation Smart Environments

QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET

Wireless Local Area Networks (WLANs) and Wireless Sensor Networks (WSNs) Primer. Computer Networks: Wireless LANs

Mobile Routing : Computer Networking. Overview. How to Handle Mobile Nodes? Mobile IP Ad-hoc network routing Assigned reading

The Importance of Being Opportunistic

The single-cycle design from last time

Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5

ECE 4450:427/527 - Computer Networks Spring 2017

Master for Co-Simulation Using FMI

Issues of Long-Hop and Short-Hop Routing in Mobile Ad Hoc Networks: A Comprehensive Study

Real-time mean-shift based tracker for thermal vision systems

Energy Management Issue in Ad Hoc Networks

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

Pipelining. Chapter 4

Chapter 4: Network Layer

Outline. Lecture 16: Wireless Networking. Physical Layer (Layer 1) Ethernet: Wireless is Different. Attenuation Over Space

Energy Management Issue in Ad Hoc Networks

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols

TOPOLOGY CONTROL IN MOBILE AD HOC NETWORKS WITH COOPERATIVE COMMUNICATIONS

TDT4255 Friday the 21st of October. Real world examples of pipelining? How does pipelining influence instruction

Date: December 5, 1999 Dist'n: T1E1.4

(2, 4) Tree Example (2, 4) Tree: Insertion

Multiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET

Performance Evaluation of Modified IEEE MAC for Multi-Channel Multi-Hop Ad Hoc Network *

Minimal Edge Addition for Network Controllability

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

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

Seismic trace interpolation with approximate message passing Navid Ghadermarzy and Felix Herrmann and Özgür Yılmaz, University of British Columbia

Shared Access Networks Wireless. 1/27/14 CS mywireless 1

A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods

Last Lecture: Data Link Layer

Dynamic Maintenance of Majority Information in Constant Time per Update? Gudmund S. Frandsen and Sven Skyum BRICS 1 Department of Computer Science, Un

Swarming on optimized graphs for n-way broadcast

Isilon InsightIQ. Version 2.5. User Guide

Multiple Access in Cellular and Systems

Sample solution to Midterm

Transcription:

Cationary Aspects of Cross Layer Design: Context, Architectre and Interactions Vikas Kawadia and P. R. Kmar Dept. of Electrical and Compter Engineering, and Coordinated Science Lab University of Illinois, Urbana-Champaign Phone 217-333-7476, 217-244-1653 (Fax) Email prkmar@ic.ed Web http://black.csl.ic.ed/~prkmar ICC 2003, Panel on Defining Cross-Layer Design for Wireless Networking, Anchorage, Alaska, May 14, 2003

Themes Setting the context Importance of Architectre Interactions and the Law of Unintended Conseqences Conclding remarks

Wireless networks don t come with links They are formed by nodes with radios There is no a priori notion of links Nodes simply radiate energy

Nodes can cooperate in complex ways Nodes in Grop A cancel interference of Grop B at Grop C C X A B while Nodes in Grop D amplify and forward packets from Grop E to Grop F F D E while. SINR = Signal One strategy: Decode and forward Interference + Noise Instead, why not: Amplify and Forward One strategy: Increase Signal for Receiver Instead, why not: Redce Interference at Receiver

How shold nodes cooperate? Some obvios choices Shold nodes relay packets? Shold they amplify and forward? Or shold they decode and forward? Shold they cancel interference for other nodes? Or shold they boost each other s signals? Shold nodes simltaneosly broadcast to a grop of nodes? Shold those nodes then cooperatively broadcast to others? What power shold they se for any operation? Or shold they se mch more sophisticated nthoght of strategies? There are more things in heaven and earth, Horatio, Than are dreamt of in yor philosophy. Hamlet

On the optimality of the crrent proposal for ad hoc networks Theorem: Xie and Kmar (2002) Mlti-hop transport where» A packet is flly decoded at each hop» All interference from all other nodes is simply treated as noise Is optimal p to a known mltiplicative constant. (http://black.csl.ic.ed/~prkmar) Interference + Noise Interference + Noise Interference + Noise The crrent proposal Interferenc e + Noise Properties Simple receivers Simple mlti-hop packet relaying scheme Simple abstraction of wires in space This choice for the mode of operation gives rise to Roting problem Media access control problem Power control problem

The importance of architectre Sccess of Internet is de to its architectre Hierarchy of layers Peer-to-peer protocols Allows plg-and-play Longevity Important for proliferation of technology Application Layer Presentation Layer Session Layer Transport Layer Network Layer Application Layer Presentation Layer Session Layer Transport Layer Network Layer Data Link Layer Data Link Layer Physical Layer Physical Layer Sccess of serial compting von Nemann bridge (Valiant) Hardware designers and software designers need only to conform to abstractions of each other Control system paradigm Plant and controller separation Hardware Plant Controller Software

Digital commnication Shannon s architectre Sorce code (Compression) Encode for the channel Channel Decode Sorce decode (Decompression)

Ever present tension between Performance and Architectre Performance: The short term vision Ptting a link between layer A and layer B can improve performance by x% Conseqences of this approach» Spaghetti code» Not modlar» Not pgradeable» No longevity» High per nit cost _ Vale of a commnication medim = Nmber of adoptees Architectre: The long term view» Mass prodction = Redced cost over long term Tension between Performance and Architectre

Interactions The Law of Unintended Conseqences Illstration by examples Example 1: Minimm hop roting over an Adaptive rate MAC Example 2: End-to-end feedback and topology control

Example 1

Adaptive Rate MAC Idea: Adapt transmission rate according to channel qality Change modlation to get higher rate if channel is good Cold send mltiple packets at higher rates (A sggested scheme) Protocol details RTS/CTS and Broadcast packets sent at lowest rate Receiver measres strength of RTS Commnicates rate to sender in CTS DATA and ACK at that rate

One conseqence: Interaction with Min Hop Roting Protocol Most crrent roting protocols are min hop Consider DSDV for example Chooses long hops Bt long hops => low signal strength => low rates

Switching off adaptation is better In fact, plain 802.11 at 11Mbps gives higher end-to-end throghpt

Verification by ns2 simlations Channel parameters sch that at a fixed power level (0.28 W): Distance of 0-99m Û11 Mbps 99-198m Û 5.5 Mbps 199-250m Û 2 Mbps Scheme 1: Adaptive scheme (A sggested scheme) Eqal time share to each rate Send 5 packets at 11Mbs, 3 at 5.5 Mbps or 1 at 2 Mbps Scheme 2: 11 Mbps 802.11 (no cross layer) Send packets only if distance is < 100m

A linear topology 18 nodes eqally spaced in a 1500m long rectangle, 400m wide Adaptive scheme One TCP connection from node 0 to 17, starting at time 50 DSDV roting protocol Carrier sensing disabled

Random topology 50 randomly located nodes in 1000x200m 5 simltaneos TCP connections, between distant nodes DSDV roting protocol No carrier sensing Adaptive scheme

Example 2

End-to-end feedback and topology control Two loops Loop 1: Power control to drive Nmber of 1-hop neighbors to Target_degree Loop 2: Target_degree controlled to increase Average endto-end network throghpt Loosely based on a sggested scheme

Adaptation rles Loop 1: Adjst transmit power every 15s, to maintain Ot_degree = Target_degree Loop 2: Target_degree adaptation done every 90s Rles for changing the Target_degree» Repeat change (+1 or -1) if throghpt increased on previos iterate» Reverse action if throghpt decreased on previos iterate» Increase Target_degree if throghpt is zero

Details of system tested by simlation 23 nodes in 500x500 m area Each node has 5 discrete power levels Corresponding to ranges of 100m, 140m, 180m, 220m and 250m When the TwoRayGrond propagation model is sed One TCP connection from Node 0 to Node 3 Power level 1 achieves Target_degree 5, even thogh the network is disconnected

Simlation topology o 1 2 3

Conseqence: Interaction with TCP dynamics Network may oscillate between connectivity and disconnectivity Bad for TCP

A random sample of cross layer design proposals Several sggestions for cross-layer design Signal stability based roting Transmit power based roting Battery life based roting Topology control sing transmit power adjstment Topology control sing angle of arrival information Power control by monitoring end-to-end throghpt Power control for energy efficiency Traffic based sleeping strategies TCP modifications for energy efficiency Roting for improving network lifetime Adaptive rate, adaptive power MAC protocols QoS schemes based on roting and MAC parameters What are the conseqences? What interactions are possible? What does the reslting code look like? What is the reslting architectre or lack of it? Longevity? Upkeep?

Themes Setting the context for cross-layer design optimization: Infinitde of choices for operating wireless networks: What s best? A Theorem: The good news Importance of Architectre Proliferation Tension between performance and architectre Longevity isse» Short term verss long term perspective Interactions and the Law of Unintended Conseqences Layers can interact Loops can be formed What is the natre of the interactions? Commnity needs to exercise cation before leaping into Cross-layer design

Conclding remarks Architectre is important Often neglected Interactions exist Often neglected Need to change the thrst of the work in cross-layer design to a more holistic perspective Design schemes which have no adverse interactions against other layer or cross-layer design now (holistic across layers) Design schemes good against other ftre bright ideas in any cross-layer (holistic across time)

To obtain papers Papers can be downloaded from http://black.csl.ic.ed/~prkmar For hard copy send email to prkmar@ic.ed