The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper we consider the problem of maximizing information propagation in social networks. To solve it, we introduce a probabilistic maximum coverage problem, and further purpose a cluster-based heuristic and a neighborhood-removal heuristic for two basic diffusion models, namely, the Linear Threshold Model and the Independent Cascade Model, respectively. Our proposed strategies are compared...
Network coding may improve network efficiency. However, it is not necessary to code every link to meet a given transmission rate. In this paper, we consider the NP-hard problem of minimizing the number of coding links of a network for a given target transmission rate. Chemical Reaction Optimization (CRO) is a general purpose metaheuristic, which have been demonstrated to be effective in many optimization...
Online social search (OSS) brings forth a new way to harness the Internet for answers. In this paper, we study the non-cooperation problem in OSS. We propose an analytical model that captures the behavior of OSS nodes, and, from a gaming-strategy point of view, analyze various strategies an individual node can utilize to allocate its awareness capacity. Based on this we derive the Pareto inefficiency...
In this paper, we study the problem of discovering multiple resource holders and how to evaluate a node's satisfaction in query incentive networks. Utilizing an acyclic tree, we show that query propagation has a nature of exponential start, polynomial growth, and eventually becoming a constant. We model the query propagation as an extensive game, obtain nodes' greedy behaviors from Nash equilibrium...
Online social search (OSS) brings forth a new way to harness the Internet for answers. In this paper, we study the balancing between OSS users' capabilities and responsibilities. Targeting a practical system design, we propose an analytical model that captures the heterogeneity of different referral sessions in OSS, and a distributed socio-aware referral strategy that can achieve the desired balance...
Online social search brings forth a new way to harness the Internet for answers. However, the personal and often sensitive information is unwittingly exposed to others when a person looks for an expert via the underlying social network. In this paper, we propose a model in which a node's behavior of looking for an expert is adjusted by his awareness of the potential expertise of his contacts. We derive...
Peer-to-peer (P2P) live streaming applications are very popular in recent years and a Markov open queueing network model was developed to study the population dynamics in P2P live streaming. Based on the model, we deduce an optimization problem, called population transition problem, with the objective of maximizing the probability of universal streaming by manipulating population transition probability...
Grid computing collects geographically dispersed resources ranging from laptops to supercomputers to compute tasks requested by clients. Grid scheduling, i.e., assigning tasks to resources, is an NP-hard problem, and thus, metaheuristic methods are employed to find the optimal solutions. In this paper, we propose a Chemical Reaction Optimization (CRO) algorithm for the grid scheduling problem. CRO...
The capacity of wireless networks is greatly affected by the available information on network states, such as network topology, channel state, and traffic information. Previous research has estimated the capacity of wireless networks by assuming that each node in the network can obtain precise network information. However, in reality, precise network information may not be readily available, and it...
Transmission scheduling is a key design problem in wireless multi-hop networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time division multiple access (TDMA) frame length. Most of the scheduling algorithms are topology-dependent. They are generally graph-based and depend on the exact network topology information. Thus, they cannot adapt...
Online social networking systems provide indirect access to a large number of people connected by multi-step chains of acquaintances, and plays an important role in the referrals for human information flow. In this paper, from a networking point of view, we study the problem of locating experts for relevant information via online social networks. We model the action of forwarding a question with random...
Information theory has made great impact on research and development of communication systems. However, research in networking, a system built on communication components, has not benefited much from information theory and a theoretical framework to guide the analysis and design of networks is still lacking. Therefore, in this paper, we propose an information-theoretical framework to explore the quantitative...
In opportunistic networks, centrality characterizes a node's capability to act as a communication hub. In this paper, we provide an in-depth study of choosing effective centrality metrics for message forwarding in bandwidth-limited opportunistic networks. Based on this study, we propose a destination-unaware forwarding algorithm that accounts for the popularity of a node and the contact durations...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.