Capacity of Large Scale Wireless Networks with Directional Antenna and Delay Constraint Guanglin Zhang IWCT, SJTU 26 Sept, 2012 INC, CUHK 1.

Slides:



Advertisements
Similar presentations
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 11 Information.
Advertisements

The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
1 On the Capacity of Ad Hoc Wireless Networks Under General Node Mobility Michele Garetto – Università di Torino Paolo Giaccone - Politecnico di Torino.
The Capacity of Wireless Networks
EE360: Lecture 10 Outline Capacity and Optimization of Ad Hoc Nets Announcements Revised proposals due Monday HW 1 posted, due Feb. 19 Lecture Wed will.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
1 Capacity Scaling in Delay Tolerant Networks with Heterogeneous Mobile Nodes Michele Garetto – Università di Torino Paolo Giaccone - Politecnico di Torino.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Breaking the Interference Barrier David Tse Wireless Foundations University of California at Berkeley Mobicom/Mobihoc Plenary Talk September 13, 2007 TexPoint.
Capacity of ad-hoc wireless Networks Vicky Sharma.
TDMA Scheduling in Wireless Sensor Networks
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
802.11a/b/g Networks Herbert Rubens Some slides taken from UIUC Wireless Networking Group.
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
Wireless Capacity. A lot of hype Self-organizing sensor networks reporting on everything everywhere Bluetooth personal networks connecting devices City.
The Capacity of Wireless Ad Hoc Networks
MotionCast: On the Capacity and Delay Tradeoffs Chenhui Hu 1, Xinbing Wang 1, Feng Wu 2 1 Institute of Wireless Communication Technology (IWCT) Shanghai.
Information Theory of Wireless Networks: A Deterministic Approach David Tse Wireless Foundations U.C. Berkeley CISS 2008 March 21, 2008 TexPoint fonts.
UCBC UCSC Broadband Communications (UCBC) Research Group Hamid R. Sadjadpour April 2004 Space-Time Signal Processing for Wireless Ad-hoc Networks.
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
Hierarchical Cooperation Achieves Linear Scaling in Ad Hoc Wireless Networks David Tse Wireless Foundations U.C. Berkeley MIT LIDS May 7, 2007 Joint work.
Mobility Increases The Capacity of Ad-hoc Wireless Networks By Grossglauser and Tse Gautam Pohare Heli Mehta Computer Science University of Southern California.
MAC Reliable Broadcast in Ad Hoc Networks Ken Tang, Mario Gerla University of California, Los Angeles (ktang,
Mobile Ad hoc Networks COE 549 Delay and Capacity Tradeoffs II Tarek Sheltami KFUPM CCSE COE 8/6/20151.
Capacity of Ad Hoc Networks Quality of Wireless links Physical Layer Issues The Channel Capacity Path Loss Model and Signal Degradation MAC for.
Coding Schemes for Multiple-Relay Channels 1 Ph.D. Defense Department of Electrical and Computer Engineering University of Waterloo Xiugang Wu December.
Cooperative Principles and Relay Routing Multihop Relaying in Wimax.
Optimal Multicast Capacity and Delay Tradeoffs in MANETs: A Global Perspective Yun Wang, Xiaoyu Chu, Xinbing Wang Department of Electronic Engineering.
Impact of Social Relation and Group Size in Multicast Ad Hoc Networks Yi Qin, Riheng Jia, Jinbei Zhang, Weijie Wu, Xinbing Wang Shanghai Jiao Tong University.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
Hierarchical Cooperation Achieves Linear Scaling in Ad Hoc Wireless Networks David Tse Wireless Foundations U.C. Berkeley AISP Workshop May 2, 2007 Joint.
Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.
Mobility Weakens the Distinction between Multicast and Unicast Xinbing Wang Dept. of Electronic Engineering Shanghai Jiao Tong University Shanghai, China.
EE360 PRESENTATION On “Mobility Increases the Capacity of Ad-hoc Wireless Networks” By Matthias Grossglauser, David Tse IEEE INFOCOM 2001 Chris Lee 02/07/2014.
Evolution-cast: Temporal Evolution in Wireless Social Networks and Its Impact on Capacity Luoyi Fu, Jinbei Zhang, Xinbing Wang Department of Electronic.
Network Architecture (R02) #4 24/10/2013 Wireless Capacity Jon Crowcroft,
Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.
Function Computation over Heterogeneous Wireless Sensor Networks Xuanyu Cao, Xinbing Wang, Songwu Lu Department of Electronic Engineering Shanghai Jiao.
Delay-Throughput Tradeoff with Correlated Mobility in Ad-Hoc Networks Shuochao Yao*, Xinbing Wang*, Xiaohua Tian* ‡, Qian Zhang † *Department of Electronic.
1 Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser, David Tse IEEE Infocom 2001 (Best paper award) Oct 21, 2004 Som C.
Wireless Networks Spring 2005 Capacity of Ad Hoc Networks.
Convergecast with MIMO Luoyi Fu, Yi Qin, Xinbing Wang Department of Electronic Engineering Shanghai Jiao Tong University, China Xue Liu Department of Computer.
Scaling Laws for Cognitive Radio Network with Heterogeneous Mobile Secondary Users Yingzhe Li, Xinbing Wang, Xiaohua Tian Department of Electronic Engineering.
1 Deterministic Collision-Free Communication Despite Continuous Motion ALGOSENSORS 2009 Saira Viqar Jennifer L. Welch Parasol Lab, Department of CS&E TEXAS.
Converge-Cast: On the Capacity and Delay Tradeoffs Xinbing Wang Luoyi Fu Xiaohua Tian Qiuyu Peng Xiaoying Gan Hui Yu Jing Liu Department of Electronic.
A Reservation-based TDMA Protocol Using Directional Antennas (RTDMA-DA) For Wireless Mesh Networks Amitabha Das and Tingliang Zhu, Nanyang Technological.
WIRELESS MESH NETWORKS Ian F. AKYILDIZ* and Xudong WANG** * Georgia Institute of Technology BWN (Broadband Wireless Networking) Lab & ** TeraNovi Technologies.
On the Topology of Wireless Sensor Networks Sen Yang, Xinbing Wang, Luoyi Fu Department of Electronic Engineering, Shanghai Jiao Tong University, China.
MAIN RESULT: Depending on path loss and the scaling of area relative to number of nodes, a novel hybrid scheme is required to achieve capacity, where multihop.
Multicast Scaling Laws with Hierarchical Cooperation Chenhui Hu, Xinbing Wang, Ding Nie, Jun Zhao Shanghai Jiao Tong University, China.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
12.Nov.2007 Capacity of Ad Hoc Wireless Networks Jinyang Li Charles Blake Douglas S. J. De Coutu Hu Imm Lee Robert Morris Paper presentation by Tonio Gsell.
Impact of Interference on Multi-hop Wireless Network Performance
EECS 290S: Network Information Flow
Group Multicast Capacity in Large Scale Wireless Networks
Hidden Terminal Decoding and Mesh Network Capacity
The Capacity of Wireless Networks
Capacity Regions for Wireless AdHoc Networks
Throughput-Optimal Broadcast in Dynamic Wireless Networks
Su Yi (RPI) Yong Pei (Univ. of Miami) Shivkumar Kalyanaraman (RPI)
Effectiveness of the 2-hop Routing Strategy in MANETS
CAPACITY OF POWER CONSTRAINED AD-HOC NETWORKS
Capacity of Ad Hoc Networks
Pradeep Kyasanur Nitin H. Vaidya Presented by Chen, Chun-cheng
Gaurav Sharma,Ravi Mazumdar,Ness Shroff
Presentation transcript:

Capacity of Large Scale Wireless Networks with Directional Antenna and Delay Constraint Guanglin Zhang IWCT, SJTU 26 Sept, 2012 INC, CUHK 1

2 Outline  Background and related works  Unicast capacity for static networks  System model and definition  Main result and sketch of derivation  Multicast capacity for VANETs  Main result and sketch of derivation  Conclusions 2

3 Outline  Background and related works  Unicast capacity for static networks  System model and definition  Main result and sketch of derivation  Multicast capacity for VANETs  Main result and sketch of derivation  Conclusions 3

Background 4 “ Broadband's take-up has repeatedly been jumpstarted by must-have applications. Napster drove the shift from dialup to wired broadband. Now Apple's iPhone is playing the same role in triggering explosive growth in the wireless Web. Unless we miss our guess, this dynamic is about to rudely change the subject from net neutrality to a shortage of wireless capacity to meet enthusiastic consumer demand …” [10/14/2009, Wall Street Journal] A Roadmap of Technology Evolution (Borrowed from Junshan Zhang’s slides) iPhone on sale day

Background 5 TxRx point-to-point (Shannon 48)  Channel Capacity (Gaussian Channel): Known Rx1 TxRx Tx 1 Tx 2 Rx 2 multiple-access (Alshwede, Liao 70’s) broadcast (Cover, Bergmans 70’s) Shannon 48 Ahlswede 71 Liao 72 Cover 72 Slides partially borrowed from D. Tse’s talk on Information Theory of Wireless Networks

6  Channel Capacity (Gaussian Channel): Unknown D Tx 1 Relay S Tx 2Rx 2 Rx 1 relay (Best known achievable region: Han & Kobayashi 81) (Best known achievable region: El Gamal & Cover 79) Han & Kobayashi 81 El Gamal & Cover79 Background Slides partially borrowed from D. Tse’s talk on Information Theory of Wireless Networks

Typical Related Work 7  Capacity in wireless ad hoc network not scalable  In static ad hoc wireless networks with n nodes, the per-node throughput behaves as  Main reason: spatial interference Significant gap between demand and wireless capacity ground breaking work work [1] P. Gupta, P.R. Kumar, The capacity of wireless networks, IEEE Trans. on Information Theory, March pessimistic result

Typical Related Work  Mobility can increase the capacity:  Store-carry-forward communication scheme  Drawback: large delays [2] M. Grossglauser and D. Tse, Mobility Increases the Capacity of Ad Hoc Wireless Networks, IEEE/ACM Trans. on Networking, August S D R 8

Typical Related Work 9  Infrastructure can increase capacity  In static ad hoc network with n wireless nodes and k base stations, the per-node capacity is  Assume that base stations are wired together with unlimited bandwidth, and  Many techniques to increase capacity  Directional antenna, Network coding, MIMO,… [3]Liu, B. and Liu, Z. and Towsley, D., On the capacity of hybrid wireless networks, INFOCOM 2003.

Difficulty on Network Capacity Analysis  A large number of potential wireless transmissions  Neighboring transmissions interfere with each other  Dynamic of network topology due to node mobility  Uncertainty of channel quality, e.g., shadowing, pass loss, multi-path  … 10

11 Outline  Background and related works  Unicast capacity for static networks  System model and definition  Main result and sketch of derivation  Multicast capacity for VANETs  Main result and sketch of derivation  Conclusions

System Models and Definition  Assumptions  n nodes and m base stations  n nodes randomly placed  m base stations regularly deployed  Random source destination pairs  Base stations are relays 12  Directional Antenna  Every node equipped with directional antenna  Transmitting and receiving range are common  Beam-width:

System Models and Definition(Cont’)  Interference Model  Receiver-based Interference model 13  Delay Constraint  Ad hoc mode transmission  Infrastructure mode transmission  Maximum hops form source to destination: L  No interference between ad hoc and infrastructure mode transmission Xk Xl Xi Xj

Asymptotic Capacity 14  We say that the per-node capacity is if there exist two constants c and c’ such that  Sustainable: there exists a spatial and temporal scheduling scheme that can achieve such a rate.  Delay: The hops it takes to send packets from source nodes to their destinations.

15 Outline  Background and related works  Unicast capacity for static networks  System model and definition  Main result and sketch of derivation  Multicast capacity for VANETs  Main result and sketch of derivation  Conclusions

Main contribution: the capacity of unicast network  Propose an L-maximum-hop delay constraint strategy, and give the closed-form upper bound of the capacity  Provide the transmission schedule strategy and the routing construction to achieve the upper bound of the capacity  Analyze the relations between throughput capacity and system parameters 16

Main Results 17  Main theorem : Under the L-maximum-hop resource allocation strategy, by using directional antenna, the throughput capacity of the network is  Proof: sketch Infrastructure Mode Capacity Infrastructure Mode Capacity Hybrid Capacity Ad Hoc Mode Capacity Ad Hoc Mode Capacity Lower Bound Upper Bound

Lower Bound: Sketch of derivation  Construct Voronoi Tessellation  Choose points, …,  Spanning  Adjacent Voronoi Cells  Cells have common points  Interfering Neighbors  Distance between cell  : transmission range  : guard zone 18

Lower Bound: Sketch of derivation (Cont’)  Number of interfering neighbors 19 Remark: every cell has no more than interfering neighbors, where

Lower Bound: Routing and Scheduling  Scheduling  TDMA  Routing  Random chosen destination  Multihop transmission 20 Remark: The scheduling strategy and routing are designed to avoid hot point

Lower Bound: Routing and Scheduling  Traffic load  Expectation of traffic load 21 P(the that cross V and can be used to forward packet) E(the number of lines in that cross V and can be used to forward packet)

Lower Bound: Ad Hoc Mode Transmission  When, there exists a constant, such that 22  When, we have

Upper Bound: Ad Hoc Mode Transmission  When, the upper bound of per-node throughput capacity is 23  When, we have the upper bound per-node throughput capacity Remark: the number of simultaneous transmissions for the whole network is no more than

Capacity Scaling Laws 24 Multicast Throughput Capacity in Hybrid Wireless Networks

Capacity with respect to L and m 25 Relations with delay constraint L Relations with number of base stations m

Capacity with respect to 26 Relations with directional antenna when

27 Outline  Background and related works  Unicast capacity for static networks  System model and definition  Main result and sketch of derivation  Multicast capacity for VANETs  Main result and sketch of derivation  Conclusions

System Model and Assumption  Assumption  There are n vehicular nodes and m base stations in the network  At each time slot, n nodes are randomly and uniformly deployed  m base stations are placed regularly  There are k multicast sessions 28  Directional antenna  Delay constraint  Each transmission should be finished within D time slots

System Model and Assumption  Mobility model  2D i.i.d. fast mobility model  2D i.i.d. slow mobility model  1D i.i.d. fast mobility model  1D i.i.d. slow mobility model Fit the vehicular mobility 29  Time scale of mobility  Fast mobility The mobility of nodes is at the same time scale as the trans- mission of packets  Slow mobility The mobility of nodes is much slower than the transmission of packets

Main Contribution for Multicast VANET 30  We present an asymptotic study of the multicast capacity for the hybrid VANETs, and obtain the closed form formula of the multicast capacity in order of magnitude  We analyze the impact of two mobility models and two mobility time scales on multicast capacity of the VANET, which is not considered in the state-of-the-art research, especially under delay constraint  We analyze the impact of the base stations, the beamwidth of the directional antenna, and delay constraint on the multicast capacity

Intuitive Analysis: Multicast Capacity 31 Reliable broadcasting channel Unreliable relay channel Reliable receiving channel Base station Upper bound capacity of hybrid VANET Directional trans-ceiving

Main Theorem and Proof Intuition 32  2D i.i.d. fast mobility model Proof: (sketch) Infrastructure mode transmission 2-D i.i.d. fast mobility model the packets have to be transmitted from relays to their destinations the packets have to be transmitted from relays to their destinations Upper bound capacity the packets are directly transmitted from source to their destinations the packets are directly transmitted from source to their destinations 2-D i.i.d. fast mobility model Infrastructure mode transmission Theorem 1: Under the 2D-i.i.d. fast mobility model and delay constraint D, we have the multicast capacity of ad hoc mode transmission

Main Theorem and Proof Intuition 33  2D i.i.d. slow mobility model The mobile speed of nodes are much slower than the data transmission 2D i.i.d. slow mobility model Throughput capacity of VANET Proof: (sketch) Theorem 2: Under the 2D-i.i.d. slow mobility model and delay constraint D, we have the number of bits that are successfully delivered to their destinations in T time slots

Main Theorem and Proof Intuition 34  1D i.i.d. fast mobility model Proof: (sketch) Lemma 8: Under the 1D-i.i.d. fast mobility model and delay constraint D, we have the number of bits that are successfully delivered to their destinations in T time slots H(B) denotes the minimum distance between the relays that carrying bit B and any of the p destinations.

Main Theorem and Proof Intuition 35  1D i.i.d. slow mobility model Proof: (sketch) Theorem 3: Under the 1D-i.i.d. slow mobility model and delay constraint D, we have the number of bits that are successfully delivered to their destinations in T time slots Step 1: Bits transmitted directly from source to destinations By the Cauchy-Schwarz inequality,

Proof Sketch 36 Meanwhile, we can have, By the Jansen inequality, Then, we have,

Proof Sketch 37 Using similar approach as in step 1, we have, Step 2: Bits transmitted from relay to destinations Step 3: Bits that are successfully delivered to destinations up to time T Step 3: Bits that are successfully delivered to destinations up to time T

Main Result: 38 2D i.i.d. fast mobility model : 2D i.i.d. slow mobility model : 1D i.i.d. fast mobility model : 1D i.i.d. slow mobility model :

Capacity Scaling Laws 39 Multicast Throughput Capacity in Hybrid VANET with Directional Antenna and Delay Constraint

Conclusions 40 We study the unicast capacity of large scale wireless networks with directional antenna and delay constraint while the nodes are static. The multicast capacity of VANET with different mobility models are investigated and the closed-form formulae are given in order of magnitude. We analyze the impact of system parameters on the capacity scaling laws and provide scheduling strategy and routing construction to achieve the capacity bound.

Future Work 41 The capacity of large scale wireless networks with network coding The capacity of heterogeneous network with delay constraint The capacity of wireless networks with social relationship Information theoretic capacity of large scale wireless network

Thank You !