Presentation is loading. Please wait.

Presentation is loading. Please wait.

論文進度報告 蔡永斌 Tsai, Yung-Pin

Published byῬεβέκκα Μακρής Modified over 5 years ago

Similar presentations

Presentation on theme: "論文進度報告 蔡永斌 Tsai, Yung-Pin"— Presentation transcript:

1 論文進度報告 蔡永斌 Tsai, Yung-Pin
2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

2 Agenda Introduction Problem Formulation Lagrangean Relaxation
Background Motivation Literature Survey Problem Formulation Problem Description Lagrangean Relaxation Lagrangean relaxation problem Subproblems 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

3 Taxonomy of Wireless Networks
Networking Multi-hop Infrastructure-less Single-hop Wireless Wide Area Networks (WWANs) Mesh Networks (WMNs) Infrastructure-based Wireless Local (WLANs) Metropolitan (WMANs) Personal Area Networks (WPANs) 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

4 Infrastructure-based
Taxonomy of WMNs WMNs Infrastructure-based Infrastructure-less Hybrid Infrastructure/ backbone WMNs Client WMNs Hybrid WMNs 分類方法參考自: I. F. Akyildiz, X. Wang and W. Wang, “Wireless Mesh Networks: a Survey,” Computer Networks, Vol. 47, Issue 4, Pages , March 2005. 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

5 Infrastructure/backbone WMNs
圖擷取自: I. F. Akyildiz, X. Wang and W. Wang, “Wireless Mesh Networks: a Survey,” Computer Networks, Vol. 47, Issue 4, Pages , March 2005. 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

6 Motivation Performance limitation of multi-hop wireless networks:
Channel bandwidth is shared by a number of transmissions. Benefit gained through building relay nodes decreases when network grows. [1] Longer hop paths must bear significantly lower throughput compare with shorter paths. [2][3][4][5] The performance of the network can improve is limited, because the total network capacity has been constrained by network architecture. [1] P. Gupta and P. R. Kumar, “The Capacity of Wireless Networks,” IEEE Transactions on information theory, Vol. 46, No. 2, Pages , 2000. [2] I. F. Akyildiz, X. Wang and W. Wang, “Wireless Mesh Networks: a Survey,” Computer Networks, Vol. 47, Issue 4, Pages , March 2005. [3] B. Li, “End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks,” Proc. IEEE ICDCS’05. [4] V. Gambiroza, B. Sadeghi and E. W. Knightly, “End-to-End Performance and Fairness in Multihop Wireless Backhaul Networks,” Proc. ACM MobiCom, Pages , Sept.-Oct [5] Y. F. Wen and Frank Y. S. Lin, “The Top Load Balancing Forest Routing in Mesh Networks”, Proc. IEEE CCNC, pages , Jan 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

7 Motivation Even through during the operation stage we can deploy additional equipments or upgrade equipments to increase link capacity, throughput is not always raised[1]. The greatest motivation of our work: We consider end-to-end throughput fairness at network planning stage. Optimization issues like network deployment, channel assignment, routing and flow control are jointly considered in the WMNs deployment problem we addressed. With the objective to maximize the minimal end-to-end throughput, in other word, to maximize the total network capacity. [1] A. Tang, J. Wang and S. H. Low, “Counter-Intuitive Throughput Behaviors ini Networks Under End-to-End Control,” IEEE Transactions on Networking, Vol. 14, No. 2, Pages , April 2006. 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

8 Literature Survey Capacity of WMNs End-to-End Fairness of WMNs
IEEE s/D3 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

9 Agenda Introduction Problem Formulation Lagrangean Relaxation
Background Motivation Literature Survey Problem Formulation Problem Description Lagrangean Relaxation Lagrangean relaxation problem Subproblems 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

10 Capacity of WMNs The capacity of WMNs is influenced by many factors including :[1] Network architecture Network topology Traffic pattern Network node density Number of channels used for each node Transmission power level [1] I. F. Akyildiz, X. Wang and W. Wang, “Wireless Mesh Networks: a Survey,” Computer Networks, Vol. 47, Issue 4, Pages , March 2005. 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

11 Capacity of WMNs Capacity analysis of multi-hop wireless networks [1]
P. Gupta and P. R. Kumar Optimal placed and random placed multi-hop wireless networks Interference models: physical model and protocol model [1] P. Gupta and P. R. Kumar, “The Capacity of Wireless Networks,” IEEE Transactions on information theory, Vol. 46, No. 2, Pages , 2000. [2] L. Kleinrock and J. Silvester, “Optimum Transmission Radii for Packet Radio Networks or Why Six Is A Magic Number,” Proc. IEEE National Telecommunications Conference, Pages , December 1978. [3] E. M. Royer, P. M. M. Smith and L. E. Moser, “An Analysis of the Optimum Node Density for Ad hoc Mobile Networks,” Proc. IEEE ICC, Vol. 3, Pages , June 2001. [4] J. Gomez and A. T. Campbell, “Variable-Range Transmission Power Control in Wireless Ad Hoc Networks,” IEEE Transaction on Mobile Computing, Vol. 6, No. 1, Pages 87-99, January 2007. 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

12 Capacity of WMNs To increase the network capacity:
Multi-hop multi-channel multi-radio wireless networks [1, 2, 3, 4, 5] Joint channel assignment, link scheduling, routing algorithms [1, 2, 4, 5] End-to-end fairness bandwidth allocation The tradeoff between fair quality of service (QoS) and network performance [6] In WMNs, competitions for resources include inter-flow contention and intra-flow contention [6]. Max-min fairness model [1] H. Yu, P. Mohapatra and X. Lin, “Channel Assignment and Link Scheduling in Multi-Radio Multi-Channel Wireless Mesh Networks,” Mobile Networks and Applications, Vol. 13, Issue 1-2, Pages , April 2008. [2] M. Kodialam and T. Nandagopal, “Characterizing the Capacity Region in Multi-Radio Multi-Channel Wireless Mesh Networks,” Proc. MobiCom’05. [3] W. Wang and X. Liu, “A Framework for Maximum Capacity in Multi-channel Multi-radio Wireless Networks,” Proc. IEEE CCNC’06. [4] X. Y. Li, A. Nusairat, Y. Wu, Y. Qi, J. Zhao, X. Chu and Y. Liu, “Joint Throughput Optimization for Wireless Mesh Networks,” IEEE Transactions on Mobile Computing, Vol. 8, Issue 7, Pages , July 2009. [5] J. Tang, G. L. Xue and W. Y. Zhang, “Cross-Layer Optimization For End-To-End Rate Allocation in Multi-Radio Wireless Mesh Networks,” Wireless Networks, Vol. 15, No. 1, January 2009. [6] B. Li, “End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks,” Proc. IEEE ICDCS’05. 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

13 Inter-Flow Contention
In a single-hop wireless network: w2 : w1 = 1 : 2 F1 F2 2/3B 1/3B 參考自: B. Li, “End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks,” Proc. IEEE ICDCS’05. 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

14 Intra-Flow Contention
In a multi-hop wireless mesh network F1 F2.1 F2.2 F2.3 2/3B 1/9B r2 : r1 = 1 : 6 unfair 1/9B 1/3B 1/9B 參考自: B. Li, “End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks,” Proc. IEEE ICDCS’05. 2/5B 1/5B r2 : r1 = 1 : 2 FAIR 1/5B 3/5B 1/5B 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

15 End-to-End Fairness of WMNs
To achieve end-to-end throughput fairness: Bandwidth allocation [1] The method extends the per-hop link bandwidth allocation to multi-hop flow fairness. This kind of approaches can be achieved through flow control [1] B. Li, “End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks,” Proc. IEEE ICDCS’05. [2] Y.F. Wen, F.Y.S. Lin, Y.C. Tzeng and C.T. Lee, "Backhaul Assignment and Routing Algorithms with End-to-End QoS Constraints for Wireless Mesh Networks", Springer Wireless Personal Communications, Feb 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

16 End-to-End Fairness of WMNs
Cross-layer optimization approach [1] Rate allocation, routing, scheduling, transmission power control and channel assignment problems Max-min fairness (end-to-end throughput fairness) Multi-hop wireless network deployment [2] Backhaul and routing assignment problem which guarantees end-to-end delay fairness. In our research: Mesh router and backhaul assignment, power control, channel assignment, routing and flow control End-to-end throughput fairness [1] J. Tang, G. L. Xue and W. Y. Zhang, “Cross-Layer Optimization For End-To-End Rate Allocation in Multi-Radio Wireless Mesh Networks,” Wireless Networks, Vol. 15, No. 1, January 2009. [2] Y.F. Wen, F.Y.S. Lin, Y.C. Tzeng and C.T. Lee, "Backhaul Assignment and Routing Algorithms with End-to-End QoS Constraints for Wireless Mesh Networks", Springer Wireless Personal Communications, Feb 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

17 IEEE 802.11s IEEE 802.11s/D3 Internet
An enhancement of the original standard to support WLAN implementations for more flexible interoperable wireless connectivity. Internet Portal 1 Portal 2 AP MC1 MC2 MC3 MC4 MC5 MBSS infrastructure BSS Mesh STA 3 Mesh STA 7 Mesh STA 2 Mesh STA 6 Mesh STA 1 Mesh STA 8 Mesh STA 5 Mesh STA 4 圖文參考自: IEEE Standard, “Draft STANDARD for Information Technology- Telecommunications and information exchange- between systems- Local and metropolitan area networks- Specific requirements- Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications,” March 2009. infrastructure BSS 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

18 Agenda Introduction Problem Formulation Lagrangean Relaxation
Background Motivation Literature Survey Problem Formulation Problem Description Lagrangean Relaxation Lagrangean relaxation problem Subproblems 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

19 Problem Description Multi-hop Multi-radio Multi-channel Multi-mode WMN
Optimization issues: Mesh router and gateway assignment Channel assignment Routing Bandwidth allocation Objective: Maximize the total network capacity when achieve end-to-end throughput fairness 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

20 Problem Description K - The index set of all available non-overlapping channels For example, channels 1, 6, and 11 in 2.4 GHz Wi-Fi channels (IEEE b/g). W - The index set of all Origin-Destination pairs (OD-pairs) V - The index set of candidate locations for mesh routers N - The index set of all mobile clients L - The index set of all candidate links Q - The index set of all cliques constructed of candidate links Pw - The index set of all paths for OD-pair w 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

21 Problem Description Candidate Links
Two candidate location form a candidate link Dominated node Candidate Locations Mobile clients 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

22 Problem Description Cliques (in the contention graph) Clique
Form by one or more candidate links Clique k = 1 k = 2 k = 3 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

23 Problem Formulation Problem Assumptions
Each mesh router is stationary. Each mesh router can be equipped with multiple radios each of which operates on a particular and non-overlapping channel. Antennas are omni-directional. The routing path of each OD-pair is single path. Each mesh router has AP functionalities and can be upgraded to have gateway functionalities. Each mobile client must home to a mesh router and the selection is through system. Each mesh router and mobile client has the capability of perfect power control. Mobile clients are capable to use all available non-overlapping channels and the selection is through system. 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

24 Problem Formulation Given CLs for mesh routers
Positions and weighting factors for MCs Cost function of building a mesh router and additional cost to have gateway function Distances between nodes Maximum transmission range of each radio Limited number of available channels of each radio Budget constraint 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

25 Problem Formulation Objective: Subject to:
To maximize the minimum weighted end-to-end throughput Subject to: Budget constraint Mesh router and gateway assignment constraints Routing constraints Link constraints Channel capacity constraints Nodal capacity constraint Air-interface capacity constraint Link capacity constraints Integer constraints 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

26 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

27 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

28 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

29 Problem Formulation 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

30 Problem Formulation 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

31 Problem Formulation 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

32 Problem Formulation 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

33 Problem Formulation 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

34 Problem Formulation 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

35 Lagrangean Relaxation
Primal Problem Lagrangean Relaxation Problem Subproblem Lagrangean Dual Problem Optimal Solution Adjust Lagrangean Multipliers 2018/11/29

36 2018/11/29

37 Lagrangean Relaxation Problem
2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

38 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

39 Lagrangean Relaxation Problem
2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

40 Lagrangean Relaxation Problem
2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

41 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

42 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

43 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

44 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

45 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

46 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

47 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

48 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

49 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

50 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

51 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

52 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

53 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

54 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

55 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

56 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

57 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

58 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

59 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

60 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

61 Dual Problem & Subgradient Method
2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

62 Thanks For your listening
2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

63 Getting Primal Feasible Solution
Heuristic 1 Mesh router, gateway and radio assignment Routing Transmission range and link capacity Flow control 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

64 Heuristic for Mesh Router, Gateway and Radio Assignment
以LR problem中(SUB 8)所得的solution為起始值。因為這 樣的路徑規劃較有可能得到好的primal feasible solution。 將每個OD pair所選路徑上的每個mesh router建立起來， 將路徑終點的mesh router升級成gateway。並建立radio在 每個節點上。 若所花費成本大於預算，則選擇較不重要的link刪去。反 之則選擇較重要的link建立。 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

65 Heuristic for Routing 以最大化throughput為目標做routing
2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

66 Heuristic for Setting Transmission Range and Link Capacity
將每個radio的傳輸範圍設為該radio所需負責做transmitter 的link中最大的距離。 計算每個link的capacity 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

67 Heuristic for Flow Control
以Data Network中所提出的Max-min flow control來做 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

68 Getting Primal Feasible Solution
Heuristic 2 Mesh router, gateway and radio assignment Transmission range and link capacity flow control 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

69 Heuristic for Mesh Router, Gateway and Radio Assignment
以(SUB 1)所得的solution為起始值。 若花費成本大於預算，則選擇較不重要的link將兩端radio 刪除。 若花費成本尚未達到預算，則選擇較重要的link建立起來。 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

70 Heuristic for Setting Transmission Range and Link Capacity
將每個radio的傳輸範圍設為該radio所需負責做transmitter 的link中最大的距離。 計算每個link的capacity。 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

71 Heuristic for Routing and Flow Control
以最大化throughput為目標做routing 以Data Network中所提出的Max-min flow control來做 2018/11/29 Network Optimization Laboratory, Information Management Department, National Taiwan University

Download ppt "論文進度報告 蔡永斌 Tsai, Yung-Pin"

Similar presentations

University At Buffalo Capacity Of Ad-Hoc Networks Ajay Kumar.

University At Buffalo Capacity Of Ad-Hoc Networks Ajay Kumar.
1 Capacity analysis of mesh networks with omni or directional antennas Jun Zhang and Xiaohua Jia City University of Hong Kong.

1 Capacity analysis of mesh networks with omni or directional antennas Jun Zhang and Xiaohua Jia City University of Hong Kong.
Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.

Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.

Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Wide Area Wi-Fi Sam Bhoot. Wide Area Wi-Fi  Definition: Wi-Fi (Wireless Fidelity) n. – popular term for high frequency wireless local area networks operating.

Wide Area Wi-Fi Sam Bhoot. Wide Area Wi-Fi  Definition: Wi-Fi (Wireless Fidelity) n. – popular term for high frequency wireless local area networks operating.
CSE 6590 Department of Computer Science & Engineering York University 1 Introduction to Wireless Ad-hoc Networking 5/4/2015 2:17 PM.

CSE 6590 Department of Computer Science & Engineering York University 1 Introduction to Wireless Ad-hoc Networking 5/4/2015 2:17 PM.
Stony Brook Mesh Router: Architecting a Multi-Radio Multihop Wireless LAN Samir R. Das (Joint work with Vishnu Navda, Mahesh Marina and Anand Kashyap)

Stony Brook Mesh Router: Architecting a Multi-Radio Multihop Wireless LAN Samir R. Das (Joint work with Vishnu Navda, Mahesh Marina and Anand Kashyap)
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.

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.
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.

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.
CS541 Advanced Networking 1 Wireless Mesh Networks Neil Tang 1/26/2009.

CS541 Advanced Networking 1 Wireless Mesh Networks Neil Tang 1/26/2009.
LCN 2007, Dublin 1 Non-bifurcated Routing in Wireless Multi- hop Mesh Networks by Abdullah-Al Mahmood and Ehab S. Elmallah Department of Computing Science.

LCN 2007, Dublin 1 Non-bifurcated Routing in Wireless Multi- hop Mesh Networks by Abdullah-Al Mahmood and Ehab S. Elmallah Department of Computing Science.
Researches in MACS Lab Prof. Xiaohua Jia Dept of Computer Science City University of Hong Kong.

Researches in MACS Lab Prof. Xiaohua Jia Dept of Computer Science City University of Hong Kong.
CS541 Advanced Networking 1 Static Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks Neil Tang 3/9/2009.

CS541 Advanced Networking 1 Static Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks Neil Tang 3/9/2009.
Topology Control, Interference, and Throughput for Wireless Mesh Networks presented by Qin LIU.

Topology Control, Interference, and Throughput for Wireless Mesh Networks presented by Qin LIU.
Capacity of Ad Hoc Networks Quality of Wireless links Physical Layer Issues The Channel Capacity Path Loss Model and Signal Degradation 802.11 MAC for.

Capacity of Ad Hoc Networks Quality of Wireless links Physical Layer Issues The Channel Capacity Path Loss Model and Signal Degradation MAC for.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.

High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
A Fair Scheduling for Wireless Mesh Networks Naouel Ben Salem and Jean-Pierre Hubaux Laboratory of Computer Communications and Applications (LCA) EPFL.

A Fair Scheduling for Wireless Mesh Networks Naouel Ben Salem and Jean-Pierre Hubaux Laboratory of Computer Communications and Applications (LCA) EPFL.
Capacity of Wireless Mesh Networks: Comparing Single- Radio, Dual-Radio, and Multi- Radio Networks By: Alan Applegate.

Capacity of Wireless Mesh Networks: Comparing Single- Radio, Dual-Radio, and Multi- Radio Networks By: Alan Applegate.
A Fair Scheduling for Wireless Mesh Networks Naouel Ben Salem and Jean-Pierre Hubaux Laboratory of Computer Communications and Applications (LCA) EPFL.

A Fair Scheduling for Wireless Mesh Networks Naouel Ben Salem and Jean-Pierre Hubaux Laboratory of Computer Communications and Applications (LCA) EPFL.
Clustering in Mobile Ad hoc Networks. Why Clustering? –Cluster-based control structures provides more efficient use of resources for large dynamic networks.

Clustering in Mobile Ad hoc Networks. Why Clustering? –Cluster-based control structures provides more efficient use of resources for large dynamic networks.

Similar presentations

Ads by Google