Search

In this study, we focus on real-time anomaly detection using the gated graph neural network (GGNN) and long short-term memory (LSTM) algorithms for the most commonly used network protocols of HTTP and TELNET. In a network, the flow of the various protocols is determined by their respective roles. Each protocol consists of options with individual tasks, and protocols are processed based on these tasks. Therefore, when analyzing flow, a unique repetitive pattern emerges according to the flow and mission. Accordingly, when an anomaly signal is involved, the pattern shows different characteristics from the existing pattern. This study identifies the flow of input and output values based on the correlation between the options defined at each port, whereby the correlation is analyzed, and the detection accuracy of the anomaly signal is determined using the GGNN and LSTM algorithms. The experimental results demonstrate an accuracy of 99.36% for GGNN and 89.46% for LSTM in detecting network anomalies. [ABSTRACT FROM AUTHOR]

Vehicular Internet of Things (VIoT) refers to integrating Internet of Things (IoT) technology into the transportation sector, specifically vehicles. It aims to enhance transportation safety, efficiency, and sustainability by using connected devices and real-time data exchange between vehicles, road infrastructure, and transportation management systems. RFID can provide valuable insights into the functioning and performance of vehicles, enabling the development of intelligent transportation systems and contributing to the growth of the VIoT. To secure essential driving data tag location, data privacy, and road safety are the primary concerns in the VIoT system. An attacker can perform a variety of attacks on the tag and compromise its privacy through the wireless channel between it and the reader. To ensure secure communication for the various application of the VIoT system, An RFID-based protocol is proposed, which is referred to as UPSRVNet (Ultralightweight, Privacy preserved, and Secure RFID-based authentication protocol for VIoT Networks). The proposed protocol guarantees secure authentication in VIoT networks using ultralightweight, privacy-preserving RFID tags by substituting bit formation and right-shift rotation for high-computing operations like hash functions and encryption/decryption algorithms. It also reduces RFID tags' storage and communication overhead and aims to secure the driver's location, personal information, and resistance from known attacks. As per the experiment result, the proposed UPSRVNet protocol showed a significant reduction in communication overhead between tag and reader, that is 50%, and the storage cost on the tag is also reduced by 33.33% compared to existing protocols. Due to this, the certification and authentication processes may be performed quickly. The protocol ensured the security requirements by informal analysis using the Scyther tool. A comprehensive analysis of the proposed protocol reveals its substantial advantages over the existing protocol concerning computation complexity, communication efficacy, and storage expenditure. [ABSTRACT FROM AUTHOR]

The world's first five-agent network, also called Wuxing network in ancient China, had been fully established in the second century BC. Surprisingly, the key to cracking the operation of Wuxing network is the golden ratio, the world's most astonishing number originating from ancient Greece. Wuxing network is composed of five agents located on the vertices of a pentagon such that adjacent agents cooperate with each other, while spaced-apart agents oppose each other. Although it was proposed more than 2000 years ago, it is still an unparalleled network operation protocol. This article reveals the role of the golden ratio in the balance and stability of Wuxing network, and demonstrates how to detect the golden ratio experimentally in Wuxing electronic circuits and in Wuxing formation flight of drones. [ABSTRACT FROM AUTHOR]

In this paper, network energy assesses the capacity of a node to convey messages to others. In most cases, network energy is created when two nodes interact with one another. If a node is part of the same network as the node it is connecting with, then it will be able to make an inter-network energy connection with the node it is meeting. In the case that this does not take place, there will be an accumulation of energy within the part of the network that is facing the node. A node with higher inter-network energy is considered suitable for forwarding. The energy optimisation is achieved using efficient identification of source and destination pairs. This work has considered two scenarios, i.e. lossless transmission and lossy transmission, for our experiments and evaluated the detection probability. The performance of the proposed PPM is evaluated in terms of delivery ratio, overhead and hops count performance measures. When the buffer size is set to 100 MB, PPM delivers 59% of messages with message overhead of 750 and it has a hop count of 2, which is comparable to the state-of-the-art methods. With lengthy lifetimes of IOT networks, PPM is capable of giving higher performance while maintaining the privacy of network. The detection probability for the lossy observations model is applied to a 10-node, 20-node, 30-node and 40-node IoT network. [ABSTRACT FROM AUTHOR]

Many previous studies showed that some nodes should be in a sleeping state while the traffic is high. These nodes can wake up periodically to transmit data while they have data to transmit. The system throughput will be increased while each node can change between wake-up and sleeping states periodically. If a node can estimate the active rate and wake up at the optimal time, the collision probability decreases. This study proposes a Q-learning-based distributed queuing medium access control (QL-based DQMAC) protocol for Internet-of-Things (IoT) networks. In the proposed QL-based DQMAC, we derive the optimal number of contention IoT nodes. Each node calculates the active rate by itself through the Q-learning algorithm. Then, each node determines whether it will be active or in sleeping mode in the next contention period according to the active rate. Finding the optimal IoT nodes in each contention period decreases the probability of collision. The energy consumption due to the contention and delay for MAC contention is reduced owing to the lower number of contentions. Protocol comparison with other DQMAC protocols shows that the proposed QL-based DQMAC protocol achieves higher performance in IoT networks. [ABSTRACT FROM AUTHOR]

The 802.11ah standard is a new energy-efficient, wireless networking protocol which allows thousands of indoor and outdoor devices to be connected to the same access point. The Centralized Authentication Control (CAC) method, described in the standard, enables up to 8000 stations to be authenticated and associated with the same access point. A baseline implementation of the CAC method has been reported; however, it suffers from a few limitations. In this paper, an efficient methodology is proposed to minimize the CAC method's association time. The proposed methodology allows the association of a large number of stations by predicting the size of the network followed by selecting the best step size that will enable fast association between the access point and the stations of the network. The methodology consists of three stages. The first stage provides a baseline implementation of the 802.11ah standard, while the second stage eliminates the effect of too large or too small step sizes. The third stage finds the optimal step size and step repeat for each network size and predicts network size based on queue size. The performance of the proposed methodology is evaluated and compared in terms of total association time, number of total trials and percentage of ineffective trials. The methodology outperforms the baseline implementation by achieving a 30% reduction in the total association time, 30% reduction in the total number of trials and 45% reduction in the total number of ineffective trials. [ABSTRACT FROM AUTHOR]

Blockchain technology with its inherent security features revolutionizes the field of distributed networks and has become one of the significant areas of research. To preserve the security features and to maintain its global state, consensus mechanisms are very essential and are performed by a set of peers in the underlying network called miners. Therefore, the miners need to be a trusted entity and their trustworthiness plays a vital role in preserving the security of the asset ledger. To ensure trusted nodes perform the consensus process, fuzzy-based trust models are robust and effective. Therefore, fuzzy inference system-based trusted consensus mechanism (FISTCON) is proposed as an effective security solution resulting in a fast and secure consensus process. The proposed scheme works in two phases. In phase 1, a fuzzy-based trust model that includes transaction history and trust feedback (F-THTF trust model) to identify trusted miners for consensus is proposed. In phase 2, a fuzzy-based effective practical byzantine fault tolerance (F-EpBFT) consensus protocol with an optimized broadcasting mechanism to decrease the communication overhead is proposed. The proposed work is implemented in the Hyperledger fabric framework, and the outcomes are thoroughly analyzed to prove the efficiency of the proposed scheme in a variety of scenarios. [ABSTRACT FROM AUTHOR]

Focusing specifically on sensing devices with restricted resources, heterogeneous internet of things (HIoT) is an attractive scenario for IoT networks. Nonetheless, the very nature of wireless channels in these networks has given rise to a series of security challenges, which need to be considered while developing authentication protocols. Here, we scrutinized Yu and Park's, Kumari et al.'s, and Ostad-sharif et al.'s protocols and illustrated their weaknesses against key compromise attacks, insider attacks, and violation of anonymity. Furthermore, for heterogeneous IoT contexts, a lightweight and secure authentication and key agreement protocol for heterogeneous IoT environments is presented. Concerning the restricted resources of sensing devices, an attempt is made to provide an efficient HIoT-based authentication protocol to enhance network security and performance. The gateway as a trusted authority with the maximum workload and sensing devices with the highest restrictions on resources are considered in the suggested protocol. As a result, the user bears the brunt of the workload in the individual session. The Burrows–Abadi–Needham (BAN) logic is used to validate the proposed protocol, and the Automated Validation of Internet Security Protocols and Applications (AVISPA) tool is utilized to demonstrate resilience to existing active attacks. Simulation findings and performance assessment revealed that our protocol improved communication overheads by up to 110%, computation overheads by up to 83%, and sensing device maximum storage capacity by up to 51%. [ABSTRACT FROM AUTHOR]

The use of independent spanning trees (ISTs) has scientific applications in fault-tolerant requirement in network protocols and secure message distributions. Most of the designs of ISTs are for those interconnection networks with vertex symmetric property, implying that one can find ISTs rooted on a designated vertex, and, by the vertex symmetry property of the given network, hence have solved the ISTs problem on any arbitrary vertex. The existence of asymmetry makes the ISTs problem even harder than its symmetric counterpart. In this paper, we propose two linear time algorithms that solved ISTs rooted at an arbitrary vertex of WK-recursive networks and WK-recursive pyramids separately. The performance of the proposed algorithms is evaluated both, analytically and experimentally, in terms of tree heights and average distances. [ABSTRACT FROM AUTHOR]

Few technologies have been mired in hype more than blockchain, which is the underlying peer-to-peer network protocol for cryptocurrencies such as Bitcoin. Given the technology's emphasis on purported "immutable ledgers" and trust-less sharing models, there has been a great deal of interest in applying blockchain to democratic reforms. From localized decision-making to national-scale voting systems, blockchain has spurred a surge of interest in how democracy might "get a software update". While significant research exists on socio-technological imaginaries (perceptions) and potential applications (experiments) within the Global North, few studies have looked at more dynamic contexts, particularly Central Asia. In light of the violence surrounding elections in October 2020 and previous revolutions against the country's central government, the status of democracy in Kyrgyzstan is, at best, fragile and, at worst, non-existent. This article explores alternative futures scenarios for localized, blockchain-driven governance futures in Kyrgyzstan and concludes with a proposal for deeper investigation. [ABSTRACT FROM AUTHOR]

Quantum network protocols offer new functionalities such as enhanced security to communication and computational systems. Despite the rapid progress in quantum hardware, it has not yet reached a level of maturity that enables execution of many quantum protocols in practical settings. To develop quantum protocols in real world, it is necessary to examine their performance considering the imperfections in their practical implementation using simulation platforms. In this paper, we consider several quantum protocols that enable promising functionalities and services in near-future quantum networks. The protocols are chosen from both areas of quantum communication and quantum computation as follows: quantum money, W-state based anonymous transmission, verifiable blind quantum computation, and quantum digital signature. We use NetSquid simulation platform to evaluate the effect of various sources of noise on the performance of these protocols, considering different figures of merit. We find that to enable quantum money protocol, the decoherence time constant of the quantum memory must be at least three times the storage time of qubits. Furthermore, our simulation results for the w-state based anonymous transmission protocol show that to achieve an average fidelity above 0.8 in this protocol, the storage time of sender's and receiver's particles in the quantum memory must be less than half of the decoherence time constant of the quantum memory. We have also investigated the effect of gate imperfections on the performance of verifiable blind quantum computation. We find that with our chosen parameters, if the depolarizing probability of quantum gates is equal to or greater than 0.05, the security of the protocol cannot be guaranteed. Lastly, our simulation results for quantum digital signature protocol show that channel loss has a significant effect on the probability of repudiation. [ABSTRACT FROM AUTHOR]

A critical requirement in Mobile Ad Hoc Networks (MANETs) is its ability to automatically discover existing services as well as their locations. Several solutions have been proposed in various communication domains which could be classified into two categories: (1) directory based, and (2) directory-less. The former is efficient but suffers from the amount of control messages being exchanged to maintain all directories in an agile environment. However, the latter approach attempts to reduce the amount of control messages to update directories, by simply sending broadcast messages to discover services; which is also a non-desirable approach in MANETs. This research work builds on top of our prior work (Nazeeruddin et al. in IFIP/IEEE international conference on management of multimedia networks and services, Springer, Berlin, 2006)) where we introduced a new efficient protocol for service discovery in MANETs (MSLD); a lightweight, robust, scalable, and flexible protocol which supports node heterogeneity and dynamically adapts to network changes while not flooding the network with extra protocol messages—a major challenge in today's network environments, such as Internet of Things (IoT). Extensive simulations study was conducted on MSLD to: (1) initially evaluate its performance in terms of latency, service availability, and overhead messages, then (2) compare its performance to Dir-Based, Dir-less, and PDP protocols under various network conditions. For most performance metrics, simulation results show that MSLD outperforms Dir-Based, Dir-less, and PDP by either matching or achieving high service availability, low service discovery latency, and considerably less communication overhead. [ABSTRACT FROM AUTHOR]