Search

Load balancing is of great significance to extend the longevity of wireless sensor networks, due to the inherent imbalanced energy overhead in such networks. However, existing solutions cannot balance the load distribution in partially disconnected wireless sensor networks. For example, if a network is partitioned into several segments with different area sizes, some areas have much more traffic load than other areas. In this article, we propose a load-balanced routing scheme, which aims to balance energy consumption within each segment and among different segments. First, we adopt unequal transmission distances to build initial routing for intrasegment load balancing. Second, we adopt the genetic algorithm to build extra routing between different segments for intersegment load balancing. The unique character of our work is twofold. On one hand, we investigate partitioned wireless sensor networks where there are several isolated segments. On the other hand, we pursue load balancing from a global perspective rather than from a local one. Some simulations verify the effectiveness and the advantages of our scheme in terms of extra deployment cost, system longevity, and load balancing degree. [ABSTRACT FROM AUTHOR]

In order to better improve the reliability of data transmission and extend the network lifetime, the paper proposes the Sensing Clustering Routing Algorithm Based on Collaborative Computing (SCR-CC). The proposed algorithm uses the characteristics of the perceptual radius, which obey the normal distribution, and gives the process of completing the expected value of the data transmission of any two nodes in the cluster. Secondly, the paper analysed the necessary conditions of the existence for the expected value of the number of neighbour nodes when the redundant nodes are closed and the working nodes meet arbitrary differences. Thirdly, the cluster angle formed by the base station and the cluster is used to optimize the clustering structure and complete the dynamic clustering process to achieve the energy balance of the entire network. Finally, the simulation experiments show that the proposed SCR-CC algorithm compared with the other three algorithms reduces the number of failed nodes by 11.37% on average and increases the network lifetime by 27.09% on average; therefore, the efficiency and effectiveness of the SCR-CC algorithm are verified. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

In the Fog Computer (FC), the process of data is prone to problems such as low data similarity and poor data tolerance. This paper proposes a hierarchical data job scheduling strategy Based on Intelligent Sensor-Cloud in Fog Computer (HDJS). HDJS dynamically adjusts the priority of the job to avoid job starvation and maximize the use of resources, uses the key frame to the resource occupied information, distributes the frame sequence to the unit, and then combines the intra frame distribution strategy to balance the load between the nodes. The experimental results show our proposed strategy may be possible to avoid the operation of hunger and resource fragmentation problems, make full use of the advantages of multi-core and multi-thread, improve system resource utilization, and shorten the execution time and response time. [ABSTRACT FROM AUTHOR]