Node Distribution of a New Scalable Mobility Model for Ad Hoc Wireless Networks Sheeraz Ahmad.

Slides:



Advertisements
Similar presentations
1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) & Milan Vojnovic (Microsoft Research Cambridge) IEEE Infocom.
Advertisements

Readiness in Formation Control of Multi-Robot System Zhihao Xu (Univ. of Würzburg) Hiroaki Kawashima (Kyoto Univ.) Klaus Schilling (Univ. of Würzburg)
1 Analysis of Random Mobility Models with PDE's Michele Garetto Emilio Leonardi Politecnico di Torino Italy MobiHoc Firenze.
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed slides from Richard Yang.
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.
Coverage Estimation in Heterogeneous Visual Sensor Networks Mahmut Karakaya and Hairong Qi Advanced Imaging & Collaborative Information Processing Laboratory.
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.
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)
June 3, A New Multipath Routing Protocol for Ad Hoc Wireless Networks Amit Gupta and Amit Vyas.
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.
1 The Random Trip Mobility Model Milan Vojnovic (Microsoft Research) Computer Lab Seminar, University of Cambridge, UK, Nov 2004 with Jean-Yves Le Boudec.
Stable mobility models for MANETS Kim Blackmore Roy Timo (DE/NICTA) Leif Hanlen (NICTA)
Yashar Ganjali, and Abtin Keshavarzian Presented by: Isaac Keslassy Computer Systems Laboratory Department of Electrical Engineering Stanford University.
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 Random Trip Stationarity, Perfect Simulation and Long Range Dependence Jean-Yves Le Boudec (EPFL) joint work with Milan Vojnovic (Microsoft Research.
Yashar Ganjali Joint work with: Abtin Keshavarzian June 4, 2003 Single-Path vs. Multi-Path Routing in Ad Hoc Networks.
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed some Richard Yang‘s slides.
General Ripple Mobility Model Chun-Hung Chen Dept. of CSIE National Taipei University of Technology.
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.
Exposure In Wireless Ad-Hoc Sensor Networks S. Megerian, F. Koushanfar, G. Qu, G. Veltri, M. Potkonjak ACM SIG MOBILE 2001 (Mobicom) Journal version: S.
Social Networks Based Ad Hoc Mobility Models Mirco Musolesi Stephen Hailes Cecilia Mascolo University College London 3 rd UK-Ubinet Workshop Bath, 9-11.
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
Routing & scheduling for mobile ad hoc networks using an EINR model Harshit Arora Mentor: IIT Kanpur Dr. Harlan Russell.
Routing Protocol Evaluation David Holmer
Location, location, location Border effects in interference limited ad hoc networks Orestis Georgiou Shanshan Wang, Mohammud Z. Bocus Carl P. Dettmann.
WALKING IN FACEBOOK: A CASE STUDY OF UNBIASED SAMPLING OF OSNS junction.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Contact-Based Mobility Metrics for Delay-
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
1 Probabilistic Coverage in Wireless Sensor Networks Nadeem Ahmed, Salil S. Kanhere and Sanjay Jha Computer Science and Engineering, University of New.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
UNIVERSITY OF SOUTHERN CALIFORNIA PATHS: Analysis of PATH Duration Statistics and their Impact on Reactive MANET Routing Protocols Narayanan Sadagopan.
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.
On the Stability of a Five-body Planetary System Embedded in the β Pictoris Debris Disk Jared H. Crossley Mentor: Nader Haghighipour.
A Standard Measure of Mobility for Evaluating Mobile Ad Hoc Network Performance By Joseph Charboneau Karthik Raman.
Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.
Dynamic Bandwidth Reservation in Cellular Networks Using Road Topology Based Mobility Predictions InfoCom 2004 Speaker : Bo-Chun Wang
A New Class of Mobility Models for Wireless Mobile Communication Networks Joshua Gabet Advisor: Carl Baum Clemson University SURE 2005.
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.
Evolution of Cooperation in Mobile Ad Hoc Networks Jeff Hudack (working with some Italian guy)
Weighted Waypoint Mobility Model and Its Impact on Ad Hoc Networks Electrical Engineering Department UNIVERSITY OF SOUTHERN CALIFORNIA USC Kashyap Merchant,
12.Nov.2007 Capacity of Ad Hoc Wireless Networks Jinyang Li Charles Blake Douglas S. J. De Coutu Hu Imm Lee Robert Morris Paper presentation by Tonio Gsell.
Slide 1 SLIP 2004 Payman Zarkesh-Ha, Ken Doniger, William Loh, and Peter Bendix LSI Logic Corporation Interconnect Modeling Group February 14, 2004 Prediction.
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
Motion in Two Dimensions
SLAW: A Mobility Model for Human Walks
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
Circles.
Jérôme Härri, Fethi Filali, Christian Bonnet
Ning Li and Jennifer C. Hou University of Illinois at Urbana-Champaign
What is Mobile Network? Why is it called Ad Hoc?
A Variation of the Buffon’s Needle and Coin Problems
Ad Hoc Networks - Performance
Analysis of Link Reversal Routing Algorithms
Motion in Two Dimensions
Hidden Terminal Decoding and Mesh Network Capacity
A New Multipath Routing Protocol for Ad Hoc Wireless Networks
Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.
Random Geometric Graph Diameter in the Unit Disk
Speaker: Po-Hung Chen Advisor: Dr. Ho-Ting Wu 2016/10/12
Formation of Community-based Multi-hop Wireless Access Networks
Motion-Aware Routing in Vehicular Ad-hoc Networks
Adaptation of the Simulated Risk Disambiguation Protocol to a Discrete Setting ICAPS Workshop on POMDP, Classification and Regression: Relationships and.
Presentation transcript:

Node Distribution of a New Scalable Mobility Model for Ad Hoc Wireless Networks Sheeraz Ahmad IIT Kanpur Mentor : Dr. Carl Baum

Outline Background of Mobility Models Random Way Point Model Motivation Introduction to New Model Node Distribution for New Model Outage Probability Comparison between Theoretical and Simulation Results Conclusion

Background of Mobility Models Mobility Models are required to describe the motion of mobile nodes. To track real motion, long time observation and statistical averaging can be used. For quick simulation, models like Random Way Point and Markov Model are used.

Random Way Point Model Choose two points uniformly in given region. Choose a random velocity. Start moving towards the second point with this velocity. After node reaches there, choose another point and repeat the process.

Motivation Node distribution for RWP is non-uniform; nodes tend to spend more time in the ‘middle’. Due to this RWP is not scalable, i.e. if we try to increase the size of the region this ‘edge effect’ becomes more prominent. Again due to the non-uniformity network performance becomes location dependent. Compelling need to come up with models which give uniform or nearly uniform distribution.

Introduction to New Model Instead of the interior the points are chosen on the boundary. The process progresses by choosing the angle subtended by the path at the center from the distribution :1/4*sin(| |/2) a r

Node Distribution for New Model = sub-segment length within r-circle = = total length within a-circle Probability that node lies within a circle of radius r = = (which is uniform)

We apply similar reasoning to donut geometry for following cases: 1. Donut 1 : where only such are chosen such that path does not collide with inner circle. 2. Donut 2 : where only such are chosen such that path always collides with inner circle and after collision the node reflects back. b a

Extending the same logic we get the node distribution as : Donut 1: Donut 2:

Outage Probability Probability that a node is deprived of connection (call it ). We assume outage for a node if it has no other node present within a distance d. x a d

For circle geometry we get = Outage probability ( ) =

For donut geometry we get = Outage probability ( ) =

Comparison between Theoretical and Simulation Results

Conclusion A new mobility model was suggested and was applied to three different scenarios. Theoretical expressions for node distribution of all three were derived which agree very closely with simulations. Node distribution for circle is uniform and for donut 1 is nearly uniform. By using these two in conjunction we can get a scalable mobility model. Performance criteria are MODEL SENSITIVE.

References “Stationary Distributions for the Random Waypoint Mobility Model” by William Navidi and Tracy Camp. “Random Waypoint Considered Harmful” by J. Yoon et al. “Understanding the Simulation of Mobility Models with Palm Calculus” by Jean-Yves Le Boudec

Acknowledgements Dr. Carl Baum Dr. Noneaker and Dr. Xu Rahul, Josh and other graduate students Fellow SURE participants SURE Program, Clemson University

Questions