1 On the Performance of Slotted Aloha with Capture Effect in Wireless Networks Arash Behzad and Julan Hsu Professor Mario Gerla CS218 Project UCLA December.

Slides:



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

Cooperative Transmit Power Estimation under Wireless Fading Murtaza Zafer (IBM US), Bongjun Ko (IBM US), Ivan W. Ho (Imperial College, UK) and Chatschik.
The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
The Capacity of Wireless Networks
Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.
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.
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
Enhancing Secrecy With Channel Knowledge
Topology Control for Effective Interference Cancellation in Multi-User MIMO Networks E. Gelal, K. Pelechrinis, T.S. Kim, I. Broustis Srikanth V. Krishnamurthy,
Interactions Between the Physical Layer and Upper Layers in Wireless Networks: The devil is in the details Fouad A. Tobagi Stanford University “Broadnets.
Wireless Sensor Networks Energy Efficiency Issues
The Capacity of Wireless Ad Hoc Networks
Analyzing Multi-channel MAC Protocols for Underwater Sensor Networks Presenter: Zhong Zhou.
NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
6/28/2015CSC82601 Radio-resource sharing for adhoc Networking with UWB. by Francesca Cuomo, Cristina Martello, Andrea Baiocchi, and Fabrizio Capriotti.
How to Turn on The Coding in MANETs Chris Ng, Minkyu Kim, Muriel Medard, Wonsik Kim, Una-May O’Reilly, Varun Aggarwal, Chang Wook Ahn, Michelle Effros.
Cellular System Capacity Maximum number of users a cellular system can support in any cell. Can be defined for any system. Typically assumes symmetric.
Mobility Increases The Capacity of Ad-hoc Wireless Networks By Grossglauser and Tse Gautam Pohare Heli Mehta Computer Science University of Southern California.
MIMO and TCP: A CASE for CROSS LAYER DESIGN Soon Y. Oh, Mario Gerla Computer Science Dept. University of California, Los Angeles {soonoh,
CS Dept, City Univ.1 The Complexity of Connectivity in Wireless Networks Presented by LUO Hongbo.
Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.
MAXIMIZING SPECTRUM UTILIZATION OF COGNITIVE RADIO NETWORKS USING CHANNEL ALLOCATION AND POWER CONTROL Anh Tuan Hoang and Ying-Chang Liang Vehicular Technology.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
On the Optimal SINR in Random Access Networks with Spatial Re-Use Navid Ehsan and R. L. Cruz UCSD.
1 Power Control for Distributed MAC Protocols in Wireless Ad Hoc Networks Wei Wang, Vikram Srinivasan, and Kee-Chaing Chua National University of Singapore.
POWER CONTROL IN COGNITIVE RADIO SYSTEMS BASED ON SPECTRUM SENSING SIDE INFORMATION Karama Hamdi, Wei Zhang, and Khaled Ben Letaief The Hong Kong University.
Toward Optimal Utilization of Shared Random Access Channels Joseph (Seffi) Naor, Technion Danny Raz, Technion Gabriel Scalosub, University of Toronto.
Selecting Transmit Powers and Carrier Sense Thresholds in CSMA Jason Fuemmeler, Nitin Vaidya, Venugopal Veeravalli ECE Department & Coordinated Science.
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
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.
College of Engineering WiFi and WCDMA Network Design Robert Akl, D.Sc. Department of Computer Science and Engineering Robert Akl, D.Sc. Department of Computer.
1 Constant Density Spanners for Wireless Ad-Hoc Networks Discrete Mathematics and Algorithms Seminar Melih Onus April
Mingyuan Yan, Shouling Ji, and Zhipeng Cai Presented by: Mingyuan Yan.
The Case for Addressing the Limiting Impact of Interference on Wireless Scheduling Xin Che, Xi Ju, Hongwei Zhang {chexin, xiju,
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.
AUTONOMOUS DISTRIBUTED POWER CONTROL FOR COGNITIVE RADIO NETWORKS Sooyeol Im; Jeon, H.; Hyuckjae Lee; IEEE Vehicular Technology Conference, VTC 2008-Fall.
TRANSMISSION POWER CONTROL FOR AD HOC WIRELESS NETWORKS: THROUGHPUT, ENERGY AND FAIRNESS Lujun Jia; Xin Liu; Noubir, G.; Rajaraman, R.; Wireless Communications.
An Adaptive, High Performance MAC for Long- Distance Multihop Wireless Networks Presented by Jason Lew.
OPTIMUM INTEGRATED LINK SCHEDULING AND POWER CONTROL FOR MULTI-HOP WIRELESS NETWORKS Arash Behzad, and Izhak Rubin, IEEE Transactions on Vehicular Technology,
Statistical-Time Access Fairness Index of One-Bit Feedback Fair Scheduler Fumio Ishizaki Dept. of Systems Design and Engineering Nanzan University, Japan.
A Distributed Relay-Assignment Algorithm for Cooperative Communications in Wireless Networks ICC 2006 Ahmed K. Sadek, Zhu Han, and K. J. Ray Liu Department.
Cognitive Radio for Dynamic Spectrum Allocation Systems Xiaohua (Edward) Li and Juite Hwu Department of Electrical and Computer Engineering State University.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Doc.: IEEE r0 Amin Jafarian, Newracom 1 CCA Revisit May 2015 NameAffiliationsAddressPhone Amin
University of Houston Cullen College of Engineering Electrical & Computer Engineering Capacity Scaling in MIMO Wireless System Under Correlated Fading.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
STUMP: Exploiting Position Diversity in the Staggered TDMA Underwater MAC Protocol Kurtis Kredo II, Petar Djukic, Prasant Mohapatra IEEE INFOCOM 2009.
Doc.: IEEE /1110r0 Amin Jafarian, Newracom 1 September 2015 BSS-TXOP NameAffiliationsAddressPhone Amin
The Scaling Law of SNR-Monitoring in Dynamic Wireless Networks Soung Chang Liew Hongyi YaoXiaohang Li.
Wireless Sensor Networks M Homework #2. IEEE MAC Protocol - Star topology – Part I Consider a square area equipped with 30 nodes distributed.
Khaled Hatem Almotairi and Xuemin (Sherman) Shen IEEE Globecom 2010 Speak: Huei-Rung, Tsai Symmetrical Power Control for Multi- channel Multi-hop Wireless.
Medium Access Control in Wireless networks
1 On the Channel Capacity of Wireless Fading Channels C. D. Charalambous and S. Z. Denic School of Information Technology and Engineering, University of.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
4 Introduction Carrier-sensing Range Network Model Distributed Data Collection Simulation 6 Conclusion 2.
1 Effectiveness of Physical and Virtual Carrier Sensing in IEEE Wireless Ad Hoc Networks Fu-Yi Hung and Ivan Marsic WCNC 2007.
- A Maximum Likelihood Approach Vinod Kumar Ramachandran ID:
Impact of Interference on Multi-hop Wireless Network Performance
Presented by Tae-Seok Kim
Topology Control –power control
On the Physical Carrier Sense in Wireless Ad-hoc Networks
The Capacity of Wireless Networks
Throughput-Optimal Broadcast in Dynamic Wireless Networks
Capacity of Ad Hoc Networks
Pradeep Kyasanur Nitin H. Vaidya Presented by Chen, Chun-cheng
Presentation transcript:

1 On the Performance of Slotted Aloha with Capture Effect in Wireless Networks Arash Behzad and Julan Hsu Professor Mario Gerla CS218 Project UCLA December 1, 2003

2 System Model Assumptions:  Slotted ALOHA  Omni directional antennas  Half-duplex radios  Immobile nodes and fixed topological configuration (single access net) Assumptions:  Slotted ALOHA  Omni directional antennas  Half-duplex radios  Immobile nodes and fixed topological configuration (single access net) Objective:  A nalysis of the throughput performance of the Slotted Aloha medium access control for an arbitrary topology under variations of transmission probability (q) and transmission power level (P) Objective:  A nalysis of the throughput performance of the Slotted Aloha medium access control for an arbitrary topology under variations of transmission probability (q) and transmission power level (P)

3 Highlights of Presentation Highlights of this presentation: i.Major interference models in wireless networks and their features ii.Some asymptotic theoretical results iii. Power control and capture effect iv. Preliminary simulation results v.Conclusions Highlights of this presentation: i.Major interference models in wireless networks and their features ii.Some asymptotic theoretical results iii. Power control and capture effect iv. Preliminary simulation results v.Conclusions

4 I. Two Core Interference Models in Wireless Networks and their Features

5 1. Protocol Interference Model  Assuming all nodes employ a common transmission range r c, transmission from node i 1 to node j 1 is successful if and for every other node i 2 transmitting in the same time slot  r c and r i are commonly known as communication range and interference range, respectively.  Assuming all nodes employ a common transmission range r c, transmission from node i 1 to node j 1 is successful if and for every other node i 2 transmitting in the same time slot  r c and r i are commonly known as communication range and interference range, respectively. j1j1 j2j2 j3j3 i3i3 i1i1 i2i2

6  Let be the subset of nodes simultaneously transmitting at some time instant (time slot) employing an identical transmit power level. Then the transmission from a node,, is successfully received by a node,, if and only if whereby is the distance between nodes and, N is the ambient noise power level, and is the path loss exponent.  Let be the subset of nodes simultaneously transmitting at some time instant (time slot) employing an identical transmit power level. Then the transmission from a node,, is successfully received by a node,, if and only if whereby is the distance between nodes and, N is the ambient noise power level, and is the path loss exponent. 2. Physical Interference Model j1j1 j2j2 j3j3 i3i3 i1i1 i2i2

7 Disadvantages of Protocol Interference Model: Aggregate Effect of Interference -Illustration of a transmission scenario, which is feasible based on Protocol Interference Model and is infeasible based on Physical Interference Model. Note that all receivers are out of the “interference range” r i of non-associated transmitters. This problem can be resolved by Protocol Interference Model via considering a larger interference range in the expense of losing some spatial reuse. j1j1 j2j2 j3j3 i3i3 i1i1 i2i2 Feasible based on Protocol Interference Model, but infeasible based on Physical Interference Model Feasible based on Protocol Interference Model, but infeasible based on Physical Interference Model

8 -Illustration of a transmission scenario, which is feasible based on Physical Interference Model (assuming i 2 is sufficiently close to j 2 ) and is infeasible based on Protocol Interference Model, since j 2 is in the interference range of i 1. j1j1 i1i1 i2i2 j2j2 Infeasible based on Protocol Interference Model, but feasible based on Physical Interference Model Infeasible based on Protocol Interference Model, but feasible based on Physical Interference Model Disadvantages of Protocol Interference Model: Capture Effect

9 KEY ASSUMPTIONS: I. Protocol Interference Model II. Identical transmit power level (no power control) III. Identical probability of transmission for all nodes KEY ASSUMPTIONS: I. Protocol Interference Model II. Identical transmit power level (no power control) III. Identical probability of transmission for all nodes Conventional Slotted Aloha in Wireless Networks 4 AP/BN/BS

10 Interference Model Assumptions: Protocol Model  Based on the Protocol Interference Model, transmission from node k to AP is successfully received if and only if it is the only transmission in the underlying slot. Why? 4 AP Is it fair?

11 Interference Model Assumptions: Physical Model  What if we consider the Physical Interference Model? The throughput under Protocol Interference Model is higher or under the Physical Interference Model? Why? 4 AP Does q=1/n still work?

12 II. Some Asymptotic Theoretical Results

13  Consider an arbitrary (symmetric/asymmetric) topology. Based on the Physical Interference Model, the probability of success for transmission from i k to AP (C k ) is equal to where Y r is a 0-1 Bernoulli variable defined as follows:  Consider an arbitrary (symmetric/asymmetric) topology. Based on the Physical Interference Model, the probability of success for transmission from i k to AP (C k ) is equal to where Y r is a 0-1 Bernoulli variable defined as follows: Probability of Successful Transmission

14 Estimation of Aggregate Interference by L-F Central Limit Theorem  Equation (1) can be written as  The term (i.e. the aggregate interference) is a linear combination of independent Bernoulli variables. Conclusively, based on a generalization of the Central Limit Theorem (the Lindeberg- Feller Central Limit Theorem) we havethe Lindeberg- Feller Central Limit Theorem where n is a sufficiently large number.  Equation (1) can be written as  The term (i.e. the aggregate interference) is a linear combination of independent Bernoulli variables. Conclusively, based on a generalization of the Central Limit Theorem (the Lindeberg- Feller Central Limit Theorem) we havethe Lindeberg- Feller Central Limit Theorem where n is a sufficiently large number.

15 The Lindeberg-Feller Central Limit Theorem If the independent random variables satisfy the Lindeberg condition, then for all a < b, where is the normal distribution function. Note: In most practical cases the Lindberg condition is satisfied. If the independent random variables satisfy the Lindeberg condition, then for all a < b, where is the normal distribution function. Note: In most practical cases the Lindberg condition is satisfied.

16 Theorem 1  Theorem 1. Consider an arbitrary (symmetric/asymmetric) topology with large number of nodes operating under a Slotted Aloha medium access control. Based on the Physical Interference Model, the probability of success for transmission i k  AP can be calculated as where Q(.) is the Q-function, n is an arbitrarily large number and  Theorem 1. Consider an arbitrary (symmetric/asymmetric) topology with large number of nodes operating under a Slotted Aloha medium access control. Based on the Physical Interference Model, the probability of success for transmission i k  AP can be calculated as where Q(.) is the Q-function, n is an arbitrarily large number and

17 Derivation of Aggregate Throughput  The aggregate throughput (per slot) can be calculated as the following: where X r is a 0-1 Bernoulli variable defined as  Clearly, (why?; are X i ’s independent?)  The aggregate throughput (per slot) can be calculated as the following: where X r is a 0-1 Bernoulli variable defined as  Clearly, (why?; are X i ’s independent?)

18 Theorem 2  Theorem 2. Consider an arbitrary (symmetric/asymmetric) topology with large number of nodes operating under a Slotted Aloha medium access control. Based on the Physical Interference Model, the aggregate throughput can be calculated as where Q(.) is the Q-function, n is arbitrarily large number and  Theorem 2. Consider an arbitrary (symmetric/asymmetric) topology with large number of nodes operating under a Slotted Aloha medium access control. Based on the Physical Interference Model, the aggregate throughput can be calculated as where Q(.) is the Q-function, n is arbitrarily large number and

19 Based on Theorem 2, what happens to TH as q  1? Would it be still fair? Intuitive Interpretation of Theorem 2 Based on equalities (3) and (4), it can be easily shown that 4 AP

20 III. Power Control and Capture Effect

21 For a given topology, every node i k can individually select the transmit power such that its received signal power at AP becomes a constant, say A mW. Clearly, this method supports fairness. What is the drawback of this approach? Conventional Power Control  Under the former approach the probability of capture becomes zero. 4 AP

22  Assume there are m different transmit power levels. Every node randomly and independently selects a power level for its transmission in the underlying slot.  This method supports fairness and increases the channel utilization. Why?  Assume there are m different transmit power levels. Every node randomly and independently selects a power level for its transmission in the underlying slot.  This method supports fairness and increases the channel utilization. Why? Power-Controlled Approach for Symmetric Topologies

23 Key Observation  As noted before, the aggregate throughput can be calculated as  Key observation: Based on Chebychev’s inequality and Wald’s lemma we have proven that the upper bound for probability of capture is inversely proportional with the variance of power distribution. This is also intuitively correct. Why?  As noted before, the aggregate throughput can be calculated as  Key observation: Based on Chebychev’s inequality and Wald’s lemma we have proven that the upper bound for probability of capture is inversely proportional with the variance of power distribution. This is also intuitively correct. Why?

24 IV. Preliminary Simulation Results

25 Simulation Assumptions  Noise power (N) = -90 dBm  Transmit power (P) = 50 mW (unless otherwise specified)  Communication range (r c ) = 250 m Minimum required SINR = 10 dB  Path loss exponent = 4  Number of nodes = 50  Noise power (N) = -90 dBm  Transmit power (P) = 50 mW (unless otherwise specified)  Communication range (r c ) = 250 m Minimum required SINR = 10 dB  Path loss exponent = 4  Number of nodes = 50

26 Throughput per Node associated with Approach 1 (Symmetric)  Note that throughput of node k is equal to

27 Optimal Probability of Transmission associated with Approach 1

28 Throughput per Node associated with Approach 1

29 Aggregate Throughput associated with Approach 2 (Asymmetric Topology) P1 = 1 mW; P2 = 100 mW

30 Throughput per Node associated with Approach 2 (Asymmetric Topology) P1 = 1 mW; P2 = 100 mW

31 Conclusions  We introduced two methods for increasing the aggregate throughput of a single access net based on the Slotted Aloha MAC: - In approach one no power control were used. The only control knob considered was q, probability of transmission. - In approach two, two knobs were takes in consideration simultaneously: P (transmit power level) and q (probability of transmission)  Approach one seems to be more promising, as the results are not asymptotic and a minimum fairness is guaranteed. However, not all systems possess the power control capabilities.