Search

This paper addresses the challenge of efficiently designing multiplexer structures in quantum-dot technology circuits. Specifically, it introduces a novel approach to constructing a 2-to-1 multiplexer through a unique gate design that relies on the interaction between cells. The key focus of this design is to minimize the utilization of cells, thereby conserving space and facilitating the creation of more complex combinational and sequential circuits. The methodology involves developing a gate structure that requires the least number of cells compared to existing designs. This reduction in cell usage not only optimizes space utilization but also enhances the scalability of the multiplexer for integration into larger circuits. The proposed gate structure demonstrates a significant improvement, achieving a 15% reduction in the number of cells compared to the previously best-known design. To further evaluate the effectiveness of this novel gate design, the study extends its analysis to include the implementation of various complex circuits such as a 4-to-1 multiplexer, D latch, and T latch. These structures are synthesized using the newly proposed gate design as a fundamental building block. To validate the functionality and performance of these circuits, simulations are conducted using the QCADesigner simulation tool. This comprehensive simulation enables a thorough assessment of the proposed structures across different circuit configurations, providing insights into their operational efficiency and suitability for practical applications in quantum-dot technology. [ABSTRACT FROM AUTHOR]

In order to provide access control on encrypted data, Attribute-based encryption (ABE) defines each user using a set of attributes. Fuzzy identity-based encryption (FIBE) is a variant of ABE that allows for a threshold access structure for users. To address the potential threat posed by future quantum computers, this paper presents a postquantum fuzzy IBE scheme based on lattices. However, current lattice-based ABE schemes face challenges related to computational complexity and the length of ciphertext and keys. This paper aims to improve the performance of an existing fuzzy IBE scheme by reducing key length and computational complexity during the encryption phase. While negative attributes are not utilized in our scheme, we prove its security under the learning with error (LWE) hard problem assumption in the selective security model. These improvements have significant implications for the field of ABE. [ABSTRACT FROM AUTHOR]

This paper proposed a new Distributed Score Based Clustering Algorithm (DSBCA) for Mobile Ad-hoc Networks (MANETs). In MANETs, select suitable nodes in clusters as cluster heads are so important. The proposed Clustering Algorithm considers the Battery Remaining, Number of Neighbors, Number of Members, and Stability in order to calculate the node's score with a linear algorithm. After each node calculates its score independently, the neighbors of the node must be notified about it. Also each node selects one of its neighbors with the highest score to be its cluster head and, therefore the selection of cluster heads is performed in a distributed manner with most recent information about current status of neighbor nodes. The proposed algorithm was compared with Weighted Clustering Algorithm and Distributed Weighted Clustering Algorithm in terms of number of clusters, number of re-affiliations, lifespan of nodes in the system, end-to-end throughput and overhead. The simulation results proved that the proposed algorithm has achieved the goals. Keywords: Ad-hoc Networks, Distributed clustering algorithm, Cluster head, INTRODUCTION Mobile ad hoc networks (MANETs) consist of mobile devices that form the wireless networks with out any fixed infrastructure or centralized administration. In these networks each node communicates the [...]

Abstract Certificate authorities (CAs) are the main components of PKI that enable us for providing basic security services in wired networks and Internet. But, we cannot use centralized CAs, in mobile ad hoc networks (MANETs). So, many efforts have been made to adapt CA to the special characteristics of MANETs and new concepts such as distributed CAs (DCAs) have been proposed that distribute the functionality of CA between MANET nodes. In this article, we study various proposed DCA schemes for MANET and then classify these schemes according to their internal structures and techniques. Finally, we propose the characteristics of an ideal DCA system that can be used to verify the completeness of any DCA scheme. This classification and taxonomy identify the weakness and constraints of each scheme, and are very important for designing more secure, scalable, and high performance DCA systems for MANETs and other networks.

VANETs are one of the important technologies in recent decade. This importance is evident which can be used in road and mountains trails and also provides other information to vehicle from roads. There are many challenges and problems in this networks which can cited as routing, clustering, quality of services criteria, energy consumption, RSU placement and etc. This article tries to study and survey about VANET's clustering methods in roads and mountain trails with high reliability. [ABSTRACT FROM AUTHOR]