Ad hoc Service Grid A Self-Organizing Infrastructure for Mobile Commerce

Similar documents
Ad hoc Service Grid A Self-Organizing Infrastructure for Mobile Commerce

Resource Control for Elastic Traffic in CDMA Networks

熊本大学学術リポジトリ. Kumamoto University Repositor

C. G. Cassandras and Y. Geng

A Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)

Utility-based Routing

Comparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate

Impact of Interference Model on Capacity in CDMA Cellular Networks. Robert Akl, D.Sc. Asad Parvez University of North Texas

Topology Control for C-RAN Architecture Based on Complex Network

Multi-sensor optimal information fusion Kalman filter with mobile agents in ring sensor networks

Enhancing Throughput in Wireless Multi-Hop Network with Multiple Packet Reception

Movement - Assisted Sensor Deployment

Approximating User Distributions in WCDMA Networks Using 2-D Gaussian

Distributed Uplink Scheduling in EV-DO Rev. A Networks

An Activity Based Mobility Prediction Strategy Using Markov Modeling for Wireless Networks

Coverage Maximization in Mobile Wireless Sensor Networks Utilizing Immune Node Deployment Algorithm

Beam quality measurements with Shack-Hartmann wavefront sensor and M2-sensor: comparison of two methods

Traffic balancing over licensed and unlicensed bands in heterogeneous networks

AN IMPROVED BIT LOADING TECHNIQUE FOR ENHANCED ENERGY EFFICIENCY IN NEXT GENERATION VOICE/VIDEO APPLICATIONS

An efficient cluster-based power saving scheme for wireless sensor networks

Resource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks

EE360: Lecture 7 Outline Cellular System Capacity and ASE Announcements Summary due next week

A New Type of Weighted DV-Hop Algorithm Based on Correction Factor in WSNs

Joint Adaptive Modulation and Power Allocation in Cognitive Radio Networks

Clustering Based Fractional Frequency Reuse and Fair Resource Allocation in Multi-cell Networks

Low Complexity Duty Cycle Control with Joint Delay and Energy Efficiency for Beacon-enabled IEEE Wireless Sensor Networks

FUTURE wireless systems will need to provide high data

Research Article A Utility-Based Rate Allocation of M2M Service in Heterogeneous Wireless Environments

Prevention of Sequential Message Loss in CAN Systems

Performance Evaluation of QoS Parameters in Dynamic Spectrum Sharing for Heterogeneous Wireless Communication Networks

Calculation of the received voltage due to the radiation from multiple co-frequency sources

Kalman Filter based Dead Reckoning Algorithm for Minimizing Network Traffic between Mobile Nodes in Wireless GRID

An Optimal Model and Solution of Deployment of Airships for High Altitude Platforms

Priority based Dynamic Multiple Robot Path Planning

Journal of Chemical and Pharmaceutical Research, 2016, 8(4): Research Article

Intelligent Management of Distributed Generators Reactive Power for Loss Minimization and Voltage Control

Challenges of Flexible Real-Time Communication

A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION

Throughput Maximization by Adaptive Threshold Adjustment for AMC Systems

Key-Words: - Automatic guided vehicles, Robot navigation, genetic algorithms, potential fields

Iterative Water-filling for Load-balancing in

Dynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University

Developing a Gesture Based Remote Human-Robot Interaction System Using Kinect

A Predictive QoS Control Strategy for Wireless Sensor Networks

The Detection Algorithms Performance in BLAST Enhanced IEEE a WLAN Standard on Measured Channels. University of Bristol

Define Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.

PAPER Effect of Joint Detection on System Throughput in Distributed Antenna Network

Correlation Analysis of Multiple-Input Multiple-Output Channels with Cross-Polarized Antennas

Smart Duty Cycle Control with Reinforcement Learning for Machine to Machine Communications

Automatic Decentralized Clustering for Wireless Sensor Networks

ANNUAL OF NAVIGATION 11/2006

Redes de Comunicação em Ambientes Industriais Aula 8

Electrical Capacitance Tomography with a Square Sensor

Study of the Improved Location Algorithm Based on Chan and Taylor

Centralized approach for multi-node localization and identification

MIMO-OFDM Systems. Team Telecommunication and Computer Networks, FSSM, University Cadi Ayyad, P.O. Box 2390, Marrakech, Morocco.

Fast Code Detection Using High Speed Time Delay Neural Networks

An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks

Optimal Grid Topology using Genetic Algorithm to Maintain Network Security

High Speed, Low Power And Area Efficient Carry-Select Adder

Data-Centric Attribute Allocation and Retrieval (DCAAR) Scheme for Wireless Sensor Networks

The Performance Improvement of BASK System for Giga-Bit MODEM Using the Fuzzy System

An Improved Method for GPS-based Network Position Location in Forests 1

Adaptive Distributed Topology Control for Wireless Ad-Hoc Sensor Networks

An Improved Weighted Centroid Localization Algorithm

Development of a High-Order Discontinuous Galerkin Fluid Solver Within SU2

An Adaptive Scheduling Algorithm for Set Cover Problem in Wireless Sensor Networks: A Cellular Learning Automata Approach

Analysis of Lifetime of Large Wireless Sensor Networks Based on Multiple Battery Levels

A Control and Communications Architecture for a Secure and Reconfigurable Power Distribution System: An Analysis and Case Study

Spectrum Co-existence of IEEE b and a Networks Using Reactive and Proactive Etiquette Policies

Wi-Fi Indoor Location Based on RSS Hyper-Planes Method

Context-aware Cluster Based Device-to-Device Communication to Serve Machine Type Communications

Algorithms Airline Scheduling. Airline Scheduling. Design and Analysis of Algorithms Andrei Bulatov

Target Channel Visiting Order Design Using Particle Swarm Optimization for Spectrum Handoff in Cognitive Radio Networks

Power Minimization Under Constant Throughput Constraint in Wireless Networks with Beamforming

On Channel Estimation of OFDM-BPSK and -QPSK over Generalized Alpha-Mu Fading Distribution

CONTROL AND OPTIMIZATION IN CYBERPHYSICAL SYSTEMS: FROM SENSOR NETWORKS TO "SMART PARKING" APPS. C. G. Cassandras

Channel Alternation and Rotation in Narrow Beam Trisector Cellular Systems

PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht

Fractional Base Station Cooperation Cellular Network

Cost Analysis and Efficient Radio Bearer Selection for Multicasting over UMTS

Fair Coalitions for Power-Aware Routing in Wireless Networks

Dynamic Resource Networks: Coordination and Control of Networks with Mobile Actuators and Sensors

Performance Analysis of Scheduling Policies for Delay-Tolerant Applications in Centralized Wireless Networks

COMPARISON OF DIFFERENT BROADCAST SCHEMES FOR MULTI-HOP WIRELESS SENSOR NETWORKS 1

Delay Constrained Fuzzy Rate Control for Video Streaming over DVB-H

Dynamic Resource Allocation Algorithm of UAS by Network Environment and Data Requirement

Performance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme

Frog Call-Inspired Self-Organizing Anti-Phase Synchronization for Wireless Sensor Networks

Research of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b

Test 2. ECON3161, Game Theory. Tuesday, November 6 th

Optimizing a System of Threshold-based Sensors with Application to Biosurveillance

Next Generation Wireless Networks: Research Challenges and Opportunities

The Effect Of Phase-Shifting Transformer On Total Consumers Payments

Utility-Based Power Control in Cellular Wireless Systems

Chalmers Publication Library. Copyright Notice

Optimization of transformer loading based on hot-spot temperature using a predictive health model

CELLULAR SYSTEM CAPACITY and PERFORMANCE IMPROVEMENT with SDMA

Distributed Channel Allocation Algorithm with Power Control

Optimum Allocation of Distributed Generations Based on Evolutionary Programming for Loss Reduction and Voltage Profile Correction

Transcription:

Ad hoc Servce Grd A Self-Organzng Infrastructure for Moble Commerce Klaus Herrmann, Kurt Gehs, Gero Mühl Berln Unversty of Technology Emal: klaus.herrmann@acm.org Web: http://www.vs.tu-berln.de/herrmann/ Oslo, Norway, September 17 th 2004 MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 1

Outlne > Ad hoc Servce Grd > General vson, advantages, and challenges > Research Focus > Self-organzng Servce Dstrbuton > Complementng Concepts > Summary and Conclusons MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 2

Wreless Servces at medum-szed Locatons > Locatons: > Constructon stes, hosptals, shoppng malls etc. > Servces (e.g. at a shoppng mall) > Local, faclty-specfc servces for local users > Examples: navgaton, product fnder, reservaton (e.g. restaurant) > Usng cellular phone networks > Non-local communcaton, expensve, low-bandwdth > Usng WLAN access pont technology > Wrng s extremely expensve(!), nflexble, centralzed server MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 3

Ad hoc Servce Grd > Basc dea: Use an ad hoc network > Dstrbuton of PC-lke computers (Servce Cubes) at the locaton > Wreless network nterface, power connector, no perpherals > Drect communcaton between neghborng Servce Cubes > Mult-hop communcaton between Cubes that are further apart > Users access servces va nearest Servce Cube > Advantages > Communcaton s free of charge, modest expenses for setup > No hgh ntal expenses for monolthc central server > Flexbly scalable: addng or removng Cubes durng runtme s easy MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 4

Example Setup: Shoppng Mall 90 m 180 m MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 5

General Challenges > Decentralzaton and Self-Organzaton > Dstrbuted resources Control and organzaton s dffcult > Servce nfrastructure should be nvsble > Mnmal manual nterventons > Self-organze and adapt to changng condtons > Personalzaton vs. prvacy and securty > Offer personalzed servces whle provdng prvacy > Interactons must be secure > Busness Models > Indrect revenue MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 6

Current Research Focus > Self-organzng dynamc servce dstrbuton > Dynamc replcaton and node selecton to meet current demand > Maxmze QoS: response tmes perceved by users > Mnmze network load, balance processng load > Servce lookup and dscovery > Enable users to dscover servces and fnd best servce replca > Data consstency > Acheve data consstency among replcated stateful servces > What does an overall ASG Mddleware/Servceware look lke? MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 7

Self-organzng Servce Dstrbuton > Installaton: one servce replca postoned arbtrarly > Clents start accessng the servce > Assumpton: Spatal dstrbuton of requests s non-unform > General Approach: Use request patterns to gude dstrbuton > Clents always choose closest servce > Request tree T s recorded at each servce replca s Cube > Servce s replcated or mgrated to request hot spots MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 8

Dstrbuton algorthm > Runs perodcally at the replca s Cube > Compute weghtng functon M n for each node n n the tree > Fnd nodes and j n request tree T such that > and j are not n the same subtree > M > M j > M k for all k wth k j > Mgrate servce to node f t s domnatng (M >> M k for k) > Replcate servce to and j f both are domnatng and the servcespecfc replca lmt has not been reached > Dssolve replca f dle for too long MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 9

Weghtnng Functon M n M n = ( D + ) ( ) n 1 Rn t = t k > Informally: Number of transmssons caused by n > Inputs > D n : Hop Dstance of node n from servce s node > R n (): Number of requests transmtted by node n at tme ndex > t: the current tme ndex > k: length of relevant request hstory tme wndow MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 10

Smple Example 1 2 3 4 5 Requests produced: 10 10 10 10 10 R n (): 50 40 30 20 10 D n +1: 1 2 3 4 5 =100 (transmtted) M n : 50 80 90 80 50 1 2 3 4 5 Requests produced: 10 10 10 10 10 R n (): 10 20 50 20 10 D n +1: 3 2 1 2 3 =60 (transmtted) M n : 30 40 50 40 30 MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 11

MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 12 Oscllaton Avodance > Mantan a hstory of adaptatons performed locally at each node > Adaptaton = (Destnaton, Request Tree) > Check for past adaptatons wth smlar Request Trees before performng an adaptaton > Smlarty of two trees T 1 and T 2 s gven by ( ) { } { } wth 1 2 2 1 1 2 1 2 1 2 1 2 1 + = r N r N N N M M M M T T s / /, = k k k k k j T r T N N M root node from ID of node IDs from Set of ff 0 : :

Emergent Effects > Replcas fnd postons where traffc s balanced > None of the nodes nvolved n the request flow stands out n terms of network load produced (no domnatng nodes) > Tunable parameter: Domnaton Factor > Preset lmt on per-servce number of replca controls the average dstance between servce and clents > Tunable Parameter: Replca Lmt > Oscllaton avodance reduces unnecessary adaptatons whle stll keepng the system reactve > Tunable Parameter: Smlarty Threshold > Processng load s balanced > Replcaton and choce of nearest servce by clents MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 13

Result Adaptve Reducton n overall Traffc Overall Transmssons #Transmssons 180 160 140 120 100 80 60 40 20 0 49900 99900 149900 199900 Tme [smulaton steps] MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 14

Work not Covered n the Talk > Dstrbuted lookup servce for moble servces > Forwardng of clent requests to current servce locaton > Lazy propagaton of locaton changes by snoopng meta nformaton pggybacked n servce reples Self-reparng > Data consstency n stateful servces > Weak, optmstc consstency model (nspred by Bayou) > Current work! > Archtectural mplcatons on overall mddleware > Puttng t all together > Past, current, and future work! MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 15

Summary and Conclusons > Ad hoc Servce Grd: Basc vson for a servce provsonng platform for medum-szed locatons > Conceptual groundwork (algorthms and protocols) > Self-organzng servce dstrbuton > Smple, usage-drven algorthm > Transmsson hot spots attract servces untl network load s balanced > Oscllaton s damped whle the system remans reactve to changes > Network load s reduced MOBIS 04 - Oslo - 17.9.4 Herrmann/Gehs/Mühl - Ad hoc Servce Grd 16

Thank you. Queston and comments are welcome. Klaus Herrmann klaus.herrmann@acm.org Intellgent Networks and Management of Dstrbuted Systems Berln Unversty of Technology www.vs.tu-berln.de

Telecommuncatons Insttute Faculty IV Electrcal Engneerng & Computer Scence TU Berln phone: +49 30 314-79830 fax: +49 30 314-24573 offce@vs.tu-berln.de Secretary EN 6 Enstenufer 17 EN-Gebäude D-10587 Berln Germany Intellgent Networks and Management of Dstrbuted Systems