Search results for "routing"
showing 10 items of 587 documents
Context-Aware RF-Energy Harvesting for IoT Networks
2021
Energy Harvesting plays a crucial role in improving the operational lifetime of IoT devices. The deployment of dedicated RF-transmitters helps in sufficient energy propagation to the sensor nodes of IoT networks. Also, energy harvesting using the deployment of such RF-transmitters is a challenging issue. In this work, two methods are proposed for the optimal placement of RF-transmitters for efficient energy harvesting in wireless sensor networks. The proposed context-aware RF-energy harvesting considers different network performance parameters such as energy-hole information, and data routing information. RF-transmitter deployment is achieved using network connectivity information in the fi…
NoC Reconfiguration for CMP Virtualization
2011
At NoC level, the traffic interferences can be drastically reduced by using virtualization mechanisms. An effective strategy to virtualize a NoC consists in dividing the network in different partitions, each one serving different applications and traffic flows. In this paper, we propose a NoC reconfiguration mechanism to support NoC virtualization under real scenarios. Dynamic reassignment of network resources to different partitions is allowed in order to NoC dynamically adapts to application needs. Evaluation results show a good behavior of CMP virtualization.
Advances in vehicle routing and logistics optimization
2019
nessuno
Implementation and Deployment Evaluation of the DMAMAC Protocol for Wireless Sensor Actuator Networks
2016
Abstract The increased application of wireless technologies including Wireless Sensor Actuator Networks (WSAN) in industry has given rise to a plethora of protocol designs. These designs target metrics ranging from energy efficiency to real-time constraints. Protocol design typically starts with a requirements specification, and continues with analytic and model-based simulation analysis. State-of- the-art network simulators provide extensive physical environment emulation, but still have limitations due to model abstractions. Deployment testing on actual hardware is therefore vital in order to validate implementability and usability in the real environment. The contribution of this article…
Fast Implementation of Double-coupled Nonnegative Canonical Polyadic Decomposition
2019
Real-world data exhibiting high order/dimensionality and various couplings are linked to each other since they share some common characteristics. Coupled tensor decomposition has become a popular technique for group analysis in recent years, especially for simultaneous analysis of multi-block tensor data with common information. To address the multiblock tensor data, we propose a fast double-coupled nonnegative Canonical Polyadic Decomposition (FDC-NCPD) algorithm in this study, based on the linked CP tensor decomposition (LCPTD) model and fast Hierarchical Alternating Least Squares (Fast-HALS) algorithm. The proposed FDCNCPD algorithm enables simultaneous extraction of common components, i…
A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows
2009
This paper presents an efficient and well-scalable metaheuristic for fleet size and mix vehicle routing with time windows. The suggested solution method combines the strengths of well-known threshold accepting and guided local search metaheuristics to guide a set of four local search heuristics. The computational tests were done using the benchmarks of [Liu, F.-H., & Shen, S.-Y. (1999). The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society, 50(7), 721-732] and 600 new benchmark problems suggested in this paper. The results indicate that the suggested method is competitive and scales almost linearly up to instances with 1000 custome…
An optimization approach for communal home meal delivery service
2009
Abstract: This paper is the first to discuss the communal home meal delivery problem. The problem can be modelled as a multiple travelling salesman problem with time windows, that is closely related to the well-studied vehicle routing problem with time windows. Experimental results are reported for a real-life case study from Central Finland over several alternative scenarios using the SPIDER commercial solver. The comparison with current practice reveals that a significant savings potential can be obtained using off-the-shelf optimization tools. As such, the potential for supporting real-life communal routing problems can be considered to be important for VRP practitioners.
Discrete-Time Adaptive Hysteresis Filter for Parallel Computing and Recursive Identification of Preisach Model
2018
High-precision motion control systems, for instance deployed for micro- and nano-positioning, often use the smart-material based actuators such as piezoelectric and magnetostrictive stages. Those exhibit inherent hysteresis nonlinearities which are challenging to compensate without precise hysteresis modeling. Even if a suitable hysteresis modeling approach is available, its parameter identification, correspondingly adaptation, at normal operating conditions constitute an essential task for the overall control design. This paper uses the direct recursive identification method for the Preisach hysteresis model and describes the fast parallel-computing discrete-time algorithm for an adaptive …
Some remarks on unconditionally convergent multipliers
2017
We present some results concerning the representation of unconditionally convergent multipliers, including a reformulation of a conjecture of Balazs and Stoeva.
On the Robust Synthesis of Logical Consensus Algorithms for Distributed Intrusion Detection
2013
We introduce a novel consensus mechanism by which the agents of a network can reach an agreement on the value of a shared logical vector function depending on binary input events. Based on results on the convergence of finite--state iteration systems, we provide a technique to design logical consensus systems that minimize the number of messages to be exchanged and the number of steps before consensus is reached, and that can tolerate a bounded number of failed or malicious agents. We provide sufficient joint conditions on the input visibility and the communication topology for the method's applicability. We describe the application of our method to two distributed network intrusion detecti…