Peer-to-peer(P2P)energy trading refers to a type of decentralized transaction,where the energy from distributed energy resources is directly traded between peers.A key challenge in peer-to-peer energy trading is desig...Peer-to-peer(P2P)energy trading refers to a type of decentralized transaction,where the energy from distributed energy resources is directly traded between peers.A key challenge in peer-to-peer energy trading is designing a safe,efficient,and transparent trading model and operating mechanism.In this study,we consider a P2P trading environment based on blockchain technology,where prosumers can submit bids or offers without knowing the reports of others.We propose an Arrow-d’Aspremont-Gerard-Varet(AGV)-based mechanism to encourage prosumers to submit their real reserve price and determine the P2P transaction price.We demonstrate that the AGV mechanism can achieve Bayesian incentive compatibility and budget balance.Kernel density estimation(KDE)is used to derive the prior distribution from the historical bid/offer information of the agents.Case studies are carried out to analyze and evaluate the proposed mechanism.Simulation results verify the effectiveness of the proposed mechanism in guiding agents to report the true reserve price while maximizing social welfare.Moreover,we discuss the advantages of budget balance for decentralized trading by comparing the Vickrey-Clarke-Groves(VCG)and AGV mechanisms.展开更多
One of the key challenges in ad-hoc networks is the resource discovery problem.How efciently&quickly the queried resource/object can be resolved in such a highly dynamic self-evolving network is the underlying que...One of the key challenges in ad-hoc networks is the resource discovery problem.How efciently&quickly the queried resource/object can be resolved in such a highly dynamic self-evolving network is the underlying question?Broadcasting is a basic technique in the Mobile Ad-hoc Networks(MANETs),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive ooding technique oods the network with query messages,while the random walk scheme operates by contacting subsets of each node’s neighbors at every step,thereby restricting the search space.Many earlier works have mainly focused on the simulation-based analysis of ooding technique,and its variants,in a wired network scenario.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of mobile P2P networks.In this article,we mathematically model different widely used existing search techniques,and compare with the proposed improved random walk method,a simple lightweight approach suitable for the non-DHT architecture.We provide analytical expressions to measure the performance of the different ooding-based search techniques,and our proposed technique.We analytically derive 3 relevant key performance measures,i.e.,the avg.number of steps needed to nd a resource,the probability of locating a resource,and the avg.number of messages generated during the entire search process.展开更多
Free riding has a great influence on the expandability,robustness and availability of Peer-to-Peer(P2P) network.Controlling free riding has become a hot research issue both in academic and industrial communities.An in...Free riding has a great influence on the expandability,robustness and availability of Peer-to-Peer(P2P) network.Controlling free riding has become a hot research issue both in academic and industrial communities.An incentive scheme is proposed to overcoming free riding in P2P network in this paper.According to the behavior and function of nodes,the P2P network is abstracted to be a Distributed and Monitoring-based Hierarchical Structure Mechanism(DMHSM) model.A utility function based on several influencing factors is defined to determine the contribution of peers to the whole system.This paper also introduces reputation and permit mechanism into the scheme to guarantee the Quality of Service(QoS) and to reward or punish peers in the network.Finally,the simulation results verify the effectiveness and feasibility of this model.展开更多
We are interested in providing Video-on-Demand (VoD) streaming service to a large population of clients using peer-to-peer (P2P) approach. Given the asynchronous demands from multiple clients, continuously changing of...We are interested in providing Video-on-Demand (VoD) streaming service to a large population of clients using peer-to-peer (P2P) approach. Given the asynchronous demands from multiple clients, continuously changing of the buffered contents, and the continuous video display requirement, how to collaborate with potential partners to get expected data for future content delivery are very important and challenging. In this paper, we develop a novel scheduling algorithm based on deadline- aware network coding (DNC) to fully exploit the network resource for efficient VoD service. DNC generalizes the existing net- work coding (NC) paradigm, an elegant solution for ubiquitous data distribution. Yet, with deadline awareness, DNC improves the network throughput and meanwhile avoid missing the play deadline in high probability, which is a major deficiency of the con- ventional NC. Extensive simulation results demonstrated that DNC achieves high streaming continuity even in tight network conditions.展开更多
基金supported by National Natural Science Foundation of China(U2066211,52177124,52107134)the Institute of Electrical Engineering,CAS(E155610101)+1 种基金the DNL Cooperation Fund,CAS(DNL202023)the Youth Innovation Promotion Association of CAS(2019143).
文摘Peer-to-peer(P2P)energy trading refers to a type of decentralized transaction,where the energy from distributed energy resources is directly traded between peers.A key challenge in peer-to-peer energy trading is designing a safe,efficient,and transparent trading model and operating mechanism.In this study,we consider a P2P trading environment based on blockchain technology,where prosumers can submit bids or offers without knowing the reports of others.We propose an Arrow-d’Aspremont-Gerard-Varet(AGV)-based mechanism to encourage prosumers to submit their real reserve price and determine the P2P transaction price.We demonstrate that the AGV mechanism can achieve Bayesian incentive compatibility and budget balance.Kernel density estimation(KDE)is used to derive the prior distribution from the historical bid/offer information of the agents.Case studies are carried out to analyze and evaluate the proposed mechanism.Simulation results verify the effectiveness of the proposed mechanism in guiding agents to report the true reserve price while maximizing social welfare.Moreover,we discuss the advantages of budget balance for decentralized trading by comparing the Vickrey-Clarke-Groves(VCG)and AGV mechanisms.
文摘One of the key challenges in ad-hoc networks is the resource discovery problem.How efciently&quickly the queried resource/object can be resolved in such a highly dynamic self-evolving network is the underlying question?Broadcasting is a basic technique in the Mobile Ad-hoc Networks(MANETs),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive ooding technique oods the network with query messages,while the random walk scheme operates by contacting subsets of each node’s neighbors at every step,thereby restricting the search space.Many earlier works have mainly focused on the simulation-based analysis of ooding technique,and its variants,in a wired network scenario.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of mobile P2P networks.In this article,we mathematically model different widely used existing search techniques,and compare with the proposed improved random walk method,a simple lightweight approach suitable for the non-DHT architecture.We provide analytical expressions to measure the performance of the different ooding-based search techniques,and our proposed technique.We analytically derive 3 relevant key performance measures,i.e.,the avg.number of steps needed to nd a resource,the probability of locating a resource,and the avg.number of messages generated during the entire search process.
基金Supported by the National Natural Science Foundation of China (No.60873203)the Natural Science Foundation of Hebei Province (No.F2008000646)the Guidance Program of the Department of Science and Technology in Hebei Province (No.072135192)
文摘Free riding has a great influence on the expandability,robustness and availability of Peer-to-Peer(P2P) network.Controlling free riding has become a hot research issue both in academic and industrial communities.An incentive scheme is proposed to overcoming free riding in P2P network in this paper.According to the behavior and function of nodes,the P2P network is abstracted to be a Distributed and Monitoring-based Hierarchical Structure Mechanism(DMHSM) model.A utility function based on several influencing factors is defined to determine the contribution of peers to the whole system.This paper also introduces reputation and permit mechanism into the scheme to guarantee the Quality of Service(QoS) and to reward or punish peers in the network.Finally,the simulation results verify the effectiveness and feasibility of this model.
基金Project (No. DAG05/06.EG05) supported by the Research GrantCouncil (RGC) of Hong Kong, China
文摘We are interested in providing Video-on-Demand (VoD) streaming service to a large population of clients using peer-to-peer (P2P) approach. Given the asynchronous demands from multiple clients, continuously changing of the buffered contents, and the continuous video display requirement, how to collaborate with potential partners to get expected data for future content delivery are very important and challenging. In this paper, we develop a novel scheduling algorithm based on deadline- aware network coding (DNC) to fully exploit the network resource for efficient VoD service. DNC generalizes the existing net- work coding (NC) paradigm, an elegant solution for ubiquitous data distribution. Yet, with deadline awareness, DNC improves the network throughput and meanwhile avoid missing the play deadline in high probability, which is a major deficiency of the con- ventional NC. Extensive simulation results demonstrated that DNC achieves high streaming continuity even in tight network conditions.
