Obserwuj
Matthias R. Brust
Matthias R. Brust
University of Luxembourg
Zweryfikowany adres z uni.lu
Tytuł
Cytowane przez
Cytowane przez
Rok
Privacy and Security of Big Data in AI Systems: A Research and Standards Perspective
S Dilmaghani, MR Brust, G Danoy, N Cassagnes, J Pecero, P Bouvry
2019 IEEE International Conference on Big Data (Big Data), 5737-5743, 2019
1152019
The Rise of Drones in Internet of Things: A survey on the evolution, prospects and challenges of Unmanned Aerial Vehicles
NS Labib, MR Brust, G Danoy, P Bouvry
IEEE Access 9, 115466-115487, 2021
982021
Defending against Intrusion of Malicious UAVs with Networked UAV Defense Swarms
MR Brust, G Danoy, P Bouvry, D Gashi, H Pathak, MP Gonçalves
IEEE Conference on Local Computer Networks (IEEE LCN), 2017
832017
A Networked Swarm Model for UAV Deployment in the Assessment of Forest Environments
MR Brust, BM Strimbu
IEEE International Conference on Intelligent Sensors, Sensor Networks and …, 2015
832015
Internet of Unmanned Aerial Vehicles—A Multilayer Low-Altitude Airspace Model for Distributed UAV Traffic Management
NS Labib, G Danoy, J Musial, MR Brust, P Bouvry
Sensors 19 (21), 4779, 2019
802019
Local Positioning for Environmental Monitoring in Wireless Sensor and Actor Networks
MI Akbas, MR Brust, D Turgut
IEEE Conference on Local Computer Networks (IEEE LCN), 806-813, 2010
782010
Connectivity Stability in Autonomous Multi-level UAV Swarms for Wide Area Monitoring
G Danoy, MR Brust, P Bouvry
ACM Symposium on Development and Analysis of Intelligent Vehicular Networks …, 2015
742015
UAV-UGV-UMV multi-swarms for cooperative surveillance
DH Stolfi, MR Brust, G Danoy, P Bouvry
Frontiers in Robotics and AI 8, 616950, 2021
582021
Swarm-based counter UAV defense system
MR Brust, G Danoy, DH Stolfi, P Bouvry
Discover Internet of Things 1 (1), 1-19, 2021
532021
Tackling large-scale and combinatorial bi-level problems with a genetic programming hyper-heuristic
E Kieffer, G Danoy, MR Brust, P Bouvry, A Nagih
IEEE Transactions on Evolutionary Computation 24 (1), 44-56, 2019
432019
WACA: A Hierarchical Weighted Clustering Algorithm Optimized for Mobile Hybrid Networks
MR Brust, A Andronache, S Rothkugel
3rd International Conference on Wireless and Mobile Communications (ICWMC'07 …, 2007
432007
Dynamic Multi-hop Clustering for Mobile Hybrid Wireless Networks
MR Brust, H Frey, S Rothkugel
ACM Conference on Ubiquitous Information Management and Communication, 130-135, 2008
402008
A GP Hyper-Heuristic Approach for Generating TSP Heuristics
G Duflo, E Kieffer, MR Brust, G Danoy, P Bouvry
2019 IEEE International Parallel and Distributed Processing Symposium …, 2019
372019
Target Tracking Optimization of UAV Swarms Based on Dual-Pheromone Clustering
MR Brust, M Zurad, L Hentges, L Gomes, G Danoy, P Bouvry
IEEE International Conference on Cybernetics (IEEE CYBCONF), 2017, 1-8, 2017
352017
Multimedia Content Distribution in Hybrid Wireless Networks using Weighted Clustering
A Andronache, MR Brust, S Rothkugel
ACM International Workshop on Wireless Multimedia Networking and Performance …, 2006
35*2006
Small Worlds: Strong Clustering in Wireless Networks
MR Brust, S Rothkugel
IEEE International Conference on Distributed Computing in Sensor Systems …, 2007
342007
Modeling online social network users’ profile attribute disclosure behavior from a game theoretic perspective
J Chen, AR Kiremire, MR Brust, VV Phoha
Computer Communications, 2014
322014
VBCA: A Virtual Forces Clustering Algorithm for Autonomous Aerial Drone Systems
MR Brust, MI Akbas, D Turgut
IEEE International Systems Conference (IEEE SysCon), 2016, 2016
312016
Coverage Optimization with Connectivity Preservation for UAV Swarms Applying Chaotic Dynamics
M Rosalie, MR Brust, G Danoy, S Chaumette, P Bouvry
IEEE International Conference on Autonomic Computing (IEEE ICAC), 2017, 113-118, 2017
302017
Topology-based Clusterhead Candidate Selection in Wireless Ad-hoc and Sensor Networks
MR Brust, A Andronache, S Rothkugel, Z Benenson
IEEE Conference on Communication Systems Software and Middleware (IEEE …, 2007
302007
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20