MLS An Efficient Location Service for Mobile Ad Hoc Networks Roland Flury Roger Wattenhofer
|
|
|
- Bernice Woods
- 6 years ago
- Views:
Transcription
1 MLS An Efficient Location Service for Mobile Ad Hoc Networks Roland Flury Roger Wattenhofer Distributed Computing Group
2 Geographic Routing To each message, piggyback the position of the receiver The routing decision is solely based on this information Greedy forwarding: A node forwards a message to its neighbor closest to the destination Face routing: To surround routing voids, a message may be routed along the border of the hole Roland Flury, ETH MobiHoc
3 Geographic Routing Advantages of georouting No routing tables, efficient and scalable No setup time, each new node can participate immediately Fully reactive (on demand) routing once the position of the destination is known Roland Flury, ETH MobiHoc
4 Location Service Q: How can a node determine the position of another node? Proactive distribution Each node broadcasts its position VERY expensive Home based location service Each node has an associated place (its home) where it stores its location The place is determined by the hash value of the node s ID Any node can determine this place This is a GHT (Geographic Hash Table) Roland Flury, ETH MobiHoc
5 GHT: Home Based Location Service Each node has a single location server Chosen at a random position Good load balancing Each node has to store location information only for a few nodes Arbitrary high stretch: Roland Flury, ETH MobiHoc
6 Mobility Mobile nodes complicate location services tremendously The position of a node cannot be known exactly, as it may change continuously Any location information has to be considered stale Lookup of position not wise, rather route messages through location server? Roland Flury, ETH MobiHoc
7 Some Related Work in the field of Location Services LLS: LLS: A Locality Aware Location Service for Mobile Ad Hoc Networks by Abraham et DIALM-POMC 2004 GLS: A Scalable Location Service for Geographic Ad Hoc Routing by Li et MobiCom 2000 DLM: A Scalable Location Management Scheme in Mobile Ad Hoc Networks by Xue et al. in LCN 2001 HIGH-GRADE: Enhancing Location Service Scalability with High- Grade by Yu et MASS 2005 Scalable Ad Hoc Routing: The Case for Dynamic Addressing by Eriksson et InfoCom 2004 Geographic Routing without Location Information by Rao et MobiCom 2003 Topology Independent Location Service for Self-Organizing Networks by Rezende et MobiHoc 2005 Roland Flury, ETH MobiHoc
8 Related Work (Excerpt) - GLS GLS: A Scalable Location Service for Geographic Ad Hoc Routing by Li et MobiCom 2000 Lookup cost: Size of the biggest surrounding square (level) Publish cost: not bounded , 31, 32, 74, 75, 79, Roland Flury, ETH MobiHoc
9 Related Work (Excerpt) - LLS LLS: LLS: A Locality Aware Location Service for Mobile Ad Hoc Networks by Abraham et DIALM-POMC 2004 Lookup cost: O( d 2 ) Publish cost (amortized): O(d log d) Roland Flury, ETH MobiHoc
10 Mobility revisited GLS and LLS support mobile nodes, but not concurrent lookup and mobility Existing solutions assume that mobility and lookups do not interfere Mobility Phase Lookup Phase The nodes are mobile and update their location servers XOR The nodes perform lookups That s clearly not what we expect from a MANET! Nodes cannot move freely Lookups / routing cannot happen concurrently Synchronization would be required to switch between the two phases Roland Flury, ETH MobiHoc
11 Mobility but limited Nodes may not move arbitrarily fast! If a node moves faster than the message propagation speed, no routing algorithm can ensure delivery Thus, we must limit the maximum node speed Maximum node speed can be expressed as a function of the message propagation speed of the underlying routing algorithm Roland Flury, ETH MobiHoc
12 Outline Motivation for building location services Mobility and its issues Related work MLS our contribution Model Algorithm & Analysis Conclusion Roland Flury, ETH MobiHoc
13 MLS Location Service for Truly Mobile Nodes The lookup service works despite of concurrent mobility Nodes may move freely at any time and anywhere Lookup and routing requests may execute at any time Routing is performed through the lookup mechanism No stale location information Lookup / routing overhead: close to optimal Routing to a node costs O(d), where d is the distance Moderate publish overhead due to mobility Amortized bit-meter cost is O(d log d) for moving a distance d Quite fast moving nodes! Nodes may move up to 1/15 of the message propagation speed On arbitrary paths Roland Flury, ETH MobiHoc
14 Model Deployment Area Nodes populate land areas Lake denote holes Connected graph, no islands Connectivity n 1, n 2 are connected if d(n 1, n 2 ) r min Density For any point on land, there exists a node at most r min / 3 away Thus, relatively dense node deployment Node Equipment Position module (GPS, Galileo, local system, ) Communication module Underlying Routing Given a destination position p t, we can route a message in η d(p s, p t ) from the sender position p s to p t Roland Flury, ETH MobiHoc
15 Outline Motivation for building location services Mobility and its issues Related work MLS our contribution Model Algorithm & Analysis Conclusion Roland Flury, ETH MobiHoc
16 Selection of Location Servers Each node builds a hierarchy of location servers that are located in exponentially increasing areas around the node. Top level surrounds entire world Each level is divided in 4 sub-squares A level pointer points to the next smaller level that surrounds t The position of the level pointer is determined by hashing the ID of t L t 0 L t M LP t M ½ t L t 1 LP t 1 L t 2 LP t 2 LP t M 1 t Roland Flury, ETH MobiHoc
17 Routing in MLS Routing in MLS consists of two phases 1) Find a Location Pointer of the destination 2) Recursively follow the Location Pointers The second step pretty easy: Performance If the destination is d away from sender, the lookup path is O( d ). Roland Flury, ETH MobiHoc
18 How to find a Location Pointer First, the sender assumes that the destination is in its vicinity While the lookup request fails to find a location pointer, it increases the search area Performance If the destination is d away from sender, the lookup path to find a first location pointer is O( d ). Roland Flury, ETH MobiHoc
19 Supporting Mobility A location pointer only needs to be updated when the node leaves the corresponding subsquare. Most of the time, only the closest few location pointers need to be updated due to mobility Not enough to guarantee low publish overhead! If node oscillates over grid-boundary of several layers, many location pointers need to be updated. Unbounded publish cost! Roland Flury, ETH MobiHoc
20 Lazy Publishing To overcome exorbitant publish cost due to oscillating ε moves: Only update a location pointer if the node has moved away quite a bit? Breaks the location pointer chain! Roland Flury, ETH MobiHoc
21 Lazy Publishing with Forwarding Pointers To repair the lookup path, add a forwarding pointer that points to the neighboring level that contains the location pointer. Roland Flury, ETH MobiHoc
22 Supporting Concurrency Allowing for concurrent lookup requests and node mobility is somewhat tricky LP t i +1 FP LP t i t LP t i Roland Flury, ETH MobiHoc
23 Supporting Concurrency Allowing for concurrent lookup requests and node mobility is somewhat tricky LP t i +1 LP t i t FP t i LP t i Roland Flury, ETH MobiHoc
24 Supporting Concurrency Allowing for concurrent lookup requests and node mobility is somewhat tricky Especially the deletion of location pointers and forwarding pointers Routing of messages needs time Sending a message to the next location pointer Sending command messages to update / delete / create a location pointer LP t i +1 t LP t i Note: These problems arise independently of the node speed. FP t i? LP t i Roland Flury, ETH MobiHoc
25 Supporting Concurrency TFP Solution to overcome the concurrency issue: Do not delete a location or forwarding pointer, but replace it with a Temporary Forwarding Pointer (TFP) A temporary pointer redirects a lookup to the neighbor level where the node is located. LP t i +1 t LP t i TFP are temporary and must be removed after a well known time. TFP t i FP t i TFP t i LP t i Roland Flury, ETH MobiHoc
26 Speeding A mobile node may generate many forwarding pointers while a lookup searches for it If the lookup is not fast enough, it permanently follows forwarding pointers LP FP t i TFP t i LP t i TFP t i LP t i LP TFP t i t i Roland Flury, ETH MobiHoc
27 Speeding A mobile node may generate many forwarding pointers while a lookup searches for it If the lookup is not fast enough, it permanently follows forwarding pointers LP FP t i TFP t i LP t i TFP t i LP t i LP TFP t i t i Roland Flury, ETH MobiHoc
28 Performance of MLS The maximum node speed depends on several parameters Min. speed of underlying routing Lazyness in lazy publishing How long we are willingly to follow temporary and forwarding pointers of a moving node Please see paper [ ] Without lakes, the maximum node speed may for not details exceed 1/15 of the minimum message speed of the underlying routing. 15 Despite of this relatively high node speed Lookup cost is O( d ) Amortized publish cost is O(d log d ) v node v msg Roland Flury, ETH MobiHoc
29 Questions / Comments Thank you! Questions / Comments? Distributed Computing Group Roland Flury Roger Wattenhofer Roland Flury, ETH MobiHoc
30 BACKUP Publish Algorithm Lookup Algorithm Nomenclature GLS (Related work) LLS (Related work) LLS WC Roland Flury, ETH MobiHoc
31 Publish Algorithm Roland Flury, ETH MobiHoc
32 Lookup Algorithm Roland Flury, ETH MobiHoc
33 Nomenclature Roland Flury, ETH MobiHoc
34 LLS Worst Case Roland Flury, ETH MobiHoc
35 LLS Worst Case Roland Flury, ETH MobiHoc
36 LLS Worst Case Roland Flury, ETH MobiHoc
37 LLS Worst Case Roland Flury, ETH MobiHoc
38 LLS Worst Case Roland Flury, ETH MobiHoc
39 LLS Worst Case Roland Flury, ETH MobiHoc
40 LLS Worst Case Roland Flury, ETH MobiHoc
41 LLS Worst Case Roland Flury, ETH MobiHoc
42 LLS Worst Case n2 n3 n1 n4 B Roland Flury, ETH MobiHoc
43 LLS Worst Case Roland Flury, ETH MobiHoc
44 LLS Worst Case Roland Flury, ETH MobiHoc
45 LLS Worst Case Roland Flury, ETH MobiHoc
46 LLS Worst Case Roland Flury, ETH MobiHoc
47 LLS Worst Case n1 n2 n4 n3 n5 B Roland Flury, ETH MobiHoc
48 LLS Worst Case n1 n2 n4 n3 n5 B Roland Flury, ETH MobiHoc
49 n1 n2 n4 n3 n5 B Roland Flury, ETH MobiHoc
Chapter 8 LOCATION SERVICES
Chapter 8 LOCATION SERVICES Distributed Computing Group Mobile Computing Winter 2005 / 2006 Overview Mobile IP Motivation Data transfer Encapsulation Location Services & Routing Classification of location
Mobility. Chapter 13. Ad Hoc and Sensor Networks Roger Wattenhofer 13/1
Mobility Chapter 13 Ad Hoc and Sensor Networks Roger Wattenhofer 13/1 More Car Network Ideas CAR2CAR Consortium: Audi, BMW, Daimler, Fiat, GM, Honda, Renault, VW Rating Area maturity First steps Text book
Mobility Chapter 5 Ad Hoc a Hoc nd S ensor Net r works rks Roger W r a W ttenhofer fe r 5/1
Mobility Chapter 5 Ad Hoc and Sensor Networks Roger Wattenhofer 5/1 Rating Area maturity First steps Text book Practical importance No apps Mission critical Theoretical importance Not really Must have
Location Services. Otmar Caduff
Location Services Otmar Caduff The papers A Scalable Location Service for Geographic Ad Hoc Routing J. Li, J. Jannotti, D.S.J. De Couto, D.R. Karger, R. Morris; MobiCom 2000 LLS: a Locality Aware Location
Data-Centric Query in Sensor Networks
Data-Centric Query in Sensor Networks Jie Gao Computer Science Department Stony Brook University 10/27/05 Jie Gao, CSE590-fall05 1 Papers Chalermek Intanagonwiwat, Ramesh Govindan and Deborah Estrin, Directed
Keywords MANETS, Geographical Routing, Data Delivery
Volume 3, Issue 7, July 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Encrypted and Consistent
Naming. Distributed Systems IT332
Naming Distributed Systems IT332 2 Outline Names, Identifier, and Addresses Flat Naming Structured Naming 3 Names, Addresses and Identifiers A name is used to refer to an entity An address is a name that
Geographic Routing in Simulation: GPSR
Geographic Routing in Simulation: GPSR Brad Karp UCL Computer Science CS M038/GZ06 23 rd January 2013 Context: Ad hoc Routing Early 90s: availability of off-the-shelf wireless network cards and laptops
Thomas Moscibroda Roger Wattenhofer MASS Efficient Computation of Maximal Independent Sets in Unstructured Multi-Hop Radio Networks
Efficient Computation of Maximal Independent Sets in Unstructured Multi-Hop Radio Networks Thomas Moscibroda Roger Wattenhofer Distributed Computing Group MASS 2004 Algorithms for Ad Hoc and Sensor Networks...
Performance Comparison of Scalable Location Services for Geographic Ad Hoc Routing
Performance Comparison of Scalable Location Services for Geographic Ad Hoc Routing Saumitra M. Das, Himabindu Pucha and Y. Charlie Hu School of Electrical and Computer Engineering Purdue University West
Inter-Domain Routing and Data Replication in Virtual Coordinate Based Networks
Inter-Domain Routing and Data Replication in Virtual Coordinate Based Networks Falko Dressler, Abdalkarim Awad and Mario Gerla Dept. of Computer Science, University of Erlangen, Germany {abdalkarim.awad,dressler}@informatik.uni-erlangen.de
Draft Notes 1 : Scaling in Ad hoc Routing Protocols
Draft Notes 1 : Scaling in Ad hoc Routing Protocols Timothy X Brown University of Colorado April 2, 2008 2 Introduction What is the best network wireless network routing protocol? This question is a function
Lecture 6: Overlay Networks. CS 598: Advanced Internetworking Matthew Caesar February 15, 2011
Lecture 6: Overlay Networks CS 598: Advanced Internetworking Matthew Caesar February 15, 2011 1 Overlay networks: Motivations Protocol changes in the network happen very slowly Why? Internet is shared
EZR: Enhanced Zone Based Routing In Manet
EZR: Enhanced Zone Based Routing In Manet Bency Wilson 1, Geethu Bastian 2, Vinitha Ann Regi 3, Arun Soman 4 Department of Information Technology, Rajagiri School of Engineering and Technology, Rajagiri
Routing. Information Networks p.1/35
Routing Routing is done by the network layer protocol to guide packets through the communication subnet to their destinations The time when routing decisions are made depends on whether we are using virtual
Variable Length and Dynamic Addressing for Mobile Ad Hoc Networks
Variable Length and Dynamic Addressing for Mobile Ad Hoc Networks Som Chandra Neema Venkata Nishanth Lolla {sneema,vlolla}@cs.ucr.edu Computer Science Department University of California, Riverside Abstract
On the scalability of rendezvous-based location services for geographic wireless ad hoc routing
Computer Networks 51 (2007) 3693 3714 www.elsevier.com/locate/comnet On the scalability of rendezvous-based location services for geographic wireless ad hoc routing Saumitra M. Das, Himabindu Pucha, Y.
An efficient implementation of the greedy forwarding strategy
An efficient implementation of the greedy forwarding strategy Hannes Stratil Embedded Computing Systems Group E182/2 Technische Universität Wien Treitlstraße 3 A-1040 Vienna Email: hannes@ecs.tuwien.ac.at
CHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL
WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL 2.1 Topology Control in Wireless Sensor Networks Network topology control is about management of network topology to support network-wide requirement.
Geo-Routing. Chapter 2. Ad Hoc and Sensor Networks Roger Wattenhofer
Geo-Routing Chapter 2 Ad Hoc and Sensor Networks Roger Wattenhofer 2/1 Application of the Week: Mesh Networking (Roofnet) Sharing Internet access Cheaper for everybody Several gateways fault-tolerance
Mobile Ad-Hoc Networks & Routing Algorithms
Mobile Ad-Hoc Networks & Routing Algorithms EMMANOUIL G. SPANAKIS, PhD. spanakis@csd.uoc.gr COLLABORATING RESEARCHER, COMPUTATIONAL BIOMEDICINE LABORATORY, FORTH-ICS VISITING LECTURER, COMPUTER SCIENCE
Geometric Ad-Hoc Routing: Of Theory and Practice. Fabian Kuhn Roger Wattenhofer Yan Zhang Aaron Zollinger
Geometric Ad-Hoc Routing: Of Theory and Practice Fabian Kuhn Roger Wattenhofer Yan Zhang Aaron Zollinger Geometric Routing s??? t s PODC 2003 2 Greedy Routing Each node forwards message to best neighbor
Geographical routing 1
Geographical routing 1 Routing in ad hoc networks Obtain route information between pairs of nodes wishing to communicate. Proactive protocols: maintain routing tables at each node that is updated as changes
Challenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning
Challenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning Brad Karp Berkeley, CA bkarp@icsi.berkeley.edu DIMACS Pervasive Networking Workshop 2 May, 2 Motivating Examples Vast
Geographical Quadtree Routing
Geographical Quadtree Routing Chen Avin, Yaniv Dvory, Ran Giladi Department of Communication Systems Engineering Ben Gurion University of the Negev Beer Sheva 84105, Israel Email: avin@cse.bgu.ac.il, dvory@bgu.ac.il,
DYNAMIC DATA ROUTING IN MANET USING POSITION BASED OPPORTUNISTIC ROUTING PROTOCOL
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 DYNAMIC DATA ROUTING IN MANET USING POSITION BASED OPPORTUNISTIC ROUTING PROTOCOL P. Kalaivani 1, G. Sathya 2, N.
l Heaps very popular abstract data structure, where each object has a key value (the priority), and the operations are:
DDS-Heaps 1 Heaps - basics l Heaps very popular abstract data structure, where each object has a key value (the priority), and the operations are: l insert an object, find the object of minimum key (find
Networks: A Deterministic Approach with Constant Overhead
Trace-Routing in 3D Wireless Sensor Networks: A Deterministic Approach with Constant Overhead Su Xia, Hongyi Wu, and Miao Jin! School of Computing and Informatics! University of Louisiana at Lafayette
1. Meshes. D7013E Lecture 14
D7013E Lecture 14 Quadtrees Mesh Generation 1. Meshes Input: Components in the form of disjoint polygonal objects Integer coordinates, 0, 45, 90, or 135 angles Output: A triangular mesh Conforming: A triangle
Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.
Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management
Node-Disjoint Multipath Routing with Group Mobility in MANETs
Node-Disjoint Multipath Routing with Group Mobility in MANETs Yun Ge 1,2, Guojun Wang 1,, and Jie Wu 3 1 School of Information Science and Engineering Central South University Changsha 410083, China 2
Ad hoc and Sensor Networks Topology control
Ad hoc and Sensor Networks Topology control Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity This chapter looks at methods to deal with such networks by Reducing/controlling
l So unlike the search trees, there are neither arbitrary find operations nor arbitrary delete operations possible.
DDS-Heaps 1 Heaps - basics l Heaps an abstract structure where each object has a key value (the priority), and the operations are: insert an object, find the object of minimum key (find min), and delete
Probabilistic Mechanism to Avoid Broadcast Storm Problem in MANETS
, pp.479-486 http://dx.doi.org/1.14257/astl.217.147.67 Probabilistic Mechanism to Avoid Broadcast Storm Problem in MANETS G Parimala 1, B Suvarna 2, N Rajeswari 3 and Venkatesulu Dondeti 4 VFSTR University,
Routing. Chapter 11. Ad Hoc and Sensor Networks Roger Wattenhofer 11/1
Routing Chapter 11 Ad Hoc and Sensor Networks Roger Wattenhofer 11/1 Application of the Week: Games / Art Uncountable possibilities, below, e.g., a beer coaster that can interact with other coasters [sentilla]
An Algorithm for Dissemination and Retrieval of Information in Wireless Ad Hoc Networks
An Algorithm for Dissemination and Retrieval of Information in Wireless Ad Hoc Networks Euro-par 27 Hugo Miranda Simone Leggio 2 Luís Rodrigues Kimmo Raatikainen 2 University of Lisbon and LaSIGE - Portugal
Protocol for Tetherless Computing
Protocol for Tetherless Computing S. Keshav P. Darragh A. Seth S. Fung School of Computer Science University of Waterloo Waterloo, Canada, N2L 3G1 1. Introduction Tetherless computing involves asynchronous
Wireless Sensor Networks (WSN) Tanyar Pooyeh Intelligent Robotics - winter semester 2013/14 Nov 11, 2013
Wireless Sensor Networks (WSN) Tanyar Pooyeh 2pooyeh@informatik.uni-hamburg.de Intelligent Robotics - winter semester 2013/14 Nov 11, 2013 Outline Multi-hop Wireless Networks MANETs, VANETs, WSNs Routing
Energy Aware and Anonymous Location Based Efficient Routing Protocol
Energy Aware and Anonymous Location Based Efficient Routing Protocol N.Nivethitha 1, G.Balaji 2 1 PG student, 2 Asst.Professor Department of Electronics and Communication Engineering Angel College of Engineering
CS 229 Final Report: Location Based Adaptive Routing Protocol(LBAR) using Reinforcement Learning
CS 229 Final Report: Location Based Adaptive Routing Protocol(LBAR) using Reinforcement Learning By: Eunjoon Cho and Kevin Wong Abstract In this paper we present an algorithm for a location based adaptive
Geographic Routing Without Location Information. AP, Sylvia, Ion, Scott and Christos
Geographic Routing Without Location Information AP, Sylvia, Ion, Scott and Christos Routing in Wireless Networks Distance vector DSDV On-demand DSR, TORA, AODV Discovers and caches routes on demand Geographic
Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks
Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on
Void Traversal for Guaranteed Delivery in Geometric Routing
Void Traversal for Guaranteed Delivery in Geometric Routing Mikhail Nesterenko and Adnan Vora Computer Science Department Kent State University Kent, OH, 44242 mikhail@cs.kent.edu, avora@cs.kent.edu arxiv:0803.3632v
Algorithm 23 works. Instead of a spanning tree, one can use routing.
Chapter 5 Shared Objects 5.1 Introduction Assume that there is a common resource (e.g. a common variable or data structure), which different nodes in a network need to access from time to time. If the
Announcements. CMPE 257: Wireless and Mobile Networking. Today. Location Management. Project status update 2. Graded exams. Hw 4 (?) Project report.
CMPE 257: Wireless and Mobile Networking Spring 2003 Lecture 17 Announcements Project status update 2. Graded exams. Hw 4 (?) Project report. CMPE 257 Spring 2003 1 CMPE 257 Spring 2003 2 Today Location
G.Narasa Reddy, 2 A.Avanthi, 3 R.Prasanth Reddy 1
ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: Enhancing DSR Protocol Performance in Mobile Ad Hoc Networks
Introduction to Sync
Introduction to Sync Outline NDN Sync overview Sync protocol design issues Sync protocol for mobile ad-hoc networks What is NDN Sync? New transport service for data-centric networking [1] Synchronizing
Routing Protocols in MANETs
Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an
Hierarchical Location Service for Mobile Ad-Hoc Networks
Hierarchical Location Service for Mobile Ad-Hoc Networks Wolfgang Kieß a Holger Füßler b Jörg Widmer c kiess@cs.uni-duesseldorf.de fuessler@informatik.uni-mannheim.de joerg.widmer@epfl.ch Martin Mauve
Exercise Unit 2: Modeling Paradigms - RT-UML. UML: The Unified Modeling Language. Statecharts. RT-UML in AnyLogic
Exercise Unit 2: Modeling Paradigms - RT-UML UML: The Unified Modeling Language Statecharts RT-UML in AnyLogic Simulation and Modeling I Modeling with RT-UML 1 RT-UML: UML Unified Modeling Language a mix
Wireless Networking Graph Theory Unplugged. Distributed Computing Group Roger Wattenhofer WG 2004
Wireless Networking Graph Theory Unplugged Distributed Computing Group Roger Wattenhofer WG 2004 Overview Introduction Ad-Hoc and Sensor Networks Routing / Broadcasting Clustering Topology Control Conclusions
Multicasting in Adhoc Networks Using MAODV Protocol
EUROPEAN ACADEMIC RESEARCH Vol. II, Issue 1/ April 2014 ISSN 2286-4822 www.euacademic.org Impact Factor: 3.1 (UIF) DRJI Value: 5.9 (B+) Multicasting in Adhoc Networks Using MAODV Protocol ALI MUSTAFA SAAD
Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANET
IJSRD - International Journal for Scientific Research & Development Vol. 1, Issue 6, 2013 ISSN (online): 2321-0613 Integrated Demand (IRA-ODGR) for MANET M J.Kalaiselvi 1 K.Sathishkumar 2 1 M.E. Student,
Clustering Algorithm (DBSCAN) VISHAL BHARTI Computer Science Dept. GC, CUNY
Clustering Algorithm (DBSCAN) VISHAL BHARTI Computer Science Dept. GC, CUNY Clustering Algorithm Clustering is an unsupervised machine learning algorithm that divides a data into meaningful sub-groups,
Replacing Failed Sensor Nodes by Mobile Robots
Replacing Failed Sensor Nodes by Mobile Robots Yongguo Mei, Changjiu Xian, Saumitra Das, Y. Charlie Hu and Yung-Hsiang Lu Purdue University, West Lafayette {ymei, cjx, smdas, ychu, yunglu}@purdue.edu Abstract
Lecture 6: Vehicular Computing and Networking. Cristian Borcea Department of Computer Science NJIT
Lecture 6: Vehicular Computing and Networking Cristian Borcea Department of Computer Science NJIT GPS & navigation system On-Board Diagnostic (OBD) systems DVD player Satellite communication 2 Internet
CSE 5306 Distributed Systems
CSE 5306 Distributed Systems Naming Jia Rao http://ranger.uta.edu/~jrao/ 1 Naming Names play a critical role in all computer systems To access resources, uniquely identify entities, or refer to locations
LECTURE 9. Ad hoc Networks and Routing
1 LECTURE 9 Ad hoc Networks and Routing Ad hoc Networks 2 Ad Hoc Networks consist of peer to peer communicating nodes (possibly mobile) no infrastructure. Topology of the network changes dynamically links
Approximately Uniform Random Sampling in Sensor Networks
Approximately Uniform Random Sampling in Sensor Networks Boulat A. Bash, John W. Byers and Jeffrey Considine Motivation Data aggregation Approximations to COUNT, SUM, AVG, MEDIAN Existing work does not
Anil Saini Ph.D. Research Scholar Department of Comp. Sci. & Applns, India. Keywords AODV, CBR, DSDV, DSR, MANETs, PDF, Pause Time, Speed, Throughput.
Volume 6, Issue 7, July 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance Analysis
Graph Algorithms. Many problems in networks can be modeled as graph problems.
Graph Algorithms Many problems in networks can be modeled as graph problems. - The topology of a distributed system is a graph. - Routing table computation uses the shortest path algorithm - Efficient
BGR: Blind Geographic Routing for Sensor Networks
BGR: Blind Geographic Routing for Sensor Networks Matthias Witt 1 and Volker Turau 1 1 Department of Telematics, Hamburg University of Technology, Hamburg, Germany {matthias.witt,turau}@tuhh.de Abstract
Multi Hop Send Protocol Tool for TinyNodes Semesterthesis
Multi Hop Send Protocol Tool for TinyNodes Semesterthesis Author: Supervisor: Tutor: Remo Niedermann Prof. Dr. Roger Wattenhofer Roland Flury Zurich, February 19, 2009 Acknowledgment At first I want to
Lecturers: Sanjam Garg and Prasad Raghavendra March 20, Midterm 2 Solutions
U.C. Berkeley CS70 : Algorithms Midterm 2 Solutions Lecturers: Sanjam Garg and Prasad aghavra March 20, 207 Midterm 2 Solutions. (0 points) True/False Clearly put your answers in the answer box in front
Chapter 16 Networking
Chapter 16 Networking Outline 16.1 Introduction 16.2 Network Topology 16.3 Network Types 16.4 TCP/IP Protocol Stack 16.5 Application Layer 16.5.1 Hypertext Transfer Protocol (HTTP) 16.5.2 File Transfer
[Kleinberg04] J. Kleinberg, A. Slivkins, T. Wexler. Triangulation and Embedding using Small Sets of Beacons. Proc. 45th IEEE Symposium on Foundations
![[Kleinberg04] J. Kleinberg, A. Slivkins, T. Wexler. Triangulation and Embedding using Small Sets of Beacons. Proc. 45th IEEE Symposium on Foundations](/thumbs/96/126993271.jpg "[Kleinberg04] J. Kleinberg, A. Slivkins, T. Wexler. Triangulation and Embedding using Small Sets of Beacons. Proc. 45th IEEE Symposium on Foundations")
Landmark-based routing Landmark-based routing [Kleinberg04] J. Kleinberg, A. Slivkins, T. Wexler. Triangulation and Embedding using Small Sets of Beacons. Proc. 45th IEEE Symposium on Foundations of Computer
PARALLEL ROUTING IN MOBILE AD-HOC NETWORKS
PARALLEL ROUTING IN MOBILE AD-HOC NETWORKS Khaled Day, Abderezak Touzene, Bassel Arafeh, Nasser Alzeidi Department of Computer Science, Sultan Qaboos University, Muscat, Oman kday@squ.edu.om, arafeh@squ.edu.om,
Graph Algorithms. Many problems in networks can be modeled as graph problems.
Graph Algorithms Graph Algorithms Many problems in networks can be modeled as graph problems. - The topology of a distributed system is a graph. - Routing table computation uses the shortest path algorithm
Efficient and Robust Geocasting Protocols for Sensor Networks
Efficient and Robust Geocasting Protocols for Sensor Networks Karim Seada, Ahmed Helmy Electrical Engineering Department, University of Southern California {seada, helmy}@usc.edu Abstract- Geocasting is
Ad Hoc Wireless Routing CS 218- Fall 2003
Ad Hoc Wireless Routing CS 218- Fall 2003 Wireless multihop routing challenges Review of conventional routing schemes Proactive wireless routing Hierarchical routing Reactive (on demand) wireless routing
Simulations of the quadrilateral-based localization
Simulations of the quadrilateral-based localization Cluster success rate v.s. node degree. Each plot represents a simulation run. 9/15/05 Jie Gao CSE590-fall05 1 Random deployment Poisson distribution
殷亚凤. Naming. Distributed Systems [5]
![殷亚凤. Naming. Distributed Systems [5]](/thumbs/89/100181394.jpg "殷亚凤. Naming. Distributed Systems [5]")
Naming Distributed Systems [5] 殷亚凤 Email: yafeng@nju.edu.cn Homepage: http://cs.nju.edu.cn/yafeng/ Room 301, Building of Computer Science and Technology Review Concepts about faults How to improve dependability
Impact of Node Velocity and Density on Probabilistic Flooding and its Effectiveness in MANET
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 12, December 2014,
Load Balanced Short Path Routing in Wireless Networks Jie Gao, Stanford University Li Zhang, Hewlett-Packard Labs
Load Balanced Short Path Routing in Wireless Networks Jie Gao, Stanford University Li Zhang, Hewlett-Packard Labs Aravind Ranganathan University of Cincinnati February 22, 2007 Motivation Routing in wireless
Middle in Forwarding Movement (MFM): An efficient greedy forwarding approach in location aided routing for MANET
Middle in Forwarding Movement (MFM): An efficient greedy forwarding approach in location aided routing for MANET 1 Prashant Dixit* Department of CSE FET, Manavrachna international institute of research
Location Awareness in Ad Hoc Wireless Mobile Neworks
Location Awareness in Ad Hoc Wireless Mobile Neworks Lijuan Ai Wenyu Wang Yi Zhou 11/14/2001 Mobile Computing, Fall 2001 1 PART I INTRODUCTION TO MANET & LOCATION-AWARE COMPONENTS 11/14/2001 Mobile Computing,
Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols
Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols Sharma Shelja, Kumar Suresh and Rathy R. K. Department of CSE, FET, MRIU, Faridabad, India Email: sharma.shelja@gmail.com, enthusk@yahoo.com,
Impulse Radio Ultra Wide Band Based Mobile Adhoc Network Routing Performance Analysis
American Journal of Applied Sciences, 10 (4): 361-366, 2013 ISSN: 1546-9239 2013 Sreedhar and Venkatesh, This open access article is distributed under a Creative Commons Attribution (CC-BY) 3.0 license
Aanchal Walia #1, Pushparaj Pal *2
An Implemented approach of VANET using Location Information based Technique for safe city and vehicle Aanchal Walia #1, Pushparaj Pal *2 #1. M.Tech Scholor,ECE,Krukshetra University, *2. A.P.ECE Department,
Overhead Analysis of Reactive Shortest Single and Multi-path Routing Mechanism with Load Balance in MANET
www.ijcsi.org https://doi.org/10.20943/01201605.102107 102 Overhead Analysis of Reactive Shortest Single and Multi-path Routing Mechanism with Load Balance in MANET K.MARIYAPPAN 1, Dr.M.KARNAN 2 1 Assistant
Some Ad Hoc Network Characteristics Effects on the Performance of On-Demand Routing Protocols
Inf. Sci. Lett. 2, No. 2, 69-75 (2013) 69 Information Sciences Letters An International Journal http://dx.doi.org/10.12785/isl/020204 Some Ad Hoc Network Characteristics Effects on the Performance On-Demand
Scalability Performance of AODV, TORA and OLSR with Reference to Variable Network Size
Lovekesh Kumar / International Journal of Engineering Research and Applications (IJERA) ISSN: Scalability Performance of AODV, TORA and OLSR with Reference to Variable Network Size Lovekesh Kumar* *(Department
Efficient Peer-to-Peer Information Sharing over Mobile Ad Hoc Networks
Efficient Peer-to-Peer Information Sharing over Mobile Ad Hoc Networks Mei Li Wang-Chien Lee Anand Sivasubramaniam Department of Computer Science and Engineering Pennsylvania State University University
Routing in Sensor Networks
Routing in Sensor Networks Routing in Sensor Networks Large scale sensor networks will be deployed, and require richer inter-node communication In-network storage (DCS, GHT, DIM, DIFS) In-network processing
Exploiting the Synergy between Peer-to-Peer and Mobile Ad Hoc Networks
Exploiting the Synergy between Peer-to-Peer and Mobile Ad Hoc Networks Y. Charlie Hu, Saumitra M. Das, and Himabindu Pucha Purdue University West Lafayette, IN 47907 {ychu, smdas, hpucha}@purdue.edu Abstract
Reducing Computation Complexity in Interference-aware Energy-efficient Geographical Routing for Low Rate Wireless Personal Area Networks
International Journal of Computer Applications (975 8887) Volume 55 No.1 October 1 Reducing Computation Complexity in Interference-aware Energy-efficient Geographical Routing for Low Rate Wireless ersonal
LECT-05, S-1 FP2P, Javed I.
A Course on Foundations of Peer-to-Peer Systems & Applications LECT-, S- FPP, javed@kent.edu Javed I. Khan@8 CS /99 Foundation of Peer-to-Peer Applications & Systems Kent State University Dept. of Computer
Location Services for Ad-Hoc Networks. Rich Goyette 11 Nov 05
Location Services for Ad-Hoc Networks Rich Goyette 11 Nov 05 rgoyette@forces.gc.ca Outline Introduction Problem Characteristics of Location Services Solution Space Review Overview of Selected Approaches
Let s get Physical! ETH Zurich Distributed Computing ICALP 2010 Roger Wattenhofer
Let s get Physical! ETH Zurich Distributed Computing www.disco.ethz.ch ICALP 2010 Roger Wattenhofer Spot the Differences Too Many! Spot the Differences Still Many! Spot the Differences Better Screen Bigger
Geographic Adaptive Fidelity and Geographic Energy Aware Routing in Ad Hoc Routing
309 Geographic Adaptive Fidelity and Geographic Energy Aware Routing in Ad Hoc Routing Sinchan Roychowdhury Instrumentation Control Engineering Calcutta Institute of Engineering & Management Kolkata, India
Mobile Advanced Networks. Position-based routing geometric, geographic, location-based. Navid Nikaein Mobile Communication Department
Mobile Advanced Networks Position-based routing geometric, geographic, location-based Navid Nikaein Mobile Communication Department Navid Nikaein 2010 1 Reminder In topology-based routing, each node has
Subject: Adhoc Networks
ISSUES IN AD HOC WIRELESS NETWORKS The major issues that affect the design, deployment, & performance of an ad hoc wireless network system are: Medium Access Scheme. Transport Layer Protocol. Routing.
Sensor Deployment, Self- Organization, And Localization. Model of Sensor Nodes. Model of Sensor Nodes. WiSe
Sensor Deployment, Self- Organization, And Localization Material taken from Sensor Network Operations by Shashi Phoa, Thomas La Porta and Christopher Griffin, John Wiley, 2007 5/20/2008 WiSeLab@WMU; www.cs.wmich.edu/wise
Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14
Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing Algorithms Link- State algorithm Each node maintains a view of the whole network topology Find the shortest path
NEW! Updates from previous draft Based on group mailing list discussions Added definition of optimal scalability with examples (captures idea of suffi
IRTF ANS WG Meeting, November 12, 2003 Notes on Scalability of Wireless Ad hoc Networks Onur Arpacioglu, Tara Small and Zygmunt J. Haas , which extends
CHAPTER 5 MULTICAST GEOGRAPHY BASED ROUTING IN AD HOC NETWORKS
89 CHAPTER 5 MULTICAST GEOGRAPHY BASED ROUTING IN AD HOC NETWORKS 5.1 INTRODUCTION Efficient routing in MANET is a tough task due to their highly dynamic network topology, bandwidth controlled links and
Does Topology Control Reduce Interference? Martin Burkhart Pascal von Rickenbach Roger Wattenhofer Aaron Zollinger
Does Topology Control Reduce Interference? Martin Burkhart Pascal von Rickenbach Roger Wattenhofer Aaron Zollinger Overview What is Topology Control? Context related work Explicit interference model Interference
A Scalable Location Service for Geographic Ad Hoc Routing. Jinyang Li
A Scalable Location Service for Geographic Ad Hoc Routing by Jinyang Li B.S., Computer Science National University of Singapore, 1998 Submitted to the Department of Electrical Engineering and Computer
Topology Control in 3-Dimensional Networks & Algorithms for Multi-Channel Aggregated Co
Topology Control in 3-Dimensional Networks & Algorithms for Multi-Channel Aggregated Convergecast Amitabha Ghosh Yi Wang Ozlem D. Incel V.S. Anil Kumar Bhaskar Krishnamachari Dept. of Electrical Engineering,
Beacon Update for Greedy Perimeter Stateless Routing Protocol in MANETs
Beacon Update for Greedy erimeter Stateless Routing rotocol in MANETs Abstract Dhanarasan 1, Gopi S 2 1 M.E/CSE Muthayammal Engineering College, getdhanarasan@gmail.com 2 Assistant rofessor / IT Muthayammal