José-Fernán Martínez-Ortega

Fuzzy-Based adaptive countering method against false endorsement insertion attacks in wireless sensor networks

Wireless sensor networks (WSNs) are vulnerable to false endorsement insertion attacks (FEIAs), where a malicious adversary intentionally inserts incorrect endorsements into legitimate sensing reports in order to block notifications of real events. A centralized solution can detect and adaptively counter FEIAs while conserving the energy of the forwarding nodes because it does not make the nodes verify reports using cryptographic operations. However, to apply this solution to a WSN, the users must carefully select 10 or more security parameters, which are used to determine the occurrences of FEIAs. Thus, an inappropriate choice of a single parameter might result in the misinterpretation of or misdetection of FEIAs. Therefore, the present study proposes a fuzzy-based centralized method for detecting and adaptively countering FEIAs in dense WSNs, where two fuzzy rule-based systems are used to detect an FEIA and to select the most effective counter measure against the FEIA. A major benefit of the proposed method is that the fuzzy systems can be optimized automatically by combining a genetic algorithm and a simulation. Thus, users only need to write a model of the WSN to apply the proposed method to a WSN. The improved performance with this method is demonstrated by simulation results.Wireless sensor networks (WSNs) based on wearable devices are being used in a growing variety of applications, many of them with strict privacy requirements: medical, surveillance, e-Health, and so forth. Since private data is being shared (physiological measures, medical records, etc.), implementing security mechanisms in these networks has become a major challenge. The objective of deploying a trustworthy domain is achieving a nonspecific security mechanism that can be used in a plethora of network topologies and with heterogeneous application requirements. Another very important challenge is resilience. In fact, if a stand-alone and self-configuring WSN is required, an autosetup mechanism is necessary in order to maintain an acceptable level of service in the face of security issues or faulty hardware. This paper presents SensoTrust, a novel security model for WSN based on the definition of trustworthy domains, which is adaptable to a wide range of applications and scenarios where services are published as a way to distribute the acquired data. Security domains can be deployed as an add-on service to merge with any service already deployed, obtaining a new secured service.

A Mission Planning Approach for Precision Farming Systems Based on Multi-Objective Optimization

As the demand for food grows continuously, intelligent agriculture has drawn much attention due to its capability of producing great quantities of food efficiently. The main purpose of intelligent agriculture is to plan agricultural missions properly and use limited resources reasonably with minor human intervention. This paper proposes a Precision Farming System (PFS) as a Multi-Agent System (MAS). Components of PFS are treated as agents with different functionalities. These agents could form several coalitions to complete the complex agricultural missions cooperatively. In PFS, mission planning should consider several criteria, like expected benefit, energy consumption or equipment loss. Hence, mission planning could be treated as a Multi-objective Optimization Problem (MOP). In order to solve MOP, an improved algorithm, MP-PSOGA, is proposed, taking advantages of the Genetic Algorithms and Particle Swarm Optimization. A simulation, called precise pesticide spraying mission, is performed to verify the feasibility of the proposed approach. Simulation results illustrate that the proposed approach works properly. This approach enables the PFS to plan missions and allocate scarce resources efficiently. The theoretical analysis and simulation is a good foundation for the future study. Once the proposed approach is applied to a real scenario, it is expected to bring significant economic improvement.

AEKF-SLAM: A New Algorithm for Robotic Underwater Navigation

In this work, we focus on key topics related to underwater Simultaneous Localization and Mapping (SLAM) applications. Moreover, a detailed review of major studies in the literature and our proposed solutions for addressing the problem are presented. The main goal of this paper is the enhancement of the accuracy and robustness of the SLAM-based navigation problem for underwater robotics with low computational costs. Therefore, we present a new method called AEKF-SLAM that employs an Augmented Extended Kalman Filter (AEKF)-based SLAM algorithm. The AEKF-based SLAM approach stores the robot poses and map landmarks in a single state vector, while estimating the state parameters via a recursive and iterative estimation-update process. Hereby, the prediction and update state (which exist as well in the conventional EKF) are complemented by a newly proposed augmentation stage. Applied to underwater robot navigation, the AEKF-SLAM has been compared with the classic and popular FastSLAM 2.0 algorithm. Concerning the dense loop mapping and line mapping experiments, it shows much better performances in map management with respect to landmark addition and removal, which avoid the long-term accumulation of errors and clutters in the created map. Additionally, the underwater robot achieves more precise and efficient self-localization and a mapping of the surrounding landmarks with much lower processing times. Altogether, the presented AEKF-SLAM method achieves reliably map revisiting, and consistent map upgrading on loop closure.

A New High-Efficiency Multilevel Frequency-Modulation Different Chaos Shift Keying Communication System

Considering the large number of delay lines and orthogonality Walsh code sequences in the traditional multilevel frequency-modulation different chaos shift keying (FM-DCSK), in this paper, we propose a new multilevel FM-DCSK, named multilevel M-ary FM-DCSK (MFM-DCSK). The MFM-DCSK transmits multilevel symbols directly in the communication channel without using orthogonality Walsh code sequence. Based on this, the MFM-DCSK can reduce computation complexity and time delay and improve transmission rate dramatically. In this paper, we also evaluate the bit error rate (BER) performance of the MFM-DCSK in an additive white Gaussian noise channel, a multipath Rayleigh fading channel, and a multiuser channel. Compared with the conventional chaos communication algorithms, the MFM-DCSK can improve the integrated performance of the communication algorithm significantly. Moreover, we also define the utility of the chaos communication algorithm, which takes the transmission rate, the number of delay lines, and the BER into consideration. According to this definition, we deduce the optimal value of M for both MFM-DCSK and traditional M-ary FM-DCSK algorithms.