Sizes of Minimum Connected Dominating Sets of a Class of Wireless Sensor Networks
Jonathan C. Li, Chuan Heng Foh, Lachlan L. H. Andrew, Moshe Zukerman · 2008
We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowing other nodes to remain in sleep mode in order to conserve energy. We derive the expected value and the distribution of N for single dimensional dense networks.