Muhammad Usman Ilyas

Learn More
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying top-k information hubs is crucial for many applications such as advertising in social networks where advertisers are interested in identifying hubs to whom free samples can be given. Existing solutions are centralized and require time stamped(More)
—In a multi-hop 802.15.4 Wireless Sensor Network the volume of traffic that is processed by intermediate nodes increases considerably as data approaches the PAN coordinator. This problem is referred to as the reachback problem. In this work we focus on a more fundamental implication of reachback on operational network lifetime of 802.15.4-based wireless(More)
—We present principal component centrality (PCC) as a measure of centrality that is more general and encompasses eigenvector centrality (EVC). We explain some of the difficulties in applying EVC to graphs and networks that contain more than just one neighborhood of nodes with high influence. We demonstrate the shortcomings of traditional EVC and contrast it(More)
—Identifying the most influential nodes in social networks is a key problem in social network analysis. However, without a strict definition of centrality the notion of what constitutes a central node in a network changes with application and the type of commodity flowing through a network. In this paper we identify social hubs, nodes at the center of(More)