180 research outputs found
On the vulnerabilities of voronoi-based approaches to mobile sensor deployment
Mobile sensor networks are the most promising solution to cover an Area of Interest (AoI) in safety critical scenarios. Mobile devices can coordinate with each other according to a distributed deployment algorithm, without resorting to human supervision for device positioning and network configuration. In this paper, we focus on the vulnerabilities of the deployment algorithms based on Voronoi diagrams to coordinate mobile sensors and guide their movements. We give a geometric characterization of possible attack configurations, proving that a simple attack consisting of a barrier of few compromised sensors can severely reduce network coverage. On the basis of the above characterization, we propose two new secure deployment algorithms, named SecureVor and Secure Swap Deployment (SSD). These algorithms allow a sensor to detect compromised nodes by analyzing their movements, under different and complementary operative settings. We show that the proposed algorithms are effective in defeating a barrier attack, and both have guaranteed termination. We perform extensive simulations to study the performance of the two algorithms and compare them with the original approach. Results show that SecureVor and SSD have better robustness and flexibility and excellent coverage capabilities and deployment time, even in the presence of an attac
A Distributed Strategy to Maximize Coverage in a Heterogeneous Sensor Network in the Presence of Obstacles
In this paper, an efficient deployment strategy is proposed for a network of
mobile and static sensors with nonidentical sensing and communication radii.
The multiplicatively weighted Voronoi (MW-Voronoi) diagram is used to partition
the field and assign the underlying coverage task to each mobile sensor. A
gradient-based method is applied to find the best candidate point based on the
detected coverage holes and the coverage priority considering the relative
distance of the mobile sensor from the static ones and the obstacles in the
field. The sensors move to a new position if such a relocation increases their
local coverage. The efficiency of the proposed strategy in different scenarios
is demonstrated by simulations.Comment: 8 pages, 8 figures, submitted to the 62nd IEEE Conference on Decision
and Contro
Network analysis and algorithm solutions in critical emergency scenarios
Critical emergency scenarios in network communication, mobile wireless sensor networks and Smart Grids. Network recovery after massive disruption, algorithms for damaged networks, protocols for damaged networks, progressive monitoring of a damaged network, progressive flow restoration of a damaged network. Analysis of the vulnerabilities of the deployment algorithm for Mobile Wireless Sensor Netowkrs in human hostile environment, Algorithms for Mobile Wireless Sensor Networks under attack. Analysis of the cascading failures phenomenon in the Smart Grids, Prevents Large Blackout in the Smart Grids, Reduce the energy demand on the Smart Grids using the Internet of Things
Coverage and Energy Analysis of Mobile Sensor Nodes in Obstructed Noisy Indoor Environment: A Voronoi Approach
The rapid deployment of wireless sensor network (WSN) poses the challenge of
finding optimal locations for the network nodes, especially so in (i) unknown
and (ii) obstacle-rich environments. This paper addresses this challenge with
BISON (Bio-Inspired Self-Organizing Network), a variant of the Voronoi
algorithm. In line with the scenario challenges, BISON nodes are restricted to
(i) locally sensed as well as (ii) noisy information on the basis of which they
move, avoid obstacles and connect with neighboring nodes. Performance is
measured as (i) the percentage of area covered, (ii) the total distance
traveled by the nodes, (iii) the cumulative energy consumption and (iv) the
uniformity of nodes distribution. Obstacle constellations and noise levels are
studied systematically and a collision-free recovery strategy for failing nodes
is proposed. Results obtained from extensive simulations show the algorithm
outperforming previously reported approaches in both, convergence speed, as
well as deployment cost.Comment: 17 pages, 24 figures, 1 tabl
A mobile assisted coverage hole patching scheme based on particle swarm optimization for WSNs
Wireless sensor networks (WSNs) have drawn much research attention in recent years due to the superior performance in multiple applications, such as military and industrial monitoring, smart home, disaster restoration etc. In such applications, massive sensor nodes are randomly deployed and they remain static after the deployment, to fully cover the target sensing area. This will usually cause coverage redundancy or coverage hole problem. In order to effectively deploy sensors to cover whole area, we present a novel node deployment algorithm based on mobile sensors. First, sensor nodes are randomly deployed in target area, and they remain static or switch to the sleep mode after deployment. Second, we partition the network into grids and calculate the coverage rate of each grid. We select grids with lower coverage rate as candidate grids. Finally, we awake mobile sensors from sleep mode to fix coverage hole, particle swarm optimization (PSO) algorithm is used to calculate moving position of mobile sensors. Simulation results show that our algorithm can effectively improve the coverage rate of WSNs
How Physicality Enables Trust: A New Era of Trust-Centered Cyberphysical Systems
Multi-agent cyberphysical systems enable new capabilities in efficiency,
resilience, and security. The unique characteristics of these systems prompt a
reevaluation of their security concepts, including their vulnerabilities, and
mechanisms to mitigate these vulnerabilities. This survey paper examines how
advancement in wireless networking, coupled with the sensing and computing in
cyberphysical systems, can foster novel security capabilities. This study
delves into three main themes related to securing multi-agent cyberphysical
systems. First, we discuss the threats that are particularly relevant to
multi-agent cyberphysical systems given the potential lack of trust between
agents. Second, we present prospects for sensing, contextual awareness, and
authentication, enabling the inference and measurement of ``inter-agent trust"
for these systems. Third, we elaborate on the application of quantifiable trust
notions to enable ``resilient coordination," where ``resilient" signifies
sustained functionality amid attacks on multiagent cyberphysical systems. We
refer to the capability of cyberphysical systems to self-organize, and
coordinate to achieve a task as autonomy. This survey unveils the cyberphysical
character of future interconnected systems as a pivotal catalyst for realizing
robust, trust-centered autonomy in tomorrow's world
- …