1 / 28

A Novel Capacity Analysis for Wireless Backhaul Mesh Networks

A Novel Capacity Analysis for Wireless Backhaul Mesh Networks. Tein-Yaw David Chung, Kung-Chun Lee, and Hsiao-Chih George Lee Department of Computer Science and Engineering Yuan Ze University, Taiwan, R.O.C. April 1, 2008. Abstract. Primary design goal

lulu
Download Presentation

A Novel Capacity Analysis for Wireless Backhaul Mesh Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Novel Capacity Analysis for Wireless Backhaul Mesh Networks Tein-Yaw David Chung, Kung-Chun Lee, and Hsiao-Chih George Lee Department of Computer Science and Engineering Yuan Ze University, Taiwan, R.O.C. April 1, 2008

  2. Abstract • Primary design goal • To find an analytic method to determine the capacity upper bound for network planning of wireless backhaul mesh networks

  3. Outline • INTRODUCTION • RELATED WORK • SYSTEM MODEL • ANALYTIC ANALYSISAND SIMULATION RESULTS • CONCLUSION AND FUTURE WORK

  4. Architecture of Wireless Mesh Networks (WMNs) Subscriber Station (SS) Base Station (BS) Mesh Client Traffic on the backhaul Multi-hop forwarding Intra-flow & inter-flow INTRODUCTION Internet Internet Wireless MeshBackhaul SS SS BS SS SS SS Mesh Client Mesh Mesh Client Client Cellular Networks WiFi Networks Wireless Mesh Link Other type of link Intra-flow Intra-flow Inter-flow Inter-flow

  5. Wireless Mesh Network (WMN) Scheduling Centralized vs. distributed Transmission Time Division Duplex (TDD ) vs. FrequencyDivision Duplex (FDD) Internet Internet Wireless MeshBackhaul SS SS BS SS SS SS Mesh Client Mesh Mesh Client Client Cellular Networks WiFi Networks Wireless Mesh Link Other type of link Intra-flow Inter-flow Inter-flow Question: Capacity upper bound for inter-flow in centralized-control TDD-based WMNs

  6. RELATED WORK • Bottleneck Collision Domain (BCD) [7]  • Distributed • Pessimistic • Need simulation Bottleneck Collision Area (BCA) • Centralized • Optimistic  Tighter upper bound • A closed-from expression  Analytic  Readily used [7] J. Jun and M.L. Sichitiu, “The Nominal Capacity of Wireless Networks”

  7. SYSTEM MODEL Assumptions Transmission Single channel, single-radio (SC-SR) Omni-directional antenna Fixed transmission power *  Single-rate transmission * Interference model: Protocol model [2] Traffic Pattern Equal downlink and uplink inter-flows per node Shortest path routing MAC scheme Symmetric MACA  No overflow No contention No error [2] P. Gupta and P.R. Kumar, ``The Capacity of Wireless Networks."

  8. Internet Internet Wireless MeshBackhaul SS SS BS SS SS SS Mesh Client Mesh Mesh Client Client Cellular Networks WiFi Networks Wireless Mesh Link Other type of link Network Model • Network nodes • Infinity number of nodes * • Uniformly distributed • Centralizedscheduling • TDD (Time Division Duplex) Intra-flow Inter-flow

  9. Scheduling-Based Method • Period of schedule ε: (1) • Throughput over link lwith schedule ε is (2) where |εl| = number of timeslots assigned to εlW= channel capacity • Per-node capacity with schedule ε (3) 

  10. Ring-based Network Model

  11. Distance between two links • The maximum distance between their terminal nodes  [Case 1] Two p-links on a line [Case 2] Two p-links not on a line

  12. Minimum reuse distance,dreuse • [Case 1] Two p-links on a line

  13. [Case 2] Two p-links not on a line

  14. Collision area(CA) • An area in which no any two links can transmit simultaneously

  15. Maximal collision area • Two p-links on a line • The circle with diameterdreuse [Case 2] two p-links not on a line [Case 1] two p-links on a line

  16. Bottleneck collision area (BCA) • CA with the maximum traffic load. 

  17. ANALYTICAL ANALYSIS • Per-node capacity upper bound:  (12) wheren = number of SSs = density of SSs p = transmission range d= radius of the network W = channel capacity 

  18. For MC-MR WMNs, given n = number of nodes =per-node capacity c=number of non-overlapping channels m = number of radios per node through a proper channel assignment: • maximum per-node capacity = • maximum network capacity =

  19. 21% 3% Fig. 3 Per-node capacity with various p, where and n = 100.

  20. Fig. 4 Total capacity with various n, where and d = 1km.

  21. SIMULATION RESULTS Compare BCA BCD [7] Linear programming algorithm [4] [7] J. Jun and M.L. Sichitiu, “The Nominal Capacity of Wireless Networks” [4] M. Kodialam and T. Nandagopal, “On the Capacity Region of Multi-Radio Multi-Channel Wireless Networks”

  22. Fig. 5 Per-node capacity with various p, where , n = 100, d=1 km

  23. Fig. 6 Total capacity with various n, where , p = 1, and d = 0.5 km.

  24. CONCLUSION Bottleneck Collision Area (BCA) Analytic analysis Closed-form expression Tighter capacity upper bound Much larger than that of the BCD [7] Close to linear programming algorithm [4]

  25. FUTUR WORK Finite node density Non-uniform transmission power Multi-rate transmission p 25

  26. Thank you ! Q & A

  27. Q&A • Analytical (BCD) • Per-node capacity: (p)Asymmetricvs. Symmetric  • Per-node capacity: (d)Asymmetricvs. Symmetric  • Simulation (BCD, Algorithm [4], and BCD [7] • Per-node capacity: vs.  • Per-node capacity: (p)Asymmetricvs. Symmetric  • Per-node capacity: (n)Asymmetricvs. Symmetric 

  28. Reference I.F. Akyildiz and X. Wang,“A Survey on Wireless Mesh Networks,” IEEE Communications Magazine, vol. 43, Issue 9, September 2005. P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Transactions on Information Theory, March 2000. P. Kyasanur and N.H. Vaidya,“Capacity of Multi-Channel Wireless Networks: Impact of Number of Channels and Interfaces,” ACM Mobicom, August 2005. M. Kodialam and T. Nandagopal, “Characterizing the Capacity Region in Multi-Radio Multi-Channel Wireless Mesh Networks,” ACM Mobicom, August 2005. M. Kodialam and T. Nandagopal, “On the Capacity Region of Multi-Radio Multi-Channel Wireless Mesh Networks,” IEEE Workshop on Wireless Mesh Networks (WiMesh), September 2005. W. Wang and X. Liu, “A Framework for Maximum Capacity in Multi-channel Multi-radio Wireless Networks,” IEEE Consumer Communications and Networking Conference, 2006. J. Jun and M.L. Sichitiu, “The Nominal Capacity of Wireless Mesh Networks,” IEEE Wireless Communications Magazine, vol. 10, October 2003. M. Malekesmaeili, M. Shiva, M. Soltan, “Topology Optimization for Backbone Wireless Mesh Networks,” Fifth Annual Conference on Communication Networks and Services Research, 2007. X. Wu, J. Liu, and G. Chen, “Analysis of Bottleneck Delay and Throughput in Wireless Mesh Networks,” IEEE International Conference on Mobile Ad-hoc and Sensor Systems, 2006. E. Miorando and F. Granelli, “On Connectivity and Capacity of Wireless Mesh Networks,” IEEE International Conference on Communications, 2007. J. Huang, L. Wang, and C. Chang, "Coverage and capacity of a wireless mesh network," International Conference on Wireless Networks, Communications and Mobile Computing, vol. 1, June 2005. J. Huang, L. Wang and C. Chang, "Capacity and QoS for a scalable ring-based wireless mesh network," IEEE JSAC, vol. 24, November 2006. G. Mergen and L. Tong, “Stability and Capacity of Regular Wireless Networks,” IEEE Transactions on Information Theory, June 2005.

More Related