A random geometric graph coverage model of wireless sensor networks

A new random geometric graph coverage model is presented in this article. Compared with other old simple models, this new model considers not only the sensitivity of node but also the reliability of links. It is more appropriate to real situations, affected by various factors. The model shows its applicability when all wireless sensor networks´ (WSN) nodes obtaining its own coordinate for coverage and surveillance purposes. We also analyze some key parameters of WSN as a new model of random geometric graph and propose a simple greedy localization algorithm. In the end, empirical results demonstrate the validity of proposed model and algorithm.