Wireless Network Optimisation Mike Morgan. Categories of Wireless Device ➲ Fixed ● Physically fixed in position e.g. Antenna mounted on tower or rooftop.

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Advertisements

Exercises and Solutions Lecture 1
G5BAIM Artificial Intelligence Methods
COMP 482: Design and Analysis of Algorithms
INTRODUCTION TO COMPUTER NETWORKS Zeeshan Abbas. Introduction to Computer Networks INTRODUCTION TO COMPUTER NETWORKS.
What is a network? A network consists of two or more computers that are linked in order to share resources (such as printers and CD-ROMs) , exchange.
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
Eighth Edition by William Stallings
 Network topology is the layout pattern of interconnections of the various elements (links, nodes, etc.) of a computer.  Network topologies may be physical.
Introduction to Approximation Algorithms Lecture 12: Mar 1.
Deployment of Surface Gateways for Underwater Wireless Sensor Networks Saleh Ibrahim Advising Committee Prof. Reda Ammar Prof. Jun-Hong Cui Prof. Sanguthevar.
1 Optimisation Although Constraint Logic Programming is somehow focussed in constraint satisfaction (closer to a “logical” view), constraint optimisation.
Ryan Kinworthy 2/26/20031 Chapter 7- Local Search part 1 Ryan Kinworthy CSCE Advanced Constraint Processing.
[1][1][1][1] Lecture 2-3: Coping with NP-Hardness of Optimization Problems in Practice May 26 + June 1, Introduction to Algorithmic Wireless.
1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.
BA 471 – Telecommunications and Networking Dr. V.T. Raja Oregon State University
CSE 550 Computer Network Design Dr. Mohammed H. Sqalli COE, KFUPM Spring 2007 (Term 062)
1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.
MAE 552 – Heuristic Optimization Lecture 25 March 22, 2002 Topic: Tabu Search.
INTRODUCTION TO COMPUTER NETWORKS INTRODUCTION Lecture # 1 (
Network Done by: Athra sultan.
Growing the Network © 2004 Cisco Systems, Inc. All rights reserved. Choosing the Right Network Topology INTRO v2.0—3-1.
NETWORK TOPOLOGY. WHAT IS NETWORK TOPOLOGY?  Network Topology is the shape or physical layout of the network. This is how the computers and other devices.
NETWORK TOPOLOGY ALEGRIA GONZALEZ. WHAT IS A NETWORK TOPOLOGY?  a topology is a description of the of a network, including its  The physical topology.
Network Topologies.
NETWORKING CONCEPTS. Data Communication Communication is for sharing information Sharing can be local or remote Local communication between individuals.
Flow Models and Optimal Routing. How can we evaluate the performance of a routing algorithm –quantify how well they do –use arrival rates at nodes and.
Escaping local optimas Accept nonimproving neighbors – Tabu search and simulated annealing Iterating with different initial solutions – Multistart local.
Fast Spectrum Allocation in Coordinated Dynamic Spectrum Access Based Cellular Networks Anand Prabhu Subramanian*, Himanshu Gupta*,
Computer Network: It is group of interconnected computers and devices which are sharing the same communication infrastructure and communication protocols.
07/21/2005 Senmetrics1 Xin Liu Computer Science Department University of California, Davis Joint work with P. Mohapatra On the Deployment of Wireless Sensor.
Data Communications and Networking CSCS 311 Lecture 2 Amjad Hussain Zahid.
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Intro to Network Design
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Overview of Data Communications and Networking PART I.
Hybrid Cellular-Ad hoc Data Network Shuai Zhang, Ziwen Zhang, Jikai Yin.
CPT 307 Online Data Communications Overview of Data Communications & Networking Module 2 Kevin Siminski, Instructor.
Networks Network topologies. Networks Network topology Is the way the devices are arranged in a network In a wired network, it shows how the computers.
Abdullah Saad Ahmed Alqahtani ( ) AVP4/ VSAT.
How Networks work?.
-Network topology is the layout of the connection between the computers. -It is also known as the pattern in which computers.
1 EL736 Communications Networks II: Design and Algorithms Class7: Location and Topological Design Yong Liu 10/24/2007.
Prepared by:Ronnel P. Agulto, CpE Objectives Different types of topologies; Their advantages & disadvantages How to choose an appropriate topologies in.
Guide to Networking Essentials Fifth Edition Chapter 2 Network Design Essentials.
Network Topologies Created by: Ghadeer H. Abosaeed June 22, 2012.
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
Chapter 1 : Computer Networks.
1 3/13/ :25 Chapter 5Protocol Architecture1 Rivier College CS575: Advanced LANs Chapter 5: Protocol Architecture.
Chapter 2 Basic Concepts Line Configuration Topology Transmission Mode Categories of Networks Internetworks WCB/McGraw-Hill  The McGraw-Hill Companies,
Optimal Placement of Relay Infrastructure in Heterogeneous Wireless Mesh Networks by Bender’s Decomposition Aaron So, Ben Liang University of Toronto,
TOPOLOGIES in COMPUTER NETWORKING Refers to the physical layout of the network devices and cabling and how all the components communicate with each other.
3 rd lecture Presented by Dr. Sarah Mustafa Eljack.
Computer Networks Part 2
A greedy algorithm is an algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding.
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
LAN Topologies Part 1. What is topology? Topology is the physical or logical interconnection of communicating devices Physical Topology: LANtopology,
DakNet (WIRELESS TECHNOLOGY). What do you do when you want to provide Digital communication services Voice mail Digital documents Isolated Villages.
A Technical Seminar Presentation on WIMAX ( Worldwide Interoperability for Microwave Access ) BY M.K.V HARSHA VARDHAN REDDY-07K81A0440.
COMPUTER NETWORKS CS610 Lecture-13 Hammad Khalid Khan.
Overview of Data Communications and Networking
ElasticTree Michael Fruchtman.
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Nov. 7, 2000
Overview of Data Communications and Networking
Overview of Data Communications and Networking
X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.
CSE 550 Computer Network Design
Smart Grid Technology Discussions 2010
Presentation transcript:

Wireless Network Optimisation Mike Morgan

Categories of Wireless Device ➲ Fixed ● Physically fixed in position e.g. Antenna mounted on tower or rooftop ● Commonly used for broadband communications ➲ Portable ● Stays in place while being used, but can be picked up and moved to another location ➲ Mobile ● In motion during use

Fixed Wireless Network Types ➲ Point to Point ● Bus Topology ➲ Point to Multipoint ● Star Topology ➲ Consecutive Point ● Ring topology: some redundancy ● Hamiltonian Cycle ➲ Mesh ● Mesh Topology: better redundancy ● Design problem is very complex

Mesh Networks ➲ How many different ways can these nine devices be connected? ➲ Which one is the best?

Design of Mesh Networks ➲ Some devices perform the task of 'relaying' data on behalf of others. ➲ The equipment needed for relay devices is normally far more expensive than for ordinary terminals. ➲ Two design goals: ● The number of relays used ought to be kept to a minimum. ● The network should provide adequate redundancy and be able to handle traffic demands.

Heuristics ➲ It is not possible to evaluate all possible mesh structures within a useful time frame ➲ A smaller subset of possible network designs must be evaluated. Optimal answers cannot be guaranteed. ➲ How might it be possible to select good designs for evaluation among so many alternatives?

Construction methods ➲ Greedy construction searches build the network component by component. ● Start with nothing and add relays in until all objectives are satisfied. ● Start with a maximum number of relays and drop as many as possible without violating constraints ➲ These searches can be adapted using iteration, random factors and memory based techniques.

Perturbation Methods ➲ Make minor alterations to a current solution in the hope of finding an improvement. ➲ Also may be adapted using random factors and memory. ➲ Useful as a means of improving already promising solutions