The emergence of 6G-enabled Internet of Vehicles (IoV) promises to revolutionize mobility and connectivity, integrating vehicles into a mobile Internet of Things (IoT)-oriented wireless sensor network (WSN). Meanwhile, 5G technologies and mobile edge computing further support this vision by facilitating real-time connectivity and empowering massive access to the Internet. Within this context, IoT-oriented WSNs play a crucial role in intelligent transportation systems, offering affordable alternatives for traffic monitoring and management. Efficient sensor selection thus represents a critical concern while deploying WSNs on urban networks. In this paper, we provide an overview of such a notably hard problem. The contribution is twofold: (i) surveying state-of-the-art model-based techniques for efficient sensor selection in traffic flow monitoring, emphasizing challenges of sensor placement, and (ii) advocating for the development of data-driven methodologies to enhance sensor deployment efficacy and traffic modeling accuracy. Further considerations underscore the importance of data-driven approaches for adaptive transportation systems aligned with the IoV paradigm.

This work presents a novel general regularized distributed solution for the state estimation problem in networked systems. Resting on the graph-based representation of sensor networks and adopting a multivariate least-squares approach, the designed solution exploits the set of the available inter-sensor relative measurements and leverages a general regularization framework, whose parameter selection is shown to control the estimation procedure convergence performance. As confirmed by the numerical results, this new estimation scheme allows ( $i$ ) the extension of other approaches investigated in the literature and ( $ii$ ) the convergence optimization in correspondence to any (undirected) graph modeling the given sensor network.

This work mainly addresses continuous-time multiagent consensus networks where an adverse attacker affects the convergence performances of said protocol. In particular, we develop a novel secure-by-design approach in which the presence of a network manager monitors the system and broadcasts encrypted tasks (i.e., hidden edge weight assignments) to the agents involved. Each agent is then expected to decode the received codeword containing data on the task through appropriate decoding functions by leveraging advanced security principles, such as objective coding and information localization. Within this framework, a stability analysis is conducted for showing the robustness to channel tampering in the scenario where part of the codeword corresponding to a single link in the system is corrupted. A tradeoff between objective coding capability and network robustness is also pointed out. To support these novelties, an application example on decentralized estimation is provided. Moreover, an investigation of the robust agreement is as well extended in the discrete-time domain. Further numerical simulations are given to validate the theoretical results in both the time domains.

This work addresses multi-agent consensus networks where adverse attackers affect the convergence performances of the protocol by manipulating the edge weights. We generalize FabrisZelazo2022 and provide guarantees on the agents’ agreement in the presence of attacks on multiple links in the network. A stability analysis is conducted to show the robustness to channel tampering in the scenario where part of the codeword, corresponding to the value of the edge weights, is corrupted. Exploiting the built-in objective coding, we show how to compensate the conservatism that may emerge because of multiple threats in exchange for higher encryption capabilities. Numerical examples related to semi-autonomous networks are provided.