首页期刊导航|Computer communications
期刊信息/Journal information
Computer communications
IPC Science and Technology Press Limited
Computer communications

IPC Science and Technology Press Limited

0140-3664

Computer communications/Journal Computer communicationsSCIAHCIISTPEI
正式出版
收录年代

    A survey on authentication protocols of dynamic wireless EV charging

    Hettiarachchi N.Hakak S.Mandal K.
    1.1-1.23页
    查看更多>>摘要：© 2024 The AuthorsElectric Vehicles (EVs) are considered the predominant method of decreasing fossil fuels as well as greenhouse gas emissions. With the drastic growth of EVs, the future smart grid is expected to extensively incorporate dynamic wireless charging (DWC) systems, a significant advancement over traditional charging methods. DWC, offering the unique ability to charge vehicles in motion, introduces new infrastructures, complex network models and consequently, a massive attack surface. To accomplish the goal of such an enormous smart grid accompanying DWCs, the security of EV charging infrastructures has become a deciding factor. EV charging is vulnerable to cyberattacks as it has many attack vectors and many challenges to combat. Unlike the traditional charging services provided in a typical static charging station, the DWC has a complex network architecture which makes it vulnerable to many forms of cyberattacks. Authentication plays a crucial role in safeguarding the frontline security of this ecosystem. However, within the domain of DWC, the current academic landscape has seen limited attention dedicated to authentication protocols. This background signifies the necessity of a comprehensive survey to cover the authentication protocols of dynamic wireless EV charging environments. This review paper examines the security requirements and the network model of the DWC, providing comprehensive insights into existing authentication protocols by scrutinizing a proper classification. Furthermore, the paper addresses existing challenges in authentication schemes within DWC and explores potential future research tendencies aiming to strengthen the security framework of this emerging technology.
      原文链接:
    • NETL
    • NSTL
    • Elsevier

    Trustless privacy-preserving data aggregation on Ethereum with hypercube network topology

    Ismayilov G.C.Ozturan C.
    1.1-1.15页
    查看更多>>摘要：© 2024 Elsevier B.V.The privacy-preserving data aggregation is a critical problem for many applications where multiple parties need to collaborate with each other privately to arrive at certain results. Blockchain, as a database shared across the network, provides an underlying platform on which such aggregations can be carried out with a decentralized manner. Therefore, in this paper, we have proposed a scalable privacy-preserving data aggregation protocol for summation on the Ethereum blockchain by integrating several cryptographic primitives including commitment scheme, asymmetric encryption and zero-knowledge proof along with the hypercube network topology. The protocol consists of four stages as contract deployment, user registration, private submission and proof verification. The analysis of the protocol is made with respect to two main perspectives as security and scalability including computational, communicational and storage overheads. In the paper, the zero-knowledge proof, smart contract and web user interface models for the protocol are provided. We have performed an experimental study in order to identify the required gas costs per individual and per system. The general formulation is provided to characterize the changes in gas costs for the increasing number of users. The zero-knowledge proof generation and verification times are also measured.
      原文链接:
    • NETL
    • NSTL
    • Elsevier

    Trajectory design of UAV-aided energy-harvesting relay networks in the terahertz band

    Sabuj S.R.Cho Y.Elsharief M.Jo H.-S....
    1.1-1.14页
    查看更多>>摘要：© 2024 Elsevier B.V.Unmanned aerial vehicle (UAV)-aided relaying benefits from easy deployment, strong communication channels, and mobility compared with traditional ground relaying, thereby enhancing the wireless connectivity of future industrial Internet of Things networks. In this paper, a UAV-assisted relay network capable of harvesting energy from a source is designed by exploiting the radio frequency band and transmitting information between the transmitter and corresponding receiver utilizing the terahertz (THz) band. Subsequently, the channel capacity is analytically derived using the finite blocklength theorem for THz communication. In addition, we formulate an optimization problem to determine the optimal location of the UAV to maintain the minimum channel capacity between the transmitter and receiver pair. To determine the optimal location, we employ the augmented Lagrange multiplier approach. Regarding the optimal location, we propose an algorithm for two UAV trajectories, namely forward and backward trajectories, that employs modified minimal jerk trajectories. The numerical results indicate that the backward trajectory provides better system performance in terms of channel capacity. Moreover, the simulation findings show that in urban, dense urban, and high-rise areas, the backward trajectory improves upon the forward trajectory by approximately 41.07%, 59.02%, and 76.47%, respectively, while using a blocklength of 400 bytes.
      原文链接:
    • NETL
    • NSTL
    • Elsevier

    Towards proactive rumor control: When a budget constraint meets impression counts

    Xu P.Peng Z.Wang L.
    1.1-1.13页
    查看更多>>摘要：© 2024 Elsevier B.V.The proliferation of rumors in online networks poses significant public safety risks and economic repercussions. Addressing this, we investigate the understudied aspect of rumor control: the interplay between influence block effect and user impression counts under budget constraints. We introduce two problem variants, RCIC and RCICB, tailored for diverse application contexts. Our study confronts two inherent challenges: the NP-hard nature of the problems and the non-submodularity of the influence block, which precludes direct greedy approaches. We develop a novel branch-and-bound framework for RCIC, achieving a (1−1/e−ϵ) approximation ratio, and enhance its efficacy with a progressive upper bound estimation, refining the ratio to (1−1/e−ϵ−ρ). Extending these techniques to RCICB, we attain approximation ratios of ([Formula presented](1−1/e−ρ)−ϵ). We conduct experiments on real-world datasets to verify the efficiency, effectiveness, and scalability of our methods.
      原文链接:
    • NETL
    • NSTL
    • Elsevier