Hyuk Lim, Chaegwon Lim, Jennifer C. Hou Department of Computer Science

Slides:



Advertisements
Similar presentations
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Advertisements

Intel Research Internet Coordinate Systems - 03/03/2004 Internet Coordinate Systems Marcelo Pias Intel Research Cambridge
Winter 2004 UCSC CMPE252B1 CMPE 257: Wireless and Mobile Networking SET 3f: Medium Access Control Protocols.
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
1 An Approach to Real-Time Support in Ad Hoc Wireless Networks Mark Gleeson Distributed Systems Group Dept.
Interactions Between the Physical Layer and Upper Layers in Wireless Networks: The devil is in the details Fouad A. Tobagi Stanford University “Broadnets.
Design and Analysis of an MST-Based Topology Control Algorithm Ning Li and Jennifer Hou Department of Computer Science University of Illinois at Urbana-Champaign.
On Channel-Discontinuity-Constraint Routing in Multi-Channel Wireless Infrastructure Networks Abishek Gopalan, Swaminathan Sankararaman 1.
1 Minimizing End-to-End Delay: A Novel Routing Metric for Multi- Radio Wireless Mesh Networks Hongkun Li, Yu Cheng, Chi Zhou Department of Electrical and.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Wireless MESH network Tami Alghamdi. Mesh Architecture – Mesh access points (MAPs). – Mesh clients. – Mesh points (MPs) – MP uses its Wi-Fi interface.
Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.
Tuning the Carrier Sensing Range of IEEE MAC Jing Deng,Ben Liang and Pramod K. Varshney Univ. of New Orleans Globecom 2004.
Selecting Transmit Powers and Carrier Sense Thresholds in CSMA Jason Fuemmeler, Nitin Vaidya, Venugopal Veeravalli ECE Department & Coordinated Science.
Enhancing TCP Fairness in Ad Hoc Wireless Networks using Neighborhood RED Kaixin Xu, Mario Gerla UCLA Computer Science Department
Joint PHY-MAC Designs and Smart Antennas for Wireless Ad-Hoc Networks CS Mobile and Wireless Networking (Fall 2006)
A Power Saving MAC Protocol for Wireless Networks Technical Report July 2002 Eun-Sun Jung Texas A&M University, College Station Nitin H. Vaidya University.
Packet Dispersion in IEEE Wireless Networks Mingzhe Li, Mark Claypool and Bob Kinicki WPI Computer Science Department Worcester, MA 01609
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
1 Interplay of Spatial Reuse and SINR-determined Data Rates in CSMACA-based, Multi-hop, Multi- rate Wirless Networks Ting-Yu Lin and Jennifer C. Hou Department.
Distributed Channel Assignment and Routing Multiradio Mutlichannel Multihop Wireless Networks Haitao Wu, Fan Yang, Kun Tan, Jie Chen, Qian Zhang, and Zhenshrng.
Wireless Sensor Networks M Homework #2. IEEE MAC Protocol - Star topology – Part I Consider a square area equipped with 30 nodes distributed.
Hongkun Li, Yu Cheng, Chi Zhou Illinois Institute of Technology, Chicago, IL, USA IEEE GLOBECOM 2008.
Improving the scalability of MAC protocols in Wireless Mesh Networks Mthulisi Velempini (Mr.)
Wireless Protocols. 2 Outline MACA 3 ISM: Industry, Science, Medicine unlicensed frequency spectrum: 900Mhz, 2.4Ghz, 5.1Ghz, 5.7Ghz.
On Mitigating the Broadcast Storm Problem with Directional Antennas Sheng-Shih Wang July 14, 2003 Chunyu Hu, Yifei Hong, and Jennifer Hou Dept. of Electrical.
How Physical Carrier Sense Affects System Throughput in IEEE Wireless Networks Zheng Zeng, Yong Yang and Jennifer C. Hou Department of Computer.
1 A Coordinate-Based Approach for Exploiting Temporal-Spatial Diversity in Wireless Mesh Networks Hyuk Lim Chaegwon Lim Jennifer C. Hou MobiCom 2006 Modified.
MAC Protocols for Sensor Networks
MAC Protocols for Sensor Networks
Routing Metrics for Wireless Mesh Networks
MAC Protocols that use directional Antennas
IMPROVING OF WIRELESS MESH NETWORKS.
Localization for Anisotropic Sensor Networks
Routing Metrics for Wireless Mesh Networks
Architecture and Algorithms for an IEEE 802
Balancing Uplink and Downlink Delay of VoIP Traffic in WLANs
Presented by Tae-Seok Kim
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
Contention-based protocols with Reservation Mechanisms
Understanding Impact of PHY/MAC Attributes on Performance
Distributed Medium Access Control in Wireless Networks
Topics in Distributed Wireless Medium Access Control
Ning Li and Jennifer C. Hou University of Illinois at Urbana-Champaign
Suman Bhunia and Shamik Sengupta
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya Modified and Presented.
Shuffle Exchange Point-to-point, Bus, Ring, Star, Mesh
Cross layer design is wireless multi-hop network
Net 435: Wireless sensor network (WSN)
On the Physical Carrier Sense in Wireless Ad-hoc Networks
Layer 1 of the TCP/IP protocol stack: Network Access Layer (NAL)
Routing Metrics for Wireless Mesh Networks
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Provision of Multimedia Services in based Networks
Goal Control the amount of traffic in the network
Topology Control and Its Effects in Wireless Networks
Department of Computer Science Southern Illinois University Carbondale CS441-Mobile & Wireless Computing IEEE Standard.
basics Richard Dunn CSE July 2, 2003.
An extension of IEEE e QoS for MESH Networks
The Impact of Multihop Wireless Channel on TCP Performance
Capacity of Ad Hoc Networks
Data Link Layer 2019/2/19.
Mesh Media Access Coordination Ad Hoc Group Report Out
May 2006 doc.: IEEE May 2006 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [Mesh.
Performance Implications of DCF to ESS Mesh Networks
Performance Implications of DCF to ESS Mesh Networks
User Cooperation for Improving Spatial Spectral Utilization in Multhop Wireless Networks March 1, 2006 Chansu Yu 3/1/2006 NEONet 2006.
Path Capacity in Multirate and Multihop Wireless Networks
Performance Implications of DCF to ESS Mesh Networks
Presentation transcript:

Improving Network Throughput Through Spatial Diversity in Wireless Mesh Networks Hyuk Lim, Chaegwon Lim, Jennifer C. Hou Department of Computer Science University of Illinois at Urbana Champaign jhou@cs.uiuc.edu http://lion.cs.uiuc.edu

Control Knobs for Mitigating Interference To mitigate interference and maximize the network capacity, there are several control knobs: Transmit power  topology control Carrier sense threshold  trade-off between spatial reuse and interference level Scheduling concurrent transmissions for interference-free connections Channel diversity  use of non-overlapping channels

Interference Flows that are routed along different paths within the interference range compete for the channel bandwidth, resulting in inter-flow interference. Consecutive packets in a single flow may be spread over the route and interfere with each other, resulting in intra-flow interference. transmission range Y Z A B C D interference range Queue at A

Exploring Spatial Diversity Through Scheduling What if we schedule packet transmissions as follows Y Z A B C D Case 1 Case 2

Exploring Spatial Diversity Through Scheduling Issues to be considered How do we find sets of nodes that result in the least inter flow interference only with the use of location information How do we schedule concurrent transmissions for packets that belong to interference-free connections Interleave packet transmissions for interference-free connections.

Determining Interference-free Sets of Nodes Option 1: Use geographic locations of next-hop nodes Can be readily obtained by GPS Misleading because the distance between two nodes may not be a good index of interference (e.g., the interference may not be significant if there is an obstacle between them). Option 2: Use received signal strength More representative in determining the level of interference Can be readily obtained through the sensory functions implemented in most IEEE 802.11 interface cards.

Determining Interference-free Sets of Nodes We focus on transporting downstream traffic at gateway nodes Gateway nodes are responsible for transporting a large amount of downstream traffic Instrument nodes that can communicate with the GN directly or through a relay node to perform RSS measurements. RSS measurements are performed within two hops of the GN. Can be extended to h hops from the GN. Tradeoff between control overhead/complexity and accuracy in inferring interference. Construct, based on RSS measurements, a virtual coordinate system in which the distance between two nodes represents the level of interference

RSS Measurement Through exchange of hello packets, a GN n gathers RSS measurement between itself and a node m that can directly communicate with it. between a neighbor node of m’s and m. Node n constructs S=[sij], where sij is (-RSS) measurement made in dBm, 1<= i, j <= p, and p is the number of node n’s one-hop neighbors

Virtual Coordinate System The jth column of S represents node j’s coordinates in a p-dimension. These coordinates are correlated with each other  it is difficult to identify components that play an important role. PCA comes to rescue. PCA transforms a data set that consists of a large number of correlated variables to a new set of uncorrelated principal components.

Principal Component Analysis

Singular Value Decomposition Obtain the SVD of S The columns of the pxp matrix U=[u1,…., up] are the principal components and the orthogonal basis of the new subspace. By using the first q columns of U, Uq, we project the p-dimensional space into a q-dimensional space:

Determining Coordinates for Two-Hop Neighbors

Corner Case Two neighbor nodes of the GN are outside each other’s transmission ranges

Use of TXOP to Coordinate Transmission TXOP: Transmission opportunity defined in IEEE 802.11e

Coordinating Transmission Order The GN looks up a candidate frame from the queue in the LLC. T= the set of neighbor nodes to which frames were sent after the GN grasped the medium. The GN looks up to N frames in the LLC in order to locate a frame f such that routing(f) and i do not interfere, for every i in T. After the GN uses the medium, it sets a contention window that is larger than what is originally specified in IEEE 802.11 DCF, in order to give more opportunities to its neighbor nodes.

LLC Layer Implementation for GN

MAC Layer Implementation for GN

Transmit_with_backoff(p,retx)