WANG, Wen-Chieh (Jeffrey) HSU, Chien-Liang

Slides:



Advertisements
Similar presentations
Cellular Telephone Networks By: Sultan Alshaek. Outline: Cellular telephone definition. Cellular telephone advantages. Cellular telephone Concept. Simple.
Advertisements

Green Network Project Contract
Chapter 7 1 Cellular Telecommunications Systems Abdulaziz Mohammed Al-Yami
The role of virtualisation in the dense wireless networks of the future Sokol Kosta CINI.
Robot Sensor Networks. Introduction For the current sensor network the topography and stability of the environment is uncertain and of course time is.
Sonar and Localization LMICSE Workshop June , 2005 Alma College.
CSLI 5350G - Pervasive and Mobile Computing Week 6 - Paper Presentation “Exploiting Beacons for Scalable Broadcast Data Dissemination in VANETs” Name:
TDMA based MAC protocol to assist in Wide area Sensor Network Deployment Nuwan Gajaweera.
1 Channel Assignment Strategies Handoff (Handover) Process Handoff: Changing physical radio channels of network connections involved in a call,
Yu Stephanie Sun 1, Lei Xie 1, Qi Alfred Chen 2, Sanglu Lu 1, Daoxu Chen 1 1 State Key Laboratory for Novel Software Technology, Nanjing University, China.
22 nd September 2008 | Tariciso F. Maciel Suboptimal Resource Allocation for Multi-User MIMO-OFDMA Systems Tarcisio F. Maciel Darmstadt, 22 nd September.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
Chapter 4 DECISION SUPPORT AND ARTIFICIAL INTELLIGENCE
Concurrent Processes Lecture 5. Introduction Modern operating systems can handle more than one process at a time System scheduler manages processes and.
Overview.  UMTS (Universal Mobile Telecommunication System) the third generation mobile communication systems.
Dynamic Load Balancing Experiments in a Grid Vrije Universiteit Amsterdam, The Netherlands CWI Amsterdam, The
MAXIMIZING SPECTRUM UTILIZATION OF COGNITIVE RADIO NETWORKS USING CHANNEL ALLOCATION AND POWER CONTROL Anh Tuan Hoang and Ying-Chang Liang Vehicular Technology.
Lecture 2 The Cellular Concept Prof. Shamik Sengupta Office 4210 N Fall 2010.
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.
Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.
Regional Traffic Simulation/Assignment Model for Evaluation of Transit Performance and Asset Utilization April 22, 2003 Athanasios Ziliaskopoulos Elaine.
GSM Signaling Protocol Architecture. Protocols above the link layer of the GSM signaling protocol architecture provide specific functions: Radio Resource.
Handoff in Cellular Systems By: Sireesha Vempati. Venkata Uppuluri. Vijaya Petla.
MohammaD AL-Khuffash, Rasool Bani Matar, Raja’y Kelany GSM Network Planning For Nablus City ( Third Phase ) Submitted to: Dr.Jamal Kharosha.
CELLULAR NETWORK. Early mobile system Cellular Network Use of one powerful transmitter located on high location. Range of signals was upto 50km. These.
1 Announcements The fixing the bug part of Lab 4’s assignment 2 is now considered extra credit. Comments for the code should be on the parts you wrote.
Advanced Spectrum Management in Multicell OFDMA Networks enabling Cognitive Radio Usage F. Bernardo, J. Pérez-Romero, O. Sallent, R. Agustí Radio Communications.
Cellular Network Concepts and Design
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
EELE 5490, Fall, 2009 Wireless Communications Ali S. Afana Department of Electrical Engineering Class 4 Sep. 30 th, 2009.
QoS-guaranteed Transmission Scheme Selection for OFDMA Multi-hop Cellular Networks Jemin Lee, Sungsoo Park, Hano Wang, and Daesik Hong, ICC 2007.
1 Blind Channel Identification and Equalization in Dense Wireless Sensor Networks with Distributed Transmissions Xiaohua (Edward) Li Department of Electrical.
RADAR: an In-building RF-based user location and tracking system
Capacity Enhancement with Relay Station Placement in Wireless Cooperative Networks Bin Lin1, Mehri Mehrjoo, Pin-Han Ho, Liang-Liang Xie and Xuemin (Sherman)
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
1 On Optimal Worst-Case Matching Cheng Long (Hong Kong University of Science and Technology) Raymond Chi-Wing Wong (Hong Kong University of Science and.
FREQUENCY MANAGEMENT AND CHANNEL ASSIGNMENT
A Wireless Design Tool 學生 : 陳信旭 學號 :s Outline ‧ INTRODUCTION ‧ DESIGN CHALLENGES ‧ DESIGN PROCEDURE WITHOUT ROLLABOUT ‧ ROLLABOUT DESIGN TOOL OVERVIEW.
Energy Efficient Spectrum Allocation for Green Radio in Two-tier Cellular Networks Wenchi Cheng, Hailin Zhang, Liqiang Zhao and Yongzhao Li Global Telecommunications.
Optimization Problems
2011 ULTRA Program: Green Radio Prof. Jinho Choi College of Engineering Swansea University, UK.
Reuse Partitioning in Fixed Two-hop Cellular Relaying Network Reporter: Yi-Harn Lin Date: 2006/05/10.
CISC 849 : Applications in Fintech Namami Shukla Dept of Computer & Information Sciences University of Delaware iCARE : A Framework for Big Data Based.
CDMA Systems. 2 How does CDMA work? Each bit (zero or one) is spread into N smaller pulses/chips (a series of zeros and ones). The receiver which knows.
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.
Joint Base Station and Relay Station Placement for IEEE j Networks Hsiao-Chen Lu and Wanjiun Liao Department of Electrical Engineering, National.
Thought of the day Thought of the day Difference between science and spirituality is same as the difference between word and silence. Sameer Trapasiya.
Self-Organized Resource Allocation in LTE Systems with Weighted Proportional Fairness I-Hong Hou and Chung Shue Chen.
Progress Report Green Network Project Haluk Celebi Manu Dhundi Nourah Alhassoun Sushant Bhardwaj Yasser Mohammed.
Unit 4 Cellular Telephony
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Supervisors:Dr. Yehuda Ben-Shimol Mr. Itzik Kitroser Alon Tzulang &Tseela Matsry Present:
A Presentation on Adaptive Neuro-Fuzzy Inference System using Particle Swarm Optimization and it’s Application By Sumanta Kundu (En.R.No.
Traffic Simulation L2 – Introduction to simulation Ing. Ondřej Přibyl, Ph.D.
Optimization Problems
IMPROVING OF WIRELESS MESH NETWORKS.
Cellular Networks Wireless Transmission Cellular Concept
Fundamentals of Cellular Networks (Part IV)
Fundamentals of Cellular Networks (Part II)
ECE 7930 Advanced Topics in Wireless Networks
GPSR Greedy Perimeter Stateless Routing
Concept of Power Control in Cellular Communication Channels
Opportunity Driven Multiple Access
Authors: Ing-Ray Chen; Yating Wang Present by: Kaiqun Fu
Optimization Problems
MITP 413: Wireless Technologies Week 3
Cellular Telephone Networks
Chrysostomos Koutsimanis and G´abor Fodor
Cellular Systems.
Presentation transcript:

Siting Mobile Phone Base Stations a GRASS application on location selection WANG, Wen-Chieh (Jeffrey) HSU, Chien-Liang Chaoyang University of Technology

GRASS: Siting Mobile Phone Base Stations Outline Introduction Basic Concepts Implementation Verification Conclusion 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 1. Introduction 1.1 Background 1.2 Objectives 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 1.1 Background Quality of service vs. health concerns Siting mobile phone base stations is often a fierce issue in Taiwan, because: Densely populated urbanized areas occupied by high-rise buildings The NIMBY-ism and unfair compensation Intense competition, secrecy, and under the counter deals 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 1.2 Objectives Create a freely available solution to foster the knowledge dissemination and open discussion of siting mobile phone base stations. Serve as an experiment to learn and test GRASS’s LOS and other raster processing capabilities 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 2. Basic Concepts 2.1 Mobile phone system 2.2 Base station characteristics 2.3 Assumptions 2.4 Rationale of the solution 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 2.1 Mobile Phone System MS BS MTX [Courtesy of Wikipedia] 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

2.2 Base Station Characteristics On the supply side Signal strength Channel capacity On the demand side Terrain Spatial distribution of mobile stations [Courtesy of Wikipedia] 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 2.3 Assumptions Mobile phone system’s radio signal behaves like light Only works on the “macro” type of cell There are four different cell sizes in a GSM network - macro, micro, pico and umbrella cells. 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

2.4 Rationale of the Solution From a “worm’s eye view’: Only those BS a MS can see can serve it. Only those BS within service distance is qualified. Closer BS, i.e. stronger signal, is preferred. Preferred BS must still have capacity to serve. Go through every possible combination to find the optimal set of BS. 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 3. Implementation 3.1 Some compromises 3.2 The algorithm 3.3 The code structures 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 3.1 Some Compromises A deterministic approach to a stochastic process Use readily available UNIX tools instead of low-level programming Raster-based GIS tools and execution speed limit the precision 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 3.2 The Algorithm (1) Prepare the DTM and MS distribution map. Create a BS’s distance map. Block those distances over limit to create the availability mask. Create the BS’s visibility map through line-of-sight (LOS) analysis. Remove “invisible” areas from the availability mask. Save the availability mask for later use. Assign MS demands to it, from near to far, until reaching its capacity. 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 3.2 The Algorithm (2) Repeat step 2 through 7 for every other BS. Select a set of BS and create the set’s assignment map. Prepare each BS’s distance map so that those unavailable areas have extremely high value. Identify each cell’s closest BS and record that BS in the assignment map. Repeat step 9 through 12 for every possible BS set. Examine and compare all sets’ result to find the optimal combination of BS. 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

3.3.1 Code Listing of bs.test.sh #!/bin/sh if test "$GISBASE" = ""; then echo "You must be in GRASS to run this program." exit fi bs.dist.sh 1 125 1425 bs.dist.sh 2 525 1825 bs.dist.sh 3 575 2175 bs.dist.sh 4 525 2175 bs.dist.sh 5 675 2525 bs.dist.sh 6 625 2725 bs.dist.sh 7 675 2775 bs.dist.sh 8 1275 3425 bs.dist.sh 9 2275 3425 bs.dist.sh 10 2675 3475 bs.dist.sh 11 2225 3075 bs.dist.sh 12 2525 2275 bs.site.sh 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

3.3.2 Code Structure of bs.dist.sh 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

3.3.3 Code Structure of bs.site.sh 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 4. Verification 4.1 The site 4.2 Results 4.3 Discussion 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 4.1 The Site (1) 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 4.1 The Site (2) 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 4.2 Results (1) bs.dist.sh result for BS3 bs.dist.sh result for BS4 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 4.2 Results (2) bs.dist.sh result for BS5 bs.site.sh result 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 4.3 Discussion 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 5. Conclusion 5.1 Summary 5.2 Further work 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 5.1 Summary The BS siting problem is one type of the broader location-allocation problems. The LOS-based GRASS application does provide an intuitive approach to the BS siting problem. The current bottleneck of obtaining a solution is not at the LOS computation but at the assignment of BS capacities to MS demands from near to far. 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

GRASS: Siting Mobile Phone Base Stations 5.2 Further Work Short-term: Improve the robustness of the code so that under no circumstance will there be unused BS capacities. Revise the code to provide more automation and execution efficiency. Long-term: Use a stochastic simulation instead of the deterministic heuristic to reflect the true nature of people making phone calls. Replace the simple LOS analysis with a more realistic method to model the behavior of mobile phone radio signal. 09/14 FOSS4G2006 GRASS: Siting Mobile Phone Base Stations

Comments And Questions The End Comments And Questions