Header menu link for other important links
Connected dominated set based node centrality in wireless networks
T. Virajita Sharma, U.K. Singh,
Published in International Workshop on Computer Science and Engineering (WCSE)
Pages: 95 - 102
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.
About the journal
Journal2016 6th International Workshop on Computer Science and Engineering, WCSE 2016
PublisherInternational Workshop on Computer Science and Engineering (WCSE)