General Ripple Mobility Model Chun-Hung Chen 2006.05.16 Dept. of CSIE National Taipei University of Technology.

Slides:



Advertisements
Similar presentations
Mobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future.
Advertisements

Function Rules, Tables and Graphs
1 Analysis of Random Mobility Models with PDE's Michele Garetto Emilio Leonardi Politecnico di Torino Italy MobiHoc Firenze.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Section 3 - The Behavior of Waves
Designing An g Ad-hoc Network for Multimedia Communication Chung-Wei Lee & Jonathan C.L. Liu Presented By: Mahendra Kumar.
CHAPTER 1 Exploring Data
Statistics 1: Introduction to Probability and Statistics Section 3-3.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) Milan Vojnovic (Microsoft Research Cambridge)
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
Evaluate IEEE e EDCA Performance Tyler Ngo CMPE 257.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (II) 11th Week
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Sections : Dispatching rules and filtered beam search.
1 A Novel Binary Particle Swarm Optimization. 2 Binary PSO- One version In this version of PSO, each solution in the population is a binary string. –Each.
Mobility Models in Mobile Ad Hoc Networks Chun-Hung Chen 2005 Mar 8 th Dept. of Computer Science and Information Engineering National Taipei University.
Impact of Different Mobility Models on Connectivity Probability of a Wireless Ad Hoc Network Tatiana K. Madsen, Frank H.P. Fitzek, Ramjee Prasad [tatiana.
Physics 121 Topics: Course announcements Quiz
Measuring Motion Chapter 1 Section 1.
5-Minute Check on Section 2-1a Click the mouse button or press the Space Bar to display the answers. 1.What does a z-score represent? 2.According to Chebyshev’s.
Sector Search Pattern HEY! I’M OVER HERE !!!. Characteristics: v Used in small search areas v There is a good starting point v Small search objects Sector.
Jeopardy Q $100 Q $200 Q $300 Q $400 Q $500 Q $100 Q $200 Q $300 Q $400 Q $500 Final Jeopardy.
2015/10/1 A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks Tai-Jung Chang, Kuochen Wang, Yi-Ling Hsieh Department.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Routing Protocol Evaluation David Holmer
Peer-to-Peer AOI Voice Chatting for Massively Multiplayer Online Games (P2P-NVE 2007 workshop) Jehn-Ruey Jiang and Hung-Shiang Chen Adaptive Computing.
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
A review of M. Zonoozi, P. Dassanayake, “User Mobility and Characterization of Mobility Patterns”, IEEE J. on Sel. Areas in Comm., vol 15, no. 7, Sept.
Peer-to-Peer AOI Voice Chatting for Massively Multiplayer Online Games (P2P-NVE 2007 workshop) Jehn-Ruey Jiang and Hung-Shiang Chen Presenter: Shun-Yun.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
1 Virtual Patrol : A New Power Conservation Design for Surveillance Using Sensor Networks Prasant Mohapatra, Chao Gui Computer Science Dept. Univ. California,
Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Contact-Based Mobility Metrics for Delay-
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
Spatio-temporal Pattern Queries M. Hadjieleftheriou G. Kollios P. Bakalov V. J. Tsotras.
Geo Location Service CS218 Fall 2008 Yinzhe Yu, et al : Enhancing Location Service Scalability With HIGH-GRADE Yinzhe Yu, et al : Enhancing Location Service.
Yschen, CSIE, CCU1 Chapter 5: The Cellular Concept Associate Prof. Yuh-Shyan Chen Dept. of Computer Science and Information Engineering National Chung-Cheng.
UNIVERSITY OF SOUTHERN CALIFORNIA PATHS: Analysis of PATH Duration Statistics and their Impact on Reactive MANET Routing Protocols Narayanan Sadagopan.
Wireless Communication Technologies Group 3/20/02CISS 2002, Princeton 1 Distributional Properties of Inhibited Random Positions of Mobile Radio Terminals.
Wave Properties. Reflection When a wave is turned back toward its start point Fixed End – wave hits an obstacle that is rigid and is reflected back inverted.
Social-Aware Stateless Forwarding in Pocket Switched Networks Soo-Jin SHIN
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
Rounding scheme if r * j  1 then r j := 1  When the number of processors assigned in the continuous solution is between 0 and 1 for each task, the speed.
1 A Multi-Rate Routing Protocol with Connection Entropy for MANETs Cao Trong Hieu, Young Cheol Bang, Jin Ho Kim, Young An Kim, and Choong Seon Hong Presenter:
Sharp Hybrid Adaptive Routing Protocol for Mobile Ad Hoc Networks
A Standard Measure of Mobility for Evaluating Mobile Ad Hoc Network Performance By Joseph Charboneau Karthik Raman.
User Mobility Modeling and Characterization of Mobility Patterns Mahmood M. Zonoozi and Prem Dassanayake IEEE Journal on Selected Areas in Communications.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.
Deploying Sensors for Maximum Coverage in Sensor Network Ruay-Shiung Chang Shuo-Hung Wang National Dong Hwa University IEEE International Wireless Communications.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
Copyright © 2002 OPNET Technologies, Inc. 1 Random Waypoint Mobility Model Empirical Analysis of the Mobility Factor for the Random Waypoint Model 1542.
A New Class of Mobility Models for Ad Hoc Wireless Networks Rahul Amin Advisor: Dr. Carl Baum Clemson University SURE 2006.
Weighted Waypoint Mobility Model and Its Impact on Ad Hoc Networks Electrical Engineering Department UNIVERSITY OF SOUTHERN CALIFORNIA USC Kashyap Merchant,
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Measures of Variation. Variation Variation describes how widely data values are spread out about the center of a distribution.
Happy Tuesday! Pick up the paper from the table and get ready to take notes.
Where Are You? Children Adults.
Node Distribution of a New Scalable Mobility Model for Ad Hoc Wireless Networks Sheeraz Ahmad.
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
Section 3: Wave Interactions
What is Mobile Network? Why is it called Ad Hoc?
Floating Content in Vehicular Ad-hoc Networks
Interactions of Waves Chapter 15 Section 3.
15.3 Interactions of waves Key concepts: How do reflection, refraction, and diffraction change a wave’s direction? What are the different types of interference?
Wave Interaction Chapter 1.3.
Physical Science: Chapter 15: Section 3
1.3 Describing Quantitative Data with Numbers
Statistics 1: Introduction to Probability and Statistics
Presentation transcript:

General Ripple Mobility Model Chun-Hung Chen Dept. of CSIE National Taipei University of Technology

Introduction

RMM-Previous Work

The problem with RMM It can be described as the combination of two RWP mobility patterns It can be described as the combination of two RWP mobility patterns The average speed can not be spread wide The average speed can not be spread wide Uniform Index (UI) is not a good index for spatial distribution Uniform Index (UI) is not a good index for spatial distribution There is a limitation for extension There is a limitation for extension

Procedure of GRMM 1. Given V min, V max, R min, and R max 2. Randomly choose a speed v within [V min, V max ] 3. r = f(v, λ, V min, V max ) 4. Uniformly pick up a destination within the disk of radius r and the disk centering at the node position 5. The node moves toward the destination, and if it reaches the wall or boundary, it will bounce off and maintain the same speed. Bouncing action is set according to the rule that incidence angle is equal to the reflection angle.

Flexible Average Speed (FAS) In RMM, V min <V LS <V max In RMM, V min <V LS <V max g(λ,v) = 0 if v ≦ V LS g(λ,v) = 0 if v ≦ V LS g(λ,v) = 1 if v > V LS g(λ,v) = 1 if v > V LS If we want the lower speed node with shorter distance, we can assign g(λ,v) as a monotone increasing function. If we want the lower speed node with shorter distance, we can assign g(λ,v) as a monotone increasing function. g(λ,v)=v λ is proposed here and it is an instance of GRMM g(λ,v)=v λ is proposed here and it is an instance of GRMM

V min =1, V max =20, R min =50, R max =1000 and g(λ,v)=v λ

Evaluation Metrics Average Speed Average Speed –Results of Flexible Average Speed Average Number of Links Average Number of Links –Given Effective Range D, if there exists a link between A and B, Distance from A to B is smaller than or equal to D Average Duration of Links Average Duration of Links –Once the link is established, we observe how long it lasts Spatial Distribution Spatial Distribution –Moving area is divided into several 100x100 sections. Accumulating how many nodes being in the sections. Spatial Entropy Spatial Entropy –

Simulation Parameters X Coordinate1000 meters Y Coordinate1000 meters Number of Nodes (N)50 Simulation Time120 minutes V min 1 m/s V max 20 m/s R min 50 meters R max 1000 meters Effective Range (D)300 meters

Flexible Average Speed

Average Number of Links

Average Duration of Links

Spatial Distribution

Spatial Entropy

Conclusions GRMM maintains the simplicity and the understandable of RWP GRMM maintains the simplicity and the understandable of RWP It is the first time of Flexible Average Speed (FAS) mentioned in mobility models. It is the first time of Flexible Average Speed (FAS) mentioned in mobility models. There are still some analytic works which can be done There are still some analytic works which can be done