Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks

• Published in: 2010 IEEE 30th International Conference on Distributed Computing Systems pp. 448 - 457
• Main Authors: Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu Zhu, Ding-Zhu Du
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2010
• Subjects: Computer science; Connected dominating set; Costs; Delay; Distributed computing; Energy consumption; general graph; Mathematics; NP-hard; obstacle; Routing protocols; shortest path; Spine; virtual backbones; Wireless networks; Wireless sensor networks

In this paper, we will study a special Connected Dominating Set (CDS) problem - between any two nodes in a network, there exists at least one shortest path, all of whose intermediate nodes should be included in a special CDS, named Minimum rOuting Cost CDS (MOC-CDS). Therefore, routing by MOC-CDS ca...