1 Efficient Backbone Synthesis Algorithm for Multi-Radio Wireless Mesh Networks Huei-jiun Ju and Izhak Rubin Electrical Engineering Department University.

Slides:



Advertisements
Similar presentations
Communications Research Centre (CRC) Defence R&D Canada – Ottawa 1 Properties of Mobile Tactical Radio Networks on VHF Bands Li Li & Phil Vigneron Communications.
Advertisements

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks Xiaorui Wang, Guoliang Xing, Yuanfang Zhang*, Chenyang Lu, Robert Pless,
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
An Interest-Driven Approach to Integrated Unicast and Multicast Routing in MANETs Rolando Menchaca-Mendez J.J. Garcia-Luna-Aceves 280N Seminar: 4/28/2008.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
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.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.
A Survey on Wireless Mesh Networks Sih-Han Chen 陳思翰 Department of Computer Science and Information Engineering National Taipei University of Technology.
Mesh Networks A.k.a “ad-hoc”. Definition A local area network that employs either a full mesh topology or partial mesh topology Full mesh topology- each.
Performance Comparison of Routing Protocols for Ad Hoc Networks PATTERN ENDIF Ferrara.
CS541 Advanced Networking 1 Dynamic Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks Neil Tang 3/10/2009.
MIMO-CAST: A CROSS-LAYER AD HOC MULTICAST PROTOCOL USING MIMO RADIOS Soon Y. Oh*, Mario Gerla*, Pengkai Zhao**, Babak Daneshrad** *Computer Science Dept.,
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Ad-hoc On-Demand Distance Vector Routing (AODV) Sirisha R. Medidi.
Computer Networks: Wireless Networks Ivan Marsic Rutgers University Chapter 6 – Wireless Networks.
A Preferred Link Based Multicast Protocol for Wireless Mobile Ad hoc Networks R. S. Sisodia, Karthigeyan. I, B. S. Manoj, and C. Siva Ram Murthy ICC 2003.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
Professor Izhak Rubin Electrical Engineering Department UCLA August 2005 Unmanned-Vehicle Aided Multi-Tier Autonomous Intelligent Wireless.
9/25/2000UCLA CSD Gerla, Kwon and Pei On Demand Routing in Large Ad Hoc Wireless Networks With Passive Clustering Mario Gerla, Taek Jin Kwon and Guangyu.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
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.
CCH: Cognitive Channel Hopping in Vehicular Ad Hoc Networks Brian Sung Chul Choi, Hyungjune Im, Kevin C. Lee, and Mario Gerla UCLA Computer Science Department.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Hamida SEBA - ICPS06 June 26 th -29 th Lyon France 1 ARMP: an Adaptive Routing Protocol for MANETs Hamida SEBA PRISMa Lab. – G2Ap team
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
Mobile Adhoc Network: Routing Protocol:AODV
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
Multicast Routing in Mobile Ad Hoc Networks (MANETs)
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
CSE 6590 Fall 2009 Routing Metrics for Wireless Mesh Networks 1 12 November, 2015.
Energy and Latency Control in Low Duty Cycle MAC Protocols Yuan Li, Wei Ye, John Heidemann Information Sciences Institute, University of Southern California.
2003/04/24AARON LEE 1 An Efficient K-hop Clustering Routing Scheme for Ad-Hoc Wireless Networks S. F. Hwang, C. R. Dow Journal of the Internet Technology,
Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.
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.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
2005/02/171 A Region-Based Routing Protocol for Wireless Mobile Ad Hoc Networks Speaker: Chen-Nien Tsai Adviser: Kai-Wei Ke.
An Efficient Wireless Mesh Network A New Architecture 指導教授:許子衡 教授 學生:王志嘉.
Scalable Routing Protocols for
Forwarding Group Multicast Protocol (FGMP) for Multihop, Mobile Wireless Networks Speaker : Wilson Lai Date : Ching-Chuan Chiang, Mario Gerla.
Weight-Based Clustering Multicast Routing Protocol for Mobile Ad Hoc Networks Chun-Chieh Huang, Ruay-shiung Chang and Ming-Huang Guo National Dong-Hwa.
CSR: Cooperative Source Routing Using Virtual MISO in Wireless Ad hoc Networks IEEE WCNC 2011 Yang Guan, Yao Xiao, Chien-Chung Shen and Leonard Cimini.
Backbone Topology Synthesis for Multi- Radio Meshed Wireless LANs Huei-jiun Ju and Izhak Rubin University of California, Los angeles(UCLA) Keon Jang, SA.
SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks Presenter: Sheng-Shih Wang October 30, 2003 Chao Gui and Prasant Mohapatra.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
Low Latency Broadcast in Multirate Wireless Mesh Networks Chun Tung Chou, Archan Misra, Junaid Qadir Keon Jang
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.
LA-MAC: A Load Adaptive MAC Protocol for MANETs IEEE Global Telecommunications Conference(GLOBECOM )2009. Presented by Qiang YE Smart Grid Subgroup Meeting.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Power-Aware Topology Control for Wireless Ad-Hoc Networks Wonseok Baek and C.-C. Jay Kuo Department of Electrical Engineering University of Southern California.
COSC 6590 Fall Multi-channel, multi-radio wireless networks.
Routing Metrics for Wireless Mesh Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Routing Metrics for Wireless Mesh Networks
AODV-OLSR Scalable Ad hoc Routing
Multi-channel, multi-radio wireless networks
Net 435: Wireless sensor network (WSN)
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Ad hoc Routing Protocols
Routing Metrics for Wireless Mesh Networks
Multi-channel, multi-radio
Computer Networks: Wireless Networks
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Efficient flooding with Passive clustering (PC) in Ad Hoc Networks
Presentation transcript:

1 Efficient Backbone Synthesis Algorithm for Multi-Radio Wireless Mesh Networks Huei-jiun Ju and Izhak Rubin Electrical Engineering Department University of California, Los Angeles (UCLA) WCNC 2006

2 Outline Introduction Related Work Multi-Radio Backbone Synthesis Algorithm (MR-BAS) Multi-Radio MBN On-Demand Routing (MR-MBNR) Performance evaluation Conclusions

3 Introduction- Mesh Backbone Network Topology

4 The advantage of backbone Mesh Network Easy for routing Power saving Increasing the efficiency

5 Introduction- Mobile Backbone Network (MBN) Nodes are classified into two categories, Backbone Capable Nodes (BCNs) and Regular Nodes (RN), based on their ability In this paper AP nodes are analogous to BCNs while non-AP act as regular RNs.

6 Introduction- Motivation MBN is designed so that it involves a sufficient but not excessive number of backbone nodes.

7 Related Work ETSA (Extended mobile backbone network topology algorithm) Each node have a single radio, use 1-hop complete neighborhood and 2-hop BN neighbor information and all nodes operate at the same frequency. CDS construction algorithm Each node have a single radio and make use of complete 2-hop neighborhood data.

8 MR-BSA In this paper Multi-radio backbone synthesis algorithm (MR- BSA) is used for constructing and maintaining a backbone network in this paper. Each AP node is either elected to serve as a BN or is one-hop away from a BN Backbone Nodes are classified with three type. BN_A, BN_B and BN_C.

9 MR-BSA - System model BN_A RN BCNBN_A

10 MR-BSA - System model BN_B RN BN_ARN BN_ABN_B

11 MR-BSA - System model BN_C RN BN_ARN BN_ABN_C

12 MR-BSA - System model AP nodes are equipped with two radio (high capacity channel and low capacity channel) modules and routing intelligence. Non-AP nodes are only employed a single radio and possessed no routing capability. Each channel can be operated at its selected data channel. Each node has two timer : Short Timer and Long Timer, and the Long Timer is set to be 3 times Short Timer. AP_node Client_node 一: high capacity channel 一: low capacity channel

13 MR-BSA - Short Timer expires When the Short Timer expires, the node broadcast Hello message to it’s neighbor on high capacity channel ( BCN or BN) and low capacity channel. Node Hello message

14 MR-BSA - Hello message Hello message on high capacity channel contains Node’s ID Status Weight Associated BN ID BN neighbor list

15 MR-BSA - Hello message Hello message on low capacity channel contains Node’s ID Status Weight Associated BN ID Predecessor node’s ID Number of hops to the closest BN

16 MR-BSA - Hello message Through periodic Hello message exchange Each BCN learns its 1-hop neighborhood and 2-hop BN neighbor across the high capacity channel. All nodes learn their 1-hop neighborhood across the low capacity channel.

17 MR-BSA - Long Timer expires When the Long Timer expires, the node updates its neighbor lists based on the number of Hello messages received from each neighboring radio within the previous period.

18 MR-BSA Association algorithm is used for constructing the backbone network. BCN to BN and BN to BCN conversion algorithm is used for maintaining the backbone network.

19 MR-BSA- Association Algorithm In the high capacity channel BCN try to find a BN_A node with highest weight in its 1-hop neighborhood to associate with. If no neighboring BN is detected, the node attempts to associate with a BCN. And selecting among all its neighboring BCNs. BCN BN_A Weight=3 BN_A Weight=4 BN_A Weight=5 BCN Weight=3 BCN Weight=4 BCN Weight=5 一: high capacity channel 一: low capacity channel BN Hello message

20 MR-BSA- Association Algorithm In the low capacity channel BCNs and RNs try to find a BN node with highest weight to associate with. If no neighboring BN is detected, BCN or RN BN Weight=3 BN Weight=4 BN Weight=5 BCN or RN BCN 一: high capacity channel 一: low capacity channel BN Hello message +

21 MR-BSA- BCN to BN conversion Algorithm BCN to BN conversion algorithm executes based on high capacity channel neighborhood information. BN_A BN_BBN_C BCN

22 MR-BSA- BCN to BN conversion Algorithm

23 MR-BSA- BCN to BN conversion Algorithm Case : Client coverage condition RN BCN Weight=4 RN BCN Weight=5 BN_A BCN Weight=3 BCN 一: high capacity channel 一: low capacity channel

24 MR-BSA- BCN to BN conversion Algorithm Case : Local 2-hop BN_A connection BN_A BN_BBCN Weight=5 一: high capacity channel 一: low capacity channel BCN Weight=4

25 MR-BSA- BCN to BN conversion Algorithm Case : Local 2-hop BN_A and BN_C connection BN_A BCN Weight=5 BCN Weight=4 BN_C BCN BN

26 MR-BSA- BCN to BN conversion Algorithm Case : Local 3-hop BN_A connection BN_A BN_C BCN BN_C + + +

27 MR-BSA- BN to BCN conversion Algorithm BN to BCN conversion algorithm executes based on high capacity channel neighborhood information. During the execution of BN to BCN conversion algorithm BN also updates its role as BN_A,B or C BN_A BN_BBN_C BCN

28 MR-BSA- BN to BCN conversion Algorithm

29 MR-BSA- BN to BCN conversion Algorithm Case : Client coverage condition BN Weight=4 BN Weight=3 BCN 一: high capacity channel 一: low capacity channel RN

30 MR-BSA- BN to BCN conversion Algorithm Case : Local 2-hop BN_A connection BN_A BN_BBCN Weight=5 一: high capacity channel 一: low capacity channel BCN Weight=4

31 MR-BSA- BN to BCN conversion Algorithm Case : Local 2-hop BN_A and BN_C connection BN_A BCN Weight=4 BCN BN Weight=3 BN_C

32 MR-BSA- BN to BCN conversion Algorithm Case : Local 3-hop BN_A connection BN_A BN_C BN Weight=3 BCN Weight=5 BCN

33 Multi-Radio MBN On-Demand Routing (MR-MBNR) Through use of on-demand routing protocols such as Ad hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR), source-destination routes are discovered by flooding route request (RREQ) packets across the entire network.

34 Performance evaluation Simulation model QualNet V DCF MAC layer protocol Channel data rate 2Mbps Radio transmission range 300m Short_Timer:2secs Long_Timer:6secs The results have been averaged over 5 randomly generated topologies.

35 Performance evaluation- Backbone Network

36 Performance evaluation- Backbone Network

37 Performance evaluation

38 Performance evaluation- Throughput Performance (single channel)

39 Performance evaluation- Throughput Performance (single channel)

40 Performance evaluation- Throughput Performance (two channel) The notation “Lx” represents the results for setting the low capacity radio transmit power to x dBm.

41 Conclusions The MR-BSA scheme presented here Guarantees to construct and maintain a connected backbone network Reduce routing overhead and to provide scalable and efficient operation for the wireless network.