Submit to Sensors Review for Sensors Propose a Special Issue

Journal Browser

► Journal Browser

Distributed Algorithms for Wireless Sensor Networks

Print Special Issue Flyer
Special Issue Editors
Special Issue Information
Published Papers

A special issue of Sensors (ISSN 1424-8220). This special issue belongs to the section "Sensor Networks".

Deadline for manuscript submissions: closed (31 December 2021) | Viewed by 32410

Share This Special Issue

Special Issue Editors

Prof. Dr. Mohamed Mosbah

E-Mail Website
Guest Editor

LaBRI , Université de Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France
Interests: distributed algorithms; networks and protocols; wireless sensor networks; intelligent transportation systems; security and safety
Special Issues, Collections and Topics in MDPI journals

Dr. Imen Jemili

E-Mail Website
Guest Editor

Faculty of sciences of Bizerte, Univ. Carthage, 7021 Bizerte, Tunisia
Interests: wireless communications, smart cities, Internet of vehicles, routing, MAC protocols
Special Issues, Collections and Topics in MDPI journals

Dr. Mohamed Tounsi

E-Mail Website
Guest Editor

Common First Year deanship, Umm Al-Qura University, Makkah, Saudi Arabia
Interests: Distributed systems, Graph Relabeling Systems, Formal methods, Wireless Sensors Networks

Special Issue Information

Dear Colleagues,

Today, the growing interest in Wireless Sensor Networks has led to their deployment at large scale in several fields ranging from environmental monitoring to smart transportation, industrial systems, health and biomedical systems, intelligent environments, etc. Sensors being a key component of the Internet of Things, many IoT solutions entail their deployment in order to gather information from the surrounding environment, which will be forwarded for remote data processing (at sink level, fog/edge level or by a cloud-processing service). Sensor nodes have to cooperate in order to ensure a reliable forwarding for the different types of gathered data while respecting the QoS requirements. For some applications, other concerns have to be considered, such as security issues and energy limitation, as sensors have to operate for many years with limited batteries that cannot easily be replaced. To enhance network performances, additional contextual information can also be handled to adjust node and network behaviors. However, with the significant growth in the use of IoT and distributed sensor systems, many challenges arise and need to be addressed to support such large deployment, mainly in the context of smart cities and environments. In this context, the recourse to distributed algorithms in which computation is distributed among all sensor nodes allows overcoming inherent WSN limitations related to the short range communication over a wireless medium, resource limitations in terms of energy, computational resources, unreliability of links, etc. Further, distributed algorithms are required to comprehend the aspects of the large implementations that lead to certain characteristics, i.e., scalability, efficiency, and optimization. This Special Issue welcomes contributions dealing with distributed algorithms for Wireless Sensor Networks tackling all aspects, from sensor deployment to data management cloud.

Distributed Algorithms for Sensor Networks
Distributed communication and networking algorithms and protocols
Mobile and Wireless Network Computing for WSNs
Formal methods for Sensor Networks
Edge and fog computing
Artificial intelligence (or machine intelligence) in distributed sensor systems
Crowdsourcing and Wireless Sensors
Vehicle platoon networking
Distributed and federated Machine Learning
Internet of Things and cyber-physical systems
Sensor technologies and monitoring
Security, privacy, and trust in WSNs
MAC protocol
Routing protocols

Prof. Mohamed Mosbah
Dr. Imen Jemili
Dr. Mohamed Tounsi
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Sensors is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Published Papers (13 papers)

Download All Papers

Research

14 pages, 2298 KiB

Open AccessArticle

Enabling WLAN and WPAN Coexistence via Cross-Technology Communication

by Seungku Kim

Sensors 2022, 22(3), 707; https://0-doi-org.brum.beds.ac.uk/10.3390/s22030707 - 18 Jan 2022

Cited by 2 | Viewed by 1837

Abstract

In the limited frequency spectrum shared by various wireless communication technologies, cross-technology interference is an important factor which determines communication performance. A variety of coexistence methods to reduce the impact of this interference have been studied, but most of them cannot explicitly coordinate the shared spectrum and are not practical. This paper presents an explicit coexistence mechanism using cross-technology communication among heterogeneous wireless technologies. This mimics “carrier sense multiple access with collision avoidance” (CSMA/CA) via bidirectional cross-technology communication, which is called CTC-CSMA/CA. It allows communication between heterogeneous wireless technologies in order to achieve CSMA/CA. This accurately assigns required channel resources by directly sending and receiving feedback. CTC-CSMA/CA is a highly compatible technology because it does not require any modification to the IEEE 802.11 standard or any extra hardware. In addition, Zigbee can operate with a low duty cycle by synchronizing it to a periodic Wi-Fi beacon. We implemented CTC-CSMA/CA using a commodity Wi-Fi access point and a commercial Zigbee platform. Our experiments showed that the channels are coordinated more accurately by our method, which significantly improves Zigbee throughput, than by conventional schemes. We expect the proposed scheme to be an important application case in designing future cross-technology communication. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Figure 1

21 pages, 3934 KiB

Open AccessCommunication

Energy Efficient Routing Protocol in Sensor Networks Using Genetic Algorithm

by Jatinkumar Patel and Hosam El-Ocla

Sensors 2021, 21(21), 7060; https://0-doi-org.brum.beds.ac.uk/10.3390/s21217060 - 25 Oct 2021

Cited by 17 | Viewed by 2295

Abstract

In this paper, we examine routing protocols with the shortest path in sensor networks. In doing this, we propose a genetic algorithm (GA)-based Ad Hoc On-Demand Multipath Distance Vector routing protocol (GA-AOMDV). We utilize a fitness function that optimizes routes based on the energy consumption in their nodes. We compare this algorithm with other existing ad hoc routing protocols including LEACH-GA, GA-AODV, AODV, DSR, EPAR, EBAR_BFS. Results prove that our protocol enhances the network performance in terms of packet delivery ratio, throughput, round trip time and energy consumption. GA-AOMDV protocol achieves average gain that is 7 to 22% over other protocols. Therefore, our protocol extends the network lifetime for data communications. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Figure 1

27 pages, 1160 KiB

Open AccessArticle

Multi-View Data Analysis Techniques for Monitoring Smart Building Systems

by Vishnu Manasa Devagiri, Veselka Boeva, Shahrooz Abghari, Farhad Basiri and Niklas Lavesson

Sensors 2021, 21(20), 6775; https://0-doi-org.brum.beds.ac.uk/10.3390/s21206775 - 12 Oct 2021

Cited by 2 | Viewed by 1931

Abstract

In smart buildings, many different systems work in coordination to accomplish their tasks. In this process, the sensors associated with these systems collect large amounts of data generated in a streaming fashion, which is prone to concept drift. Such data are heterogeneous due to the wide range of sensors collecting information about different characteristics of the monitored systems. All these make the monitoring task very challenging. Traditional clustering algorithms are not well equipped to address the mentioned challenges. In this work, we study the use of MV Multi-Instance Clustering algorithm for multi-view analysis and mining of smart building systems’ sensor data. It is demonstrated how this algorithm can be used to perform contextual as well as integrated analysis of the systems. Various scenarios in which the algorithm can be used to analyze the data generated by the systems of a smart building are examined and discussed in this study. In addition, it is also shown how the extracted knowledge can be visualized to detect trends in the systems’ behavior and how it can aid domain experts in the systems’ maintenance. In the experiments conducted, the proposed approach was able to successfully detect the deviating behaviors known to have previously occurred and was also able to identify some new deviations during the monitored period. Based on the results obtained from the experiments, it can be concluded that the proposed algorithm has the ability to be used for monitoring, analysis, and detecting deviating behaviors of the systems in a smart building domain. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Figure 1

23 pages, 28037 KiB

Open AccessArticle

Routing with Face Traversal and Auctions Algorithms for Task Allocation in WSRN

by Jelena Stanulovic, Nathalie Mitton and Ivan Mezei

Sensors 2021, 21(18), 6149; https://0-doi-org.brum.beds.ac.uk/10.3390/s21186149 - 13 Sep 2021

Viewed by 1715

Abstract

Four new algorithms (RFTA1, RFTA2, GFGF2A, and RFTA2GE) handling the event in wireless sensor and robot networks based on the greedy-face-greedy (GFG) routing extended with auctions are proposed in this paper. In this paper, we assume that all robots are mobile, and after the event is found (reported by sensors), the goal is to allocate the task to the most suitable robot to act upon the event, using either distance or the robots’ remaining energy as metrics. The proposed algorithms consist of two phases. The first phase of algorithms is based on face routing, and we introduced the parameter called search radius (SR) at the end of this first phase. Routing is considered successful if the found robot is inside SR. After that, the second phase, based on auctions, is initiated by the robot found in SR trying to find a more suitable one. In the simulations, network lifetime and communication costs are measured and used for comparison. We compare our algorithms with similar algorithms from the literature (k-SAAP and BFS) used for the task assignment. RFTA2 and RFTA2GE feature up to a seven-times-longer network lifetime with significant communication overhead reduction compared to k-SAAP and BFS. Among our algorithms, RFTA2GE features the best robot energy utilization. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Figure 1

19 pages, 3048 KiB

Open AccessArticle

OSCAR: An Optimized Scheduling Cell Allocation Algorithm for Convergecast in IEEE 802.15.4e TSCH Networks

by Mohamed Osman and Frederic Nabki

Sensors 2021, 21(7), 2493; https://0-doi-org.brum.beds.ac.uk/10.3390/s21072493 - 03 Apr 2021

Cited by 12 | Viewed by 2655

Abstract

Today’s wireless sensor networks expect to receive increasingly more data from different sources. The Time Slotted Channel Hopping (TSCH) protocol defined in the IEEE 802.15.4-2015 version of the IEEE 802.15.4 standard plays a crucial role in reducing latency and minimizing energy consumption. In the case of convergecast traffic, nodes close to the root have consistently heavy traffic and suffer from severe network congestion problems. In this paper, we propose OSCAR, an novel autonomous scheduling TSCH cell allocation algorithm based on Orchestra. This new design differs from Orchestra by allocating slots according to the location of the node relative to the root. The goal of this algorithm is to allocate slots to nodes according to their needs. This algorithm manages the number of timeslots allocated to each node using the value of the rank described by the RPL routing protocol. The goal is that the closer the node is to the root, the more slots it gets in order to maximize the transmission opportunities. To avoid overconsumption, OSCAR sets up a mechanism to adjust the radio duty cycle of each node by reducing the slots allocated to inactive nodes regardless of their position in the network. We implement OSCAR on Contiki-ng and evaluate its performance by both simulations and experimentation. The performance assessment of OSCAR shows that it outperforms Orchestra on the average latency and reliability, without significantly increasing the average duty cycle, especially when the traffic load is high. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Figure 1

21 pages, 835 KiB

Open AccessArticle

A Weighted and Distributed Algorithm for Range-Based Multi-Hop Localization Using a Newton Method

by Jose Diaz-Roman, Boris Mederos, Ernesto Sifuentes, Rafael Gonzalez-Landaeta and Juan Cota-Ruiz

Sensors 2021, 21(7), 2324; https://0-doi-org.brum.beds.ac.uk/10.3390/s21072324 - 26 Mar 2021

Cited by 2 | Viewed by 1790

Abstract

Wireless sensor networks are used in many location-dependent applications. The location of sensor nodes is commonly carried out in a distributed way for energy saving and network robustness, where the handling of these characteristics is still a great challenge. It is very desirable that distributed algorithms invest as few iterations as possible with the highest accuracy on position estimates. This research proposes a range-based and robust localization method, derived from the Newton scheme, that can be applied over isotropic and anisotropic networks in presence of outliers in the pair-wise distance measurements. The algorithm minimizes the error of position estimates using a hop-weighted function and a scaling factor that allows a significant improvement on position estimates in only few iterations. Simulations demonstrate that our proposed algorithm outperforms other similar algorithms under anisotropic networks. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Figure 1

22 pages, 568 KiB

Open AccessArticle

A Co-Design-Based Reliable Low-Latency and Energy-Efficient Transmission Protocol for UWSNs

by Xiaohui Wei, Hao Guo, Xingwang Wang, Xiaonan Wang, Chu Wang, Mohsen Guizani and Xiaojiang Du

Sensors 2020, 20(21), 6370; https://0-doi-org.brum.beds.ac.uk/10.3390/s20216370 - 08 Nov 2020

Cited by 8 | Viewed by 2228

Abstract

Recently, underwater wireless sensor networks (UWSNs) have been considered as a powerful technique for many applications. However, acoustic communications in UWSNs bring in huge QoS issues for time-critical applications. Additionally, excessive control packets and multiple copies during the data transmission process exacerbate this challenge. Faced with these problems, we propose a reliable low-latency and energy-efficient transmission protocol for dense 3D underwater wireless sensor networks to improve the QoS of UWSNs. The proposed protocol exploits fewer control packets and reduces data-packet copies effectively through the co-design of routing and media access control (MAC) protocols. The co-design method is divided into two steps. First, the number of handshakes in the MAC process will be greatly reduced via our forwarding-set routing strategy under the guarantee of reliability. Second, with the help of information from the MAC process, network-update messages can be used to replace control packages through mobility prediction when choosing a route. Simulation results show that the proposed protocol has a considerably higher reliability, and lower latency and energy consumption in comparison with existing transmission protocols for a dense underwater wireless sensor network. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Figure 1

23 pages, 2412 KiB

Open AccessArticle

Privacy-Preserving Distributed Analytics in Fog-Enabled IoT Systems

by Liang Zhao

Sensors 2020, 20(21), 6153; https://0-doi-org.brum.beds.ac.uk/10.3390/s20216153 - 29 Oct 2020

Cited by 7 | Viewed by 2391

Abstract

The Internet of Things (IoT) has evolved significantly with advances in gathering data that can be extracted to provide knowledge and facilitate decision-making processes. Currently, IoT data analytics encountered challenges such as growing data volumes collected by IoT devices and fast response requirements for time-sensitive applications in which traditional Cloud-based solution is unable to meet due to bandwidth and high latency limitations. In this paper, we develop a distributed analytics framework for fog-enabled IoT systems aiming to avoid raw data movement and reduce latency. The distributed framework leverages the computational capacities of all the participants such as edge devices and fog nodes and allows them to obtain the global optimal solution locally. To further enhance the privacy of data holders in the system, a privacy-preserving protocol is proposed using cryptographic schemes. Security analysis was conducted and it verified that exact private information about any edge device’s raw data would not be inferred by an honest-but-curious neighbor in the proposed secure protocol. In addition, the accuracy of solution is unaffected in the secure protocol comparing to the proposed distributed algorithm without encryption. We further conducted experiments on three case studies: seismic imaging, diabetes progression prediction, and Enron email classification. On seismic imaging problem, the proposed algorithm can be up to one order of magnitude faster than the benchmarks in reaching the optimal solution. The evaluation results validate the effectiveness of the proposed methodology and demonstrate its potential to be a promising solution for data analytics in fog-enabled IoT systems. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Figure 1

22 pages, 1009 KiB

Open AccessArticle

Flood and Contain: An Optimized Repeal-Based Flooding Algorithm for Wireless Ad Hoc and Sensor Networks

by Javier Gomez, Martha Montes-de-Oca and Jose Jaime Camacho-Escoto

Sensors 2020, 20(20), 5914; https://0-doi-org.brum.beds.ac.uk/10.3390/s20205914 - 20 Oct 2020

Cited by 1 | Viewed by 2354

Abstract

Flooding is a simple yet reliable way of discovering resources in wireless ad hoc networks such as mobile ad hoc networks (MANETs), ad hoc sensors, and recently, IoT networks. However, its operation is resource-intensive, especially in densely populated networks. Several approaches can be found in the literature to reduce the impact of flooding. Many of these approaches follow a repeal-based operation, chasing and stopping further propagation of flooding packets once the target is found. However, repeal-based protocols might end up transmitting even more packets than the original flooding. This work characterizes a maximum repeal-flooding boundary beyond which it is counterproductive to chase the original flooding. We present the Flood and Contain (F&C) algorithm, a method that can quickly establish the maximum repeal-flooding boundary for each node while making no assumptions on the underlying network. F&C’s packet overhead increases linearly with the hop count up to the maximum repeal-flooding boundary, in which case there is no attempt to chase the original flooding. In this latter case, F&C generates only as many packets as the original flooding. Simulations show that, on average, F&C reduces the total flooding overhead (compared to traditional flooding) up to 35 percent once considering all possible destinations, with only a slight increase in resource discovery latency, and it outperforms all other repeal-based protocols, particularly for longer routes. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Figure 1

27 pages, 2014 KiB

Open AccessArticle

Robust ℋ_∞-Fuzzy Logic Control for Enhanced Tracking Performance of a Wheeled Mobile Robot in the Presence of Uncertain Nonlinear Perturbations

by Nur Syazreen Ahmad

Sensors 2020, 20(13), 3673; https://0-doi-org.brum.beds.ac.uk/10.3390/s20133673 - 30 Jun 2020

Cited by 21 | Viewed by 2757

Abstract

Motion control involving DC motors requires a closed-loop system with a suitable compensator if tracking performance with high precision is desired. In the case where structural model errors of the motors are more dominating than the effects from noise disturbances, accurate system modelling will be a considerable aid in synthesizing the compensator. The focus of this paper is on enhancing the tracking performance of a wheeled mobile robot (WMR), which is driven by two DC motors that are subject to model parametric uncertainties and uncertain deadzones. For the system at hand, the uncertain nonlinear perturbations are greatly induced by the time-varying power supply, followed by behaviour of motion and speed. In this work, the system is firstly modelled, where correlations between the model parameters and different input datasets as well as voltage supply are obtained via polynomial regressions. A robust

H_{\infty}

-fuzzy logic approach is then proposed to treat the issues due to the aforementioned perturbations. Via the proposed strategy, the

H_{\infty}

controller and the fuzzy logic (FL) compensator work in tandem to ensure the control law is robust against the model uncertainties. The proposed technique was validated via several real-time experiments, which showed that the speed and path tracking performance can be considerably enhanced when compared with the results via the

H_{\infty}

controller alone, and the

H_{\infty}

with the FL compensator, but without the presence of the robust control law. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Graphical abstract

22 pages, 6945 KiB

Open AccessArticle

Incremental Interval Type-2 Fuzzy Clustering of Data Streams using Single Pass Method

by Sana Qaiyum, Izzatdin Aziz, Mohd Hilmi Hasan, Asif Irshad Khan and Abdulmohsen Almalawi

Sensors 2020, 20(11), 3210; https://0-doi-org.brum.beds.ac.uk/10.3390/s20113210 - 05 Jun 2020

Cited by 6 | Viewed by 2359

Abstract

Data Streams create new challenges for fuzzy clustering algorithms, specifically Interval Type-2 Fuzzy C-Means (IT2FCM). One problem associated with IT2FCM is that it tends to be sensitive to initialization conditions and therefore, fails to return global optima. This problem has been addressed by optimizing IT2FCM using Ant Colony Optimization approach. However, IT2FCM-ACO obtain clusters for the whole dataset which is not suitable for clustering large streaming datasets that may be coming continuously and evolves with time. Thus, the clusters generated will also evolve with time. Additionally, the incoming data may not be available in memory all at once because of its size. Therefore, to encounter the challenges of a large data stream environment we propose improvising IT2FCM-ACO to generate clusters incrementally. The proposed algorithm produces clusters by determining appropriate cluster centers on a certain percentage of available datasets and then the obtained cluster centroids are combined with new incoming data points to generate another set of cluster centers. The process continues until all the data are scanned. The previous data points are released from memory which reduces time and space complexity. Thus, the proposed incremental method produces data partitions comparable to IT2FCM-ACO. The performance of the proposed method is evaluated on large real-life datasets. The results obtained from several fuzzy cluster validity index measures show the enhanced performance of the proposed method over other clustering algorithms. The proposed algorithm also improves upon the run time and produces excellent speed-ups for all datasets. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Figure 1

18 pages, 447 KiB

Open AccessFeature PaperArticle

A Distributed Clustering Algorithm Guided by the Base Station to Extend the Lifetime of Wireless Sensor Networks

by Antonio-Jesus Yuste-Delgado, Juan-Carlos Cuevas-Martinez and Alicia Triviño-Cabrera

Sensors 2020, 20(8), 2312; https://0-doi-org.brum.beds.ac.uk/10.3390/s20082312 - 18 Apr 2020

Cited by 17 | Viewed by 4197

Abstract

Clustering algorithms are necessary in Wireless Sensor Networks to reduce the energy consumption of the overall nodes. The decision of which nodes are the cluster heads (CHs) greatly affects the network performance. The centralized clustering algorithms rely on a sink or Base Station (BS) to select the CHs. To do so, the BS requires extensive data from the nodes, which sometimes need complex hardware inside each node or a significant number of control messages. Alternatively, the nodes in distributed clustering algorithms decide about which the CHs are by exchanging information among themselves. Both centralized and distributed clustering algorithms usually alternate the nodes playing the role of the CHs to dynamically balance the energy consumption among all the nodes in the network. This paper presents a distributed approach to form the clusters dynamically, but it is occasionally supported by the Base Station. In particular, the Base Station sends three messages during the network lifetime to reconfigure the

s k i p

value of the network. The

s k i p

, which stands out as the number of rounds in which the same CHs are kept, is adapted to the network status in this way. At the beginning of each group of rounds, the nodes decide about their convenience to become a CH according to a fuzzy-logic system. As a novelty, the fuzzy controller is as a Tagaki–Sugeno–Kang model and not a Mandami-one as other previous proposals. The clustering algorithm has been tested in a wide set of scenarios, and it has been compared with other representative centralized and distributed fuzzy-logic based algorithms. The simulation results demonstrate that the proposed clustering method is able to extend the network operability. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Figure 1

18 pages, 559 KiB

Open AccessArticle

Distributed Robust Filtering for Wireless Sensor Networks with Markov Switching Topologies and Deception Attacks

by Fengzeng Zhu, Xu Liu, Jiwei Wen, Linbo Xie and Li Peng

Sensors 2020, 20(7), 1948; https://0-doi-org.brum.beds.ac.uk/10.3390/s20071948 - 31 Mar 2020

Cited by 5 | Viewed by 2305

Abstract

This paper is concerned with the distributed full- and reduced-order

l_{2}

l_{\infty}

This paper is concerned with the distributed full- and reduced-order

l_{2}

l_{\infty}

state estimation issue for a class of discrete time-invariant systems subjected to both randomly occurring switching topologies and deception attacks over wireless sensor networks. Firstly, a switching topology model is proposed which uses homogeneous Markov chain to reflect the change of filtering networks communication modes. Then, the sector-bound deception attacks among the communication channels are taken into consideration, which could better characterize the filtering network communication security. Additionally, a random variable obeying the Bernoulli distribution is used to describe the phenomenon of the randomly occurring deception attacks. Furthermore, through an adjustable parameter E, we can obtain full- and reduced-order

l_{2}

l_{\infty}

state estimator over sensor networks, respectively. Sufficient conditions are established for the solvability of the addressed switching topology-dependent distributed filtering design in terms of certain convex optimization problem. The purpose of solving the problem is to design a distributed full- and reduced-order filter such that, in the presence of deception attacks, stochastic external interference and switching topologies, the resulting filtering dynamic system is exponentially mean-square stable with prescribed

l_{2}

l_{\infty}

performance index. Finally, a simulation example is provided to show the effectiveness and flexibility of the designed approach. Full article

(This article belongs to the Special Issue Distributed Algorithms for Wireless Sensor Networks)

► Show Figures

Figure 1

Journal Menu

Journal Browser

Distributed Algorithms for Wireless Sensor Networks

Share This Special Issue

Special Issue Editors

Special Issue Information

Published Papers (13 papers)

Research

Further Information

Guidelines

MDPI Initiatives

Follow MDPI