RESUMO
Wireless sensor networks (WSNs) are vulnerable to computer viruses. To protect WSNs from virus attack, the virus library associated with each sensor node must be updated in a timely way. This article is devoted to developing energy-efficient patching strategies for WSNs. First, we model the original problem as an optimal control problem in which (a) each control stands for a patching strategy, and (b) the objective functional to be optimized stands for the energy efficiency of a patching strategy. Second, we prove that the optimal control problem is solvable. Next, we derive the optimality system for solving the optimal control problem, accompanied with a few examples. Finally, we examine the effects of some factors on the optimal control. The obtained results help improve the security of WSNs.
RESUMO
The optimal link removal (OLR) problem aims at removing a given number of links of a network so that the spectral radius of the residue network obtained by removing the links from the network attains the minimum. Torus networks are a class of regular networks that have witnessed widespread applications. This paper addresses three subproblems of the OLR problem for torus networks, where two or three or four edges are removed. For either of the three subproblems, a link-removing scheme is described. Exhaustive searches show that, for small-sized tori, each of the proposed schemes produces an optimal solution to the corresponding subproblem. Monte-Carlo simulations demonstrate that, for medium-sized tori, each of the three schemes produces a solution to the corresponding subproblem, which is optimal when compared to a large set of randomly produced link-removing schemes. Consequently, it is speculated that each of the three schemes produces an optimal solution to the corresponding subproblem for all torus networks. The set of links produced by each of our schemes is evenly distributed over a network, which may be a common feature of an optimal solution to the OLR problem for regular networks.