The Influence Mobility Model: A Novel Hierarchical Mobility Modeling Framework Muhammad U. Ilyas and Hayder Radha Michigan State University.

Slides:

Advertisements

Similar presentations

1 Gesture recognition Using HMMs and size functions.

Advertisements

Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.

8.3 Representing Relations Connection Matrices Let R be a relation from A = {a 1, a 2,..., a m } to B = {b 1, b 2,..., b n }. Definition: A n m  n connection.

Matrices, Digraphs, Markov Chains & Their Use by Google Leslie Hogben Iowa State University and American Institute of Mathematics Leslie Hogben Iowa State.

Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.

Nonparametric Link Prediction in Dynamic Graphs Purnamrita Sarkar (UC Berkeley) Deepayan Chakrabarti (Facebook) Michael Jordan (UC Berkeley) 1.

An Introduction to Variational Methods for Graphical Models.

A Probabilistic Model for Road Selection in Mobile Maps Thomas C. van Dijk Jan-Henrik Haunert W2GIS, 5 April 2013.

® IBM Software Group © 2006 IBM Corporation Rational Software France Object-Oriented Analysis and Design with UML2 and Rational Software Modeler 04. Other.

. Markov Chains as a Learning Tool. 2 Weather: raining today40% rain tomorrow 60% no rain tomorrow not raining today20% rain tomorrow 80% no rain tomorrow.

Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.

Entropy Rates of a Stochastic Process

Matrices, Digraphs, Markov Chains & Their Use. Introduction to Matrices  A matrix is a rectangular array of numbers  Matrices are used to solve systems.

Tutorial 8 Markov Chains. 2  Consider a sequence of random variables X 0, X 1, …, and the set of possible values of these random variables is {0, 1,

6.896: Probability and Computation Spring 2011 Constantinos (Costis) Daskalakis lecture 2.

More on Rankings. Query-independent LAR Have an a-priori ordering of the web pages Q: Set of pages that contain the keywords in the query q Present the.

1 Hierarchical Image-Motion Segmentation using Swendsen-Wang Cuts Adrian Barbu Siemens Corporate Research Princeton, NJ Acknowledgements: S.C. Zhu, Y.N.

Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.

Computational Methods for Management and Economics Carla Gomes Module 9a Network Models Terminology (Slides adapted from J.Orlin’s)

Network Coding Project presentation Communication Theory 16:332:545 Amith Vikram Atin Kumar Jasvinder Singh Vinoo Ganesan.

1 Markov Chains Algorithms in Computational Biology Spring 2006 Slides were edited by Itai Sharon from Dan Geiger and Ydo Wexler.

EAs for Combinatorial Optimization Problems BLG 602E.

CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.

Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.

A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.

EECC694 - Shaaban #1 lec #7 Spring The OSI Reference Model Network Layer.

CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.

Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.

Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.

Entropy Rate of a Markov Chain

CSCI-455/552 Introduction to High Performance Computing Lecture 18.

1 Applications of Relative Importance  Why is relative importance interesting? Web Social Networks Citation Graphs Biological Data  Graphs become too.

Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.

Computer Science 112 Fundamentals of Programming II Introduction to Graphs.

LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G.

+ Mayukha Bairy Disk Intersection graphs and CDS as a backbone in wireless ad hoc networks.

Lecture 8: Generalized Linear Models for Longitudinal Data.

Adaptive CSMA under the SINR Model: Fast convergence using the Bethe Approximation Krishna Jagannathan IIT Madras (Joint work with) Peruru Subrahmanya.

GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,

Nyhoff, ADTs, Data Structures and Problem Solving with C++, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Graphs.

Handover and Tracking in a Camera Network Presented by Dima Gershovich.

Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Neural Networks Design  Motivation  Evolutionary training  Evolutionary design of the architecture.

GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.

Markov Cluster (MCL) algorithm Stijn van Dongen.

CS774. Markov Random Field : Theory and Application Lecture 02

Data Structures & Algorithms Graphs

 { X n : n =0, 1, 2,...} is a discrete time stochastic process Markov Chains.

Topics Paths and Circuits (11.2) A B C D E F G.

Relevant Subgraph Extraction Longin Jan Latecki Based on : P. Dupont, J. Callut, G. Dooms, J.-N. Monette and Y. Deville. Relevant subgraph extraction from.

Network Community Behavior to Infer Human Activities.

Joint Power and Channel Minimization in Topology Control: A Cognitive Network Approach J ORGE M ORI A LEXANDER Y AKOBOVICH M ICHAEL S AHAI L EV F AYNSHTEYN.

Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.

Data Structures & Algorithms Graphs Richard Newman based on book by R. Sedgewick and slides by S. Sahni.

GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,

10.1 Properties of Markov Chains In this section, we will study a concept that utilizes a mathematical model that combines probability and matrices to.

Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”

15 October 2012 Eurecom, Sophia-Antipolis Thrasyvoulos Spyropoulos / Absorbing Markov Chains 1.

Progress Report ekker. Problem Definition In cases such as object recognition, we can not include all possible objects for training. So transfer learning.

A New Class of Mobility Models for Ad Hoc Wireless Networks Rahul Amin Advisor: Dr. Carl Baum Clemson University SURE 2006.

1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.

Verein Konstantin Melnik Svetlana

A Place-based Model for the Internet Topology Xiaotao Cai Victor T.-S. Shi William Perrizo NDSU {Xiaotao.cai, Victor.shi,

Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.

Random Walk for Similarity Testing in Complex Networks

School of Computing Clemson University Fall, 2012

Restricted Boltzmann Machines for Classification

Complex Networks: Connectivity and Functionality

An Introduction to Variational Methods for Graphical Models

Graph Operations And Representation

A mesoscopic approach to model path choice in emergency condition

Presentation transcript:

The Influence Mobility Model: A Novel Hierarchical Mobility Modeling Framework Muhammad U. Ilyas and Hayder Radha Michigan State University

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Motivation  Many mobility models used for design and testing of ad-hoc networks are random mobility models.  Group mobility models bring some structure to completely random entity mobility models.  Today’s mobility models seem to ignore one important characteristic of mobile nodes, i.e. different classes of nodes influence each other.

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Previous Work Based on the works of…  Chalee Asavathiratham’s work on the “Influence Model” presented in his doctoral dissertation.  Jin Tiang et al. work on “Graph-based mobility models”.

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Feature Wishlist for the “Ideal” Mobility Model  Task based movement  Path selection  Node classification  Class transition  Dependence/ Influence  Scale invariance   (  )    

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Current Work: Scope  Obtain a graph-based representation of the simulated scenario based on paths on geographical map. –Step 1: Determine the different types of nodes in the simulated scenario. –Step 2: Build a graph-based transportation network (transnet) for each node type/ mode of transportation. –Step 3: Combine/ connect transnets.  Determine network influence matrix D.

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Graph-based Representation of Simulation Plane  Determine number of node classes.  Cut up the map of the area being simulated into sites (vertices) in which mobility of nodes belonging to the same class is described by the same set of parameters.  Determine paths between sites (edges) and obtain a transportation subnet.  Repeat for all node classes.  Interconnect vertices of different transportation subnets where nodes change over from one subnet to another. Output: A set of interconnected transportation subnets.

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Graph-based Representation of Simulation Plane G: Connectivity Matrix Consists of submatrices G ij Basic elements of G are 1s and 0s

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Graph-based Representation of Simulation Plane  This form of representation of the simulation area by means of the connectivity matrix G restricts the movement of nodes.

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Markov Chains vs. Influence Model  Similarities –Both Markov Chains (MC) and the Influence Model (IM) can be defined by stochastic matrices and be graphically represented as weighted di-graphs.  Differences –A Markov Chain describes the state of a system and the transition probabilities to other states conditional on the current state. –The Influence Model describes the states of a number of systems equal to the number of vertices in the graph.

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Markov Chains vs. Influence Model  Differences (Cont’d): –In MC the edge weights on outgoing edges represent the transition probabilities. –In the IM the edge weights on incoming edges represent the magnitude of the influence from other nodes. –MC and the IM differ in their evolution equations.

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Markov Chains vs. Influence Model A C B A C B

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Binary Influence Model  Evolution Equations for Binary Influence Model  D network influence matrix (nxn)  r[k+1] probability vector (nx1)  s[k] status vector (nx1)  Bernoulli() coin flipping function

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Binary Influence Model  The Binary Influence Model (BIM) restricts the states to be either 0 or 1.  We are using the BIM in the Influence Mobility Model to model states of sites as either free/ accessible or congested/ inaccessible.

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Example: Pedestrian Crossing  Note: We used a special form of the Binary Influence Model, the “Evil Rain Model” for this particular example.Evil Rain Model

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Example: Pedestrian Crossing

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Example: Pedestrian Crossing

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Future Work  Replacing the Binary Influence Model with the General Influence Model.  Associating costs with the links on the connectivity matrix and allocating limited budgets to individual nodes.  A routing algorithm that routes nodes through the transnets within budget constraints.

Thank You Q&A

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Evil Rain Model

Wireless And Video Communications (WAVES) Lab ECE: Michigan State University Example 2: Intra-state Travel Link Number Time