Engineering a distributed infrastructure for large-scale cost-effective content dissemination over urban vehicular networks

This paper proposes a practical and cost-effective approach to construct a fully distributed roadside communication infrastructure to facilitate the localized content dissemination to vehicles in the urban area. The proposed infrastructure is composed of distributed lightweight low-cost devices called roadside buffers (RSBs), where each RSB has the limited buffer storage and is able to transmit wirelessly the cached contents to fast-moving vehicles. To enable the distributed RSBs working toward the global optimal performance (e.g., minimal average file download delays), we propose a fully distributed algorithm to determine optimally the content replication strategy at RSBs. Specifically, we first develop a generic analytical model to evaluate the download delay of files, given the probability density of file distribution at RSBs. Then, we formulate the RSB content replication process as an optimization problem and devise a fully distributed content replication scheme accordingly to enable vehicles to recommend intelligently the desirable content files to RSBs. The proposed infrastructure is designed to optimize the global network utility, which accounts for the integrated download experience of users and the download demands of files. Using extensive simulations, we validate the effectiveness of the proposed infrastructure and show that the proposed distributed protocol can approach to the optimal performance and can significantly outperform the traditional heuristics.

The effects of the social structure of digital networks on viral marketing performance

Viral marketing is a form of peer-to-peer communication in which individuals are encouraged to pass on promotional messages within their social networks. Conventional wisdom holds that the viral marketing process is both random and unmanageable. In this paper, we deconstruct the process and investigate the formation of the activated digital network as distinct from the underlying social network. We then consider the impact of the social structure of digital networks (random, scale free, and small world) and of the transmission behavior of individuals on campaign performance. Specifically, we identify alternative social network models to understand the mediating effects of the social structures of these models on viral marketing campaigns. Next, we analyse an actual viral marketing campaign and use the empirical data to develop and validate a computer simulation model for viral marketing. Finally, we conduct a number of simulation experiments to predict the spread of a viral message within different types of social network structures under different assumptions and scenarios. Our findings confirm that the social structure of digital networks play a critical role in the spread of a viral message. Managers seeking to optimize campaign performance should give consideration to these findings before designing and implementing viral marketing campaigns. We also demonstrate how a simulation model is used to quantify the impact of campaign management inputs and how these learnings can support managerial decision making.

Solving the median shortest path problem in the planning and design of urban transportation networks using a vector labeling algorithm

This paper proposes an alternative algorithm to solve the median shortest path problem (MSPP) in the planning and design of urban transportation networks. The proposed vector labeling algorithm is based on the labeling of each node in terms of a multiple and conflicting vector of objectives which deletes cyclic, infeasible and extreme-dominated paths in the criteria space imposing cyclic break (CB), path cost constraint (PCC) and access cost parameter (ACP) respectively. The output of the algorithm is a set of Pareto optimal paths (POP) with an objective vector from predetermined origin to destination nodes. Thus, this paper formulates an algorithm to identify a non-inferior solution set of POP based on a non-dominated set of objective vectors that leaves the ultimate decision to decision-makers. A numerical experiment is conducted using an artificial transportation network in order to validate and compare results. Sensitivity analysis has shown that the proposed algorithm is more efficient and advantageous over existing solutions in terms of computing execution time and memory space used.

An algorithm to median shortest path problem (MSPP) in the design of urban transportation networks

This paper proposes an efficient solution algorithm for realistic multi-objective median shortest path problems in the design of urban transportation networks. The proposed problem formulation and solution algorithm to median shortest path problem is based on three realistic objectives via route cost or investment cost, overall travel time of the entire network and total toll revenue. The proposed solution approach to the problem is based on the heuristic labeling and exhaustive search technique in criteria space and solution space of the algorithm respectively. The first labels each node in terms of route cost and deletes cyclic and infeasible paths in criteria space imposing cyclic break and route cost constraint respectively. The latter deletes dominated paths in terms of objectives vector in solution space in order to identify a set of Pareto optimal paths. The approach, thus, proposes a non-inferior solution set of Pareto optimal paths based on non-dominated objective vector and leaves the ultimate decision to decision-makers for purpose specific final decision during applications. A numerical experiment is conducted to test the proposed algorithm using artificial transportation network. Sensitivity analyses have shown that the proposed algorithm is advantageous and efficient over existing algorithms to find a set of Pareto optimal paths to median shortest paths problems.

Complex network theoretical analysis on information dissemination over vehicular networks

How to enhance the communication efficiency and quality on vehicular networks is one critical important issue. While with the larger and larger scale of vehicular networks in dense cities, the real-world datasets show that the vehicular networks essentially belong to the complex network model. Meanwhile, the extensive research on complex networks has shown that the complex network theory can both provide an accurate network illustration model and further make great contributions to the network design, optimization and management. In this paper, we start with analyzing characteristics of a taxi GPS dataset and then establishing the vehicular-to-infrastructure, vehicle-to-vehicle and the hybrid communication model, respectively. Moreover, we propose a clustering algorithm for station selection, a traffic allocation optimization model and an information source selection model based on the communication performances and complex network theory.

Identifying social influence in complex networks: a novel conductance eigenvector centrality model

Identifying influential peers is an important issue for business to promote commercial strategies in social networks. This paper proposes a conductance eigenvector centrality (CEC) model to measure peer influence in the complex social network. The CEC model considers the social network as a conductance network and constructs methods to calculate the conductance matrix of the network. By a novel random walk mechanism, the CEC model obtains stable CEC values which measure the peer influence in the network. The experiments show that the CEC model can achieve robust performance in identifying peer influence. It outperforms the benchmark algorithms and obtains excellent outcomes when the network has high clustering coefficient.

Building genetic networks using relatedness information : a novel approach for the estimation of dispersal and characterization of group structure in social animals

Natal dispersal is an important life history trait driving variation in individual fitness, and therefore, a proper understanding of the factors underlying dispersal behaviour is critical to many fields including population dynamics, behavioural ecology and conservation biology. However, individual dispersal patterns remain difficult to quantify despite many years of research using direct and indirect methods. Here, we quantify dispersal in a single intensively studied population of the cooperatively breeding chestnut-crowned babbler (Pomatostomus ruficeps) using genetic networks created from the combination of pairwise relatedness data and social networking methods and compare this to dispersal estimates from re-sighting data. This novel approach not only identifies movements between social groups within our study sites but also provides an estimation of immigration rates of individuals originating outside the study site. Both genetic and re-sighting data indicated that dispersal was strongly female biased, but the magnitude of dispersal estimates was much greater using genetic data. This suggests that many previous studies relying on mark–recapture data may have significantly underestimated dispersal. An analysis of spatial genetic structure within the sampled population also supports the idea that females are more dispersive, with females having no structure beyond the bounds of their own social group, while male genetic structure expands for 750 m from their social group. Although the genetic network approach we have used is an excellent tool for visualizing the social and genetic microstructure of social animals and identifying dispersers, our results also indicate the importance of applying them in parallel with behavioural and life history data.