Routing with Face Traversal and Auctions Algorithms for Task Allocation in WSRN

Four new algorithms (RFTA1, RFTA2, GFGF2A, and RFTA2GE) handling the event in wireless sensor and robot networks based on the greedy-face-greedy (GFG) routing extended with auctions are proposed in this paper. In this paper, we assume that all robots are mobile, and after the event is found (reporte...

Descripción completa

Detalles Bibliográficos
Autores principales: Stanulovic, Jelena, Mitton, Nathalie, Mezei, Ivan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2021
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8472648/
https://www.ncbi.nlm.nih.gov/pubmed/34577357
http://dx.doi.org/10.3390/s21186149

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8472648/
https://www.ncbi.nlm.nih.gov/pubmed/34577357
http://dx.doi.org/10.3390/s21186149

Ejemplares similares