DTAIS:Distributed trusted active identity resolution systems for the Industrial Internet

In recent years,the Industrial Internet and Industry 4.0 came into being.With the development of modern industrial intelligent manufacturing technology,digital twins,Web3 and many other digital entity applications are also proposed.These applications apply architectures such as distributed learning,resource sharing,and arithmetic trading,which make high demands on identity authentication,asset authentication,resource addressing,and service location.Therefore,an efficient,secure,and trustworthy Industrial Internet identity resolution system is needed.However,most of the traditional identity resolution systems follow DNS architecture or tree structure,which has the risk of a single point of failure and DDoS attack.And they cannot guarantee the security and privacy of digital identity,personal assets,and device information.So we consider a decentralized approach for identity management,identity authentication,and asset verification.In this paper,we propose a distributed trusted active identity resolution system based on the inter-planetary file system(IPFS)and non-fungible token(NFT),which can provide distributed identity resolution services.And we have designed the system architecture,identity service process,load balancing strategy and smart contract service.In addition,we use Jmeter to verify the performance of the system,and the results show that the system has good high concurrent performance and robustness.

A Game Theoretic Approach for Energy-Efficient In-Network Caching in Content-Centric Networks

Recently, content-centric networking （CCN） has become a hot research topic for the diffusion of contents over the Internet. Most existing works on CCN focus on the improvement of network resource utilization. Consequently, the energy consumption aspect of CCN is largely ignored. In this paper, we propose a distributed energyefficient in-network caching scheme for CCN, where each content router only needs locally available information to make caching decisions considering both caching energy consumption and transport energy consumption. We formulate the in-network caching problem as a non-cooperative game. Through rigorous mathematical analysis, we prove that pure strategy Nash equilibria exist in the proposed scheme, and it always has a strategy profile that implements the socially optimal configuration, even if the touters are self-interested in nature. Simulation results are presented to show that the distributed solution is competitive to the centralized scheme, and has superior performance compared to other popular caching schemes in CCN. Besides, it exhibits a fast convergence speed when the capacity of content routers varies.

A Survey on Energy Efficiency in Cellular Networks

With the continuous increase of user requirement, the Information and Communication Technology (ICT) has developed rapidly. As a result, both capacity and coverage performances have been improved, and at the same time, the communication networks have been more energy-intensive. In order to improve the energy efficiency of cellular networks, the green communication must be realized in the future networks. In this article, we present a short survey on energy-efficient technology of cellular networks. Moreover, we classify them into three categories based on theirapplication scenarios: energy-efficient architectures, energy-efficient resource management and energy-efficient radio technologies. For the first scenario, the applications of relay, Coordinated Multiple Points (CoMP) and heterogeneous network are discussed in detail. For the second scenario, the switching off scheme will be introduced as an emphasis of this part. And for the third scenario, the Multiple-Input Multiple-Output (MIMO) and Orthogonal Frequency Division Multiplexing (OFDM) will be introduced as the representatives of the Energy-Efficient Radio Technologies. Finally, based on the technologies introduced above, a prospect forecast of the energy-efficient wireless cellular network is presented.