POSTER TEMPLATE BY: www.PosterPresentations.com Glasgow Mobility Model for Mobile Ad Hoc Networks Sarah Al-Humoud, Lewis M. Mackenzie and Wim Vanderbauwhede.

Slides:



Advertisements
Similar presentations
Supporting Cooperative Caching in Disruption Tolerant Networks
Advertisements

An Adaptive Compulsory Protocol for Basic Communication in Ad-hoc Mobile Networks Ioannis Chatzigiannakis Sotiris Nikoletseas April 2002.
Multicasting in Mobile Ad Hoc Networks Ravindra Vaishampayan Department of Computer Science University of California Santa Cruz, CA 95064, U.S.A. Advisor:
CSE 6590 Department of Computer Science & Engineering York University 1 Introduction to Wireless Ad-hoc Networking 5/4/2015 2:17 PM.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
An Ad Hoc Network Taxi Dispatch System E Huang Digital Technology Group Computer Laboratory University of Cambridge.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Arsitektur Jaringan Terkini
1 SOWER: Self-Organizing Wireless Network for Messaging Márk Félegyházi {mark.felegyhazi, srdan.capkun, Srdjan Čapkun Jean-Pierre.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
Rescue operations using coordinated multicast MANET Alexandros Vasiliou and Anastasios A. Economides {avasil, Information Systems Department.
Chapter 41 Information Technology For Management 6 th Edition Turban, Leidner, McLean, Wetherbe Lecture Slides by L. Beaubien, Providence College John.
MANETs A Mobile Ad Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless links. Characteristics include: no fixed infrastructure.
AdHoc Probe: Path Capacity Probing in Wireless Ad Hoc Networks Ling-Jyh Chen, Tony Sun, Guang Yang, M.Y. Sanadidi, Mario Gerla Computer Science Department,
1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.
1 Internet Networking Spring 2006 Tutorial 3 Ad-hoc networks TBRPF (based on IETF tutorials on TBRPF)
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models Pei’en LUO.
Ad Hoc Networking via Named Data Michael Meisel, Vasileios Pappas, and Lixia Zhang UCLA, IBM Research MobiArch’10, September 24, Shinhaeng.
CCH: Cognitive Channel Hopping in Vehicular Ad Hoc Networks Brian Sung Chul Choi, Hyungjune Im, Kevin C. Lee, and Mario Gerla UCLA Computer Science Department.
PhD-TW-Colloquium, October 09, 2008Polling systems as performance models for mobile ad hoc networking Ahmad Al Hanbali, Richard Boucherie, Jan-Kees van.
POSTER TEMPLATE BY: Efficient Counter-Based Flooding for Mobile Ad Hoc Networks S. Al-Humoud, M. Ould Khaoua and L. M. Mackenzie.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
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.
Presented by Fei Huang Virginia Tech April 4, 2007.
ROUTING ALGORITHMS IN AD HOC NETWORKS
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
Jason Ernst, University of Guelph 1.  Introduction ◦ Background Information ◦ Motivation for Research / Current Problems  Proposed Solution ◦ Algorithm.
A study of Intelligent Adaptive beaconing approaches on VANET Proposal Presentation Chayanin Thaina Advisor : Dr.Kultida Rojviboonchai.
Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki MANET (Mobile Ad-hoc.
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.
A Fuzzy Content Centric Network Architecture for Real-time Communications in MANETs Niaz Morshed Chowdhury Dr. Lewis M. Mackenzie School of Computing Science.
PRESENTED BY, V.Rajasekaran. AD-HOC SENSOR NETWORK USING HYBRID ENERGY EFFICIENT DISTRIBUTED CLUSTERING.
Sentient Transportation Systems [Using sensor networks for building a full fledged transportation system for a township] Mobile Computing Class CEN 5531.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
DHT-based unicast for mobile ad hoc networks Thomas Zahn, Jochen Schiller Institute of Computer Science Freie Universitat Berlin 報告 : 羅世豪.
Security in Wireless Ad Hoc Networks. 2 Outline  wireless ad hoc networks  security challenges  research directions  two selected topics – rational.
BY PREETHI.E. * For people living in developed countries the absolute volume of road traffic can be a daily nuisance. In addition, the road traffic.
Amit Saha April 13 th, 2005 VANET : V EHICULAR A D HOC NET WORKS.
Network Connectivity of VANETs in Urban Areas Wantanee Viriyasitavat, Ozan K. Tonguz, Fan Bai IEEE communications society conference on sensor, mesh and.
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
Mobile Computing and Wireless Communication Pisa 26 November 2002 Roberto Baldoni University of Roma “La Sapienza”
Chapter 14 : Modeling Mobility Andreas Berl. 2 Motivation  Wireless network simulations often involve movements of entities  Examples  Users are roaming.
Communication in heterogeneous ad hoc grid Shan Natarajan.
Two Connected Dominating Set Algorithms for Wireless Sensor Networks Overview Najla Al-Nabhan* ♦ Bowu Zhang** ♦ Mznah Al-Rodhaan* ♦ Abdullah Al-Dhelaan*
Wireless Ad Hoc Networks
Ασύρματες και Κινητές Επικοινωνίες Ενότητα # 12: Ασύρματα Δίκτυα Πλέγματος (Wireless Mesh Networks) Διδάσκων: Βασίλειος Σύρης Τμήμα: Πληροφορικής.
Routing Metrics and Protocols for Wireless Mesh Networks Speaker : 吳靖緯 MA0G0101.
Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.
A New Class of Mobility Models for Ad Hoc Wireless Networks Rahul Amin Advisor: Dr. Carl Baum Clemson University SURE 2006.
I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Verein Konstantin Melnik Svetlana
Wireless Sensor Networks: A Survey I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci.
HoWL: An Efficient Route Discovery Scheme Using Routing History in Mobile Ad Hoc Networks Faculty of Environmental Information Mika Minematsu
MOBILE AD-HOC NETWORKS
Jérôme Härri, Fethi Filali, Christian Bonnet
What is Mobile Network? Why is it called Ad Hoc?
CHARACTERISTICS.
Wireless and Mobile Ad Hoc Networks
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Mobile ad hoc networking: imperatives and challenges
Study of performance of regular TCP in MANETs (using simulator).
Motion-Aware Routing in Vehicular Ad-hoc Networks
Presentation transcript:

POSTER TEMPLATE BY: Glasgow Mobility Model for Mobile Ad Hoc Networks Sarah Al-Humoud, Lewis M. Mackenzie and Wim Vanderbauwhede University of Glasgow, Glasgow, G12 8RZ, U.K. {sara, lewis, MANET References MANETs Evaluation techniques There are four available techniques to evaluate MANETs performance. Namely: analytical modelling, network simulation, real-world measurements and network emulation. [1] A mobility model is a core component in mobile network simulations. It mainly describes node movements, location and velocity over time. This description feeds the network simulation in a form of a trace file. Mobility models could be categorised according to node movements into independent and group mobility models [2]. Examples to the former category are random walk, random way point and markov mobility models. Reference Point Group Mobility is an example of the later. Mobility Models A MANET (Mobile Ad Hoc Network) consists of a set of mobile nodes communicating in a multi-hop way without any fixed infrastructure such as access points or base stations. Characteristics of MANET  No centralized control & administration  Self-organizing and self-restoring  Transmission through multiple hops  Frequent link breakage and change of network topology Applications of MANET  Battlefield communication  Sensor networks  Personal area networking using PDAs, laptops and handphones, etc  Cellular network and wireless Hot Spot extension MANETs Evaluation Techniques Measurement Analytical modelling Emulation Simulation Manhattan mobility model Analytical Modelling Emulation Measurement Simulation Glasgow Mobility Model Analytical modeling require a small time with low cost. However, it has low salability as well. Measurements are possible if something similar to the proposed system already exists. This is a hybrid approach between simulations and measurements [3]. Simulation is convenient for its low cost compared to measurement. It has a medium realism that comes between analytical modelling and measurement. Moreover, simulation results are suspicious until validated. Glasgow Mobility Model uses a grid road topology and is based on the existing Manhattan mobility model. It tries to solve two problems in the Manhattan model. The problems are. Firstly, it permits car stacking, that is, no maximum cars capacity per lane, Figure 2. Second when a car reaches the end of a lane it starts again at the beginning of that lane. Both problems are results of synthetic over-simplification that drives the simulation away from reality and meaningfulness. In Glasgow mobility model we aim at solving those two problems. Our mobility model assumes Glasgow city center map, Figure 3, as a base map with nine horizontal and ten vertical streets. Figure 1: MANETs Evaluation techniques Figure 2: Car staking problem in Manhattan Mobility model [1] R. Jain, The art of computer systems performance analysis : techniques for experimental design, measurement, simulation, and modeling. New York: Wiley, [2] F. Bai and A. Helmy, "A SURVEY OF MOBILITY MODELS in Wireless Adhoc Networks," in Wireless Ad Hoc and Sensor Networks: Kluwer Academic Publishers, [3] M. Kropff, T. Krop, M. Hollick, P. S. Mogre, and R. Steinmetz, "A Survey of Real-world and Emulation Testbeds for Mobile Ad hoc Networks," presented at 2nd International Conference on In Testbeds and Research Infrastructures for the Development of Networks and Communities, In Manhattan mobility model, mobile nodes move in two directions either horizontal or vertical direction on a map. The Manhattan model employs a probabilistic approach in the selection of nodes movements. At each intersection, a vehicle chooses to keep moving in the same direction, take a left turn or a right turn. Though the Manhattan mobility model is a step forward towards realism it suffers from two main problems that are stated in the next section. Figure 2 illustrates the first problem which is the car stacking problem, with the coloured cars showing the exact problem. Figure 3: Glasgow city center simplified map Department of Computing Science