Towards privacy-driven design of a dynamic carpooling system

Dynamic carpooling (also known as instant or ad-hoc ridesharing) is a service that arranges one-time shared rides on very short notice. This type of carpooling generally makes use of three recent technological advances: (i) navigation devices to determine a driver’s route and arrange the shared ride; (ii) smartphones for a traveller to request a ride from wherever she happens to be; and (iii) social networks to establish trust between drivers and passengers. However, the mobiquitous environment in which dynamic carpooling is expected to operate raises several privacy issues. Among all the personal identifiable information, learning the location of an individual is one of the greatest threats against her privacy. For instance, the spatio-temporal data of an individual can be used to infer the location of her home and workplace, to trace her movements and habits, to learn information about her centre of interests or even to detect a change from her usual behaviour. Therefore, preserving location privacy is a major issue to be able to leverage the possibilities offered by dynamic carpooling. In this paper we use the principles of privacy-by-design to integrate the privacy aspect in the design of dynamic carpooling, henceforth increasing its public (and political) acceptability and trust.     

Context-aware trust network extraction in large-scale trust-oriented social networks

In recent years, social networking sites have been used as a means for a rich variety of activities, such as movie recommendations and product recommendations. In order to evaluate the trust between a truster (i.e., the source) and a trustee (i.e., the target) who have no direct interaction in Online Social Networks (OSNs), the trust network between them that contains important intermediate participants, the trust relations between the participants, and the social context, has an important influence on trust evaluation. Thus, to deliver a reasonable trust evaluation result, before performing any trust evaluation (i.e., trust transitivity), the contextual trust network from a given source to a given target needs to be first extracted from the social network, where constraints on social context should also be considered to guarantee the quality of the extracted networks. However, this problem has been proved to be NP-Complete. Towards solving this challenging problem, we first present a contextual trust-oriented social network structure which takes social contextual impact factors, including trust, social intimacy degree, community impact factor, preference similarity and residential location distance into account. These factors have significant influences on both social interactions between participants and trust evaluation. Then, we present a new concept QoTN (Quality of Trust Network) and propose a social context-aware trust network extraction model. Finally, we propose a Heuristic Social Context-Aware trust Network extraction algorithm (H-SCAN-K) by extending the K-Best-First Search (KBFS) method with several proposed optimization strategies. The experiments conducted on two real datasets illustrate that our proposed model and algorithm outperform the existing methods in both algorithm efficiency and the quality of the extracted trust networks.     

基于势博弈的多路径网络编码研究

介绍反向共乘的网络编码形式,基于博弈理论提出用于多路径网络编码通信分割的势博弈模型。分析一种8个节点的网络拓扑,以网络传输总成本作为优化目标设计势函数,使用博弈中的BNN动态作为激励结构调整流在不同路径上的通信分割,使网络系统收敛于Wardrop均衡,即最低成本状态。仿真结果表明,该模型使用BNN动态能够有效调整流的通信分割,从而最小化网络传输总成本。     

基于隔离问题节点的可信传感器网络体系结构

从分析问题节点引起的路由感染问题出发，探讨了使用基站来鉴别、搜索和隔离问题节点的新思路，介绍了一种隔离问题节点的传感器网络可信体系结构，提出了服务于该体系结构的可信路由协议，该协议通过规避问题节点来选择不包括问题节点的安全路径。仿真实验显示，该方案能有效地提高传感器网络有效发包率并延长网络生命期，减少路由感染影响。该方案适用于以数据为中心的资源受限的传感器网络。     

基于信任的低地球轨道卫星网络路由安全机制

将基于信任的路由安全机制引入卫星网络路由,提出一种信任评估模型,用信任度约束选路过程,以路由负载均衡为优化目标,对现有路由协议进行安全性改进,在此基础上,设计适用于卫星网络的按需安全路由协议。分析结果表明,该协议能够防范多种常见的内部攻击。     

基于信任传递机制的三支推荐

为了解决社交网络直接信任关系稀疏性问题,并降低协同过滤算法的推荐成本,文中提出基于信任传递机制的三支推荐算法.首先构建信任传递机制,获取用户的间接信任关系,扩展用户的社交网络,并使用二部图网络结构计算用户间双向影响因子.然后,将双向影响因子作为约束项,设计目标函数进行矩阵分解.最后引入三支决策思想,考虑推荐过程中的误分类代价与推广代价,构建基于目标函数的三支推荐算法.在Filmtrust、Epinions数据集上的实验表明,文中算法性能较优.     

FlowTrust: trust inference with network flows

Web-based social networking is increasingly gaining popularity due to the rapid development of computer networking technologies. However, social networking applications still cannot obtain a wider acceptance by many users due to some unresolved issues, such as trust, security, and privacy. In social networks, trust is mainly studied whether a remote user behaves as expected by an interested user via other users, who are respectively named trustee, trustor, and recommenders. A trust graph consists of a trustor, a trustee, some recommenders, and the trust relationships between them. In this paper, we propose a novel FlowTrust approach to model a trust graph with network flows, and evaluate the maximum amount of trust that can flow through a trust graph using network flow theory. FlowTrust supports multi-dimensional trust. We use trust value and confidence level as two trust factors.We deduce four trust metrics from these two trust factors, which are maximum flow of trust value, maximum flow of confidence level, minimum cost of uncertainty with maximum flow of trust, and minimum cost of mistrust with maximum flow of confidence. We also propose three FlowTrust algorithms to normalize these four trust metrics. We compare our proposed FlowTrust approach with the existing RelTrust and CircuitTrust approaches. We show that all three approaches are comparable in terms of the inferred trust values. Therefore, FlowTrust is the best of the three since it also supports multi-dimensional trust.     

一种基于半环理论的可信性评估模型

在网络安全领域,可信指的是参加各种协议的各个实体之间关系的集合,这些关系是建立在实体在某个协议之上进行相互操作的行为之上的,为了加强网络的安全性,评估结点的可信性是非常重要的。讨论了对可信事件的评估：首先介绍了可信的相关概念和相关的特性;接着评估过程被建模成一个在有向图寻找最短路径的问题,在该有向图中结点表示实体或者用户,边表示可信关系,通过使用半环理论,建立了一个基于半环的可信性评估模型TD-SEMIRING,在两个以前没有进行相互操作的实体之间建立间接的可信关系,介绍了这个模型在路由选择当中的应用;最后,通过仿真实验,验证、分析了该模型的有效性。     

Time-optimal and privacy preserving route planning for carpool policy

To alleviate the traffic congestion caused by the sharp increase in the number of private cars and save commuting costs, taxi carpooling service has become the choice of many people. Current research on taxi carpooling services has focused on shortening the detour distances. While with the development of intelligent cities, efficiently match passengers and vehicles and planning routes become urgent. And the privacy between passengers in the taxi carpooling service also needs to be considered. In this paper, we propose a time-optimal and privacy-preserving carpool route planning system via deep reinforcement learning. This system uses the traffic information around the carpooling vehicle to optimize passengers’ travel time, not only to efficiently match passengers and vehicles but also to generate detailed route planning for carpooling vehicles. We conducted experiments on an Internet of Vehicles simulator CARLA, and the results demonstrate that our method is better than other advanced methods and has better performance in complex environments.

     

基于节点依赖度和交互频繁度的无线Mesh网络信任模型

无线Mesh网络(WMN)的开放性、动态性等优点使它得到了广泛应用,同时也产生了一些安全问题,传统的信任模型无法满足WMN的安全需求.基于社会网络的信任原理,提出了一种新的WMN信任模型TFTrust.该模型定义了与信任相关的多维因子计算方法,包括节点贡献度、节点依赖度以及交互频繁度,构建了节点间直接信任值的计算方法.仿真结果表明:TFTrust模型在网络的安全性、服务质量及降低网络通信代价等方面均优于无线自组网按需平面距离向量路由(AODV)协议及Beth模型.     

Behavior‐Based Propagation of Trust in Social Networks with Restricted and Anonymous Participation

Increasing interactions and engagements in social networks through monetary and material incentives is not always feasible. Some social networks, specifically those that are built on the basis of fairness, cannot incentivize members using tangible things and thus require an intangible way to do so. In such networks, a personalized recommender could provide an incentive for members to interact with other members in the community. Behavior‐based trust models that generally compute social trust values using the interactions of a member with other members in the community have proven to be good for this. These models, however, largely ignore the interactions of those members with whom a member has interacted, referred to as “friendship effects.” Results from social studies and behavioral science show that friends have a significant influence on the behavior of the members in the community. Following the famous Spanish proverb on friendship “Tell Me Your Friends and I Will Tell You Who You Are,” we extend our behavior‐based trust model by incorporating the “friendship effect” with the aim of improving the accuracy of the recommender system. In this article, we describe a trust propagation model based on associations that combines the behavior of both individual members and their friends. The propagation of trust in our model depends on three key factors: the density of interactions, the degree of separation, and the decay of friendship effect. We evaluate our model using a real data set and make observations on what happens in a social network with and without trust propagation to understand the expected impact of trust propagation on the ranking of the members in the recommended list. We present the model and the results of its evaluation. This work is in the context of moderated networks for which participation is by invitation only and in which members are anonymous and do not know each other outside the community. Copyright © 2014 John Wiley & Sons, Ltd.     

区域低碳物流运输网络双层优化研究

区域低碳物流网络优化是建立低碳物流系统的重要环节。引入低碳理念,考虑政府低碳线路规划与货主之间的博弈,上层区域物流网络的优化以碳排放、成本、时间最少化,下层货流运用改进的Logit路径选择分配,建立了基于低碳理念的区域物流运输网络双层优化模型。根据模型求解的复杂性,运用网络变形和遗传算法给出求解优化模型的方法和步骤。算例仿真计算结果表明,该模型与算法在区域物流运输网络低碳优化组合中是准确且可行的,有益于低碳物流网络构建。     

无线移动Ad Hoc网络高效路由技术研究

无线移动自组织AdHoc网络是目前国际上前沿和热点的研究领域。综述了AdHoc网络的基本概念、原理、特点、研究现状和相关研究问题，提出了能耗平衡、瞬态链路／路由、路由算法集成等概念和思想，给出了优化路由选择的数学模型，在此基础上提出了我们自己的基于代价优化、能耗平衡、综合考虑链路状况的优化的路由算法，谊算法可以显著提高网络的性能及增加结点和网络的寿命。     

面向级联失效的加权网络负载容量非线性模型鲁棒性优化

在考虑网络负载容量关系的情况下,研究加权网络中的级联失效现象。提出了负载容量非线性模型,并针对模型参数的多目标优化问题,通过理论分析确定其影响因素。以级联失效前后网络连通性测度的比值作为鲁棒性测度,以网络容量与负载的比值平均数作为网络成本测度,采用基于拥挤距离排序的多目标粒子群优化算法(MOPSO-CD)对参数进行优化。最后通过在模拟网络和实际网络中进行的仿真比较,验证了优化后的负载容量非线性模型可以在有限的网络成本下更好地提高网络对级联失效的抵御能力。     

基于社会网络与信誉的C2C信任评价模型

将概率论和社会网络理论应用到信任传递以及多信任路径建模中,针对C2C交易平台实际的商业网络特征,提出基于社会网络与信誉的C2C信任评价模型。引入相似度计算建立簇与簇之间的关联,以解决C2C交易网络存在的买卖分工明确、稀疏性、聚簇问题。对淘宝网C2C交易平台数据的分析表明,该模型对淘宝网现有信誉机制具有较好的改进和补充作用,更符合现实生活中人与人之间的信任和推荐关系。     

Saving face on Facebook: privacy concerns,social benefits,and impression management

The nearly ubiquitous use of online social networks generally entails substantial personal disclosure and elicits significant privacy concerns. This research uses Social Exchange Theory and the impression management (IM) literature to examine how privacy concerns can be counterbalanced by the perceived social benefits afforded by a social network’s ability to support IM. We frame social network use as an attempt to engage in IM, and we highlight the importance of a social network’s IM affordances in predicting social benefits from, and disclosure through, a social network. We test our model with a sample of 244 Facebook users, finding support for the proposed relationships and yielding the following contributions. First, this research provides a novel positioning of perceived IM affordances as a primary driver of both perceived social benefits and IM disclosure propensity. Second, this research illuminates that trust in both the social network provider and social network peers influences privacy concerns, social benefits, and perceived IM affordances. Our theory has important implications for researchers and practitioners interested in privacy issues within social networks.     

基于双层复杂网络的城市交通网络协同优化方法

针对城市交通网络中旅客在公共交通出行路径选择时面临的地铁与公交双层网络在换乘衔接协同中存在的部分换乘站点之间距离过远、衔接导向不明确、局部换乘供需不平衡等问题，提出基于双层复杂网络的城市交通网络协同优化方法。首先，采用逻辑网络拓扑方法对城市交通网络进行拓扑，并基于复杂网络理论建立地铁-公交双层网络模型。然后，以换乘车站为研究对象，提出一种基于K-shell分解法和中心性权重分配的节点重要度评价方法，对大规模网络中的地铁、公交车站进行粗粒度和细粒度划分和识别，并在此基础上提出一种相互激励的双层城市交通网络协同优化方法，即在双层网络结构优化中引入复杂网络理论中对于网络拓扑中节点重要度的识别和筛选方法，通过对路径选择中高集聚效应的识别和有利节点的定位更新双层网络结构以优化现有网络的车站布局和衔接关系。最后，将提出的方法应用于成都市地铁-公交网络，优化了现有网络结构，得到了现有网络的最佳优化节点位置和优化数量，并且通过相关指标系统验证了该方法的有效性。实验结果表明，采用该方法优化32次后的网络全局效率达到最优，和平均最短路径的优化效果分别为15.89%、16.97%，旅客换乘行为提升57.44个百分点；优化方法对旅行成本在8000~12000 m的可达性影响最明显，优化效果平均达到23.44%；同时引入双层网络速度比和单位交通成本比，突出了不同运营状况下交通网络对协同优化过程的反应和敏感度的不同。     

Strategies for predicting local trust based on trust propagation in social networks

Trust plays a critical role in determining social interactions in both online and offline networks, and reduces information overload, uncertainties and risk from unreliable users. In a social network, even if two users are not directly connected, one user can still trust the other user if there exists at least one path between the two users through friendship networks. This is the result of trust propagation based on the transitivity property of trust, which is “A trusts B and B trusts C, so A will trust C”. It is important to provide a trust inference model to find reliable trust paths from a source user to an unknown target user, and to systematically combine multiple trust paths leading to a target user. We propose strategies for estimating level of trust based on Reinforcement Learning, which is particularly well suited to predict a long-term goal (i.e. indirect trust value on long-distance user) with short-term reward (i.e. direct trust value between directly connected users). In other words, we compare and evaluate how the length of available trust paths and aggregation methods affects prediction accuracy and then propose the best strategy to maximize the prediction accuracy.     

电子商务下的信任网络构造与优化

电子商务环境中交易实体间的信任关系类似于传统商务环境中复杂的社会关系.实体间的信任度量涉及到交易额、交易发生时间、消费实体个人收入及其对信任的风险态度等因素,难以准确地给出量化计算.为探明这种信任关系的本质特点,结合现实生活中社会关系网络的一些认知理论和方法,详细分析和定义了实体及实体关系的相关属性,提出了一种信任网络描述的形式化模型.研究了信任网络的构造方法,建立了一套信任网络优化算法,有效地降低了信任网络的复杂性.最后,给出了一套信任网络可视化自动生成工具,通过实例应用分析表明,信任网络形式化描述模型和优化算法可以很好地揭示电子商务环境中复杂的信任关系,降低了信任度量算法的复杂度,可为信任的传播机制和信任计算模型的研究提供理论基础.     

多链路因特网接入网络出口路径选择研究

针对当前企事业单位广泛使用多链路因特网接入问题,选取链路成本和影响网络性能的路由跳数作为多链路因特网接入网络的研究对象,建立多链路出口路径选择优化模型,在链路成本满足不大于zC_min的约束条件下,将多链路出口路径选择转化为路由跳数优化问题,并提出一个自适应多链路出口路径选择算法,模拟结果表明,提出的算法能达到提高网络性能,降低网络链路成本的目的。