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.

Slides:



Advertisements
Similar presentations
Nick Feamster CS 4251 Computer Networking II Spring 2008
Advertisements

Vivek Jain, Anurag Gupta Dharma P. Agrawal
University At Buffalo Capacity Of Ad-Hoc Networks Ajay Kumar.
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.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
How Effective is the IEEE RTS/CTS Handshake in Ad Hoc Networks Kaixin Xu,Mario Gerla, Sang Bae IEEE Globecom 2002.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
AdHoc Probe: Path Capacity Probing in Wireless Ad Hoc Networks Ling-Jyh Chen, Tony Sun, Guang Yang, M.Y. Sanadidi, Mario Gerla Computer Science Department,
Wireless Capacity. A lot of hype Self-organizing sensor networks reporting on everything everywhere Bluetooth personal networks connecting devices City.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
Ad-Hoc Networking Course Instructor: Carlos Pomalaza-Ráez D. D. Perkins, H. D. Hughes, and C. B. Owen: ”Factors Affecting the Performance of Ad Hoc Networks”,
The Capacity of Wireless Ad Hoc Networks
Centre for Wireless Communications Opportunistic Media Access for Multirate Ad Hoc Networks B.Sadegahi, V.Kanodia, A.Sabharwal and E.Knightly Presented.
Low Delay Marking for TCP in Wireless Ad Hoc Networks Choong-Soo Lee, Mingzhe Li Emmanuel Agu, Mark Claypool, Robert Kinicki Worcester Polytechnic Institute.
The Impact of Multihop Wireless Channel on TCP Throughput and Loss Zhenghua Fu, Petros Zerfos, Haiyun Luo, Songwu Lu, Lixia Zhang, Mario Gerla INFOCOM2003,
Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Vikram Kanodia.
Does the IEEE MAC Protocol Work Well in Multihop Wireless Ad Hoc Networks? Shugong Xu Tark Saadawi June, 2001 IEEE Communications Magazine (Adapted.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
The Impact of Multihop Wireless Channel on TCP Throughput and Loss Presented by Scott McLaren Zhenghua Fu, Petros Zerfos, Haiyun Luo, Songwu Lu, Lixia.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Travis Grant – Mingzhe Li, Choong-Soo Lee, Emmanuel.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Mingzhe Li, Choong-Soo Lee, Emmanuel Agu, Mark Claypool and Bob Kinicki Computer Science Department.
AdHoc Probe: Path Capacity Probing in Wireless Ad Hoc Networks Ling-Jyh Chen, Tony Sun, Guang Yang, M.Y. Sanadidi, Mario Gerla Computer Science Department,
MIMO and TCP: A CASE for CROSS LAYER DESIGN Soon Y. Oh, Mario Gerla Computer Science Dept. University of California, Los Angeles {soonoh,
1 Expected Data Rate (EDR): An Accurate High-Throughput Path Metric For Multi- Hop Wireless Routing Jun Cheol Park Sneha Kumar Kasera.
IEEE Wireless Communication Magazine Design and Performance of an Enhanced IEEE MAC Protocol for Multihop Coverage Extension Frank H.P. Fitzek, Diego.
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
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.
Capacity of Ad Hoc Networks Quality of Wireless links Physical Layer Issues The Channel Capacity Path Loss Model and Signal Degradation MAC for.
Network Coding vs. Erasure Coding: Reliable Multicast in MANETs Atsushi Fujimura*, Soon Y. Oh, and Mario Gerla *NEC Corporation University of California,
CS640: Introduction to Computer Networks Aditya Akella Lecture 22 - Wireless Networking.
Opersating Mode DCF: distributed coordination function
Tuning the Carrier Sensing Range of IEEE MAC Jing Deng,Ben Liang and Pramod K. Varshney Univ. of New Orleans Globecom 2004.
Wireless Medium Access. Multi-transmitter Interference Problem  Similar to multi-path or noise  Two transmitting stations will constructively/destructively.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya University of Illinois.
802.11: Performance Reference: “Does the IEEE MAC protocol work well in multihop wireless ad hoc networks”; Xu, S.; Saadawi, T. IEEE Communications.
Enhancing TCP Fairness in Ad Hoc Wireless Networks using Neighborhood RED Kaixin Xu, Mario Gerla UCLA Computer Science Department
1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.
Network Architecture (R02) #4 24/10/2013 Wireless Capacity Jon Crowcroft,
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
Effects of Multi-Rate in Ad Hoc Wireless Networks
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs K.Murugan, B.Dushyanth, E.Gunasekaran S.Arivuthokai, RS.Bhuvaneswaran, S.Shanmugavel.
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.
Power Control in Wireless Ad Hoc Networks Background An ad hoc network is a group of self configuring wireless nodes that lack infrastructure. Motivation—Power.
Performance Analysis of IEEE Distributed Coordination Function (DCF) Author : Giuseppe Bianchi Presented by: 李政修 December 23, 2003.
A Multi-Channel CSMA MAC Protocol with Receiver Based Channel Selection for Multihop Wireless Networks Nitin Jain, Samir R. Das Department of Electrical.
Explicit and Implicit Pipelining in Wireless MAC Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Xue Yang, UIUC.
Multi-Channel MAC Protocol for Multi-Hop Wireless Networks: Handling Multi-Channel Hidden Node Problem Using Snooping Myunghwan Seo, Yonggyu Kim, and Joongsoo.
Turkmen Canli ± and Ashfaq Khokhar* Electrical and Computer Engineering Department ± Computer Science Department* The University of Illinois at Chicago.
Medium Access Control in Wireless networks
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Distributed-Queue Access for Wireless Ad Hoc Networks Authors: V. Baiamonte, C. Casetti, C.-F. Chiasserini Dipartimento di Elettronica, Politecnico di.
Mobile Networks and Applications (January 2007) Presented by J.H. Su ( 蘇至浩 ) 2016/3/21 OPLab, IM, NTU 1 Joint Design of Routing and Medium Access Control.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
MAC Protocols for Sensor Networks
Puzzle You have 2 glass marbles Building with 100 floors
Group Multicast Capacity in Large Scale Wireless Networks
Ad Hoc Networks - Performance
On the Physical Carrier Sense in Wireless Ad-hoc Networks
Hidden Terminal Decoding and Mesh Network Capacity
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
The Impact of Multihop Wireless Channel on TCP Performance
Capacity of Ad Hoc Networks
Pradeep Kyasanur Nitin H. Vaidya Presented by Chen, Chun-cheng
How MAC interacts with Capacity of Ad-hoc Networks – Interference problem Capacity of Wireless Networks – Part Page 1.
Presentation transcript:

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 © ETH Zürich | Taskforce Kommunikation

12.Nov.2007 Tonio Introduction  Ad hoc wireless networks promise convenient infrastructure- free communication  Does Capacity benefit or suffer from area growth?  More spatial re-use of the spectrum (+)  Nodes are increasingly imposed to forwarding load (-)  Overall question: Are ad hoc wireless networks scalable? 2

12.Nov.2007 Tonio Related work  Most related work’s analysis base on random traffic patterns  Gupta and Kumar assume the average path length to grow with the spatial diameter of the network:  End-to-end throughput available to each node:  Approaches zero! 3

12.Nov.2007 Tonio Background  Four way exchange  RTS (ready to send)  CTS (clear to send)  Data  ACK (acknowledgment)  NAV (network allocation vector)  Stores the time remaining till the network comes available again  RTS & CTS include busy time → stored to NAV  On timeout (no CTS) the backoff window will be doubled (exponential backoff) 4

12.Nov.2007 Tonio MAC Interactions Overview  Simulation of detailed interaction between Ad Hoc forwarding and MAC  Simple to complex scenarios  ns with CMU wireless extensions  Model Lucent Wavelan card 2Mbps  Stationary nodes  Transmission range of 250m  Interfering range of 550m  Nodes mostly separated by 200m 5

12.Nov.2007 Tonio MAC Interactions Single Cell Capacity  Framework:  Single cell 200m 200m  Sending as fast as allowed  Randomly selected destination  Expectations:   With interframe timings throughput 1.7Mbps 6

12.Nov.2007 Tonio MAC Interactions Capacity of a Chain of Nodes  Framework:  Single chain of nodes  Packets are originated at first node and forwarded to the last node in the chain  Expectations:  Maximum utilization should be 7

12.Nov.2007 Tonio MAC Interactions Capacity of a Chain of Nodes  Simulation results (1.5kB):  2 nodes achieve 1.7Mbps throughput as expected  Longer chain → approaches 0.25Mbps throughput -Only about of the maximum of 1.7Mbps  Real Hardware results:  Average difference is only 6% 8

12.Nov.2007 Tonio MAC Interactions Capacity of a Chain of Nodes  Explanation:  No optimum schedule discovery  Bandwidth allocation unevenly  Wasted backoff time 9

12.Nov.2007 Tonio MAC Interactions Capacity of Regular Lattice Network  Framework:  Horizontal traffic flow (left → right)  square lattice  Expectations:  Every third chain can operate without interchain interference → Maximum throughput should be 10

12.Nov.2007 Tonio MAC Interactions Capacity of Regular Lattice Network  Simulation results (1.5kB):  Per flow throughput settles at about 0.1Mbps  Explanation:  Nodes in the beginning experience less contention  Wasted backoff periods (0.75%) 11

12.Nov.2007 Tonio MAC Interactions Cross Traffic in a Latice  Framework:  Vertical and horizontal traffic flow (up → down, left → right)  Square lattice  Expectations:  Horizontal in one time cycle, vertical in the next → of the channel capacity 12

12.Nov.2007 Tonio MAC Interactions Cross Traffic in a Latice  Simulation results (1.5kB):  Per flow throughput settles at about 0.04Mbps, this is slightly less than of the per flow throughput of a lattice network  Explanation:  More wasted backoff periods (2.23%) 13

12.Nov.2007 Tonio MAC Interactions Excurse: One-hop network throughput  Alternate analysis  Measure the total one-hop network throughput: Count all radio transmissions for data packets that successfully arrive at their final destinations, including packets forwarded by intermediate nodes. 14

12.Nov.2007 Tonio MAC Interactions Random Traffic in a Random Layout  Framework:  Uniformly random node placement on square universe  Every node sends each packet to randomly chosen destination  No routing but precomputed shortest path  75 nodes per square kilometer  Expectations:  Similar one-hop throughput to the horizontal/vertical lattice 15

12.Nov.2007 Tonio MAC Interactions Random Traffic in a Random Layout  Simulation results (1.5kB):  Somewhat less capacity than the horizontal/vertical lattice  Explanation:  Some empty areas → wastes of spatial diversity  More packets routed through the centre 16

12.Nov.2007 Tonio Scaling Ad Hoc Networks Larger view: total capacity vs. single node load  Estimate the useful bandwidth each node can expect for its own traffic.  Load increases with the number of nodes  Load increases with the distance over which each node wishes to communicate  Total bandwidth increases with the physical area covered by the network 17

12.Nov.2007 Tonio Scaling Ad Hoc Networks Path Length : fixed radio transmission range : uniform node density : rate of originated packages per node : expected physical path length : constant  As the expected path length increases, the per node bandwidth to originate packets decreases. 18

12.Nov.2007 Tonio Scaling Ad Hoc Networks Random traffic pattern  The listed probability density function (pdf) gives the probability of a node randomly communicating with another one at distance x:  The expected path length for a random traffic pattern follows as:  So the per node capacity for a constant density is. 19

12.Nov.2007 Tonio Scaling Ad Hoc Networks Traffic Patterns that Scale  Power law distance distribution:  So the average path length is:  With it scales similar to random traffic with  With it scales roughly constant 20

12.Nov.2007 Tonio Conclusion  From the ideal node chain capacity, MAC achieves  does a reasonable job scheduling packet transmissions in ad hoc networks  is much more efficient for orderly local traffic patterns  can approach the theoretical maximum capacity of per node in a large random network  Locality of traffic is the key argument for the scalability 21