4,066 research outputs found
Intrusion-aware Alert Validation Algorithm for Cooperative Distributed Intrusion Detection Schemes of Wireless Sensor Networks
Existing anomaly and intrusion detection schemes of wireless sensor networks
have mainly focused on the detection of intrusions. Once the intrusion is
detected, an alerts or claims will be generated. However, any unidentified
malicious nodes in the network could send faulty anomaly and intrusion claims
about the legitimate nodes to the other nodes. Verifying the validity of such
claims is a critical and challenging issue that is not considered in the
existing cooperative-based distributed anomaly and intrusion detection schemes
of wireless sensor networks. In this paper, we propose a validation algorithm
that addresses this problem. This algorithm utilizes the concept of
intrusion-aware reliability that helps to provide adequate reliability at a
modest communication cost. In this paper, we also provide a security resiliency
analysis of the proposed intrusion-aware alert validation algorithm.Comment: 19 pages, 7 figure
Push & Pull: autonomous deployment of mobile sensors for a complete coverage
Mobile sensor networks are important for several strategic applications
devoted to monitoring critical areas. In such hostile scenarios, sensors cannot
be deployed manually and are either sent from a safe location or dropped from
an aircraft. Mobile devices permit a dynamic deployment reconfiguration that
improves the coverage in terms of completeness and uniformity.
In this paper we propose a distributed algorithm for the autonomous
deployment of mobile sensors called Push&Pull. According to our proposal,
movement decisions are made by each sensor on the basis of locally available
information and do not require any prior knowledge of the operating conditions
or any manual tuning of key parameters.
We formally prove that, when a sufficient number of sensors are available,
our approach guarantees a complete and uniform coverage. Furthermore, we
demonstrate that the algorithm execution always terminates preventing movement
oscillations.
Numerous simulations show that our algorithm reaches a complete coverage
within reasonable time with moderate energy consumption, even when the target
area has irregular shapes. Performance comparisons between Push&Pull and one of
the most acknowledged algorithms show how the former one can efficiently reach
a more uniform and complete coverage under a wide range of working scenarios.Comment: Technical Report. This paper has been published on Wireless Networks,
Springer. Animations and the complete code of the proposed algorithm are
available for download at the address:
http://www.dsi.uniroma1.it/~novella/mobile_sensors
On Prolonging Network Lifetime through Load-Similar Node Deployment in Wireless Sensor Networks
This paper is focused on the study of the energy hole problem in the Progressive Multi-hop Rotational Clustered (PMRC)-structure, a highly scalable wireless sensor network (WSN) architecture. Based on an analysis on the traffic load distribution in PMRC-based WSNs, we propose a novel load-similar node distribution strategy combined with the Minimum Overlapping Layers (MOL) scheme to address the energy hole problem in PMRC-based WSNs. In this strategy, sensor nodes are deployed in the network area according to the load distribution. That is, more nodes shall be deployed in the range where the average load is higher, and then the loads among different areas in the sensor network tend to be balanced. Simulation results demonstrate that the load-similar node distribution strategy prolongs network lifetime and reduces the average packet latency in comparison with existing nonuniform node distribution and uniform node distribution strategies. Note that, besides the PMRC structure, the analysis model and the proposed load-similar node distribution strategy are also applicable to other multi-hop WSN structures
Optimal Number of Nodes Deployment Method in Corona-Based WSN
Wireless sensor networks (WSNs) consist of several nodes with limited and non-rechargeable power resources. Therefore, energy efficiency and network lifetime depend on the utilize way of sensor nodes. Recently, some methods and strategies have been employed in this regard. Most of them could improve network lifespan to an acceptable level. Energy hole is one of inherent problems which can decrease the network lifetime to 89%. In multi-hop WSNs, the sensors located closer to sink must relay more data packets in comparison with other ones, thus their power supplies will be exhausted earlier than other nodes. Whereas, the sensor nodes belonging to other layers still have required energy for transmitting their data packets. This asynchronous energy depletion is considered as a problem. In this paper, we present a mathematical model for non-uniform node deployment for corona-based WSNs. According to results, Optimal Number of Nodes Deployment Method (ONNDM) enhance the network lifetime via balancing energy consumption and workload among coronas. In ONNDM, the optimum number of nodes in each corona is obtained by a mathematical formula, which can outperform other proposed strategies
Energy-Efficient Algorithm for Sensor Networks with Non-Uniform Maximum Transmission Range
In wireless sensor networks (WSNs), the energy hole problem is a key factor affecting the network lifetime. In a circular multi-hop sensor network (modeled as concentric coronas), the optimal transmission ranges of all coronas can effectively improve network lifetime. In this paper, we investigate WSNs with non-uniform maximum transmission ranges, where sensor nodes deployed in different regions may differ in their maximum transmission range. Then, we propose an Energy-efficient algorithm for Non-uniform Maximum Transmission range (ENMT), which can search approximate optimal transmission ranges of all coronas in order to prolong network lifetime. Furthermore, the simulation results indicate that ENMT performs better than other algorithms
- …