323,930 research outputs found
Low-Power Wide-Area Networks in Intelligent Transportation: Review and Opportunities for Smart-Railways
No full textThe aim of this paper is to provide an overview of the state-of-the-art in LPWAN, with a focus on intelligent transportation. IoT and LPWAN technologies appear as very promising for cost-effective remote surveillance, monitoring and control over large geographical areas, by collecting data for several sensing applications (e.g., predictive condition-based maintenance, security early warning and situation awareness, etc.) even in situations where power supply is limited (e.g., solar panels) or absent (e.g., installation on-board freight cars).
R. Dirnfeld, F. Flammini, S. Marrone, R. Nardone and V. Vittorini, "Low-Power Wide-Area Networks in Intelligent Transportation: Review and Opportunities for Smart-Railways," 2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC), 2020, pp. 1-7,
doi: 10.1109/ITSC45102.2020.9294535
Lower bounds on systolic gossip
No full textAbstractGossiping is an extensively investigated information dissemination process in which each processor has a distinct item of information and has to collect all the items possessed by the other processors. In this paper we provide an innovative and general lower bound technique relying on the novel notion of delay digraph of a gossiping protocol and on the use of matrix norm methods. Such a technique is very powerful and allows the determination of new and significantly improved lower bounds in many cases. In fact, we derive the first general lower bound on the gossiping time of systolic protocols, i.e., constituted by a periodic repetition of simple communication steps. In particular, given any network of n processors and any systolic period s, in the directed and the undirected half-duplex cases every s-systolic gossip protocol takes at least log(n)/log(1/λ)−O(loglog(n)) time steps, where λ is the unique solution between 0 and 1 of λ·p⌊s/2⌋(λ)·p⌈s/2⌉(λ)=1, with pi(λ)=1+λ2+⋯+λ2i−2 for any integer i>0. We then provide improved lower bounds in the directed and half-duplex cases for many well-known network topologies, such as Butterfly, de Bruijn, and Kautz graphs. All the results are extended also to the full-duplex case. Our technique is very general, as for s→∞ it allows the determination of improved results even for non-systolic protocols. In fact, for general networks, as a simple corollary it yields a lower bound only an O(loglog(n)) additive factor far from the general one independently proved in [Proc. 1st ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1989, p. 318; Topics in Combinatorics and Graph Theory (1990) 451; SIAM Journal on Computing 21(1) (1992) 111; Discrete Applied Mathematics 42 (1993) 75] for all graphs and any (non-systolic) gossip protocol. Moreover, for specific networks, it significantly improves with respect to the previously known results, even in the full-duplex case. Correspondingly, better lower bounds on the gossiping time of non-systolic protocols are determined in the directed, half-duplex and full-duplex cases for Butterfly, de Bruijn, and Kautz graphs. Even if in this paper we give only a limited number of examples, our technique has wide applicability and gives a general framework that often allows to get improved lower bounds on the gossiping time of systolic and non-systolic protocols in the directed, half-duplex and full-duplex cases
Model-Driven Availability Evaluation of Railway Control Systems
No full textMaintenance of real-world systems is a complex task involving several actors, procedures and technologies. Proper approaches are needed in order to evaluate the impact of different maintenance policies considering cost/benefit factors. To that aim, maintenance models may be used within availability, performability or safety models, the latter developed using formal languages according to the requirements of international standards. In this paper, a model-driven approach is described for the development of formal maintenance and reliability models for the availability evaluation of repairable systems. The approach facilitates the use of formal models which would be otherwise difficult to manage, and provides the basis for automated models construction. Starting from an extension to maintenance aspects of the MARTE-DAM profile for dependability analysis, an automated process based on model-to-model transformations is described. The process is applied to generate a Repairable Fault Trees model from the MARTE-DAM specification of the Radio Block Centre - a modern railway controller
Optimizing regenerator cost in traffic grooming
No full textAbstractIn optical networks, regenerators have to be placed on lightpaths every d consecutive nodes in order to regenerate the signal. In addition, grooming enables the use of the same regenerator by several lightpaths. Up to g (the grooming factor) lightpaths can use the same regenerator. In this work we consider the problem of minimizing the number of regenerators used in traffic grooming in optical networks. Starting from the 4-approximation algorithm of Flammini et al. (2010) [10] for d=1 and a path topology, we provide an approximation algorithm with the same approximation ratio for d=1and the ring and tree topologies. We present also a technique based on matching that leads to the same approximation ratio in tree topology and can be used to obtain approximation algorithms in other topologies. We provide an approximation algorithm for general topology that uses this technique. Finally, all the results are extended to the case of general d
A multi-layer architecture for distributed data acquisition
No full textThis paper describes an architecture for distributed control of a sensors network through Internet. The architecture is based on a multiple layer structure that allows scalability when a large number of sensors is planned. Accounting and access policies are also addressed. Since standard web interfaces are adopted, the architecture allows an easy integration with already available products to be obtained. A practical case-study is also presented where sites in different cities cooperate for data retrieval from different sensor
Start-up Made in Italy: un modello predittivo di exit a partire dagli indicatori di bilancio.
No full text- …
