IEEE.AM/MMES Tenerife 2010 1 RELIABILITY STUDY OF MESH NETWORKS MODELED AS RANDOM GRAPHS. Louis Petingi Computer Science Dept. College of Staten Island.

Slides:



Advertisements
Similar presentations
Design of a reliable communication system for grid-style traffic light networks Junghoon Lee Dept. of Computer science and statistics Jeju National University.
Advertisements

Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
The Capacity of Wireless Networks
MIMO Communication Systems
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
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.
1 Advancing Supercomputer Performance Through Interconnection Topology Synthesis Yi Zhu, Michael Taylor, Scott B. Baden and Chung-Kuan Cheng Department.
2005/12/06OPLAB, Dept. of IM, NTU1 Optimizing the ARQ Performance in Downlink Packet Data Systems With Scheduling Haitao Zheng, Member, IEEE Harish Viswanathan,
DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.
Topology Control for Effective Interference Cancellation in Multi-User MIMO Networks E. Gelal, K. Pelechrinis, T.S. Kim, I. Broustis Srikanth V. Krishnamurthy,
Wireless Mesh Networks 1. Architecture 2 Wireless Mesh Network A wireless mesh network (WMN) is a multi-hop wireless network that consists of mesh clients.
CS Dept, City Univ.1 Low Latency Broadcast in Multi-Rate Wireless Mesh Networks LUO Hongbo.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Theory of Interferences, Trade-Offs between.
Path Protection in MPLS Networks Ashish Gupta Design and Evaluation of Fault Tolerance Algorithms with Performance Constraints.
Gentian Jakllari, Stephan Eidenbenz, Nick Hengartner, Srikanth V. Krishnamurthy & Michalis Faloutsos Paper in Infocom 2008 Link Positions Matter: A Non-Commutative.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (III) 12th Week
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.
A Topology Discovery Algorithm for Sensor Networks Go Suzuki CS691, SSNS Spring 2003.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
1 A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer.
Wireless internet routing Philippe Jacquet. Internet and networking Internet –User plurality connected to –Sources plurality.
1 Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Infocom /12/20.
Flow Models and Optimal Routing. How can we evaluate the performance of a routing algorithm –quantify how well they do –use arrival rates at nodes and.
1 Source-to-all-terminal diameter constrained network reliability Louis Petingi Computer Science Dept. College of Staten Island City University of New.
Real-Time Scheduling for WirelessHART Networks by Abusayeed Saifullah, You Xu, Chenyang Lu, and Yixin Chen A Presentation of Findings for CSE5095 Joshua.
NETW 707 Modeling and Simulation Amr El Mougy Maggie Mashaly.
ITAP 2012, Wuhan China 1 Addressing optimization problems in wireless networks modeled as probabilistic graphs. Louis Petingi Computer Science Dept. College.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
TCP Enhancement for Random Loss Jiang Wu Computer Science Lakehead University.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
A Cooperative Diversity- Based Robust MAC Protocol in wireless Ad Hoc Networks Sangman Moh, Chansu Yu Chosun University, Cleveland State University Korea,
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
Presented by Fei Huang Virginia Tech April 4, 2007.
10/5/20151 Mobile Ad hoc Networks COE 549 Topology Control Tarek Sheltami KFUPM CCSE COE
Message-Passing for Wireless Scheduling: an Experimental Study Paolo Giaccone (Politecnico di Torino) Devavrat Shah (MIT) ICCCN 2010 – Zurich August 2.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
1 Network Coding and its Applications in Communication Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
Cross-Layer Optimization in Wireless Networks under Different Packet Delay Metrics Chris T. K. Ng, Muriel Medard, Asuman Ozdaglar Massachusetts Institute.
CprE 545 project proposal Long.  Introduction  Random linear code  LT-code  Application  Future work.
Utility Maximization for Delay Constrained QoS in Wireless I-Hong Hou P.R. Kumar University of Illinois, Urbana-Champaign 1 /23.
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.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
A Distributed Relay-Assignment Algorithm for Cooperative Communications in Wireless Networks ICC 2006 Ahmed K. Sadek, Zhu Han, and K. J. Ray Liu Department.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
DRP: An Efficient Directional Routing Protocol for Mobile Ad Hoc Networks Hrishikesh Gossain Mesh Networks Product Group, Motorola Tarun Joshi, Dharma.
Network and Systems Laboratory nslab.ee.ntu.edu.tw Branislav Kusy, Christian Richter, Wen Hu, Mikhail Afanasyev, Raja Jurdak, Michael Brunig, David Abbott,
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
QoS Routing and Scheduling in TDMA based Wireless Mesh Backhaul Networks Chi-Yao Hong, Ai-Chun Pang,and Jean-Lien C. Wu IEEE Wireless Communications and.
به نام خدا سيد عليرضا كارداني مجتبي اميرخاني Path Set Selection in Mobile Ad Hoc Networks زمستان 1382.
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Hidden Terminal Decoding and Mesh Network Capacity
Su Yi Babak Azimi-Sadjad Shivkumar Kalyanaraman
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Network Flow and Connectivity in Wireless Sensor Networks
Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.
Coverage and Connectivity in Sensor Networks
Routing in Ad Hoc Networks: A Case for Long Hops
Yiannis Andreopoulos et al. IEEE JSAC’06 November 2006
Capacity of Ad Hoc Networks
Pradeep Kyasanur Nitin H. Vaidya Presented by Chen, Chun-cheng
Impact of transmission errors on TCP performance
Presentation transcript:

IEEE.AM/MMES Tenerife RELIABILITY STUDY OF MESH NETWORKS MODELED AS RANDOM GRAPHS. Louis Petingi Computer Science Dept. College of Staten Island City University of New York

IEEE.AM/MMES Tenerife Network Reliability Edge Reliability Model (1960s) Communication Network modeled as a graph G=(V,E). Distinguished set K of terminals vertices (participating nodes). Each edge e fails independently with probability q e =1-p e. Classical Reliability R K (G)= Pr { All the terminal vertices remain connected after deletion of the failed edges }.

IEEE.AM/MMES Tenerife Operating States G=(V,E) K = dark vertices operatingnon-operating

IEEE.AM/MMES Tenerife Operating States Let O be the set of operating states H of G G=(V,E) K = dark vertices H p(H)=(0.4) 4 (0.6) 2 Suppose for every edge e q e =0.6 p e =0.4

IEEE.AM/MMES Tenerife Diameter constrained reliability Petingi, and Rodriguez (2001) Suppose that we want to know what is the probability that the terminal nodes meet a delay constrained D.T, for some upper bound D. R K (G,D) = Prob {After random failures of the edges, for every pair of terminal nodes u and v, there exists an operational path of length ≤ D}

IEEE.AM/MMES Tenerife Applications Videoconference, we take K to be the set of the participating nodes, and the Diameter constrained reliability gives the probability that we can find short enough paths between all of them. To avoid congestion by looping data, assign a maximum number of hops to each data packet, to control information. In this case, the diameter constrained unreliability (the complement to one of the reliability) gives the probability that there are some nodes of the network which are not reachable by using these protocols.

IEEE.AM/MMES Tenerife Heuristics to estimate reliability Monte Carlo Monte Carlo techniques excellent to estimate the classical reliability R K (G) as well as the Diameter constrained reliability R K (G,D). (Cancela and El Khadiri – IEEE Trans. on Rel. (1995)) Monte Carlo Recursive Variance Reduction Monte Carlo Recursive Variance Reduction (RVR) for classical reliability. Monte Carlo Recently Monte Carlo successfully applied to estimate Diameter constrained reliability.

IEEE.AM/MMES Tenerife Wireless Networks (Mesh) communication channels (links) digraph Khandani et. al (2005) (capacity of wireless channel) R bits per channel use  = E(|f| 2 ) f=Fading state of channel Rayleigh r.v. Rayleigh r.v. (Map) Mesh access point -Transceiver

IEEE.AM/MMES Tenerife Wireless Networks (Mesh) Source-to-K-Terminal reliability (digraph) links (channels) K = terminal nodes K = terminal nodes ss q(l) = prob. that link l fails. R s,K (G) = Pr {source s will able to send info. to all the terminal nodes of K}

IEEE.AM/MMES Tenerife Wireless Networks (Mesh) Nodes Redundancy (optimization) Several applications of Monte Carlo SNRdb = 30, R=1 bit/channel use, SNRdb = 30, R=1 bit/channel use,  = E(|f| 2 )=1 R s,t (G) = Red 3 = = (40) (20) (25) (10) (20) (28) (15) (28) (20) t s Red 2 = – = Red 1 = – = 0.141

IEEE.AM/MMES Tenerife Wireless Networks (Mesh) Areas connectivity (optimization) O G ( R 1, R 2 ) : Find in G[ R 1, R 2 ] nodes u and v, u  V 1 and v  V 2, such as Mobile map 1, M 1 Same transmission rate R, Transmission power, Noise average power (assuming additive white Gaussian noise η). Mobile map 2, M 2 Areas different physical characteristics n-path loss exp, f –fading state

IEEE.AM/MMES Tenerife Future work performance objectives 1. Specify optimization problems in communication (determine performance objectives to be evaluated). 2. Improve 2. Improve (analyze) edge reliability models (integrate antenna gains and nodes interference. Monte Carlo 3. Implementation of Monte Carlo RVR techniques to evaluate reliability adapted for parallel processing environment (CSI’s high performance computers). 4. Test 4. Test correctness of results.

IEEE.AM/MMES Tenerife References [CE1] H. Cancela, M. El Khadiri. A recursive variance-reduction algorithm for estimating communication-network reliability. IEEE Trans. on Reliab. 4(4), (1995), pp [KMAZ] E. Khandani, E. Modiano, J. Abounadi, L. Zheng, Reliability and Route Diversity in Wireless networks, 2005 Conference on Information Sciences and Systems, The Johns Hopkins University, March 16-18, [PR] Petingi L., Rodriguez J.: Reliability of Networks with Delay Contraints. Congressus Numerantium (152), (2001), pp