Joint Base Station and Relay Station Placement for IEEE 802.16j Networks Hsiao-Chen Lu and Wanjiun Liao Department of Electrical Engineering, National.

Slides:

Advertisements

Similar presentations

Joint Access Point Placement and Channel Assignment for Wireless LANs Xiang Ling School of Communication and Information Engineering University.

Advertisements

SELECT: Self-Learning Collision Avoidance for Wireless Networks Chun-Cheng Chen, Eunsoo, Seo, Hwangnam Kim, and Haiyun Luo Department of Computer Science,

22 nd September 2008 | Tariciso F. Maciel Suboptimal Resource Allocation for Multi-User MIMO-OFDMA Systems Tarcisio F. Maciel Darmstadt, 22 nd September.

College of Engineering Optimal Access Point Selection and Channel Assignment in IEEE Networks Sangtae Park Advisor: Dr. Robert Akl Department of.

Network Correlated Data Gathering With Explicit Communication: NP- Completeness and Algorithms R˘azvan Cristescu, Member, IEEE, Baltasar Beferull-Lozano,

Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks Xueyan Tang Jianliang Xu Sch. of Comput. Eng., Nanyang Technol. Univ.,

Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.

Globecom 2004 Energy-Efficient Self-Organization for Wireless Sensor Networks: A Fully Distributed approach Liang Zhao, Xiang Hong, Qilian Liang Department.

[1][1][1][1] Lecture 5-7: Cell Planning of Cellular Networks June 22 + July 6, Introduction to Algorithmic Wireless Communications David Amzallag.

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.

1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.

1 Cell Planning of 4G Cellular Networks David Amzallag Computer Science Department, Technion Joint work with Roee Engelberg (Technion), Seffi Naor (Microsoft.

Achieving Minimum Coverage Breach under Bandwidth Constraints in Wireless Sensor Networks Maggie X. Cheng, Lu Ruan and Weili Wu Dept. of Comput. Sci, Missouri.

1 A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer.

Adaptive Resource Allocation for Layer-Encoded IPTV Multicasting in IEEE WiMAX Wireless Networks Wen-Hsing Kuo, Wanjiun Liao, Tehuang Liu IEEE TRANSACTIONS.

MAXIMIZING SPECTRUM UTILIZATION OF COGNITIVE RADIO NETWORKS USING CHANNEL ALLOCATION AND POWER CONTROL Anh Tuan Hoang and Ying-Chang Liang Vehicular Technology.

SOS: A Safe, Ordered, and Speedy Emergency Navigation Algorithm in Wireless Sensor Networks Andong Zhan ∗ †, Fan Wu ∗, Guihai Chen ∗ ∗ Shanghai Key Laboratory.

Using Rotatable and Directional (R&D) Sensors to Achieve Temporal Coverage of Objects and Its Surveillance Application You-Chiun Wang, Yung-Fu Chen, and.

Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.

Constrained Green Base Station Deployment with Resource Allocation in Wireless Networks 1 Zhongming Zheng, 1 Shibo He, 2 Lin X. Cai, and 1 Xuemin (Sherman)

1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.

12. Feb.2010 | Christian Müller Distributed Resource Allocation in OFDMA-Based Relay Networks Christian Müller.

WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.

SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.

College of Engineering WiFi and WCDMA Network Design Robert Akl, D.Sc. Department of Computer Science and Engineering Robert Akl, D.Sc. Department of Computer.

IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.

Liping WANG 1, Yusheng JI 1,2, and Fuqiang Liu 3 1 The Graduate University for Advanced Studies, Tokyo, Japan 2 National Institute of Informatics, Tokyo,

DARP: Distance-Aware Relay Placement in WiMAX Mesh Networks Weiyi Zhang *, Shi Bai *, Guoliang Xue §, Jian Tang †, Chonggang Wang ‡ * Department of Computer.

College of Engineering Robert Akl, D.Sc. Department of Computer Science and Engineering.

On Placement and Dynamic Power Control Of Femto Cells in LTE HetNets

Chun Nie, Thanasis Korakis, and Shivendra Panwar Department of Electrical and Computer Engineering, Polytechnic University, Brooklyn A Multi-hop Polling.

Utility-Based Resource Allocation for Layer-Encoded IPTV Multicast Service in Wireless Relay Networks Shi-Sheng Sun, Yi-Chun Chen, Wanjiun Liao Department.

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.

Optimal Placement of Femto Base Stations in Enterprise Femtocell Networks Adviser: Frank, Yeong - Sung Lin Present by Li Wen Fang.

OFDMA Based Two-hop Cooperative Relay Network Resources Allocation Mohamad Khattar Awad, Xuemin (Sherman) Shen Student Member, IEEE Senior Member, IEEE.

QoS-guaranteed Transmission Scheme Selection for OFDMA Multi-hop Cellular Networks Jemin Lee, Sungsoo Park, Hano Wang, and Daesik Hong, ICC 2007.

Localized Algorithm for Aggregate Fairness in Wireless Sensor Networks Authors : Shigang Chen, Zhan Zhang CISE university of Florida CISE university of.

Mobile Masts Sri Lanka currently has no mobile phone network. Vodoofone wish to cover this Island with mobile phone masts to create a profitable network.

Capacity Enhancement with Relay Station Placement in Wireless Cooperative Networks Bin Lin1, Mehri Mehrjoo, Pin-Han Ho, Liang-Liang Xie and Xuemin (Sherman)

Bounded relay hop mobile data gathering in wireless sensor networks

A Joint Bandwidth Allocation and Routing Scheme for the IEEE 802

Opportunistic Fair Scheduling for the Downlink of Wireless Metropolitan Area Networks Mehri Mehrjoo, Mehrdad Dianati, Xuemin (Sherman) Shen, and.

A LOCALIZED SELF-HEALING ALGORITHM FOR NETWORKS OF MOVEABLE SENSOR NODES Mohamed Younis, Sookyoung Lee, Sheetal Gupta and Kevin Fisher Department of Computer.

Tung-Wei Kuo, Kate Ching-Ju Lin, and Ming-Jer Tsai Academia Sinica, Taiwan National Tsing Hua University, Taiwan Maximizing Submodular Set Function with.

IEEE j Relay-Based Wireless Access Networks VASKEN GENC, SEAN MURPHY, YANG YU, AND JOHN MURPHY, UNIVERSITY COLLEGE DUBLIN SCHOOL OF COMPUTER SCIENCE.

Dynamic Topology Control for Multi-hop Relaying in a Cellular TDD-OFDMA System Hye J. Kang, Hyun S. Ryu, and Chung G. Kang School of Electrical Engineering,

Multiple Frequency Reuse Schemes in the Two-hop IEEE j Wireless Relay Networks with Asymmetrical Topology Weiwei Wang a, Zihua Guo b, Jun Cai c,

Dae Wook Byun, Young Min Cho, Dong Ku Kim Yonsei University, School of Electrical and Electronic Engineering ICCIT 2008.

A Utility-based Mechanism for Broadcast Recipient Maximization in WiMAX Multi-level Relay Networks Cheng-Hsien Lin, Jeng-Farn Lee, Jia-Hui Wan Department.

Shibo He 、 Jiming Chen 、 Xu Li 、, Xuemin (Sherman) Shen and Youxian Sun State Key Laboratory of Industrial Control Technology, Zhejiang University, China.

3-Approximation Algorithm for Joint Routing and Link Scheduling in Wireless Relay Networks Chi-Yao Hong ( 洪啟堯 ) and Ai-Chun Pang ( 逄愛君 ) Dept. of Electrical.

Multicast Recipient Maximization in IEEE j WiMAX Relay Networks Wen-Hsing Kuo † ( 郭文興 ) & Jeng-Farn Lee ‡ ( 李正帆 ) † Department of Electrical Engineering,

1 Planning Base Station and Relay Station Locations in IEEE j Multi-hop Relay Networks Yang Yu, Seán Murphy, Liam Murphy Department of Computer Science.

Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.

An Orthogonal Resource Allocation Algorithm to Improve the Performance of OFDMA-based Cellular Wireless Systems using Relays Woonsik Lee, Minh-Viet Nguyen,

Tehuang Liu and Wanjiun Liao National Taiwan University, Taipei Taiwan IEEE GLOBECOM 2008.

ComNets, RWTH Aachen University Relays in CDMA2000 Martha Clavijo Chair of Communication Networks RWTH Aachen University, Germany FFV 2007, ,

Self-Organized Resource Allocation in LTE Systems with Weighted Proportional Fairness I-Hong Hou and Chung Shue Chen.

Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.

KAIS T Sensor Deployment Based on Virtual Forces Reference: Yi Zou and Krishnendu Chakarabarty, “Sensor Deployment and Target Localization Based on Virtual.

Optimal Relay Placement for Indoor Sensor Networks Cuiyao Xue †, Yanmin Zhu †, Lei Ni †, Minglu Li †, Bo Li ‡ † Shanghai Jiao Tong University ‡ HK University.

1 A Distributed Approach to Interference Mitigation between OFDM-based Systems Operating in License-exempt Spectrum Omar Ashagi, Sean Murphy and.

Cooperative Adaptive Partner Selection for Real-Time Services in IEEE j Multihop Relay Networks Cheng-Kuan Hsieh, Jyh-Cheng Chen, Jeng-Feng Weng.

Optimal Placement of Relay Infrastructure in Heterogeneous Wireless Mesh Networks by Bender’s Decomposition Aaron So, Ben Liang University of Toronto,

Performance Enhancement of Multirate IEEE WLANs with Geographically Scattered Stations 1 Duck-Yong Yang, 2 Tae-Jin Lee, 3 Kyunghun Jang, 3 Jin-Bong.

-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.

Backhaul-aware Robust 3D Drone Placement in 5G+ Wireless Networks

Presented by Hermes Y.H. Liu

A Near-Optimal Sensor Placement Algorithm to Achieve Complete Coverage/Discrimination in Sensor Networks Authors : Frank Y. S. Lin and P. L. Chiu, Student.

Presentation transcript:

Joint Base Station and Relay Station Placement for IEEE j Networks Hsiao-Chen Lu and Wanjiun Liao Department of Electrical Engineering, National Taiwan University,Taiwan IEEE GLOBECOM 2009

Outline Introduction System Model Problem Definition and Formulation The Two Stage BS and RS Deployment Algorithm Computational Experiments Conclusion

Introduction IEEE j Network components Base station (BS) Subscriber Station (SS) Mobile station (MS) Relay station (RS) BS SS MS RS

Transparent Model RS Non-Transparent Model RS Introduction IEEE j – Relay Station placement issue Low cost Throughput enhancement Coverage extension BS MS

Introduction-Motive and Goal Network planning problem Deploying a number of BSs and RSs to serve mobile stations distributed arbitrarily in a given geographic area. … … Deployment Let the cost is within the budget and the system capacity is maximized.

System Model Demand Node (d i ) W i = The number of the MS. W i = 10 Other Assumption Only consider at most two-hop relaying. Transparent and non-Transparent model. Candidate site for BS : b i Candidate site for RS : r i

= 6 Problem Definition and Formulation The Joint BS and RS Deployment Problem (JBRDP) Given the geographic area in which DNs are distributed, we want to determine the locations for a number of BSs and RSs, with the total cost within the pre-determined budget, such that each DN is covered by at least one BS or RS and the system capacity can be maximized. d i = 10 Mbps 60 Mbps

Problem Definition and Formulation Subject to constraints: b1= 1b1= 1 b2= 0b2= 0 b3= 0b3= 0 b4= 0b4= 0 b5= 0b5= 0 b6= 1b6= 1 b7= 0b7= 0 b8= 1b8= 1 b9= 0b9= 0 r1= 0r1= 0r2= 1r2= 1r3= 0r3= 0 r5= 0r5= 0r6= 0r6= 0r 7 =0 r9= 0r9= 0r 10 = 1r 11 = 0 r4= 0r4= 0 r8= 1r8= 1 r 12 = 1 r 13 = 1b 14 = 0r 15 =0r 16 = 0 (1) (2)

= 1 Problem Definition and Formulation Subject to constraints: (3) (4) djdj b i = 1 = 1 r i = 1

Problem Definition and Formulation Subject to constraints: r i = 1r j = 1 (5)

The Two Stage BS and RS Deployment Algorithm To find the placement of BSs and RSs for a specific deployment profile ( n B, n R ). The number of BSs deployed in the network. The number of RSs deployed in the network. (3) The Two Stage BS and RS Deployment Algorithm First Stage : BS Deployment Second Stage : RS Deployment input ( n B, n R ) output Deployment vector: B = [b 1 b 2... b N ] and R = [r 1 r 2... r M ].

The Two Stage BS and RS Deployment Algorithm First Stage : BS Deployment Second Stage : BS Deployment

First Stage : BS Deployment Determine a set of BS locations such that the longest distance between a DN and its nearest BS is minimized. The number of BSs deployed is equal to n B. The Two Stage BS and RS Deployment Algorithm NP-complete problem: the k-supplier problem [9] [9] “A unified approach to approximation algorithms for bottleneck problems,” Journal of the ACM, July V sup … V cust … Weight i = Distance i bibi didi B = n B

The Two Stage BS and RS Deployment Algorithm Second Stage : RS Deployment Achieve rate gain

Computational Experiments Simulator: The C++ program Simulation parameters The coverage radius of a BS7km The coverage radius of a RS4km L I ( The interference threshold for RSs )3km The deployment budget80 units The cost of a BS10 units The cost of a RS3 units 25 km 1 km

Computational Experiments

The network aggregate data rate versus the number of BSs and RSs deployed for the MS hotspot scenario

Computational Experiments The fairness index versus the number of BSs and RSs deployed for the MS hotspot scenario.

Conclusion This paper Formulate the joint BS and RS deployment problem under budget and coverage constraints as a capacity maximization problem. Design a two-stage network deployment algorithm which considers both issues of capacity enhancement. The numerical results indicate that deploying relay stations can enhance system capacity and fairness under the condition that the number of base stations deployed is not too small.

Thank you very much ~