Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.

Slides:



Advertisements
Similar presentations
Mobile Ad-hoc Network Simulator: mobile AntNet R. Hekmat * (CACTUS TermiNet - TU Delft/EWI/NAS) and Radovan Milosevic (MSc student) Mobile Ad-hoc networks.
Advertisements

4/5/20151 Mobile Ad hoc Networks COE 549 Mobility Models II Group Mobility Tarek Sheltami KFUPM CCSE COE
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed slides from Richard Yang.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
UDelModels Vinay Sridhara (Department of Electrical and Computer Engineering) University of Delaware.
Preference-based Mobility Model and the Case for Congestion Relief in WLANs using Ad hoc Networks Wei-jen Hsu, Kashyap Merchant, Haw-wei Shu, Chih-hsin.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
SLAW: A Mobility Model for Human Walks Lee et al..
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Mobile Ad hoc Networks COE 549 Mobility Models I
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
Overview of Mobility Models
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
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.
Real Time Flow Handoff in Ad Hoc Wireless Networks using Mobility Prediction William Su Mario Gerla Comp Science Dept, UCLA.
Performance Comparison of Routing Protocols for Ad Hoc Networks PATTERN ENDIF Ferrara.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (II) 11th Week
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (III) 12th Week
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed some Richard Yang‘s slides.
Milano, 4-5 Ottobre 2004 IS-MANET The Virtual Routing Protocol for Ad Hoc Networks ISTI – CNR S. Chessa.
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.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
A Distance Routing Effect Algorithm for Mobility (DREAM)* Stefano Basagni Irnrich Chlamtac Violet R. Syrotiuk Barry A. Woodward.
Layer-3 Routing Natawut Nupairoj, Ph.D. Department of Computer Engineering Chulalongkorn University.
Wireless networks simulation Performance evaluation of a protocol for ad hoc networks is usually performed by simulating the wireless network. Simulation.
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models Pei’en LUO.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Practical Mobility Models & Mobility Based Routing Joy Ghosh LANDER
Sidewinder A Predictive Data Forwarding Protocol for Mobile Wireless Sensor Networks Matt Keally 1, Gang Zhou 1, Guoliang Xing 2 1 College of William and.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
Introduction to Mobility & Network Simulator 2 (NS-2)
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
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
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.
Ad Hoc Routing: The AODV and DSR Protocols Speaker : Wilson Lai “Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks”, C. Perkins.
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.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
UNIVERSITY OF SOUTHERN CALIFORNIA PATHS: Analysis of PATH Duration Statistics and their Impact on Reactive MANET Routing Protocols Narayanan Sadagopan.
Social-Aware Stateless Forwarding in Pocket Switched Networks Soo-Jin SHIN
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
Chapter 14 : Modeling Mobility Andreas Berl. 2 Motivation  Wireless network simulations often involve movements of entities  Examples  Users are roaming.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
A Standard Measure of Mobility for Evaluating Mobile Ad Hoc Network Performance By Joseph Charboneau Karthik Raman.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
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.
Weighted Waypoint Mobility Model and Its Impact on Ad Hoc Networks Electrical Engineering Department UNIVERSITY OF SOUTHERN CALIFORNIA USC Kashyap Merchant,
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Verein Konstantin Melnik Svetlana
CS 525M – Mobile and Ubiquitous Computing Seminar Bradley Momberger.
HoWL: An Efficient Route Discovery Scheme Using Routing History in Mobile Ad Hoc Networks Faculty of Environmental Information Mika Minematsu
Speaker: Ju-Mei Li Virtual Paths Routing: A Highly Dynamic Routing Protocol for Ad Hoc Wireless Networks Abdulrahman H. Altalhi and Golden G. Richard Computer.
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
Authors: Jiang Xie, Ian F. Akyildiz
SLAW: A Mobility Model for Human Walks
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
What is Mobile Network? Why is it called Ad Hoc?
Ad Hoc Networks - Performance
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Presentation transcript:

Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005

EECS 600 Advanced Network Research, Spring Realistic Conditions for Testing Protocols Transmission range, link bandwidth, symmetry Buffer space for the storage of messages Data traffic models, and Realistic movements of the mobile users –Mobility model

EECS 600 Advanced Network Research, Spring Relevance of Mobility Models Dynamic topology –How dynamic it is? Packet delivery ratio –Path change causes unreachable destination Mobility may be helpful –How?

EECS 600 Advanced Network Research, Spring Traces versus Synthetic Models Traces are those mobility patterns that are observed in real life systems. Traces provide accurate information, especially when they involve a large number of participants and an appropriately long observation period. –Not easy to model the networks if traces have not yet been created. –Limited traces, fixed parameters, not scalable simulations Synthetic models attempt to realistically represent the behaviors of mobile nodes without the use of traces –Less realistic –Need to understand the models well before using them

EECS 600 Advanced Network Research, Spring Seven Synthetic Entity Mobility Models Random Walk Mobility Model (including its many derivatives): picks random directions and speeds. Random Waypoint Mobility Model: includes pause times between changes in destination and speed. Random Direction Mobility Model: forces nodes to travel to the edge of the simulation area before changing direction and speed. A Boundless Simulation Area Mobility Model: converts a 2D rectangular simulation area into a torus-shaped simulation area. Gauss-Markov Mobility Model: uses one tuning parameter to vary the degree of randomness in the mobility pattern. A Probabilistic Version of the Random Walk Mobility Model: utilizes a set of probabilities to determine the next position of a node. City Section Mobility Model: represents streets within a city.

EECS 600 Advanced Network Research, Spring Five Synthetic Group Mobility Models Exponential Correlated Random Mobility Model: uses a motion function to create movements. Column Mobility Model: the set of nodes form a line and are uniformly moving forward in a particular direction. Nomadic Community Mobility Model: a set of nodes move together from one location to another. Pursue Mobility Model: a set of nodes follow a given target. Reference Point Group Mobility Model: group movements are based upon the path traveled by a logical center.

EECS 600 Advanced Network Research, Spring Entity model: Random Walk A mobile node moves from its current location to a new location by randomly choosing a direction and speed in which to travel. –The new speed and direction are both chosen from pre-defined ranges, [speedmin; speedmax] and [0;2π] respectively. –Each movement in the Random Walk Mobility Model occurs in either a constant time interval t or a constant distance traveled d. –At the end of a move, a new direction and speed are calculated. –If an MN which moves according to this model reaches a simulation boundary, it “bounces” off the simulation border with an angle determined by the incoming direction. Random Walk is a memory-less mobility pattern. This characteristic can generate unrealistic movements such as sudden stops and sharp turns

EECS 600 Advanced Network Research, Spring Random Walk Example

EECS 600 Advanced Network Research, Spring Entity model: Random Waypoint The Random Waypoint Mobility Model includes pause times between changes in direction and/or speed. –A mobile node stays in one location for a certain period of time (i.e., a pause time). –Once this time expires, the node chooses a random destination in the simulation area and a speed that is uniformly distributed between [minspeed,maxspeed]. The node then travels toward the newly chosen destination at the selected speed. –Repeat above two steps Often in the model, the nodes are initially distributed randomly around the simulation area. This initial random distribution of MNs is not representative of the manner in which nodes distribute themselves when moving. –Q: How do you understand this? –Q: How to overcome this initialization problem?

EECS 600 Advanced Network Research, Spring Random Waypoint Example

EECS 600 Advanced Network Research, Spring Entity model: Random Direction A mobile node chooses a random direction in which to travel similar to the Random Walk Mobility Model. The node then travels to the border of the simulation area in that direction. Once the simulation boundary is reached, the node pauses for a specified time, chooses another angular direction (between 0 and 180 degrees) and continues the process.

EECS 600 Advanced Network Research, Spring Random Direction Example

EECS 600 Advanced Network Research, Spring Group model: RPGM The Reference Point Group Mobility (RPGM) model represents the random motion of a group of nodes as well as the random motion of each individual MN within the group. –Group movements are based upon the path traveled by a logical center for the group. The logical center for the group is used to calculate group motion via a group motion vector, GM. The motion of the group center completely characterizes the movement of its corresponding group of nodes (including their direction and speed). –Individual nodes randomly move about their own pre-defined reference points, whose movements depend on the group movement. As the individual reference points move from time t to t+1, their locations are updated according to the group’s logical center. Once the updated reference points, RP(t+1), are calculated, they are combined with a random motion vector, RM, to represent the random motion of each node about its individual reference point.

EECS 600 Advanced Network Research, Spring RPGM Movements

EECS 600 Advanced Network Research, Spring RPGM Example

EECS 600 Advanced Network Research, Spring Importance of Mobility Models Objectives –Simulations to illustrate the important of models Simulated models –Random walk, random waypoint, random direction, RPGM (with inter-group communications, and with inter-group/intra-group communication) Simulation setup –The ns-2 simulator + DSR –Long simulation –20 CBR flows (constant packet rate, 64B/s) –packet delivery ratio, end-to-end delay, hop-count, etc –Mean + 95% confidence interval

EECS 600 Advanced Network Research, Spring Packet Delivery Ratio

EECS 600 Advanced Network Research, Spring End-to-end Delay

EECS 600 Advanced Network Research, Spring Hop Count

EECS 600 Advanced Network Research, Spring Comments from Students