EVBlocks: A Blockchain-Based Secure Energy Trading Scheme for Electric Vehicles underlying 5G-V2X Ecosystems

Wireless Personal Communications - In this paper, the authors propose a secure and trusted energy trading (ET) scheme for electric vehicles (EVs) for vehicle-to-anything (V2X) ecosystems. The...     

V2X多节点协同分布式卸载策略

为了应对车联网中计算资源密集、可分离型任务的卸载环境动态变化和不同协同节点通信、计算资源存在差异的问题,提出了一种在V2X下多协同节点串行卸载、并行计算的分布式卸载策略。该策略利用车辆可预测的行驶轨迹,对任务进行不等拆分,分布式计算于本地、MEC及协同车辆,建立系统时延最小化的优化问题。为求解该优化问题,设计了博弈论的卸载机制,以实现协同节点串行卸载的执行顺序;鉴于车联网的动态时变特性,利用序列二次规划算法,给出了最优的任务不等拆分。仿真结果表明,所提策略能够有效减少计算任务系统时延,且当多协同节点分布式卸载服务时,所提策略在不同的参数条件下仍然能够保持稳定的系统性能。     

V2X多节点协同分布式卸载策略

为了应对车联网中计算资源密集、可分离型任务的卸载环境动态变化和不同协同节点通信、计算资源存在差异的问题,提出了一种在V2X下多协同节点串行卸载、并行计算的分布式卸载策略。该策略利用车辆可预测的行驶轨迹,对任务进行不等拆分,分布式计算于本地、MEC及协同车辆,建立系统时延最小化的优化问题。为求解该优化问题,设计了博弈论的卸载机制,以实现协同节点串行卸载的执行顺序;鉴于车联网的动态时变特性,利用序列二次规划算法,给出了最优的任务不等拆分。仿真结果表明,所提策略能够有效减少计算任务系统时延,且当多协同节点分布式卸载服务时,所提策略在不同的参数条件下仍然能够保持稳定的系统性能。     

Solving WDP in combinatorial double auction based on trading strategy

A solution for winner determination problem (WDP) in combinatorial double auction (CDA) was presented. Different from determining winner by solving optimization model which was non-deterministic polynomial (NP)-hard when the number of participants or resource types amounted to a large scale, the solution put the WDP goal–social welfare maximization into design of the trading strategy and determined winners by the process of resource allocation and pricing. In its corresponding allocation and pricing algorithm, sellers were allowed partially trading their bundles; the transaction path was approximated to Marshallian path; the utility for each winner was non-negative. Simulations show, compared to the WDP optimization model, the proposed algorithm can generate larger social welfare and it is particularly time efficient in conducting large-scale CDA.     

Pricing and power control in a multicell wireless data network

We consider distributed power control in a multicell wireless data system and study the effect of pricing transmit power. Drawing on the earlier work of Goodman and Mandayam (see IEEE Personal Commun. Mag., vol.7, p.48-54, 2000), we formulate the QoS of a data user via a utility function measured in bits per Joule. We consider distributed power control, modeled as a noncooperative game, where users maximize their utilities in a multicell system. Base station assignment based on received signal strength as well as received signal-to-interference ratio (SIR) are considered jointly with power control. Our results indicate that for both assignment schemes, such a procedure results in an inefficient operating point (Nash equilibrium) for the entire system. We introduce pricing of transmit power as a mechanism for influencing data user behavior and our results show that the distributed power control based on maximizing the net utility (utility minus the price) results in improving the Pareto efficiency of the resulting operating point. Variations of pricing based on global and local loading in cells are considered as a means of improving the efficiency of wireless data networks. Finally, we discuss the improvement in utilities through a centralized scheme where each base station (BS) calculates the best SIR to be targeted by the terminals it is assigned     

基于计算控制通信融合的车联网资源协同优化技术研究

车联网高度动态且业务种类多样,安全业务和非安全业务并存。如何同时满足差异化的业务需求,是车联网面临的重大挑战。分析了计算、控制与通信等要素在车联网中的融合方式,并指出以协同管理多维资源提升驾驶安全性和业务体验质量的必要性。针对业务特点分别介绍了面向自动驾驶的控制与通信融合机制、面向信息娱乐业务的计算与通信资源协同管理机制以及面向差异化业务并发的多维资源协同管理机制,最后基于相关挑战展望了该领域未来的技术发展趋势。     

SCMA mMTC系统中基于联盟区块链的无线电资源交易的信用支付

无线电资源交易发生在MTC网关（MTC Gateway MTCG）和LTE用户之间.根据基于联盟区块链的空闲无线电资源交易来建立MTCG之间的信用度.在多个授权的本地基站（Base Station BS）上建立了一个联盟区块链,用于公开审计和共享交易记录.资源交易记录在加密后上传到BS.在交易记录通过审查和共识过程之后,新区块被存储在BS上,并且可以由MTCG,LTE用户和连接到联盟区块链的BS进行公开访问.为了最大化系统的利益,支持频繁的资源交易,提出了一种基于信用贷款的支付方案,并给出了相应的最优定价策略.     

Efficient Interference Control Technology for Vehicular Moving Networks

This paper proposes an efficient interference control scheme for vehicular moving networks. The features of the proposed scheme are as follows: radio resources are separated into two resource groups to avoid interference between the cellular and vehicle‐to‐vehicle (V2V) links; V2V links are able to share the same radio resources for an improvement in the resource efficiency; and vehicles can adaptively adjust their transmission power according to the interference among the V2V links (based on the distributed power control (DPC) scheme derived using the network utility maximization method). The DPC scheme, which is the main feature of the proposed scheme, can improve both the reliability and data rate of a V2V link. Simulation results show that the DPC scheme improves the average signal‐to‐interference‐plus‐noise ratio of V2V links by more than 4 dB, and the sum data rate of the V2V links by 15% and 137% compared with conventional schemes.     

可信物联网的研究

针对物联网发展中安全体系尚不完善的问题,从物联网三层技术体系架构出发,分析了可信计算在物联网安全中的应用前景,并且以RFID协议为基础,利用可信计算技术,提出了一种基于平台完整性证明的可信接入方案,并对其进行了仿真,证明了通过本方案能够建立一个可信的数据交互环境。     

Pareto-Efficient and Goal-Driven Power Control in Wireless Networks: A Game-Theoretic Approach With a Novel Pricing Scheme

A Pareto-efficient, goal-driven, and distributed power control scheme for wireless networks is presented. We use a noncooperative game-theoretic approach to propose a novel pricing scheme that is linearly proportional to the signal-to-interference ratio (SIR) and analytically show that with a proper choice of prices (proportionality constants), the outcome of the noncooperative power control game is a unique and Pareto-efficient Nash equilibrium (NE). This can be utilized for constrained-power control to satisfy specific goals (such as fairness, aggregate throughput optimization, or trading off between these two goals). For each one of the above goals, the dynamic price for each user is also analytically obtained. In a centralized (base station) price setting, users should inform the base station of their path gains and their maximum transmit-powers. In a distributed price setting, for each goal, an algorithm for users to update their transmit-powers is also presented that converges to a unique fixed-point in which the corresponding goal is satisfied. Simulation results confirm our analytical developments.     

面向协同制造的分布式对象与虚拟设计环境研究

针对分布式在协同设计与制造环境中的需求,提出了实体对象与分布式对象的映射模型和平台匹配方案。分析了协同虚拟制造(CVM,collaborative virtual manufacturing)的技术体系,给出了实体对象的分析方法,提出了分布式环境下的分布式对象映射模型,并设计了CVM分布式支撑环境架构；引入单元匹配和平台匹配量化分析,改进了信息平台效率测度的评价方法。通过实例分析,得到了CVM系统结构拓展模型,对分布式虚拟设计与测试环节进行讨论,表明了应用协同与虚拟现实技术的改进效率。     

Efficient power control via pricing in wireless data networks

A major challenge in the operation of wireless communications systems is the efficient use of radio resources. One important component of radio resource management is power control, which has been studied extensively in the context of voice communications. With the increasing demand for wireless data services, it is necessary to establish power control algorithms for information sources other than voice. We present a power control solution for wireless data in the analytical setting of a game theoretic framework. In this context, the quality of service (QoS) a wireless terminal receives is referred to as the utility and distributed power control is a noncooperative power control game where users maximize their utility. The outcome of the game results in a Nash (1951) equilibrium that is inefficient. We introduce pricing of transmit powers in order to obtain Pareto improvement of the noncooperative power control game, i.e., to obtain improvements in user utilities relative to the case with no pricing. Specifically, we consider a pricing function that is a linear function of the transmit power. The simplicity of the pricing function allows a distributed implementation where the price can be broadcast by the base station to all the terminals. We see that pricing is especially helpful in a heavily loaded system     

VANET中抗被动和主动攻击的位置隐私保护方案(英文)

Existing location privacypreserving methods,without a trusted third party,cannot resist conspiracy attacks and active attacks.This paper proposes a novel solution for location based service(LBS) in vehicular ad hoc network(VANET).Firstly,the relationship among anonymity degree,expected company area and vehicle density is discussed.Then,a companion set V is set up by k neighbor vehicles.Based on secure multi-party computation,each vehicle in V can compute the centroid,not revealing its location to each other.The centroid as a cloaking location is sent to LBS provider(P)and P returns a point of interest(POI).Due to a distributed secret sharing structure,P cannot obtain the positions of non-complicity vehicles by colluding with multiple internal vehicles.To detect fake data from dishonest vehicles,zero knowledge proof is adopted.Comparing with other related methods,our solution can resist passive and active attacks from internal and external nodes.It provides strong privacy protection for LBS in VANET.     

HIMALIS-VI: Fast and Secure Mobility Management Scheme Based on HIMALIS for V2I Services in Future Networks

To overcome the inherent limitations of the current Internet architecture, such as lack of mobility support and security mechanism, research has begun on future Internet based on ID/locator split architecture. For the realization of future networks, it is necessary to consider the characteristics of their services and applications, as well as research on their basic architectures. The representative services include Cooperative Intelligent Transportation System (C-ITS) applications based on vehicle-to-vehicle/vehicle-to-infrastructure (V2V/V2I) communication which can prevent vehicular accidents, increase the efficiency of transportation systems, and reduce environmental pollution, all while improving passenger convenience. Since C-ITS services using V2I communication are tightly connected to both passenger and pedestrian safety, they require not only continuous network access but also secure communication regardless of the vehicle mobility. To provide continuous network access and secure communication to moving vehicles in future networks based on an ID/locator split approach, authentication and location updates of moving vehicles should be frequently performed, which results in significant signaling overhead. Therefore, to integrate V2I communication with an ID/locator split approach based on the (R1) HIMALIS architecture, in this paper we propose a novel mobility management scheme, called HIMALIS-VI, which can contribute to a delay reduction for the authentication and mitigating handover procedures at both the mobile hosts and network entities in an edge network.     

A trust mechanism-based channel assignment and routing scheme in cognitive wireless mesh networks with intrusion detection

Cognitive Wireless Mesh Networks (CWMN) is a novel wireless network which combines the advantage of Cognitive Radio (CR) and wireless mesh networks. CWMN can realize seamless integration of heterogeneous wireless networks and achieve better radio resource utilization. However, it is particularly vulnerable due to its features of open medium, dynamic spectrum, dynamic topology, and multi-top routing, etc.. Being a dynamic positive security strategy, intrusion detection can provide powerful safeguard to CWMN. In this paper, we introduce trust mechanism into CWMN with intrusion detection and present a trust establishment model based on intrusion detection. Node trust degree and the trust degree of data transmission channels between nodes are defined and an algorithm of calculating trust degree is given based on distributed detection of attack to networks. A channel assignment and routing scheme is proposed, in which selects the trusted nodes and allocates data channel with high trust degree for the transmission between neighbor nodes to establish a trusted route. Simulation results indicate that the scheme can vary channel allocation and routing dynamically according to network security state so as to avoid suspect nodes and unsafe channels, and improve the packet safe delivery fraction effectively.     

Task allocation based on profit maximization for mobile crowdsourcing

In recent years, with the development of smart devices, mobile users can use them to sense the environment. In order to improve the data quality and achieve maximum profits, incentive mechanism is needed to motivate users to participate. In this paper, reputation mechanism, participant selection, task allocation and joint pricing in mobile crowdsourcing system are studied. A user reputation evaluation method is proposed, and a participant selection algorithm (PSA) based on user reputation is proposed. Besides, a social welfare maximization algorithm (SWMA) is proposed, which achieves task pricing with maximizing the interests of all parties, including both task publishers and mobile users. The social welfare maximization problem is divided into local optimization sub-problems which can be solved by double decomposition. It is proved that the algorithm converges to the optimal solution. Results of simulations verify that algorithms PSA and SWMA are effective.     

Double auction mechanisms for resource allocation in autonomous networks

Auction mechanisms are used for allocating a resource among multiple agents with the objective to maximize social welfare. What makes auctions attractive is that they are agnostic to utility functions of agents. Auctions involve a bidding method by agents-buyers, which is then mapped by a central controller to an allocation and a payment for each agent. In autonomic networks comprising self-interested nodes with different needs and utility functions, each entity possesses some resource and can engage in transactions with others to achieve its needs. In fact, efficient network operation relies on node synergy and multi-lateral resource trading. Nodes face the dilemma of devoting their limited resource to their own benefit versus acting altruistically and anticipating to be aided in the future. Wireless ad-hoc networks, peer-to-peer networks and disruption-tolerant networks are instances of autonomic networks where the challenges above arise and the traded resource is energy, bandwidth and storage space respectively. Clearly, the decentralized complex node interactions and the double node role as resource provider and consumer amidst resource constraints cannot be addressed by single-sided auctions and even more by mechanisms with a central controller. We introduce a double-sided auction market framework to address the challenges above. Each node announces one bid for buying and one for selling the resource.We prove that there exist bidding and charging strategies that maximize social welfare and we explicitly compute them. We generalize our result to a generic network objective. Nodes are induced to follow these strategies, otherwise they are isolated by the network. Furthermore, we propose a decentralized realization of the double-sided auction with lightweight network feedback. Finally, we introduce a pricing method which does not need a charging infrastructure. Simulation results verify the desirable properties of our approach.     

Efficient signal proportional allocation (ESPA) mechanisms: decentralized social welfare maximization for divisible resources

We address the problem of devising efficient decentralized allocation mechanisms for a divisible resource, which is critical to many technological domains such as traffic management on the Internet and bandwidth allocation to agents in ad hoc wireless networks. We introduce a class of efficient signal proportional allocation (ESPA) mechanisms that yields an allocation which maximizes social welfare with minimal signaling and computational requirements for the resource. Revenue limits for this class are obtained and a sequence of schemes that approach these limits arbitrarily closely are given. We also present a locally stable negotiation scheme applicable to the entire class and illustrate efficiency and revenue properties through simulation.     

Anonymous authentication scheme of trusted mobile terminal under mobile Internet

In order to solve the contradictions between user privacy protection and identity authentication, an anonymous authentication scheme under mobile Internet is proposed, which is based on the direct anonymous attestation of trusted computing and uses the encrypting transfer and signature validation for its implementation. Aiming at two access mode of trusted mobile terminal under mobile Internet, self access and cross-domain access, the authentication process of each mode is described in details. The analysis shows that the scheme implements anonymous authentication on mobile Internet and is correct, controllable and unforgeable.     

Achieving efficient location privacy protection based on cache

With the development of mobile Internet and the popularization of intelligent terminals,location based services(LBS) has been widespread in navigation,social network and other fields.Due to the sensitivity of personal location information,data privacy protection related to location of mobile objects has become the hotspots of research.Considering the openness of the background information,and based on the information cache mechanism,a dummy selection algorithm was proposed to reduce the number of interactions between the user and the untrusted server and combine the k-anonymity to achieve efficient location privacy.Without relying on trusted third party,the scheme can prevent the attackers owned background information from inference attack,and the detail simulation results indicate its effectiveness and efficiency.