PicoTCP on Mobile Ad Hoc networks

Video in TIB AV-Portal: PicoTCP on Mobile Ad Hoc networks

Formal Metadata

PicoTCP on Mobile Ad Hoc networks
Alternative Title
Geospatial - Picotcp Networks
Title of Series
CC Attribution 2.0 Belgium:
You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Release Date
Production Year

Content Metadata

Subject Area
Implementation Matching (graph theory) Mobile Web Computer network Distance Metropolitan area network
Gateway (telecommunications) Building Overhead (computing) Table (information) Link (knot theory) State of matter Mobile Web 1 (number) Vermaschtes Netz Decision table Mathematics Hypermedia Different (Kate Ryan album) Natural number Source code Information Communications protocol Message passing Multiplication Mathematical optimization Physical system Routing Link (knot theory) Gateway (telecommunications) Polygon mesh Information Point (geometry) Moment (mathematics) State of matter Heat transfer Computer network Control flow Portable communications device Type theory Message passing Word Software Integrated development environment Network topology Order (biology) Interface (computing) System programming Metric system Table (information) Communications protocol
Code Multiplication sign Archaeological field survey Virtualization Set (mathematics) Compiler Open set Connected space Feasibility study UDP <Protokoll> Library (computing) Source code Link (knot theory) Software developer Computer file Open source Internet service provider Term (mathematics) Mechanism design Message passing Computer configuration Emulator Duality (mathematics) Software testing Right angle Whiteboard Simulation Physical system Functional (mathematics) Implementation Freeware Table (information) Mobile Web Device driver Vermaschtes Netz Mass Discrete element method Product (business) Number Revision control Peripheral Computer architecture Video tracking Code Computer network Line (geometry) Device driver Cartesian coordinate system Sphere Shareware Word Voting Software Universe (mathematics) Communications protocol Library (computing)
Information View (database) Mobile Web Adaptive behavior Planning Computer network Mereology Graph coloring Connected space Latent heat Message passing Software Arrow of time Figurate number Metric system Table (information) Descriptive statistics Physical system
Implementation Information Software developer Mobile Web Open source Vermaschtes Netz Computer network Bit Cartesian coordinate system Theory Type theory Software Aerodynamics Implementation Error message
so i'm graphical man I'm working at all from and I will land you today is an implementation of our match critical insight that would so far could this speed distance stack so 1st of all
what would talk about there are 3 basic things swallowed the possibilities with mesh networking what is much networking um and what is the peak at the speed stack uh and how does it work in general together the so mesh natural mesh networking is actually a collection of different nodes which is that the the the routing information order routing infrastructure to be able to communicate with each other and dynamically so it will describe a specific writing technique how they can communicate with each other uh where can it be used for it could be used for a sensor networks like their geospatial information different uh notes there spread over a geographical environment or human automation or actually have a network which is more well so mean and mobile network um which is configuring itself and dynamically adapting to work so Howard network said changing so how does it work uh and there are basically 2 different ways you could uh implement the mesh network uh and that's the 1 on the mantel or uh secondly uh table-driven and the amounts that a lot of an example of that could be AODV which is a protocol that is describing that's as really um asking uh the uh the routing information the moment it needs to sense and another afterward another road uh and contrary the table-driven 1 will constructs the the routing information uh on the go and sequentially without having actually needing the delta itself so um 1 of the the table driven ones as well as our which is the optimized link state routing protocol as described in RFC and it'll actually builds the tables proactively before uh they will need to send other so for example this would be running table that is required for it to get from 1 side to another so if I would get 1 to get to the destination to that I want to walk through uh gateway to and it's gonna be 1 of the main metric is going to be 1 an and like that it will go look all different uh there writing information now how does it essentially work the they will sense each node has the same intelligence inside and they send hello messages to all their neighbor nodes all these neighbor nodes will going connect to the other ones and actually um selects there in 1 of their neighbors as uh multipoint really which is actually something death topology information uh which DC messages to the rest of the media the network then there are 2 different more advanced um message types the MIT messages which will um sent more interphase 2 words network and the HMI to inject it a new routing information into and out from another network into this network and contrary the on the months uh um wrote thing will be for reactive and the will be reactive and actually and built the roads by road to grasp on the moments they they've quiet so what is it the advantage of the 1 thing contrary to the other 1 um if you have all the roads available it will go foster to centered out that um and you don't need to have the overhead of building in the tables so um and the the reactive protocol will react more on different changes in the rotting information the OK so how did we implement it's um mates uh we could this be
spec uh which is basically a networking stack uh built for them to be a modular re uh to connects to all the different devices without requiring a lot of uh operating system dependencies so you can just through environmental and moduli selects whether or not to want to have certain features available so
this is an example of how you with compiles such uh numbers that history just select your architecture cross-compiler uh and the specific problem recalls uh Weaver rights to haven't compiled in your in your library OK so if you want to check out this good and so all publicly available on the market have you can just watch another does Belgium let's get have as less because the speed uh and ask any questions there is there and if you would have the um the sources open and the dual licensing protocol for all c so you have the GP-LVM version 2 uh and uh a proprietary 1 if you would like for some more but to have its for company specifically if you don't want to be expected GPL'd words OK so how did you do our much implementation and we had a chat challenge to force that's 2 words and University of grand network uh they have a set of nodes that are connected to each other um of 50 or of 15 notes uh and we need to put it to to do that Network and it was also already a tiny Westport available so we made a forced to work towards don't that's uh and thereby improve are well as our support and From the feasibility of this this product OK so the 1st step it's is actually ports are stacked to do and that I knew as application and and use the the nasty rapid and to support the the could this be API I'll give a short demo in the end so that uh so what what's was this actually that we have on the top an application which is actually using the Olympic at the speed um to interact with the networking stack uh and the networking step also requires a small driver descended to the physical device actually and and also next that's there's 1 shared library available which uh supports the time functionality over votes dying US and if it is the application so to to have all its running the just have the line you can buy new us with the application and renewed driver includes and then have I can do for you to me and I P for just to see send something messages and the Oilers are which makes it uh the mesh network develop available so all that together was constructed than 27 kilobytes so the code for this is also available on the could this be sphere can check that out
um so to facilitate as the debarring we use the fellows be boards don't use the network the university is all a bowl of provided the was bored so we actually at 1 boards which was connected to a PC for EEG debugging uh and the was that that was the ports would force for that is also available next to that's 2 separated from the real world we and we have written a the mass assimilated where you can actually uh implement your own application and see how that the goes uh so you can visualize when you notice of such rigid and see which roads are being built the so this is actually the implementation of the mesh network only on University we so we have about 50 knows the over here which are all connected to each other and uh having the same intelligence just building of the roads insight and that looks kind of like this thank you just begin to get a lot of new nodes that uh couldn't having to all different nodes and specifying the mentally available on the right hand side OK so I'll give survey thing about 1 uh how disclose are is behaving in in a mesh network 1 university and I will
give some description yeah again I think
it's 2 minutes so it should be
living in the that yeah a PAC no 1st of all nodes are are breathing of uh and will try to send the hello messages that they I have to say that so you will see all green arrows connecting 2 nodes which are actually next to each other them so I've made the delay pretty uh expansive uh and you can actually sets how fast you want know Stuart react on specific yeah targets to and in the view OK so now you can see all nodes are connecting to their neighbors and actually there but as 17 the part of the amount of nodes which are available in their routing table so I made them become a different color once they become having more hours who were more all messages will sense through the network and divides the routing information insight is that the connection the that for example in this and the orange arrows so actually 2 hops away so you can uh send a message Viral another n nodes to to locally note and I the red arrows on it's legal to it the connections the the longer the network is being configured the more uh nodes can be accessed and the system and the and that's the kind of all roads are being built a plan and the ends when all rhetorical figure that will be possible to implement 1 no it's an old metric will uh adapts to towards this I think that's the most important part of over this then tha
so that was there a bit faster than religion the predefined with uh to come to a conclusion we have for that's that is successfully our application 2000 US and provided the new as our implementation of mesh networking so as all this is running on tripoli 8 and a and 250 look for um network so and if you would like to to have more information I would advise to go to understand that I would be willing to answer your questions the top theory of finalists in lot of you know what the I just want 1
thing to you are a lot of move around the thank you you know you don't have to do the having a much of the error Could you know 1 of the hottest downstairs and I of you enjoy this I also spatial and now we have not next what best you it type