Impact of Different Mobility Models on Connectivity Probability of a Wireless Ad Hoc Network Tatiana K. Madsen, Frank H.P. Fitzek, Ramjee Prasad [tatiana.

Slides:



Advertisements
Similar presentations
An Adaptive Compulsory Protocol for Basic Communication in Ad-hoc Mobile Networks Ioannis Chatzigiannakis Sotiris Nikoletseas April 2002.
Advertisements

The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
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.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
Lecture 4 – Kinetic Theory of Ideal Gases
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 9: Localization & positioning Holger Karl.
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.
Speech Group INRIA Lorraine
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Directional Routing for Wireless Mesh Networks: A Performance Evaluation Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman.
3.3 Toward Statistical Inference. What is statistical inference? Statistical inference is using a fact about a sample to estimate the truth about the.
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”,
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (II) 11th Week
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
1 Validation and Verification of Simulation Models.
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.
1 University of Denver Department of Mathematics Department of Computer Science.
1 Paper: IMPORTANT by Bai Sadagopan et al. Michalis Faloutsos.
1 Connectivity of Wireless Ad hoc Networks Dr. Salman Durrani School of Engineering, College of Engineering and Computer Science, The Australian National.
Social Networks Based Ad Hoc Mobility Models Mirco Musolesi Stephen Hailes Cecilia Mascolo University College London 3 rd UK-Ubinet Workshop Bath, 9-11.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
Time of arrival(TOA) Prepared By Sushmita Pal Roll No Dept.-CSE,4 th year.
Doc.: IEEE /0090r0 SubmissionMartin Jacob, TU Braunschweig January 2010 Slide 1 Modeling the Dynamical Human Blockage for 60 GHz WLAN Channel.
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.
Mobile Traffic Sensor Network versus Motion-MIX: Tracing and Protecting Mobile Wireless Nodes JieJun Kong Dapeng Wu Xiaoyan Hong and Mario Gerla.
1 Lesson 8: Basic Monte Carlo integration We begin the 2 nd phase of our course: Study of general mathematics of MC We begin the 2 nd phase of our course:
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
A Novel Mechanism for Flooding Based Route Discovery in Ad Hoc Networks Jian Li and Prasant Mohapatra GlobeCom’03 Speaker ︰ CHUN-WEI.
Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Contact-Based Mobility Metrics for Delay-
Performance Analysis of OFDM Systems with Adaptive Sub Carrier Bandwidth Suvra S. Das, Student Member, IEEE, Elisabeth De Carvalho, Member, IEEE, and Ramjee.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
UNIVERSITY OF SOUTHERN CALIFORNIA PATHS: Analysis of PATH Duration Statistics and their Impact on Reactive MANET Routing Protocols Narayanan Sadagopan.
1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,
Wireless Communication Technologies Group 3/20/02CISS 2002, Princeton 1 Distributional Properties of Inhibited Random Positions of Mobile Radio Terminals.
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
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.
A Standard Measure of Mobility for Evaluating Mobile Ad Hoc Network Performance By Joseph Charboneau Karthik Raman.
Paging Area Optimization Based on Interval Estimation in Wireless Personal Communication Networks By Z. Lei, C. U. Saraydar and N. B. Mandayam.
Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
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,
I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.
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, 鄭宇辰
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
Analysis the performance of vehicles ad hoc network simulation based
What is Mobile Network? Why is it called Ad Hoc?
David K. Y. Yau Department of Computer Science Purdue University
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Vehicular Ad-hoc Networks
Wireless Mesh Networks
2019/9/14 The Deep Learning Vision for Heterogeneous Network Traffic Control Proposal, Challenges, and Future Perspective Author: Nei Kato, Zubair Md.
Presentation transcript:

Impact of Different Mobility Models on Connectivity Probability of a Wireless Ad Hoc Network Tatiana K. Madsen, Frank H.P. Fitzek, Ramjee Prasad [tatiana | ff | Department of Communication Technology Aalborg University Aalborg, Denmark

Overview Introduction to mobility models The problem of network connectivity under mobility of nodes Definition of Connectivity Probability Analysis of Random Direction mobility model Applicability of the method to other models Example: connectivity of a network in an area with obstacles Conclusions and future work

The movement pattern of users has a significant impact on performance of wireless networks Different mobility models have been proposed –Random Direction –Random Waypoint –Virtual World Scenarios Important issues for ad hoc networks –Connectivity –Path duration –Stability of routes Introduction

Connectivity of a network under mobility of nodes

Our approach We introduce a measure of network connectivity in the presence of mobility  Connectivity probability A number that gives an estimate that the whole network is connected in any point in time

Formal definition Definition. At a given moment in time a network is connected if for every pair of nodes there exists a path between them. Under motion of nodes a semiaxis of time is divided into intervals  1 ,  2 ,  3 ,… Denote Definition. Connectivity probability is defines as a measure of set T +, or as it is customary in number theory: if this limit exists connected 2-2- 3+3+ 4-4- 1+1+ disconnected connected

Formal definition Since, then The problem to find connectivity probability is reduced to the problem of existence and calculation of the limit.

Weakly connectivity Definition. At a given moment in time a network consisting of n nodes is weakly connected if where r is the communication range and is a metric. Number of connections in fully connected network C = n(n-1)/2 Number of connection in weakly connected network n/2 <= C <= n(n-1)/2

Random Direction mobility model Node selects a direction and speed to move from a given distribution. The motion is along a straight line. Once a boundary is reached, new direction is chosen towards the inside of the simulation area. Why RD model? –It is an example of a dynamical system that successfully realizes ergodic properties  analytical approach is feasible based on ideas and methods of ergodic theory

Analysis of billiard model A particular case of RD model – billiard : trajectories form equal angles with the boundary. where a is the side of the square, n is the number of nodes, S r is a domain consisting of all possible positions of the nodes such that the network is connected. D a a Applying Weyl’s ergodic theorem, we show that the limit exists and it is equal to the spatial average:

How to use the obtained formula? It seems to be difficult to find a close form expression for the measure of S r as a function of r. We propose to use Monte-Carlo simulations to find mes S r. What is the advantage? –Using definition for calculation of connectivity probability, we would have to perform in principle infinitely many simulations, one for each point in time. –Using the obtained formula, we do not have to model our system in time, - this leads to significant reduction in computational complexity.

Example Connectivity probability for RD as a function of communication radius Simulation area is a square 100x100 m 2, speed of all nodes is 5 m/s, no pause time

Computational Effort area 100x100 m comm. radius 20m 90 nodes speed 5 m/s Conn. probability = approx Using formula –N=2000  cpu time=132 sec –N=  cpu time=666 sec Using definition –t=5.000 sec  cpu time = 2431 sec –t= sec  cpu time = 5476 sec

Applicability of the method to other models The same formula is applicable in the case of –general RD model –When rectangular-shaped obstacles are placed in the simulation area If a collection of nodes comprises a dynamical system with some particular properties, then for almost all initial conditions the limit exists. It can happen that for different initial positions and velocities, the limiting values will be different. Note that for RD model the limit does not depend on initial conditions, therefore it is defined correctly.

Random Waypoint mobility model We propose to introduce averaging over initial node distribution, and the obtained average connectivity probability can be used as an estimate for network connectivity. Simulation area is 100x100 m 2, 90 nodes, speed 5 m/s, communication radius 20 m, 10 simulation runs

Example: simulation area with obstacles A simulation scenario of a rectangular area with a lot of nodes is considered to be a good approximation for large scale ad hoc networks. For small-scale networks the shape of the mobility area becomes important. One way to make simulation scenarios more realistic is to incorporate obstacles simulation area. To illustrate the applicability of the formula in the scenarios with obstacles, we consider the following example: a = 25 m, b = 200m, 6 nodes, speed 5 m/s

Example: simulation area with obstacles Connectivity probability for RD as a function of communication radius Line A: we propose use a simplified propagation model: a signal can reach the receiver via non LOS mechanism, but the receiving power is 20 dB smaller compared with the case when a LOS path exists. The number 20 dB seems to be realistic for indoor environment, but it can vary a lot depending on materials of walls and ceiling, size of the room etc

Conclusions and future work We have presented a new method to describe connectivity of a network in presence of mobility as a measure The developed framework was applied to Random Direction model; it’s applicability to other models was discussed In the future we plan to examine other mobility models, including the one, based on the use of mobility trajectories of the users in a virtual world using a multi- player game such as e.g. Quake II.