The agricultural industry is being transformed, thanks to recent innovations in computer vision and deep learning. However, the lack of specific datasets collected in natural agricultural environments is, arguably, the main bottleneck for novel discoveries and benchmarking. The present work provides a novel dataset, Magro, and a framework to expand data collection. We present the first version of the Magro Dataset V1.0, consisting of nine ROS bags (and the corresponding raw data) containing data collected in apple and pear crops. Data were gathered, repeating a fixed trajectory on different days under different illumination and weather conditions. To support the evaluation of loop closure algorithms, the trajectories are designed to have loop closures, revisiting some places from different viewpoints. We use a Clearpath’s Jackal robot equipped with stereo cameras pointing to the front and left side, a 3D LIDAR, three inertial measurement units (IMU), and wheel encoders. Additionally, we provide calibrated RTK GPS data that can be used as ground truth. Our dataset is openly available, and it will be updated to have more data and variability. Finally, we tested two existing state-of-the-art algorithms for vision and point cloud-based localization and mapping on our novel dataset to validate the dataset’s usability.
30 June 2020 in IEEE Transactions on Network and Service Management
Network slicing has recently been proposed as one of the main enablers for 5G networks. The slicing concept consists of the partition of a physical network into several self-contained logical networks (slices) that can be tailored to offer different functional or performance requirements. In the context of 5G networks, we argue that existing ubiquitous WiFi technology can be exploited to cope with new requirements. Therefore, in this paper, we propose a novel mechanism to implement network slicing in WiFi Access Points. We formulate the resource allocation problem to the different slices as a stochastic optimization problem, where each slice can have bit rate, delay, and capacity requirements. We devise a solution to the problem above using the Lyapunov drift optimization theory, and we develop a novel queuing and scheduling algorithm. We have used Matlab and Simulink to build a prototype of the proposed solution, whose performance has been evaluated in a typical slicing scenario.
In order to execute a handover processes in a Radio Access Network, each cell has a configured list of neighbors to which such handovers are made. Rapid re-configuration ofthe neighborhood list in response to network failures and other events is currently not possible. To address this problem this paper suggests an autonomic approach for dynamically configuring neighboring cell lists and introduces a decentralized, three-layered framework. As a key element of this framework, a novel probabilistic protocol that detects and continuously tracks the coverage overlaps among cells is presented and evaluated. The protocol called DOC maintains a distributed graph of over-lapping cells. Dae to asing Bloom filters and aggregation techniques it exhibits a low traffic and computational overhead. A first series of simulation studies suggests that DOC is scalable with respect to network size and the namber of terminals.
Opportunistic networks are highly stochastic networks supported by sporadic encounters between mobile devices. To route data efficiently, opportunistic-routing algorithms must capitalize on devices’ movement and data transmission patterns. This work proposes a routing method based on reinforcement learning, specifically Q-learning. As usual in routing algorithms, the objective is to select the best candidate devices to put forward once an encounter occurs. However, there is also the possibility of not forwarding if we know that a better candidate might be encountered in the future. This decision is not usually considered in learning schemes because there is no obvious way to represent the temporal evolution of the network. We propose a novel, distributed, and online method that allows learning both the network’s connectivity and its temporal evolution with the help of a temporal graph. This algorithm allows learning to skip forwarding opportunities to capitalize on future encounters. We show that explicitly representing the action for deferring forwarding increases the algorithm’s performance. The algorithm’s scalability is discussed and shown to perform well in a network of considerable size.
24 April 2025 in IEEE Transactions on Parallel and Distributed Systems
To address the challenges posed by the deployment of microservices of future end-user applications in the cloud continuum, a performance prediction model working together with a network elasticity controller will be needed. With that aim, this work introduces Layered Queuing-Graph Neural Networks (LQ-GNN), a novel Machine Learning (ML) approach to develop a generalized performance prediction model for microservice-based applications. Unlike previous works focused on individual applications, our proposal aims for a versatile model applicable to any microservice-based application, integrating the Layered Queueing Network (LQN) modeling with Graph Neural Networks (GNN). LQ-GNN allows to efficiently estimate the response time of applications under different resource allocations and placements on the computing continuum. The obtained evaluation results indicate that the proposed model achieves a prediction error below 10% when considering different evaluation scenarios. Compared to existing methodologies, our approach balances prediction accuracy and computational efficiency, making it viable for real-time deployments. Consequently, ML-based performance prediction can significantly enhance the resource management and elasticity control of microservice-based architectures, leading to more resilient and efficient systems.
The Internet of Things (IoT) is one of the most novel networking paradigms and there are yet too many technologies defining themselves as IoT complicating the scenario for developing a fully IoT environment. The situation becomes even harder when security and privacy are considered. In this paper, we present a survey on the security aspects of an IoT conformed by wireless sensors communicating through the IEEE 802.15.4 standard. This survey follows a revision of the state of art in a layer-by-layer systematic analysis.