Zeyu Sun

A Novel Energy-Efficient k-Coverage Algorithm Based on Probability Driven Mechanism of Wireless Sensor Networks

In the process of fulfilling k-coverage over target nodes, a large quantity of redundant data may be produced, which will cause network congestion, reduce communication efficiency, impair coverage quality, and exhaust network energy quickly. To solve this problem, the paper proposes an Energy-Efficient k-Coverage Algorithm (EEKCA), which attempts to construct a network coverage model by utilizing the relative positions of nodes. Through analyzing the model, the coverage expectations for nodes in the monitored area and the minimum number of nodes required for full coverage are computed. As for power consumption, the paper presents an energy shifting function between working nodes and neighboring nodes, by use of which the scheduling for low-energy node is completed, balancing the energy consumption over the entire network and optimizing network resources. Finally, simulation results suggest that the proposed algorithm not only can improve the coverage quality of network but also can prevent the rapid depletion of node energy, thus achieving the goal of extending network lifetime.

k-degree coverage algorithm based on optimization nodes deployment in wireless sensor networks

In the process of the wireless sensor network research, the issue on the energy consumption and coverage is an essential and critical one. According to the characteristic of the sensor nodes, it is homogeneous, and we proposed the k-degree coverage algorithm based on optimization nodes deployment. First, the algorithm gives the solving procedure of the maximum seamless coverage ratio, when the three-node joint coverage has been provided. Second, when the sensor nodes are covering the monitoring area, the algorithm gives the solving procedure of the expected coverage quality and the judgment methods of the coverage ratio, when the nodes are compared with the nearby ones. And when there is redundancy coverage in the given monitoring area, we have given the solving procedure of any sensor nodes that exist in the redundant nodes coverage. Finally, using the simulation experiment, the results of the coverage algorithm based on optimization nodes deployment are compared with other algorithms in terms of the coverage quality and the network lifetime, the performance indexes have enhanced to 13.36% and 12.92% on average. Thus, the effectiveness and viability of the coverage algorithm based on optimization nodes deployment have been proved.

Optimization coverage conserving protocol with authentication in wireless sensor networks

In the k-coverage process of target nodes, substantial data redundancy occurs, which leads to the phenomenon of congestion, reducing the network communication capability and coverage as well as accelerating network energy consumption. Therefore, this article proposes an Optimization Coverage Conserving Protocol with Authentication. This protocol provides a solution to obtain the largest coverage probability for multi-nodes. In the optimization and authenticated calculation, the protocol provides the calculation method and verification process of the expected value of multi-node coverage; when the moving target nodes are continuously covered, this protocol provides a process to solve for the focused target nodes; when there is redundancy coverage, this article provides a process to calculate the coverage probability when any sensor node is covered by a redundant node. Furthermore, through comparisons of the coverage quality and network lifetime with other algorithms, the performance indexes of this protocol have been substantially increased by the simulation experiment, which verified the effectiveness and viability of the protocol in this article.

A New Energy-Efficient Coverage Control with Multinodes Redundancy Verification in Wireless Sensor Networks

The target nodes are -covered by the sensor nodes; there will be a lot of redundant data forcing the phenomenon of congestion which lowers the network communication capability and coverage and accelerates network energy consumption. Therefore, this paper proposes an energy-efficient coverage control with multinodes redundancy verification (ECMRV). The algorithm constructs the coverage network model by using the positional relationship among the sensor nodes, and the proof procedure of the sector coverage expected value of the monitoring area also has been provided. On the aspect of the energy consumption, this paper gives the proportion of energy conversion functions between the working sensor nodes and the neighboring sensor nodes. And by using the function proportional to schedule the sensor nodes with low energy, we achieve the energy balance of the whole network and the optimization of the network resources. Finally, the simulation experiments indicate that this algorithm can not only improve the quality of network coverage, but completely inhibit the rapid energy consumption of the sensor nodes as well; as a result, the network lifetime extends, which has verified availability and stability of the algorithm in the paper.

A Novel Nonlinear Multitarget -Degree Coverage Preservation Protocol in Wireless Sensor Networks

Due to the existence of a large number of redundant data in the process of covering multiple targets, the effective coverage of monitored region decreases, causing the network to consume more energy. To solve this problem, this paper proposes a multitarget -degree coverage preservation protocol. Firstly, the affiliation between the sensor nodes and target nodes is established in the network model; meanwhile the method used to calculate the coverage expectation value of the monitored region is put forward; secondly, in the aspect of the network energy conversion, use scheduling mechanisms on the sensor nodes to balance the network energy and achieve different network coverage quality with energy conversion between different nodes. Finally, simulation results show that NMCP can improve the network lifetime by effectively reducing the number of active nodes to meet certain coverage requirements.

A Hierarchical Shared Key Algorithm in Wireless Sensor Networks

Wireless sensor networks WSNs are often deployed in hostile environments, thus being subjected to great security risks. However, due to the influence of environment and dynamic topology, the communication radiuses of all nodes are not strictly consistent, which may cause different neighbor numbers and redundant neighbors for each central node. In this paper, we present a key agreement scheme without the trusted third parties by exploiting the special characteristics of Hopfield neural network: the two nodes converge in a steady state from their initial states respectively after iterating finite times, while maintaining the confidentiality of the key by quantifying the key to strings. Compared to existing solutions, the proposed method requires less memory and has lower communication overheads to key agreement.

A Novel Energy Efficient Multi-target Coverage Control Protocol with Event Driven Mechanism of Wireless Sensor Network

The covering problem and node deployment is a fundamental problem in the research of wireless sensor network. The number of nodes and the coverage of a network can directly affect performance and operating costs. For this reason, we propose an EMAC algorithm (Energy Efficient Multi-target Associate Coverage Algorithm). The algorithm uses the correlation between the nodes and dynamic grouping to adjust coverage area. Within the coverage area, we use the greedy algorithm to optimize the coverage area. So, the target node is uniformly covered by other sensor nodes and the network resources is optimized. To ensure the energy balance in wireless sensor network and extend the lifetime of it, we only wake partial nodes to work in a cycle, so that, they can work in turn. Experiments show that the algorithm can effectively reduce energy consumption, with better adaptability and effectiveness.