Social Networks Based Ad Hoc Mobility Models Mirco Musolesi Stephen Hailes Cecilia Mascolo University College London 3 rd UK-Ubinet Workshop Bath, 9-11.

Slides:



Advertisements
Similar presentations
Energy-Efficient Distributed Algorithms for Ad hoc Wireless Networks Gopal Pandurangan Department of Computer Science Purdue University.
Advertisements

Scale Free Networks.
Milgram-Routing in Social Networks
Lect.3 Modeling in The Time Domain Basil Hamed
1 Intrusion Monitoring of Malicious Routing Behavior Poornima Balasubramanyam Karl Levitt Computer Security Laboratory Department of Computer Science UCDavis.
Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks Reported by: 莫斌.
MPAC 2004Rae Harbird 1 RUBI Adaptive Resource Discovery for Ubiquitous Computing Rae Harbird Stephen Hailes
Source-Location Privacy Protection in Wireless Sensor Network Presented by: Yufei Xu Xin Wu Da Teng.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Information Networks Small World Networks Lecture 5.
SLAW: A Mobility Model for Human Walks Lee et al..
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
Small-World Graphs for High Performance Networking Reem Alshahrani Kent State University.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
Adapting Asynchronous Messaging Middleware to Ad Hoc Networking Mirco Musolesi Cecilia Mascolo Stephen Hailes Dept. of Computer Science University College.
April “ Despite the increasing importance of mathematics to the progress of our economy and society, enrollment in mathematics programs has been.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (II) 11th Week
Building Low-Diameter P2P Networks Eli Upfal Department of Computer Science Brown University Joint work with Gopal Pandurangan and Prabhakar Raghavan.
Simulation Models as a Research Method Professor Alexander Settles.
Sociological Influences on Mobile Wireless Networks Chunming Qiao, Ph.D., Professor University at Buffalo (SUNY) Director, Laboratory for Advanced Network.
Module C9 Simulation Concepts. NEED FOR SIMULATION Mathematical models we have studied thus far have “closed form” solutions –Obtained from formulas --
Impact of Different Mobility Models on Connectivity Probability of a Wireless Ad Hoc Network Tatiana K. Madsen, Frank H.P. Fitzek, Ramjee Prasad [tatiana.
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
A Collaborative Music DJ for Ad Hoc Networks Ursula Wolz Mike Massimi Eric Tarn Department of Computer Science The College of New Jersey.
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models Pei’en LUO.
Methods Demarcating into two parts to present, one is the method of location update, the other is method of data communication, namely ILSR. Location Update.
Profiles and Multi-Topology Routing in Highly Heterogeneous Ad Hoc Networks Audun Fosselie Hansen Tarik Cicic Paal Engelstad Audun Fosselie Hansen – Poster,
Context-aware Adaptive Routing for Delay Tolerant Networking Mirco Musolesi Joint work with Cecilia Mascolo Department of Computer Science University College.
1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
“The Geography of the Internet Infrastructure: A simulation approach based on the Barabasi-Albert model” Sandra Vinciguerra and Keon Frenken URU – Utrecht.
1 Constant Density Spanners for Wireless Ad-Hoc Networks Discrete Mathematics and Algorithms Seminar Melih Onus April
1 AutoconfBOF2.PPT / Aug / Singh,Perkins,Clausen IETF Not Confidential Ad hoc network autoconfiguration: definition and problem statement (draft-singh-autoconf-adp-00.txt)
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
CENTRE CEllular Network Trajectories Reconstruction Environment F. Giannotti, A. Mazzoni, S. Puntoni, C. Renso KDDLab, Pisa.
COM1721: Freshman Honors Seminar A Random Walk Through Computing Lecture 2: Structure of the Web October 1, 2002.
Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
User-Centric Data Dissemination in Disruption Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania State University.
Random Graph Generator University of CS 8910 – Final Research Project Presentation Professor: Dr. Zhu Presented: December 8, 2010 By: Hanh Tran.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
Topics Paths and Circuits (11.2) A B C D E F G.
© 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.
Siddhartha Gunda Sorabh Hamirwasia.  Generating small world network model.  Optimal network property for decentralized search.  Variation in epidemic.
Metrics for Performance Evaluation of Distributed Application Execution in Ubiquitous Computing Environments Prithwish Basu ECE Department, Boston University.
Analyzing Networks. Milgram’s Experiments “Six degrees of Separation” Milgram’s letters to various recruits in Nebraska who were asked to forward the.
VORONOI DIAGRAM AND CONVEX HULL BASED GEOCASTING AND ROUTING IN WIRELESS NETWORKS 指導教授:許子衡 報告學生:翁偉傑 1 Copyright # 2006 John Wiley & Sons, Ltd. Wirel. Commun.
REU 2009-Traffic Analysis of IP Networks Daniel S. Allen, Mentor: Dr. Rahul Tripathi Department of Computer Science & Engineering Data Streams Data streams.
Evolution of Cooperation in Mobile Ad Hoc Networks Jeff Hudack (working with some Italian guy)
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Verein Konstantin Melnik Svetlana
1 הקדמה מטרת הפרויקט המרת תוכן חיפוש ודירוג ניסוי ותוצאות סיכום חידושים Realistic Mobility & Channel Models integration in OMNeT++ Final Project Presentation.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Context-aware Adaptive Routing for Delay Tolerant Networking
Node Distribution of a New Scalable Mobility Model for Ad Hoc Wireless Networks Sheeraz Ahmad.
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
What is Mobile Network? Why is it called Ad Hoc?
Applications of graph theory in complex systems research
Highway Vehicular Delay Tolerant Networks: Information Propagation Speed Properties Emmanuel Baccelli, Philippe Jacquet, Bernard Mans, and Georgios Rodolakis.
Internet of Things A Process Calculus Approach
Robustness of wireless ad hoc network topologies
Department of Computer Science University of York
Robustness of wireless ad hoc network topologies
Vehicular Ad-hoc Networks
(Social) Networks Analysis II
Presentation transcript:

Social Networks Based Ad Hoc Mobility Models Mirco Musolesi Stephen Hailes Cecilia Mascolo University College London 3 rd UK-Ubinet Workshop Bath, 9-11 February 2005

Mobility models for ad hoc networks research Current and past research work based on simplistic mobility models Nobody moves following Random Way Point model based patterns Need for more realistic mobility models Representing real situations is difficult, but reasonable approximations of the reality are possible

Mobile ad hoc networks are social networks after all… Mobile devices are carried by humans. In a sense, it is possible to map networks of mobile nodes into a map of individuals

Social networks studies The famous “Six Degrees of Separation” Random networks studies by Erdos Small worlds model and scale-free networks Watts-Strogatz model Albert-Barabasi model Current hot topic in theoretical physics

Design of a mobility model founded on social network theory

Dynamics of the mobile hosts Problem of grouping Detection of communities Influenced by social relationships Main concept: hosts move preferentially towards the hosts that have strong relationships with them Problem of choosing goals in the simulation space

Dynamics of the mobile hosts Every host belongs to a cloud Hosts and clouds move towards a goal The movements of the hosts are the result of the composition of the their speed and the speed of the clouds they belong to. Reaching a goal: point of choice New goals chosen according to the profile of every host

Host profiling Every host is characterised by: its sociability (i.e., its tendency to stay inside a group of people) its network of social relationships Therefore, the movements of the hosts are influenced by its sociability and the attractivity exterted by the other groups of hosts

Mobility models and complex networks theory Study of the properties of the generated network: connectivity diameter average path length etc. Powerful analysis technique to help to design and improve algorithms, protocols and systems for pervasive computing

Mobility models and traces Refinement and validation of the mobility model Or viceversa, analysis and formalisation of traces by using mathematical models used to design mobility models Issues: Traces describe very specific scenarios Traces are very difficult to obtain

Current research directions Use of different social networks to represent the relative importance of the social relationships during the day Detection of community in social networks structures -> definition of community-based mobility models Geographical mapping of groups Study of the performance of algorithms and protocols with different mobility models

References Mirco Musolesi, Stephen Hailes and Cecilia Mascolo An Ad Hoc Mobility Model Founded on Social Network Theory Proceedings of the 7th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM’04). Venice, Italy. October 2004.

Questions Mirco Musolesi Mobile Systems Interest Group Dept. of Computer Science, UCL