Mechanism analysis of regulating Turing instability and Hopf bifurcation of malware propagation in mobile wireless sensor networks

A dynamical model is constructed to depict the spatial-temporal evolution of malware in mobile wireless sensor networks(MWSNs). Based on such a model, we design a hybrid control scheme combining parameter perturbation and state feedback to effectively manipulate the spatiotemporal dynamics of malware propagation. The hybrid control can not only suppress the Turing instability caused by diffusion factor but can also adjust the occurrence of Hopf bifurcation induced by time delay. Numerical simulation results show that the hybrid control strategy can efficiently manipulate the transmission dynamics to achieve our expected desired properties, thus reducing the harm of malware propagation to MWSNs.

A new solution to wireless sensor network density control problem

In this paper, we proposed a scheme based on Monte Carlo algorithm to test whether or not the nodes are redundant for realizing the node density control in the sensor network. The computational complexity is only O(n). We also established the coverage collision detection and back-off mechanism applied in the wireless sensor network. The simulation results show that the system can cover all the interested area with the smallest number of nodes and a coverage void will not appear during the course of state-transition. The coverage collision detection and back-off mechanism proposed in this article can be applied when the nodes have either synchronous or asynchronous mechanism. It also provides a stable stage with the length of the time that can be adjusted.

Home control system based on ZigBee wireless sensor networks

A new scheme of the home control system based on ZigBee wireless sensor networks is presented. The design and development of the software and hardware of the proposed system are given. In addition to the basic data acquisition and processing functions, the gateway supports the Bluetooth-based local interface and the general packet radio service （GPRS）-based remote interface. Users on the client service side can use a pocket PC or notebook PC to achieve real-time data acquisition and control instruction implementation, or remotely control the home control system through a mobile phone by sending a short message. The Labview graphical development environment is adopted to create PDA applications running on pocket PCs and monitoring platform established on notebook PCs. Except for the gateway, other nodes in the system work in sleep mode most of the time on the system, and thus it improves the lifetime of the whole system efficiently.

A PSO based Energy Efficient Coverage Control Algorithm for Wireless Sensor Networks

Wireless Sensor Networks(WSNs)are large-scale and high-density networks that typically have coverage area overlap.In addition,a random deployment of sensor nodes cannot fully guarantee coverage of the sensing area,which leads to coverage holes in WSNs.Thus,coverage control plays an important role in WSNs.To alleviate unnecessary energy wastage and improve network performance,we consider both energy efficiency and coverage rate for WSNs.In this paper,we present a novel coverage control algorithm based on Particle Swarm Optimization(PSO).Firstly,the sensor nodes are randomly deployed in a target area and remain static after deployment.Then,the whole network is partitioned into grids,and we calculate each grid’s coverage rate and energy consumption.Finally,each sensor nodes’sensing radius is adjusted according to the coverage rate and energy consumption of each grid.Simulation results show that our algorithm can effectively improve coverage rate and reduce energy consumption.

Distributed power control algorithm based on game theory for wireless sensor networks

Energy saving is the most important issue in research and development for wireless sensor networks. A power control mechanism can reduce the power consumption of the whole network. Because the character of wireless sensor networks is restrictive energy, this paper proposes a distributed power control algorithm based on game theory for wireless sensor networks which objects of which are reducing power consumption and decreasing overhead and increasing network lifetime. The game theory and OPNET simulation shows that the power control algorithm converges to a Nash Equilibrium when decisions are updated according to a better response dynamic.

Virus spreading in wireless sensor networks with a medium access control mechanism

In this paper, an extended version of standard susceptible-infected （SI） model is proposed to consider the influence of a medium access control mechanism on virus spreading in wireless sensor networks. Theoretical analysis shows that the medium access control mechanism obviously reduces the density of infected nodes in the networks, which has been ignored in previous studies. It is also found that by increasing the network node density or node communication radius greatly increases the number of infected nodes. The theoretical results are confirmed by numerical simulations.

Optimal distributed resource allocation in a wireless sensor network for control systems

Wireless technology is applied increasingly in networked control systems. A new form of wireless network called wireless sensor network can bring control systems some advantages, such as flexibility and feasibility of network deployment at low costs, while it also raises some new challenges. First, the communication resources shared by all the control loops are limited. Second, the wireless and multi-hop character of sensor network makes the resources scheduling more difficult. Thus, how to effectively allocate the limited communication resources for those control loops is an important problem. In this paper, this problem is formulated as an optimal sampling frequency assignment problem, where the objective function is to maximize the utility of control systems, subject to channel capacity constraints. Then an iterative distributed algorithm based on local buffer information is proposed. Finally, the simulation results show that the proposed algorithm can effectively allocate the limited communication resource in a distributed way. It can achieve the optimal quality of the control system and adapt to the network load changes.

Power control and channel allocation optimization game algorithm with low energy consumption for wireless sensor network

In a wireless sensor network （WSN）, the energy of nodes is limited and cannot be charged. Hence, it is necessary to reduce energy consumption. Both the transmission power of nodes and the interference among nodes influence energy consumption. In this paper, we design a power control and channel allocation game model with low energy consumption （PCCAGM）. This model contains transmission power, node interference, and residual energy. Besides, the interaction between power and channel is considered. The Nash equilibrium has been proved to exist. Based on this model, a power control and channel allocation optimization algorithm with low energy consumption （PCCAA） is proposed. Theoretical analysis shows that PCCAA can converge to the Pareto Optimal. Simulation results demonstrate that this algorithm can reduce transmission power and interference effectively. Therefore, this algorithm can reduce energy consumption and prolong the network lifetime.

POWER CONTROL BASED COOPERATIVE OPPORTUNISTIC ROUTING IN WIRELESS SENSOR NETWORKS

This paper proposes an approach called PC-CORP (Power Control based Cooperative Opportunistic Routing Protocol) for WSN (Wireless Sensor Networks), providing robustness to the random variations in network connectivity while ensuring better data forwarding efficiency in an energy efficient manner. Based on the realistic radio model, we combine the region-based routing, rendezvous scheme, sleep discipline and cooperative communication together to model data forwarding by cross layer design in WSN. At the same time, a lightweight transmission power control algorithm called PC-AIMD (Power Control Additive Increase Multiplicative Decrease) is introduced to utilize the co- operation of relay nodes to improve the forwarding efficiency performance and increase the robustness of the routing protocol. In the simulation, the performance of PC-COPR is investigated in terms of the adaptation of variations in network connectivity and satisfying the QoS requirements of application.

Clustered Wireless Sensor Network in Precision Agriculture via Graph Theory

Food security and sustainable development is making a mandatory move in the entire human race.The attainment of this goal requires man to strive for a highly advanced state in thefield of agriculture so that he can produce crops with a minimum amount of water and fertilizer.Even though our agricultural methodol-ogies have undergone a series of metamorphoses in the process of a present smart-agricultural system,a long way is ahead to attain a system that is precise and accurate for the optimum yield and profitability.Towards such a futuristic method of cultivation,this paper proposes a novel method for monitoring the efficientflow of a small quantity of water through the conventional irrigation system in cultiva-tion using Clustered Wireless Sensor Networks(CWSN).The performance measure is simulated the creation of edge-fixed geodetic clusters using Mat lab’s Cup-carbon tool in order to evaluate the suggested irrigation process model’s performance.Thefindings of blocks 1 and 2 are assessed.Each signal takes just a little amount of energy to communicate,according to the performance.It is feasible to save energy while maintaining uninterrupted communication between nodes and cluster chiefs.However,the need for proper placement of a dynamic control station in WSN still exists for maintaining connectivity and for improving the lifetime fault tolerance of WSN.Based on the minimum edgefixed geodetic sets of the connected graph,this paper offers an innovative method for optimizing the placement of control stations.The edge-fixed geodetic cluster makes the network fast,efficient and reliable.Moreover,it also solves routing and congestion problems.

Burstiness-Aware Congestion Control Protocol for Wireless Sensor Networks

In monitoring Wireless Sensor Networks(WSNs),the traffic usually has bursty characteristics when an event occurs.Transient congestion would increase delay and packet loss rate severely,which greatly reduces network performance.To solve this problem,we propose a Burstiness-aware Congestion Control Protocol(BCCP) for wireless sensor networks.In BCCP,the backoff delay is adopted as a congestion indication.Normally,sensor nodes work on contention-based MAC protocol(such as CSMA/CA).However,when congestion occurs,localized TDMA instead of CSMA/CA is embedded into the nodes around the congestion area.Thus,the congestion nodes only deliver their data during their assigned slots to alleviate the contention-caused congestion.Finally,we implement BCCP in our sensor network testbed.The experiment results show that BCCP could detect area congestion in time,and improve the network performance significantly in terms of delay and packet loss rate.

A Minimum-energy Path-preserving Topology Control Algorithm for Wireless Sensor Networks

The topology control strategies of wireless sensor networks are very important for reducing the energy consumption of sensor nodes and prolonging the life-span of networks. In this paper, we put forward a minimum-energy path-preserving topology control （MPTC） algorithm based on a concept of none k-redundant edges. MPTC not only resolves the problem of excessive energy consumption because of the unclosed region in small minimum-energy communication network （SMECN）, but also preserves at least one minimum-energy path between every pair of nodes in a wireless sensor network. We also propose an energy-efficient reconfiguration protocol that maintains the minimum-energy path property in the case where the network topology changes dynamically. Finally, we demonstrate the performance improvements of our algorithm through simulation.

Data Gathering in Wireless Sensor Networks Via Regular Low Density Parity Check Matrix

A great challenge faced by wireless sensor networks(WSNs) is to reduce energy consumption of sensor nodes. Fortunately, the data gathering via random sensing can save energy of sensor nodes. Nevertheless, its randomness and density usually result in difficult implementations, high computation complexity and large storage spaces in practical settings. So the deterministic sparse sensing matrices are desired in some situations. However,it is difficult to guarantee the performance of deterministic sensing matrix by the acknowledged metrics. In this paper, we construct a class of deterministic sparse sensing matrices with statistical versions of restricted isometry property(St RIP) via regular low density parity check(RLDPC) matrices. The key idea of our construction is to achieve small mutual coherence of the matrices by confining the column weights of RLDPC matrices such that St RIP is satisfied. Besides, we prove that the constructed sensing matrices have the same scale of measurement numbers as the dense measurements. We also propose a data gathering method based on RLDPC matrix. Experimental results verify that the constructed sensing matrices have better reconstruction performance, compared to the Gaussian, Bernoulli, and CSLDPC matrices. And we also verify that the data gathering via RLDPC matrix can reduce energy consumption of WSNs.

MST-BASED CLUSTERING TOPOLOGY CONTROL ALGORITHM FOR WIRELESS SENSOR NETWORKS

In this paper, we propose a novel clustering topology control algorithm named Minimum Spanning Tree (MST)-based Clustering Topology Control (MCTC) for Wireless Sensor Networks (WSNs), which uses a hybrid approach to adjust sensor nodes' transmission power in two-tiered hi- erarchical WSNs. MCTC algorithm employs a one-hop Maximum Energy & Minimum Distance (MEMD) clustering algorithm to decide clustering status. Each cluster exchanges information between its own Cluster Members (CMs) locally and then deliveries information to the Cluster Head (CH). Moreover, CHs exchange information between CH and CH and afterwards transmits aggregated in- formation to the base station finally. The intra-cluster topology control scheme uses MST to decide CMs' transmission radius, similarly, the inter-cluster topology control scheme applies MST to decide CHs' transmission radius. Since the intra-cluster topology control is a full distributed approach and the inter-cluster topology control is a pure centralized approach performed by the base station, therefore, MCTC algorithm belongs to one kind of hybrid clustering topology control algorithms and can obtain scalability topology and strong connectivity guarantees simultaneously. As a result, the network topology will be reduced by MCTC algorithm so that network energy efficiency will be improved. The simulation results verify that MCTC outperforms traditional topology control schemes such as LMST, DRNG and MEMD at the aspects of average node's degree, average node's power radius and network lifetime, respectively.

An Anonymous Authentication Scheme with Controllable Linkability for Vehicle Sensor Networks

Vehicle sensor networks(VSN)play an increasingly important part in smart city,due to the interconnectivity of the infrastructure.However similar to other wireless communications,vehicle sensor networks are susceptible to a broad range of attacks.In addition to ensuring security for both data-at-rest and data-in-transit,it is essential to preserve the privacy of data and users in vehicle sensor networks.Many existing authentication schemes for vehicle sensor networks are generally not designed to also preserve the privacy between the user and service provider(e.g.,mining user data to provide personalized services without infringing on user privacy).Controllable linkability can be used to facilitate an involved entity with the right linking key to determine whether two messages were generated by the same sender,while preserving the anonymity of the signer.Such a functionality is very useful to provide personalized services.Thus,in this paper,a threshold authentication scheme with anonymity and controllable linkability for vehicle sensor networks is constructed,and its security is analyzed under the random oracle model.

In-Network Puncturing for Delay-Efficient Rate Control of Distributed Video Coding in Wireless Video Sensor Networks

Wyner-Ziv Video Coding （WZVC） is considered as a promising video coding scheme for Wireless Video Sensor Networks （WVSNs） due to its high compression efficiency and error resilience functionalities, as well as its low encoding complex- ity. To achieve a good Rate-Distortion （R-D） per- formance, the current WZVC paradi^prls usually a- dopt an end-to-end rate control scheme in which the decoder repeatedly requests the additional deco- ding data from the encoder for decoding Wyner-Ziv frames. Therefore, the waiting time of the additional decoding data is especially long in multihop WVSNs. In this paper, we propose a novel pro- gressive in-network rate control scheme for WZVC. The proposed in-network puncturing-based rate control scheme transfers the partial channel codes puncturing task from the encoder to the relay nodes. Then, the decoder can request the addition- al decoding data from the relay nodes instead of the encoder, and the total waiting time for deco- ding Wyner-Ziv frames is reduced consequently. Simulation results validate the proposed rate con- trol scheme.

A Routing Protocol for Wireless Sensor Networks with Congestion Control

This paper proposed a novel RED protocol which takes the node’s energy into account depending on the length of the data packet. It also proposed a routing protocol for wireless sensor networks with congestion control which imitates the ant colony foraging behavior. Sensor nodes choose routings according to the pheromone density. The experiment result shows that the algorithm balances the energy consumption of each node. It mitigated congestion effectively with the proposed routing protocol.

Topology Control and Routing in Large Scale Wireless Sensor Networks

In this paper, a two-tiered Wireless Sensor Network (WSN) where nodes are divided into clusters and nodes forward data to base stations through cluster heads is considered. To maximize the network lifetime, two energy efficient approaches are investigated. We first propose an approach that optimally locates the base stations within the network so that the distance between each cluster head and its closest base station is decreased. Then, a routing technique is developed to arrange the communication between cluster heads toward the base stations in order to guaranty that the gathered information effectively and efficiently reach the application. The overall dynamic framework that combines the above two schemes is described and evaluated. The experimental performance evaluation demonstrates the efficacy of topology control as a vital process to maximize the network lifetime of WSNs.

A Clustering-tree Topology Control Based on the Energy Forecast for Heterogeneous Wireless Sensor Networks

How to design an energy-efficient algorithm to maximize the network lifetime in complicated scenarios is a critical problem for heterogeneous wireless sensor networks (HWSN). In this paper, a clustering-tree topology control algorithm based on the energy forecast (CTEF) is proposed for saving energy and ensuring network load balancing, while considering the link quality, packet loss rate, etc. In CTEF, the average energy of the network is accurately predicted per round (the lifetime of the network is denoted by rounds) in terms of the difference between the ideal and actual average residual energy using central limit theorem and normal distribution mechanism, simultaneously. On this basis, cluster heads are selected by cost function (including the energy, link quality and packet loss rate) and their distance. The non-cluster heads are determined to join the cluster through the energy, distance and link quality. Furthermore, several non-cluster heads in each cluster are chosen as the relay nodes for transmitting data through multi-hop communication to decrease the load of each cluster-head and prolong the lifetime of the network. The simulation results show the efficiency of CTEF. Compared with low-energy adaptive clustering hierarchy (LEACH), energy dissipation forecast and clustering management (EDFCM) and efficient and dynamic clustering scheme (EDCS) protocols, CTEF has longer network lifetime and receives more data packets at base station. © 2014 Chinese Association of Automation.

Review on uncertainty analysis and information fusion diagnosis of aircraft control system

In the aircraft control system,sensor networks are used to sample the attitude and environmental data.As a result of the external and internal factors(e.g.,environmental and task complexity,inaccurate sensing and complex structure),the aircraft control system contains several uncertainties,such as imprecision,incompleteness,redundancy and randomness.The information fusion technology is usually used to solve the uncertainty issue,thus improving the sampled data reliability,which can further effectively increase the performance of the fault diagnosis decision-making in the aircraft control system.In this work,we first analyze the uncertainties in the aircraft control system,and also compare different uncertainty quantitative methods.Since the information fusion can eliminate the effects of the uncertainties,it is widely used in the fault diagnosis.Thus,this paper summarizes the recent work in this aera.Furthermore,we analyze the application of information fusion methods in the fault diagnosis of the aircraft control system.Finally,this work identifies existing problems in the use of information fusion for diagnosis and outlines future trends.