Continue research on topological characteristics of random multihop wireless networks

Some topological characteristics of random multi-hop wireless networks were researched in [1] by Keqin Li. This paper improve the main two results in [1], which are the node degree and bisection width researched in Section 2 and 5 of [1] respectively. By consider the different situations at the corner of squares, the paper generalize the two results into a akm×bkm (a, b ¿ 2r) Euclidean square R, and analyze that why there are often very busy in the middle of multihop wireless networks by researching horizontal cutsets and vertical cutsets of it. Also, a lower bound of the average load in the middle of multihop wireless networks is provided in this paper.