Startsida
Hjälp
Sök i LIBRIS databas

     

 

Sökning: onr:4f9zr5tn2xxh7f70 > Mobility and Routin...

Mobility and Routing in a Delay-tolerant Network of Unmanned Aerial Vehicles [Elektronisk resurs]

Kuiper, Erik, 1973- (författare)
Nadjm-Tehrani, Simin (preses)
Baldoni, Roberto (opponent)
Linköpings universitet Institutionen för datavetenskap (utgivare)
Linköpings universitet Tekniska högskolan (utgivare)
Publicerad: Institutionen för datavetenskap, 2008
Engelska 66
Serie: Linköping Studies in Science and Technology. Thesis, 0280-7971 0280-7971
Ingår i:
Läs hela texten
Läs hela texten
  • E-bokAvhandling(Lic.-avh. Linköping : Linköpings universitet, 2008)
Sammanfattning Ämnesord
Stäng  
  • Technology has reached a point where it has become feasible to develop unmanned aerial vehicles (UAVs), that is aircraft without a human pilot on board. Given that future UAVs can be autonomous and cheap, applications of swarming UAVs are possible. In this thesis we have studied a reconnaissance application using swarming UAVs and how these UAVs can communicate the reconnaissance data. To guide the UAVs in their reconnaissance mission we have proposed a pheromone based mobility model that in a distributed manner guides the UAVs to areas not recently visited. Each UAV has a local pheromone map that it updates based on its reconnaissance scans. The information in the local map is regularly shared with a UAV’s neighbors. Evaluations have shown that the pheromone logic is very good at guiding the UAVs in their cooperative reconnaissance mission in a distributed manner. Analyzing the connectivity of the UAVs we found that they were heavily partitioned which meant that contemporaneous communication paths generally were not possible to establish. This means that traditional mobile ad hoc network (MANET) routing protocols like AODV, DSR and GPSR will generally fail. By using node mobility and the store-carry-forward principle of delay-tolerant routing the transfer of messages between nodes is still possible. In this thesis we propose location aware routing for delay-tolerant networks (LAROD). LAROD is a beacon-less geographical routing protocol for intermittently connected mobile ad hoc networks. Using static destinations we have shown by a comparative study that LAROD has almost as good delivery rate as an epidemic routing scheme, but at a substantially lower overhead. 

Ämnesord

Natural Sciences  (hsv)
Computer and Information Sciences  (hsv)
Computer Sciences  (hsv)
Naturvetenskap  (hsv)
Data- och informationsvetenskap  (hsv)
Datavetenskap (datalogi)  (hsv)
TECHNOLOGY  (svep)
Information technology  (svep)
Computer science  (svep)
Computer science  (svep)
TEKNIKVETENSKAP  (svep)
Informationsteknik  (svep)
Datavetenskap  (svep)
Datalogi  (svep)

Genre

government publication  (marcgt)

Indexterm och SAB-rubrik

mobility models
routing
ad hoc networks
delay-tolerant networks
Inställningar Hjälp

Titeln finns på 1 bibliotek. 

Övriga bibliotek (1)

Ange som favorit
Om LIBRIS
Sekretess
Blogg
Hjälp
Fel i posten?
Kontakt
Teknik och format
Sök utifrån
Sökrutor
Plug-ins
Bookmarklet
Anpassa
Textstorlek
Kontrast
Vyer
LIBRIS söktjänster
SwePub
Sondera
Uppsök

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

Copyright © LIBRIS - Nationella bibliotekssystem

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy