A Standard Measure of Mobility for Evaluating Mobile Ad Hoc Network Performance By Joseph Charboneau Karthik Raman.

Slides:



Advertisements
Similar presentations
1 Analysis of Random Mobility Models with PDE's Michele Garetto Emilio Leonardi Politecnico di Torino Italy MobiHoc Firenze.
Advertisements

4/5/20151 Mobile Ad hoc Networks COE 549 Mobility Models II Group Mobility Tarek Sheltami KFUPM CCSE COE
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
“Location-Aided Routing (LAR) in Mobile Ad Hoc Network” by Young-bae ko Nitin H. Validya presented by Mark Miyashita.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Routing in WSNs through analogies with electrostatics December 2005 L. Tzevelekas I. Stavrakakis.
Mobile Ad hoc Networks COE 549 Mobility Models I
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) Milan Vojnovic (Microsoft Research Cambridge)
1 Prediction-based Strategies for Energy Saving in Object Tracking Sensor Networks Yingqi Xu, Wang-Chien Lee Proceedings of the 2004 IEEE International.
Effective Quorum Construction for Consistency Management in Mobile Ad Hoc Networks Takahiro HARA Osaka University, Japan.
1 A Vehicle Route Management Solution Enabled by Wireless Vehicular Networks Kevin Collins and Gabriel-Miro Muntean IEEE INFOCOM 2008.
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.
Ad-Hoc Networking Course Instructor: Carlos Pomalaza-Ráez D. D. Perkins, H. D. Hughes, and C. B. Owen: ”Factors Affecting the Performance of Ad Hoc Networks”,
Volcano Routing Scheme Routing in a Highly Dynamic Environment Yashar Ganjali Stanford University Joint work with: Nick McKeown SECON 2005, Santa Clara,
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (II) 11th Week
QoS Constraint Routing Protocols for Mobile Ad Hoc
Distributed Token Circulation in Mobile Ad Hoc Networks Navneet Malpani, Intel Corp. Nitin Vaidya, Univ. Illinois Urbana-Champaign Jennifer Welch, Texas.
General Ripple Mobility Model Chun-Hung Chen Dept. of CSIE National Taipei University of Technology.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Mobility Models in Mobile Ad Hoc Networks Chun-Hung Chen 2005 Mar 8 th Dept. of Computer Science and Information Engineering National Taipei University.
1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Impact of Different Mobility Models on Connectivity Probability of a Wireless Ad Hoc Network Tatiana K. Madsen, Frank H.P. Fitzek, Ramjee Prasad [tatiana.
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models Pei’en LUO.
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.
1 1 Quantifying Impact of Mobility on Data Availability in Mobile Ad Hoc Networks Takahiro Hara IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 9, NO. 2, FEBRUARY.
Routing Protocol Evaluation David Holmer
UbiStore: Ubiquitous and Opportunistic Backup Architecture. Feiselia Tan, Sebastien Ardon, Max Ott Presented by: Zainab Aljazzaf.
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Algorithms for Radio Networks Exercise 11 Stefan Rührup
Small-Scale and Large-Scale Routing in Vehicular Ad Hoc Networks Wenjing Wang 1, Fei Xie 2 and Mainak Chatterjee 1 1 School of Electrical Engineering and.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
1 MANETS – An overview. 2 MANETs Model and Definitions Simulatability – mobility models Routing algorithms Security issues with routing algorithms Tracing.
Charles Fico Fahd Ahmad Saeed Group Mobility for Ad Hoc Wireless Networks.
MANET: Introduction Reference: “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations”; S. Corson and J.
UNIVERSITY OF SOUTHERN CALIFORNIA PATHS: Analysis of PATH Duration Statistics and their Impact on Reactive MANET Routing Protocols Narayanan Sadagopan.
Notes Over 4.8 Identifying Functions A relation where each input has exactly one output. Function Decide whether the relation is a function. If it is.
PRIN WOMEN PROJECT Research Unit: University of Naples Federico II G. Ferraiuolo
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
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:
Chapter 14 : Modeling Mobility Andreas Berl. 2 Motivation  Wireless network simulations often involve movements of entities  Examples  Users are roaming.
Sharp Hybrid Adaptive Routing Protocol for Mobile Ad Hoc Networks
A Mechanism for Communication- Efficient Broadcast Encryption over Wireless Ad Hoc Networks Johns Hopkins University Department of Computer Science Reza.
PeerNet: Pushing Peer-to-Peer Down the Stack Jakob Eriksson, Michalis Faloutsos, Srikanth Krishnamurthy University of California, Riverside.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
A Two-Tier Heterogeneous Mobile Ad Hoc Network Architecture and Its Load-Balance Routing Problem C.-F. Huang, H.-W. Lee, and Y.-C. Tseng Department of.
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.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
HoWL: An Efficient Route Discovery Scheme Using Routing History in Mobile Ad Hoc Networks Faculty of Environmental Information Mika Minematsu
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Node Distribution of a New Scalable Mobility Model for Ad Hoc Wireless Networks Sheeraz Ahmad.
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
What is Mobile Network? Why is it called Ad Hoc?
A comparison of Ad-Hoc Routing Protocols
Project Overview Comparing the performance of selected different Routing protocols for mobile ad-hoc networks.
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Motion-Aware Routing in Vehicular Ad-hoc Networks
OSPF Protocol.
Presentation transcript:

A Standard Measure of Mobility for Evaluating Mobile Ad Hoc Network Performance By Joseph Charboneau Karthik Raman

MANET Unpredictable topology changes. Performance related to efficiency of routing protocol.  Performance studies are done with simulations.

Performance Measure Problem  There are many mobility models but not a unified quantitative “measure” of mobility.  Ex. A is the performance of protocol R1 using model M1. B is the performance of protocol R2 using model M2. There are two different models used so results can’t be compared between A and B.

Performance Measure (Cont.) Other studies are based on  Average speed  Maximum speed  Pause time  Rate of link changes  Mobility factor Problem  Still no unified quantitative measure of mobility.

Performance Measure (Cont.) The study approached in this paper is a solution for unified quantitative measure of mobility. Solution  Use a standard that is flexible and consistent. Flexible because the mobility measure can be customized by using a remoteness function. Consistent because mobility measure has a linear relationship to link change rate.

Remoteness Remoteness is based on the distance between two nodes.  n i (t), i = 0,1,…,N-1, represent the location vector of node i at time t.  d ij (t)=|n j (t)-n i (t)| is the distance between node i to j at time t.  Remoteness is defined by R ij (t)=F(d ij (t)) Where F(.) is a function of the distance.

Remoteness (Cont.) Requirements that function F(.) must meet. a. F(0)=0, lim x→∞ F(x)=1 b. dF(x)/dx ≥ 0 for all x ≥ 0 c. dF(x)/dx| x=0 =0 d. lim x→∞ dF(x)/dx=0 e. dF(x)/dx| x=R ≥ dF(x)/dx for all x ≥ 0

Remoteness (Cont.) Requirements of function F(.) defined. a. Normalizes F(.) to have a unity maximum value. b. Guarantees that the remoteness is monotonically increasing function of distance. c. and d. give the boundary condition of F(.), which guarantee that the remoteness of a node at extreme locations does not change with movement. e. Makes the remoteness most sensitive to the movement of a node at communication range.

Remoteness (Cont.) One function of F(.) that meets all of the requirements is.  F(x) = 1/Γ(r)  With λ=(r-1)/R where r can be a non-integer.  r is the sensitivity to the remoteness at communication range.

Mobility Measure Mobility measure is defined in terms of the time derivatives of the remoteness.    N is the number of nodes and M i (t) is a measure of the relative movement of other nodes seen by i.

Mobility Measure (Cont.) The mobility measure M(t) represents the average amount of the relative movement of the nodes in the network at time t. For a network in steady state, the time average of mobility measure can be used. 

Mobility Measure (Cont.) If the function chosen for F(.) is the function discussed earlier then the mobility measure function will be. 

Mobility Measure (Cont.) If the function chosen for F(.) is the identity function then the mobility measure function will be. 

Mobility Measure (Cont.) Both M G (t) and M I (t) are both mobility measures but only M G (t) meets the given requirements.

Mobility Models Random Waypoint Model (RWP)  Node selects random destination & speed  Speed uniformly distributed between min and max speeds  Pauses at destination for random time and selects a new destination

Mobility Models (Cont.) Random Gauss-Markov Model (RGM)  Each node is assigned a speed, direction and updated every Δt  Speed and direction are uniformly distributed between their min and max values  At boundary node reflects and chooses a new random direction

Mobility Models (Cont.) Reference Point Group Mobility Model (RPGM)  Each group has a logical center which defines location, speed, direction, etc  Defines a reference point and random motion vector for each node in a group  Random motion vector is updated periodically and is given by the length and direction, distributed uniformly over the intervals [0, RM max ] and [0, 2π)

Network Scenarios

Network Scenarios (Cont.)

Simulation Results All scenarios are done with 500 seconds warm up time and measured for the next 500 seconds. The first equation is based on L(t) which defines the number of link changes. 

The formula to calculate the time average of the normalized link change is.  If N(t) is a constant N the equation is.  If N(t) is a function of time the equation is.  Simulation Results (Cont.)