To maximize the lifetime of wireless sensor networks is of great significance. In this paper, we solve the problem of choosing sink location and maximizing lifetime in arbitrary irregular convex network. First of all, we compute the theoretical data load of each node using differential analysis in irregular convex network. We proves that when sink is located at the center, the network can work for the longest time and get the greatest first node death time (First Node Die Time, FNDT). A large number of simulation experiments turn out the correctness of analysis in this paper. Conclusions in th...
