The Optimal Coverage and its Features of the Communication Nodes in Ad Hoc Network

Abstract

In Ad Hoc network, the randomness of the node’s location makes the network topology highly dynamic change, so it brings great challenges to design and realize the routing algorithm. In this paper, by using the geometry and optimization method to analyze the coverage formed by two and three intersected communication nodes in the Ad Hoc network, we get some important changing relationships about the factors of the node’s distance d and the communication radius r and the coverage area s, and briefly analyze the least number of the communication channels that the other nodes can obtain in the network, and specially discuss the situations of the optimal complete-coverage and its Features. Finally, according to the conclusions, we construct an optimal complete-coverage for a given communication area, and give its logical structure and corresponding formulas calculating the least number of communication nodes. For the researches, it has important significance to design the more efficient routing algorithm and analyze network survivability, and so on.