Wireless Sensor Networks by Unknown

Author:Unknown
Language: eng
Format: epub
ISBN: 9789811517853
Publisher: Springer Singapore

Proof:

Obviously, because the moving distance of the node is related to the repair chain, the repair chain is related to the ant’s search path, that is, the ant’s transition probability in the ant colony algorithm. We start from improving the transfer probability of ants. As shown in Eq. (5), when the spatial weights of the next hop nodes are different, and the other conditions are the same, the ants choose the probability that the next hop node tends to be straight. There are , the node is selected by Eq. (6). For the same reason, the algorithm constructed by this paper tends to be more straight and gentle barrier coverage. The patch chain can be reached to the shortest.

From Theorem 1, we can know that the movement of the mobile node when the mobile node reaches the target position is also the smallest. In the process of repairing the barrier gap, since the energy consumption of the redundant node mobile node is positively correlated with the distance moved by the node, the energy consumption of the node movement increases as the distance increases. The certificate is completed.

Compared with other barrier clearance algorithms, the main contributions of the proposed algorithm are as follows:(1)According to the improved ACO algorithm, a repair path of the barrier gap is created, and a repair chain of the barrier gap is constructed.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.