No abstract

The conventional data-based routing protocols are usually vulnerable to a large number of energy voids or hotspots in Wireless Sensor Networks (WSNs). In order to address this problem, we propose Mobile Intelligent Fog Computing: An Energy-efficient Cross-layer-sensing Clustering Method (ECCM). The first, according to the cross-layer projection principle, the proposed algorithm employs the sensingevent-driven mechanism to project the fog nodes onto the sensing layer, and constructs a powerful virtual control node. Then the control procedure of the cluster-based routing protocol in sensor networks is uploaded to the fog layer and the fog computation is employed to achieve the distributed clustering of the event-field nodes. The second, the optimized data aggregation routing is constructed, which centers the projectile fog nodes. The data in the bottom-layer routing of the sensor network is thus replaced, and the network load is balanced and reduced. The third, in the optimization of the routing protocol, we introduce the Particles Swarm Optimization, (PSO) algorithm and elect a group of optimal nodes as the cluster heads, without the cost of any competition overhead, the energy overhead of the network can be effectively reduced and balanced, which curbs the rapid exhaustion of the node energy and prolongs the network lifetime. Finally, it is shown by the simulation results that the construction and the maintenance of the routing structure are small, which could optimize the data aggregation efficiency and improve the network performance.INDEX TERMS Fog computation, wireless sensor network, clustering method, routing protocol, particles swarm optimization.

Coverage problem is an important research topic in the field of wireless sensor network (WSN). The coverage algorithm based on event probability driven mechanism (EPDM) is put forward in this paper. First of all, the network probability model is established and the subordinate relation between sensor nodes and the target nodes is presented. Secondly, a series of probability is computed and the related theorems and reasoning are also proven. Thirdly, effective coverage for the monitoring region is achieved through scheduling mechanism of nodes themselves, thus the purpose of increasing network lifetime can be realized. Finally, experimental results show that the proposed algorithm could achieve complete coverage for networks of different scale and increase the network lifetime. It possesses the good quality of effectiveness and stability.

A narrow bandwidth may lead to a large amount of redundant data, which further causes the interruptions of the communication network. In order to address this problem, an optimized clustering communication protocol based on intelligent computing (CCP-IC) is proposed in this paper. First, we adopt the intelligent algorithm to perform the optimization of the clustering in the sensor network. The adaptation function and the heuristic function are introduced to make a targeted choice on the cluster head for the next hop of the nodes in the network. Second, the controllable threshold parameter and variation coefficient are employed to optimize the shortest path chosen by the network routing. Therefore, the node energy consumption is lowered when the minimum network delay is guaranteed and the transmission efficiency is improved. Finally, it is verified via the simulation results and compared with other algorithms; the proposed protocol reduces the network energy consumption by 15.3% and prolongs the network lifetime by 18.72%, which proves the validity and effectiveness of the proposed protocol. INDEX TERMS Internet of Things, clustering communication protocol, intelligent computing, network lifetime.

When monitoring the environment with wireless sensor networks, the data sensed by the nodes within event backbone regions can adequately represent the events. As a result, identifying event backbone regions is a key issue for wireless sensor networks. With this aim, we propose a distributed and morphological operation-based data collection algorithm. Inspired by the use of morphological erosion and dilation on binary images, the proposed distributed and morphological operation-based data collection algorithm calculates the structuring neighbors of each node based on the structuring element, and it produces an event-monitoring map of structuring neighbors with less cost and then determines whether to erode or not. The remaining nodes that are not eroded become the event backbone nodes and send their sensing data. Moreover, according to the event backbone regions, the sink can approximately recover the complete event regions by the dilation operation. The algorithm analysis and experimental results show that the proposed algorithm can lead to lower overhead, decrease the amount of transmitted data, prolong the network lifetime, and rapidly recover event regions.

The problem of using lesser wireless sensor network nodes to achieve coverage and connection of certain areas under given coverage conditions is a priority and hotspot issue of WSN. For this reason, in this paper, an optimized strategy coverage control (OSCC) algorithm is proposed. First of all, a relation mapping model of sensor nodes and target nodes is established by OSCC which is based on geometric figure and related theories, probability theory, converge property, and so forth to complete effective reasoning and calculate certain network models. Secondly, OSCC makes efficient analysis of the calculating results figure out the least number of sensor nodes to cover specific monitoring area. Thirdly, OSCC picks out the optimal routing solution while conducting combinatorial optimization of routing path using ant colony optimization (ACO) algorithm, thus reducing the energy spending of whole network. In the end, this paper verifies OSCC algorithm by simulation experiment and proves it can use least sensor nodes to effectively cover target area. Also, OSCC helps greatly reduce network energy consuming, minimize network resources layout costs, and enhance network life cycle, simultaneously.

The node deployment in mobile sensor networks (MSNs) is mostly performed in a random method. However, a large number of redundant nodes may exist due to the randomness. As a result, severe data congestion may be caused and the quality of coverage (QoC) is undermined. In order to solve this QoC problem, we propose an Energy-efficient Nonlinear Coverage Control Protocol (ENCP). This protocol utilizes the normal distribution to calculate the minimal number of sensors which is required to guarantee coverage over the monitoring area. We also balance the node energy consumption and achieve the collaborative scheduling among all the sensor nodes. Meanwhile, when a certain QoC is guaranteed, we present the calculation model for the normal distribution of the sensing ranges and the proportional relationship between different parameters in the QoC function. Finally, simulation results show that the ENCP could not only improve the network QoC and network coverage rate but also effectively control the energy exhaustion at the nodes. Therefore, the network lifetime can be effectively prolonged.

No abstract