ISBN: 978-981-11-0008-6 DOI: 10.18178/wcse.2016.06.017
Connected Dominated Set Based Node Centrality in Wireless Networks
Abstract— The number of people using wireless devices and internet has increased remarkably in the
previous decade, and so is the need to route/broadcast information to the entire network. One of the latest and
most promising approaches is finding a Connected Dominating Set (CDS) in network. Another popular
concept in the social network analysis is Node centrality, because of its ability to find popular/influential
nodes. In this paper, we have formulated a simple but efficient algorithm, which first finds a CDS in the
network, and then with the help of node centrality metrics it finds a central node, for more effective
routing/broadcasting. We have increased simplicity by making changes in the existing algorithms,
incorporated Node Centrality, and ensured its efficiency by a step-by-step complexity analysis and constant
changes and improvements.
Index Terms— broadcasting, CDS, central node, connected dominating set, degree centrality, eigenvector centrality, routing, and wireless networks.
T. Virajita Sharma, Usha Kiran Singh, Debasis Das
Department of Computer Science and Engineering, NIIT University, INDIA
Cite: T. Virajita Sharma, Usha Kiran Singh, Debasis Das, "Connected Dominated Set Based Node Centrality in Wireless Networks," Proceedings of 2016 6th International Workshop on Computer Science and Engineering, pp. 95-102, Tokyo, 17-19 June, 2016.