A Radio Frequency Identification (RFID) yoking proof allows an off-line verifier to make sure whether two tags are simultaneously present. Due to off-line property, a reader cannot differentiate valid from invalid proof records when it probes tags, and would generate lots of useless data. This paper proposes a tree-based matched RFID yoking scheme which enhances the cost of identification from O(log N) to O(1), where N is the number of tags, and allows the reader to collect only those matched tags such that it significantly reduces useless data for the verifier to validate off-line.

Media Access Control (MAC) protocols in Wireless Networked Control System (WNCS) must minimize the radio energy costs in sensor nodes. Latency and throughput are also important design features for MAC protocols in the applications. But most of them cannot guarantee quality for real-time traffic. This paper studies the state of the art of current real-time MAC protocols, and then introduces a medium access control protocol and a improved protocol that provide multiple priority levels and hard real-time transmission. The channel is accessed by sensors according to their priorities. Sensors send frames in a round manner with same priority. The fairness between different priorities is provided. The channel access procedure is divided into two stages: broadcast period and transmission period. Simulation and experiment results indicate that our protocol provides high channel utilization and bounded delays for real-time communication and can be well applied in the many fields especially the dynamic wireless sensor networks.

Clustering is an efficient techniques used to achieve the specific performance requirements of large scale wireless sensor networks. In this paper we have carried out the performance analysis of cluster-based wireless sensor networks for different communication patterns formed due to application constraints based upon LEACH protocol, which is among the most popular clustering protocols proposed for these types of networks. Simulation results based upon this protocol identify some important factors that induce unbalanced energy consumption among sensor nodes and hence affect the network lifetime. This highlights the need for an adaptive clustering protocol that can increase the network lifetime by further balancing the energy consumption among sensor nodes. Paper concludes with some recommendations for such protocol.

The discrete logarithm problem has been used as the basis of several cryptosystems, especially the Diffie- Hellman key exchange protocol. P systems are a cluster of distributed parallel computing devices in a biochemical type. This paper presents a P system with active membranes and strong priority to solve the discrete logarithm problem used in Diffie-Hellman key exchange protocol. To the best of our knowledge, it’s the first time to solve the problem using P systems.

Wireless sensor networks (WSNs) have unlimited and extensive potential application in different areas. Due to WSNs’ work environments and nodes behavior, intermitted network connection may occur frequently, which lead packets delay and lose in the process of data transmission. Most related works on WSNs, seldom consider how to address the issue of intermitted network connection in WSNs. To the best of our knowledge, few papers did related work on how to utilize intermitted network connection to control the topology of WSNs and save the battery of nodes in WSNs. Although intermitted network connection in WSNs is not a good phenomenon, when it occurs, it indeed can keep some nodes in power saving mode. If we can intelligently control WSNs network topology and get intermitted network connection during the intervals of transmission, we will find another way to save the nodes energy to the maximum extent. Based on these ideas, we import the idea of Delay Tolerant Network (DTN) protocol to address the issue. In this paper, first we give the modeling and analysis on node behaviors in DTN WSNs, then we present the end to end performance analysis in DTN WSNs to get the parameters of optimistic hops, maximum hops and each node’s neighbor number, after that we give some basic rules on DTN parameters selection for DTN based WSNs topology control. Finally, we do a related simulation by our DTN based WSNs topology control approach and HER routing algorithm; simulation results show that our approach and algorithm gained better performance in WSN life span, nodes energy equilibrium consumption than DADC.

Rolling Rocket/Shell (RR/S) can effectively overcome the impact point error caused by the asymmetry of aerodynamic appearance and mass eccentricity .etc. The spatial attitude of RR/S in the process of flight must be studied for that RR/S realizes the guidance control and improves the falling point precision. This paper introduces a semi physical simulation of RR/S attitude algorithm based on non-holonomic Inertial Measurement Unit (IMU) which is composed of 3 orthogonal import rate gyroscopes. It adopts the 902E-1 two-axis turntable to simulate the spatial attitude of RR/S, and uses the non-holonomic IMU, which is fixed on the turntable by ensuring the axes of them to be aimed, to measure the 3-axis angular rate motion of the turntable. By setting the motion condition of the turntable, we can get the 3-axis angular rate data of the IMU and the 3-axis angular position data of the turntable. The attitude algorithm simulation of IMU adopts the four-sample rotation vector algorithm based on MTLAB/Simulink. The simulation results show that the semi-physical simulation method can model the spatial attitude of RR/S truly and provide exact and real-time attitude information of RR/S which is rolling in the two-axis complex movement condition.

For monitoring burst events in a kind of reactive wireless sensor networks (WSNs), a multipath routing protocol (MRP) based on dynamic clustering and ant colony optimization (ACO) is proposed.. Such an approach can maximize the network lifetime and reduce the energy consumption. An important attribute of WSNs is its limited power supply, and therefore in MRP, some metrics (such as energy consumption of communication among nodes, residual energy, path length) are considered as very important criteria while designing routing. Firstly, a cluster head (CH) is selected among nodes located in the event area according to some parameters, such as residual energy. Secondly, an improved ACO algorithm is applied in search for multiple paths between the CH and sink node. Finally, the CH dynamically chooses a route to transmit data with a probability that depends on many path metrics, such as energy consumption. The simulation results show that MRP can prolong the network lifetime, as well as balance energy consumption among nodes and reduce the average energy consumption effectively.

There are many factors that can affect the calciner process of cement production, such as highly nonlinearity and time-lag, making it very difficult to establish an accurate model of the cement precalciner kiln (PCK) system. In order to reduce transport energy consumption and to ensure the quality of cement clinker burning, one needs to explore different control methods from the traditional way. Adaptive Critic Design (ACD) integrated neural network, reinforcement learning and dynamic programming techniques, is a new optimal method. As the PCK system parameters change frequently with high real-time property, ADACD (Action-Dependant ACD) algorithm is used in PCK system to control the temperature of furnace export and oxygen content of exhaust. ADACD does not depend on the system model, it may use historical data to train a controller offline, and then adapt online. Also the BP network of artificial neural network is used to accomplish the network modeling, and action and critic modules of the algorithm. The results of simulation show that, after the fluctuations in the early control period, the controlled parameters tend to be stabilized guaranteeing the quality of cement clinker calcining.