Modeling and Control for Wireless Networked Control System

In this paper, the stabilization problem is considered for the class of wireless networked control systems （WNCS）. An indicator is introduced in the WNCS model. The packet drop sequences in the indicator are represented as states of a Markov chain. A new discrete Markov switching system model integrating 802.11 protocol and new scheduling approach for wireless networks with control systems are constructed. The variable controller can be obtained easily by solving the linear matrix inequality （LMI） with the use of the Matlab toolbox. Both the known and unknown dropout probabilities are considered. Finally, a simulation is given to show the feasibility of the proposed method.

Stability analysis and stabilization of wireless networked control systems based on deadband control scheduling

The stability analysis and stabilization problems of the wireless networked control systems(WNCSs) with signal transmission deadbands were considered. The deadbands were respectively set up at the sensor to the controller and the controller to the actor sides in the WNCS, which were used to reduce data transmission, furthermore, to decrease the network collision and node energy consumption. Under the consideration of time-varying delays and signal transmission deadbands, the model for the WNCS was presented. A novel Lyapunov functional which took full advantages of the network factors was exploited. Meanwhile, new stability analysis and stabilization conditions for the WNCS were proposed, which described the relationship of the delay bounds, the transmission deadband bounds and the system stability. Two examples were used to demonstrate the effectiveness of the proposed methods. The results show that the proposed approach can guarantee asymptotical stability of the system and reduce the data transmission effectively.

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.

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.

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.

Joint Predictive Control of Power and Rate for Wireless Networks

为了在分布式的无线网络，预兆的力量和率控制计划减轻循环延期，为系统模型被建议也说明拥挤层次和输入延期而不是在一个网络推迟状态。有输入延期的一个测量反馈控制问题被最小化之间的差别的精力提出实际并且控制的需要的 signal-to-interference-plus-noise 比率(SNR ) 层次，以及精力定序。解决这个问题，我们在场为控制的二个 Riccati 方程和在时间的评价推迟系统。一个完全的分析最佳的控制器被使用分离原则并且解决二个 Riccati 方程获得，在一个人是为随机的线性二次的规定的向后的方程，其它是标准过滤 Riccati 方程的地方。模拟结果说明建议力量和率控制计划的表演。

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 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.

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.

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.

Improved Bat Algorithm Based Energy Efficient Congestion Control Scheme for Wireless Sensor Networks

Energy conservation and congestion control are widely researched topics in Wireless Sensor Networks in recent years. The main objective is to develop a model to find the optimized path on the basis of distance between source and destination and the residual energy of the node. This paper shows an implementation of nature inspired improved Bat Algorithm to control congestion in Wireless Sensor Networks at transport layer. The Algorithm has been applied on the fitness function to obtain an optimum solution. Simulation results have shown improvement in parameters like network lifetime and throughput as compared with CODA (Congestion Detection and Avoidance), PSO (Particle Swarm Optimization) algorithm and ACO (Ant Colony Optimization).

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.

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.

On the Performability of Hierarchical Wireless Networked Control Systems

This paper investigates the performability of hierarchical Wireless Networked Control Systems (WNCS). The WNCS studied can operate in two modes: passive supervisor and active supervisor. It is first shown that the Markov models for both modes are identical. Performability models are then developed and a case study shows how to use these models to help make design decisions. More specifically, it is observed that the performability of a passive supervisor system increases in time while that of an active supervisor system decreases in time.

Design and Implementation of a Wireless Networked Water Level Control System

The design of a wireless water level control system is introduced and discussed in detail. In this system, the wireless Proportional Integral (PI) controller is developed using the LabVIEW graphical user programming language. Zigbee wireless technology is chosen for the wireless data transfer system. The experimental testbed was built and the system software and hardware were implemented. In order to compare the performance of the wired and wireless system, a corresponding wired water level control system was built. Experimental results show that under the same PI parameters, the settling time of the wired system is 3.3 times faster than the wireless system. However, the percent overshoot using the wireless controller is 4% smaller.

Fair rate control for wireless ad-hoc networks with time varying channel capacities

We consider the problem of fair rate control for wireless ad-hoc networks with time varying channel capacities. The interaction between links in wireless ad-hoc networks introduces additional constraints on the flow rate. A primal-dual algorithm that guarantees fair rate control is proved to be trajectory stable. Various fairness indexes are obtained by choosing the specified form of the utility functions, and the numerical results validate the effectiveness of the proposed algorithm.

Mobility Conscious Medium Access Control Scheme for Wireless Sensor Networks: A Conceptual Approach

Mobility in Wireless Sensor Network (WSN) presents distinctive challenges in Medium Access Control (MAC) scheme. Numerous MAC protocols for sensor networks assume that sensor nodes are static and focus primarily on energy efficiency. This work seeks to develop an improved mobility conscious medium access control scheme for wireless sensor networks with a view to enhance energy conservation on mobile sensor nodes. On this note, mobility patterns of different scenarios are modelled using Gauss Markov Mobility Model (GMMM) to determine the position and distance of the sensor nodes and how they are correlated in time.

Call for papers Journal of Control Theory and Applications Special issue on Wireless sensor networks:from theory to practices and applications

Wireless Sensor Network （WSN） is characterized by the dense deployment of sensor nodes that continuously observe physical phenomenon. The main advantages of WSN include its low cost, rapid deployment, self-organization, and fault tolerance. WSN has received tremendous interests of various research communities,