DocumentCode :
1612604
Title :
Sizes of Minimum Connected Dominating Sets of a Class of Wireless Sensor Networks
Author :
Li, Ji ; Foh, Chuan Heng ; Andrew, Lachlan L H ; Zukerman, Moshe
Author_Institution :
EEE Dept, Univ. of Melbourne, Melbourne, VIC
fYear :
2008
Firstpage :
332
Lastpage :
336
Abstract :
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.
Keywords :
set theory; telecommunication network routing; wireless sensor networks; energy conservation; minimum connected dominating set; wireless sensor network routing; Communications Society; Computer networks; Computer science; Energy measurement; Peer to peer computing; Relays; Routing protocols; Size measurement; Spine; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2008. ICC '08. IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-2075-9
Electronic_ISBN :
978-1-4244-2075-9
Type :
conf
DOI :
10.1109/ICC.2008.69
Filename :
4533105
Link To Document :
بازگشت