In this paper, a Probe Route based Defense Sinkhole Attack (PRDSA) scheme is proposed to resist Sinkhole attack and guarantee security for IoT, which is the first work that can detect, bypass and locate the sinkhole at the same time. The PRDSA scheme proposes a routing mechanism combining the far-sink reverse routing, equal-hop routing, and minimum hop routing, which can effectively circumvent the sinkhole attacks and find a safe route to the real sink, so that the scheme can achieve better sinkhole detection. More importantly, the PRDSA scheme overcomes the limitation of previous schemes that they cannot locate the sinkhole. During the detection of the sinkhole attack, the PRDSA scheme requires the nodes and the sink node to return the signature of the information (e.g., IDs, etc.), so that the location of the sinkhole can be determined. Furthermore, the PRDAS scheme mainly utilizes the characteristics of network energy consumption. The probe route of sinkhole attack mainly occurs in the region where the remaining energy exists. Thus, the PRDSA scheme has little impact on the network lifetime. Theory and experiments show that this scheme can achieve better performance than existing schemes in term of network security and lifetime.

For the Cyber-Physical Systems (CPS) in the smart industrial environments, a larger amount of smart sensor nodes, processors and actuators are deployed to sense information from physical world, which is vulnerable to be attacked because the nodes are deployed in unattended areas. Security is a pivotal issue for CPS, therefore, a trust-based active detection (TBAD) scheme is proposed for improving the reliability of collecting data packets and reducing the data redundancy. In TBAD scheme, the trust of the nodes is evaluated by the neighboring nodes and the evaluation results are added into the header of data packets. Thus, according to the reliability of data packets collected by the unmanned aerial vehicle (UAV), the trust of sensor nodes is evaluated by the UAV. In addition, the evaluation trust of nodes stored in the header of data packets will be detected when the UAV suspects the stored trust of sensor nodes. Then the trust of corresponding sensor nodes is adjusted according to the detection results. The sensor nodes with higher trust are selected to form movement trajectory. A series of simulation experiments are conducted to evaluate the performance of our scheme. The results illustrate that the proposed scheme can greatly improve the efficiency and security of data routing in CPS.

Fog (From cOre to edGe) computing employs a huge number of wireless embedded devices to enable end users with anywhere-anytime-to-anything connectivity. Due to their operating nature, wireless sensor nodes often work unattended, and hence are exposed to a variety of attacks. Preserving source-location privacy plays a key role in some wireless sensor network (WSN) applications. In this paper, a redundancy branch convergence-based preserved source location privacy scheme (RBCPSLP) is proposed for energy harvesting sensor networks, with the following advantages: numerous routing branches are created in non-hotspot areas with abundant energy, and those routing branches can merge into a few routing paths before they reach the hotspot areas. The generation time, the duration of routing, and the number of routing branches are then decided independently based on the amount of energy obtained, so as to maximize network energy utilization, greatly enhance privacy protection, and provide long network lifetimes. Theoretical analysis and experimental results show that the RBCPSLP scheme allows a several-fold improvement of the network energy utilization as well as the source location privacy preservation, while maximizing network lifetimes.

For Industrial Wireless Sensor Networks (IWSNs), sending data with timely style to the stink (or control center, CC) that is monitored by sensor nodes is a challenging issue. However, in order to save energy, wireless sensor networks based on a duty cycle are widely used in the industrial field, which can bring great delay to data transmission. We observe that if the duty cycle of a small number of nodes in the network is set to 1, the sleep delay caused by the duty cycle can be effectively reduced. Thus, in this paper, a novel Portion of Nodes with Larger Duty Cycle (PNLDC) scheme is proposed to reduce delay and optimize energy efficiency for IWSNs. In the PNLDC scheme, a portion of nodes are selected to set their duty cycle to 1, and the proportion of nodes with the duty cycle of 1 is determined according to the energy abundance of the area in which the node is located. The more the residual energy in the region, the greater the proportion of the selected nodes. Because there are a certain proportion of nodes with the duty cycle of 1 in the network, the PNLDC scheme can effectively reduce delay in IWSNs. The performance analysis and experimental results show that the proposed scheme significantly reduces the delay for forwarding data by 8.9~26.4% and delay for detection by 2.1~24.6% without reducing the network lifetime when compared with the fixed duty cycle method. Meanwhile, compared with the dynamic duty cycle strategy, the proposed scheme has certain advantages in terms of energy utilization and delay reduction.

With the development of smart devices and connection technologies, Wireless Sensor Networks (WSNs) are becoming increasingly intelligent. New or special functions can be obtained by receiving new versions of program codes to upgrade their software systems, forming the so-called smart Internet of Things (IoT). Due to the lossy property of wireless channels, data collection in WSNs still suffers from a long delay, high energy consumption, and many retransmissions. Thanks to wireless software-defined networks (WSDNs), software in sensors can now be updated to help them transmit data cooperatively, thereby achieving more reliable communication. In this paper, a Reliability Improved Cooperative Communication (RICC) data collection scheme is proposed to improve the reliability of random-network-coding-based cooperative communications in multi-hop relay WSNs without reducing the network lifetime. In WSNs, sensors in different positions can have different numbers of packets to handle, resulting in the unbalanced energy consumption of the network. In particular, nodes in non-hotspot areas have up to 90% of their original energy remaining when the network dies. To efficiently use the residual energy, in RICC, high data transmission power is adopted in non-hotspot areas to achieve a higher reliability at the cost of large energy consumption, and relatively low transmission power is adopted in hotspot areas to maintain the long network lifetime. Therefore, high reliability and a long network lifetime can be obtained simultaneously. The simulation results show that compared with other scheme, RICC can reduce the end-to-end Message Fail delivering Ratio (MFR) by 59.4%–62.8% under the same lifetime with a more balanced energy utilization.

Cloud computing has emerged as today’s most exciting computing paradigm for providing services using a shared framework, which opens a new door for solving the problems of the explosive growth of digital resource demands and their corresponding convenience. With the exponential growth of the number of data types and data size in so-called big data work, the backbone network is under great pressure due to its transmission capacity, which is lower than the growth of the data size and would seriously hinder the development of the network without an effective approach to solve this problem. In this paper, an Intelligent Aggregation based on a Content Routing (IACR) scheme for cloud computing, which could reduce the amount of data in the network effectively and play a basic supporting role in the development of cloud computing, is first put forward. All in all, the main innovations in this paper are: (1) A framework for intelligent aggregation based on content routing is proposed, which can support aggregation based content routing; (2) The proposed IACR scheme could effectively route the high aggregation ratio data to the data center through the same routing path so as to effectively reduce the amount of data that the network transmits. The theoretical analyses experiments and results show that, compared with the previous original routing scheme, the IACR scheme can balance the load of the whole network, reduce the amount of data transmitted in the network by 41.8%, and reduce the transmission time by 31.6% in the same network with a more balanced network load.