Understanding Radio Irregularity in Wireless Networks Joint work with Patrick Stüdi, Fabian Kuhn and Gustavo Alonso.

Slides:



Advertisements
Similar presentations
Fundamental Relationship between Node Density and Delay in Wireless Ad Hoc Networks with Unreliable Links Shizhen Zhao, Luoyi Fu, Xinbing Wang Department.
Advertisements

The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.
1 S4: Small State and Small Stretch Routing for Large Wireless Sensor Networks Yun Mao 2, Feng Wang 1, Lili Qiu 1, Simon S. Lam 1, Jonathan M. Smith 2.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
MASSIMO FRANCESCHETTI University of California at Berkeley Wireless sensor networks with noisy links.
Madhavi W. SubbaraoWCTG - NIST Dynamic Power-Conscious Routing for Mobile Ad-Hoc Networks Madhavi W. Subbarao Wireless Communications Technology Group.
Conceptual issues in scaling sensor networks Massimo Franceschetti, UC Berkeley.
Radio Propagation Spring 07 CS 527 – Lecture 3. Overview Motivation Block diagram of a radio Signal Propagation  Large scale path loss  Small scale.
NCKU CSIE CIAL1 How Optimal are Wireless Scheduling Protocols? Authors: Thomas Moscibroda, Yvonne Anne Oswald and Roger Wattenhofer Publisher: IEEE INFOCOM.
The Capacity of Wireless Ad Hoc Networks
Understanding Radio Irregularity in Wireless Networks Torsten Mütze, ETH Zürich joint work with Patrick Stüdi, Fabian Kuhn and Gustavo Alonso.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Theory of Interferences, Trade-Offs between.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (III) 12th Week
Evaluating the Cost of Frequency Diversity in Communication and Routing Overview Jorge Ortiz* ♦ David Culler* Causes of Loss  Pairs of nodes sharing a.
MASSIMO FRANCESCHETTI University of California at Berkeley Ad-hoc wireless networks with noisy links Lorna Booth, Matt Cook, Shuki Bruck, Ronald Meester.
Uniform Power Connectivity University of the Negev
Distributed Sensing and Data Collection Via Broken Ad Hoc Wireless Connected Networks Mobile Robots By Alan FT Winfield Presented By Navpreet Bawa.
Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.
Maximal Cliques in UDG: Polynomial Approximation Rajarshi Gupta, Jean Walrand Dept of EECS, UC Berkeley Olivier Goldschmidt, OPNET Technologies International.
MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective.
1 Connectivity of Wireless Ad hoc Networks Dr. Salman Durrani School of Engineering, College of Engineering and Computer Science, The Australian National.
A Transmission Control Scheme for Media Access in Sensor Networks Alec Woo, David Culler (University of California, Berkeley) Special thanks to Wei Ye.
MASSIMO FRANCESCHETTI University of California at Berkeley Percolation of Wireless Networks.
On Channel-Discontinuity-Constraint Routing in Multi-Channel Wireless Infrastructure Networks Abishek Gopalan, Swaminathan Sankararaman 1.
The role of entropy in wave propagation Stefano Marano Universita’ di Salerno Massimo Franceschetti University of California at Berkeley Francesco Palmieri.
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
Network Done by: Athra sultan.
IEEE.AM/MMES Tenerife RELIABILITY STUDY OF MESH NETWORKS MODELED AS RANDOM GRAPHS. Louis Petingi Computer Science Dept. College of Staten Island.
NETW 707 Modeling and Simulation Amr El Mougy Maggie Mashaly.
An algorithm for dynamic spectrum allocation in shadowing environment and with communication constraints Konstantinos Koufos Helsinki University of Technology.
: Data Communication and Computer Networks
Computer and Data Communications Semester Mohd Nazri Mahmud Session 4a-12 March 2012.
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
1 Constant Density Spanners for Wireless Ad-Hoc Networks Discrete Mathematics and Algorithms Seminar Melih Onus April
Message-Passing for Wireless Scheduling: an Experimental Study Paolo Giaccone (Politecnico di Torino) Devavrat Shah (MIT) ICCCN 2010 – Zurich August 2.
1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
Physical Layer Fundamentals Physical MAC Physical LLC Data Link Network Transport Session Presentation Application OSI Ref ModelWireless Network Network.
MAGNÚS MÁR HALLDÓRSSON, PROFESSOR SCHOOL OF COMPUTER SCIENCE | RU LECTURE MARATHON Capacity of Wireless Networks.
Routing and Scheduling for mobile ad hoc networks using an EINR approach Harshit Arora Advisor : Dr. Harlan Russell Mobile ad Hoc Networks A self-configuring.
Networks Igor Segota Statistical physics presentation.
A Distributed Relay-Assignment Algorithm for Cooperative Communications in Wireless Networks ICC 2006 Ahmed K. Sadek, Zhu Han, and K. J. Ray Liu Department.
0 Patrick Thiran - Ne X tworking’03 - Chania, Crete, Greece, June 23-25,2003 The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING.
Void Traversal for Guaranteed Delivery in Geometric Routing
Communications Letts Study Guide GCSE Information Systems and IT Chapter 15.
Analytical Foundations of Networked Computing Kirstie Bellman, Luiz DaSilva, Robert Kleinberg, Michael Mahoney, Amin Saberi, Ion Stoica, Eva Tardos, Shanghua.
SWAN simulation A Simulation Study of Denial of Service Attacks on Wireless Ad-Hoc Networks Samuel C. Nelson, Class of 2006, Dept. of Computer Science,
Wireless Communication using Directional Antennas.
Introduction for Personal Area Networks including Infrared, Bluetooth, and Near-Field Communication. Presented By Valerie Lim.
Ασύρματες και Κινητές Επικοινωνίες Ενότητα # 12: Ασύρματα Δίκτυα Πλέγματος (Wireless Mesh Networks) Διδάσκων: Βασίλειος Σύρης Τμήμα: Πληροφορικής.
UNIT IV INFRASTRUCTURE ESTABLISHMENT. INTRODUCTION When a sensor network is first activated, various tasks must be performed to establish the necessary.
Review paper report Reviewed by Chun-Fu Lin. Brief summary The readability of this paper is quite low due to the author ’ s expression and writing in.
Optimization Models for Fixed Channel Assignment in Wireless Mesh Networks with Multiple Radios Arindam K. Das, Sumit Roy, SECON Kim Young.
System Study of the Wireless Multimedia Ad-hoc Network based on IEEE g Authors Chung-Wei Lee Jonathan C.L. Liu & Kun Chen Yu-Chee Tseng & S.P. Kuo.
A Maximum Fair Bandwidth Approach for Channel Assignment in Wireless Mesh Networks Bahador Bakhshi and Siavash Khorsandi WCNC 2008.
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
Experimental Evaluation of Co-existent LTE-U and Wi-Fi on ORBIT Problem DefinitionExperimental Procedure Results Observation WINLAB Conclusion Samuel
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
UNIT 3 MULTIPLE ACCESS Adapted from lecture slides by Behrouz A. Forouzan © The McGraw-Hill Companies, Inc. All rights reserved.
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.
Maximizing Ad-Hoc network lifetime Yael Ochbaum Orit Varsano Supervised by Michael Segal.
Percolation of Clustered Wireless Networks
Understanding Radio Irregularity in Wireless Networks
On the Physical Carrier Sense in Wireless Ad-hoc Networks
Interference Avoidance and Control
Department of Computer Science University of York
Overview: Chapter 4 Infrastructure Establishment
A Topology Control Approach for Utilizing Multiple Channels in Multi-Radio Wireless Mesh Networks (broadnet2005) Mahesh K. Marina, Samir R. Das 2006/9/14.
Presentation transcript:

Understanding Radio Irregularity in Wireless Networks Joint work with Patrick Stüdi, Fabian Kuhn and Gustavo Alonso

Content Network Model Connectivity Edge Length Interference

Network Model (1) Wireless network: network of computers (nodes) without a fixed infrastructure, nodes communicate via wireless links Network Model Connectivity Edge Length Interference

Network Model (2) Network Model Connectivity Edge Length Interference

Network Model (3) Network Model Connectivity Edge Length Interference Log-normal shadowing radio propagation model

Transmission Area - + Network Model Connectivity Edge Length Interference

Connectivity & Node Degree Network Model Connectivity Edge Length Interference [Stüdi, Chinellato, Alonso 05] [Bettstetter, Hartmann 05]

Adaptive Power Assignment Irregular radio propagation improves connectivity. Similar phenomena known from percolation theory [Booth, Bruck, Cook, Franceschetti 03] 11 [Jonasson 01], [Roy, Tanemura 02] Network Model Connectivity Edge Length Interference

Distance Distribution [Trott 04] Network Model Connectivity Edge Length Interference Edge length distribution Edge power distribution under channel randomness

Edge Length Distribution Irregular radio propagation increases the average edge length. Network Model Connectivity Edge Length Interference

-Number of interferers: number of nodes that must not send concurrently to a given network link -Studied interference under log-normal shadowing and a power assignment that keeps the expected cumulated noise constant Log-normal shadowing reduces the number of interferers.Radio irregularity from log-normal shadowing is beneficial for both connectivity and interference. A comparable unit disk model is a worst case scenario for connectivity and interference. Network Model Connectivity Edge Length Interference

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.