4/5/20151 Mobile Ad hoc Networks COE 549 Mobility Models II Group Mobility Tarek Sheltami KFUPM CCSE COE

Slides:



Advertisements
Similar presentations
June 2, Mobile Computing COE 446 Mobile Ad hoc Networks Tarek Sheltami KFUPM CCSE COE
Advertisements

高度情報化社会を支えるネットワーキング技術 (大阪大学 工学部説明会資料)
Application a hybrid controller to a mobile robot J.-S Chiou, K. -Y. Wang,Simulation Modelling Pratice and Theory Vol. 16 pp (2008) Professor:
Title Name institution. April, 9-11th, 2015FORIL XI
1/10/20151 Mobile Computing COE 446 Network Operation Tarek Sheltami KFUPM CCSE COE Principles of Wireless.
Analysis of Algorithms
January 15, Mobile Computing COE 446 Network Operation Tarek Sheltami KFUPM CCSE COE Principles.
January 15, Mobile Computing COE 446 GSM Tarek Sheltami KFUPM CCSE COE Principles of Wireless Networks.
T-Talk. Javascript. Module Pattern. Namics. Thomas Junghans. Frontend Engineer. 12 h August 2009.
3/30/ The Grace and Mercy of God; A. Definitions: 1. God's grace (Greek CHARIS) is His unmerited favour toward sinners, 2. God's mercy (Greek.
Transparency Index, Family Firms, and Company Performance: Evidence from Hong Kong Yan-Leung Cheung School of Business Hong Kong Baptist University.
Corso di Algoritmi e Strutture Dati con Laboratorio A.A. 2014/15 Lezione 5.1 The String and Scanner classes.
April 9, Mobile Computing COE 446 Wireless Multiple Access Tarek Sheltami KFUPM CCSE COE Principles.
James. Heckman University of Chicago
State-Space Collapse via Drift Conditions Atilla Eryilmaz (OSU) and R. Srikant (Illinois) 4/10/20151.
4/11/20151 Mobile Computing COE 446 Wireless Multiple Access Tarek Sheltami KFUPM CCSE COE Principles.
Corrected Marketplace Form 1095-A X March  Most consumers enrolled in a Marketplace health plan in 2014 got a Form 1095-A — Health Insurance Marketplace.
4/11/20151 Ten little, nine little, eight little women …in academic research When burnout beats perseverance.
LINEAR PROGRAMMING Modeling a problem is boring --- and a distraction from studying the abstract form! However, modeling is very important: --- for your.
5/15/2015 Mobile Ad hoc Networks COE 499 Localization Tarek Sheltami KFUPM CCSE COE 1.
Adaptive Resonance Theory (ART) networks perform completely unsupervised learning. Their competitive learning algorithm is similar to the first (unsupervised)
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..
An Approach to Evaluate Data Trustworthiness Based on Data Provenance Department of Computer Science Purdue University.
Mobile Ad hoc Networks COE 549 Mobility Models I
Quantifying Generalization from Trial-by-Trial Behavior in Reaching Movement Dan Liu Natural Computation Group Cognitive Science Department, UCSD March,
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.
Search and Escape in “The Snorks World” Guillaume Poncin Gregory Kron Monday, June 9 th 2003.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (II) 11th Week
MAE 552 – Heuristic Optimization
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.
Social Networks Based Ad Hoc Mobility Models Mirco Musolesi Stephen Hailes Cecilia Mascolo University College London 3 rd UK-Ubinet Workshop Bath, 9-11.
August 6, Mobile Computing COE 446 Network Planning Tarek Sheltami KFUPM CCSE COE Principles of.
Mobile Ad hoc Networks COE 549 Routing Protocols I
Wireless networks simulation Performance evaluation of a protocol for ad hoc networks is usually performed by simulating the wireless network. Simulation.
August 21, Mobile Computing COE 446 IS-95 Tarek Sheltami KFUPM CCSE COE Principles of Wireless Networks.
Vectors and the Geometry of Space
Lecture 8 Page 1 Advanced Network Security Review of Networking Basics: Internet Architecture, Routing, and Naming Advanced Network Security Peter Reiher.
Authors: Sheng-Po Kuo, Yu-Chee Tseng, Fang-Jing Wu, and Chun-Yu Lin
MA Dynamical Systems MODELING CHANGE. Introduction to Dynamical Systems.
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.
Introduction to Mobility & Network Simulator 2 (NS-2)
Swarm Intelligence 虞台文.
Department of Electrical Engineering, Southern Taiwan University Robotic Interaction Learning Lab 1 The optimization of the application of fuzzy ant colony.
Distributed Tracking Using Kalman Filtering Aaron Dyreson, Faculty Advisor: Ioannis Schizas, Ph.D. Department of Electrical Engineering, The University.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
1 MANETS – An overview. 2 MANETs Model and Definitions Simulatability – mobility models Routing algorithms Security issues with routing algorithms Tracing.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Distance, Displacement and Speed 3/25/2011. What do you need in order to know that something is moving?  A FRAME OF REFERENCE!  A system of objects.
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
The HESSI Imaging Process. How HESSI Images HESSI will make observations of the X-rays and gamma-rays emitted by solar flares in such a way that pictures.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
Chapter 14 : Modeling Mobility Andreas Berl. 2 Motivation  Wireless network simulations often involve movements of entities  Examples  Users are roaming.
Robot Velocity Based Path Planning Along Bezier Curve Path Gil Jin Yang, Byoung Wook Choi * Dept. of Electrical and Information Engineering Seoul National.
A Standard Measure of Mobility for Evaluating Mobile Ad Hoc Network Performance By Joseph Charboneau Karthik Raman.
2/10/2016 Mobile Ad hoc Networks COE 549 Routing Protocols III Tarek Sheltami KFUPM CCSE COE
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Standard & Canonical Forms COE 202 Digital Logic Design Dr. Aiman El-Maleh College of Computer Sciences and Engineering King Fahd University of Petroleum.
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,
I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.
Verein Konstantin Melnik Svetlana
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
What is Mobile Network? Why is it called Ad Hoc?
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Apparent Subdiffusion Inherent to Single Particle Tracking
Presentation transcript:

4/5/20151 Mobile Ad hoc Networks COE 549 Mobility Models II Group Mobility Tarek Sheltami KFUPM CCSE COE

Outline 4/5/20152  Group Mobility  Column Mobility Model  Nomadic Community Mobility Model  Pursue Mobility Model  Reference Point Group Mobility Model  Performance Evaluation

4/5/20153 Group Mobility Models In an ad hoc network there are many situations in which it is necessary to model the behavior of MNs as they move together a group of soldiers in a military scenario may be assigned the task of searching a particular plot of land, capture enemy attackers or simply work together in a cooperative manner to accomplish a common goal a group mobility model is needed to simulate this cooperative characteristic The most general of group mobility models is the Reference Point Group Mobility (RPGM) model.

4/5/20154 Column Mobility Model Proved useful for scanning or searching purposes [2] This model represents a set of MTs that move around a given line (or column), which is moving in a forward direction (e.g. a row of soldiers marching together toward their enemy). A slight modification of the Column Mobility Model allows the individual MTs to follow one another (e.g. a group of young children walking in a single-file line to their classroom). For the implementation of this model, an initial reference grid (forming a column of MTs) is defined [1]. Each MN is then placed in relation to its reference point in the reference grid The MN is then allowed to move randomly around its reference point via an entity mobility model The authors propose using the Random Walk Mobility Model

4/5/20155 Column Mobility Model.. The new reference point for a given MN is defined as: nerw_reference_point = old_reference_point + advance_vector ) Since the same predefined offset is used for all MTs, the reference grid is a 1-D line.

4/5/20156 Column Mobility Model.. The MTs roam closely around their respective reference points. When the reference grid moves (on the basis of a random distance and a random angle), the MTs follow the grid and then continue to roam around their respective reference points

4/5/20157 Column Mobility Model.. The above figure illustrates the simulated movement of two groups (three MNs are in each group) using the Column Mobility Model. One group in the figure is using the original Column Mobility Model, in which the MNs move perpendicular to the direction of movement. The second group is using the modified Column Mobility Model, in which the MNs move parallel to the direction of movement.

4/5/20158 Nomadic Community Mobility Model Represents groups of MTs that collectively move from one point to another [1,2]. Within each community or group of MTs, individuals maintain their own personal ‘spaces’ where they move in random ways consider a class of students touring an art museum. The class would move from one location to another together; however, the students within the class would roam around a particular location individually When the reference point changes, all MTs in the group travel to the new area defined by the reference point and then begin roaming around the new reference point. The parameters for the entity mobility model define how far an MT may roam from the reference point.

4/5/20159 Nomadic Community Mobility Model.. Compared to the Column Mobility Model, the MTs in the Nomadic Community Mobility Model share a common reference point versus an individual reference point in a column. Thus, we would expect the MTs to be less constrained in their movement around the defined reference point. For example, in the Column Mobility Model, the MTs may only travel for two seconds before changing direction and speed; in the Nomadic Community Mobility Model, the MTs may be allowed to travel for 60 s before changing direction and speed.

4/5/ Nomadic Community Mobility Model.. The above figure gives an illustration of seven MTs moving with the Nomadic Community Mobility Model. The reference point (represented by a small black dot) moves from one location to another; as shown, the MTs follow the movement of the reference point.

4/5/ Pursue Mobility Model [1, 2] Attempts to represent MTs tracking a particular target. For example, this model could represent police officers attempting to catch an escaped criminal The Pursue Mobility Model consists of a single update equation for the new position of each MN:

4/5/ Pursue Mobility Model.. The above figure gives an illustration of six MNs moving with the Pursue Mobility Model. The white node represents the node being pursued and the solid black nodes represent the pursuing node

Reference Point Group Mobility Model 4/5/  Represents the random motion of a group of MNs as well as the random motion of each individual MN within the group [3].  Group movements are based on the path travelled by a logical center for the group  The logical center for the group is used to calculate group motion via a group motion vector,  The motion of the group center completely characterizes the movement of its corresponding group of MNs, including their direction and speed.  Individual MNs randomly move about their own predefined 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 MN about its individual reference point.

Reference Point Group Mobility Model.. 4/5/201514

Reference Point Group Mobility Model.. 4/5/ The above figure is an illustration of three MNs moving together as one group

Reference Point Group Mobility Model.. 4/5/ The above figure is an illustration of five groups moving, such that each group has a different number of MNs. Both the movement of the logical center for each group, and the random motion of each individual MN within the group, are implemented via the Random Waypoint Mobility Model. One difference, however, is that individual MNs do not use pause times while the group is moving. Pause times are only used when the group reference point reaches a destination and all group nodes pause for the same period of time.

Performance Evaluation 4/5/201517

Performance Evaluation.. 4/5/201518

Performance Evaluation.. 4/5/201519

Performance Evaluation.. 4/5/201520

References 4/5/ Sanchez M. Mobility models.; mobmodel.htm ; Page accessed on May 30th, mobmodel.htm 2.Sanchez M, Manzoni P. Anejos: A java based simulator for ad-hoc networks. Future Generation Computer Systems 2001; 17(5): 573– Hong X, Gerla M, Pei G, Chiang C. A group mobility model for ad hoc wireless networks. In Proceedings of the ACM International Workshop on Modeling and Simulation of Wireless and Mobile Systems (MSWiM), August 1999.