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]

The quantum secure multiparty computation is one of the important properties of secure quantum communication. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many complex quantum operations. To make this protocol secure and realistic, we combine both the classical and quantum phenomena. The existing protocols have some security and efficiency issues because they use (n, n) threshold approach, where all the honest players need to perform the quantum multiparty summation protocol. We however use a (t, n) threshold approach, where only t honest players need to compute the quantum summation protocol. Compared to other protocols our proposed protocol is more cost-effective, realistic, and secure. We also simulate it using the IBM corporation's online quantum computer, or quantum experience. [ABSTRACT FROM AUTHOR]

Wireless body sensor network (WBSN) provides a sophisticated monitoring environment without disturbing the daily subject activity. The WBSN increases the mobility of the subject without being restricted inside the hospital environment. However, resources like limited power and transceiver capability limit the movement of the subject. Providing an energy-efficient scheme will provide extended network lifetime and limits the frequency of recharging the battery. This subject condition modelled as a Markov model with normal and abnormal states. The transition from the normal state to abnormal state is predicted through Markov process. The sensor nodes monitoring the subject status remade to sleep state during the reasonable condition, and during the abnormal state, all the nodes awakened. This sleep–wake methodology with priority queuing model is studied in this paper and implemented in MATLAB. The priority queuing model provides a novel solution for time-critical applications. The proposed TCEM-PQM provides reduced time delay when compared to PQM routing protocol. The time delay reduced for critical applications and the policy suits monitoring environment and healthcare applications. The proposed model is simulated with Markov model. [ABSTRACT FROM AUTHOR]

A new region-based energy-conscious sink movement (RESM) is presented to enhance the lifetime of the heterogeneous wireless sensor network using stable election protocol. The movement is based on the total energy of the individual regions of the entire sensing field. The sink always moves to the centre of the lowest nonzero energy region, which is the main contribution of this work. Based on the residual energy of the regions, RESM enhances the network lifetime. Simulation results prove that this approach prolongs the network lifetime as compared to other sink movement methods such as continuous movement in the periphery and the centre as well as other existing algorithms such as LEACH, SEP, and MSE. The lifetime improvement over LEACH, SEP, and MSE is 22%, 5%, and 3%, respectively. [ABSTRACT FROM AUTHOR]

APTEEN is a typical routing protocol for wireless sensor networks, but when clustering, cluster heads are randomly selected, which makes it easy to select nodes with low residual energy as cluster heads, thus forming network holes. At the same time, in multi hop transmission, the cluster head near the sink node is overloaded due to forwarding a large amount of data. Aiming at these problems, this paper introduces PSO algorithm and proposes ADCH-EPE-APTEEN routing protocol. In order to make the particle swarm optimization algorithm more suitable for routing protocol, this paper first proposes DCA-PSO based on particle swarm optimization algorithm. DCA-PSO uses the classification adaptive change inertia weight for different states of particles in the optimization process. At the same time, dynamic learning factor is used to improve the influence of particle experience and other particle experience on convergence speed and to improve the optimization accuracy and speed of the algorithm. Secondly, when APTEEN routing protocol is networked, the cluster head is selected by DCA-PSO, in which the residual energy of nodes, the location of nodes, and the energy distribution around nodes are fully taken into consideration. Thirdly, considering the distance between nodes and the sink node, the residual energy and the energy distribution around nodes, a front area is set up in the cluster located in the upper half and the assistant cluster head is selected in the front area through the DCA-PSO algorithm. The simulation results show that the DCA-PSO algorithm can significantly improve the search speed and precision compared with the PSO algorithm. Compared with APTEEN routing protocol, the ADCH-EPE-APTEEN routing protocol can reduce the network energy consumption rate and extend network lifetime by 173%. [ABSTRACT FROM AUTHOR]

In the next-generation heterogeneous wireless networks, designing authentication protocols that meet the demand of mobile users/applications is a challenge. This paper proposes authentication and re-authentication protocols for 4G wireless networks, in particular, LTE-Advanced (LTE-A), WLAN, and WiMAX-Advanced (WiMAX-A) interworking architecture. The proposed protocols are applicable to 5G networks. With the consideration of the existing standard authentication protocols, a new set of authentication and re-authentication protocols has been reinvented to provide fast and secure handovers (HO) in the current 4G and the next 5G networks. The proposed authentication protocols can be invoked when the users perform a vertical HO (between different networks) for the first time, whereas the re-authentication protocols can be invoked when the users perform a horizontal HO (within the same network domain). These protocols provide an efficient method to protect user identity and reduce the burden on the authentication server (AS) during the sequential handovers. The results of the analytical model show that the proposed protocols achieve better performance than standard and other protocols. The reduction of handover cost, handover delay, and energy consumption in the proposed protocols reaches up to 22%, 44%, and 17%, respectively. In addition, the verification tools show that the proposed protocols are secure, dependable, and prevent all types of authentication and secrecy attacks. [ABSTRACT FROM AUTHOR]

Due to the complexity of industrial control systems and the diversity of protocols in networks, it is difficult to build intrusion detection models based on network characteristics and physical modeling. In order to build a better flow model without additional knowledge, we propose an intrusion detection method based on the content of network packets. The construction of the model is based on the idea of ZOE method. The similarity between flows is calculated through the sequential coverage algorithm, the normal flow model is established by multi-layered clustering algorithm, and the Count-Mean-Min Sketch is used to store and count the flow model. By comparing the unknown flow with the constructed normal flow model, we achieve the intrusion detection of industrial control system (ICS). The overall experimental results on 4 ICS datasets show that the improved method can effectively improve the detection rate and reduce the false-positive rate. The detection rate reached 96.7% on average, and the false-positive rate reached 0.7% on average. [ABSTRACT FROM AUTHOR]

Self-stabilization in distributed systems is a technique to guarantee convergence to a set of legitimate states without external intervention when a transient fault or bad initialization occurs. Recently, there has been a surge of efforts in designing techniques for automated synthesis of self-stabilizing algorithms that are correct by construction. Most of these techniques, however, are not parameterized, meaning that they can only synthesize a solution for a fixed and predetermined number of processes. In this paper, we report a breakthrough in parameterized synthesis of self-stabilizing algorithms in symmetric networks, including ring, line, mesh, and torus. First, we develop cutoffs that guarantee (1) closure in legitimate states, and (2) deadlock-freedom outside the legitimate states. We also develop a sufficient condition for convergence in self-stabilizing systems. Since some of our cutoffs grow with the size of the local state space of processes, scalability of the synthesis procedure is still a problem. We address this problem by introducing a novel SMT-based technique for counterexample-guided synthesis of self-stabilizing algorithms in symmetric networks. We have fully implemented our technique and successfully synthesized solutions to maximal matching, three coloring, and maximal independent set problems for ring and line topologies. [ABSTRACT FROM AUTHOR]

Software Defined Networks (SDN) has been attracting researchers, scientist, and technology experts from both academia and industry to enhance the current ICT stakes and networking paradigm. The beauty of SDN is the division of Control and Data planes and make it easy for the engineers to modify the networking protocols without visiting onsite devices. Similarly, smart cities concept has been coined recently, where a plethora of smart devices will be connected and providing tons of services to the citizens, officials, and governmental departments. The Internet of Things (IoT) plays a vital role in guaranteeing such services. Few efforts have been made to merge SDN and IoT with the sole purpose of efficient Data retrieval and achieve remotely configurable networks. In this paper, we explicitly define the Internet of Software Defined Things architecture and bring it to Smart Cities as a use-case. Our 3-tier architecture consists of Data Collection, Data Management, and Application levels that are further connected via two intermediate levels working on SDN principles. Followed by the potentials of SDN and IoT for Smart Cities, we evaluated our proposed architecture using Spark and GraphX with Hadoop Ecosystem and the results shows that efficient transfer of Data over SDN for real-time processing is achieved. [ABSTRACT FROM AUTHOR]

Nodes in original S-MAC protocol just can visit the channel in the scheduling and listening stage. The working schema may result in data latency and high conflict. To solve those above problems, we split scheduling duty into multiple micro-duties. By using different micro-dispersed contention channel, the sensor nodes reduce the collision probability of the data. Aiming at detecting the fixed duty cycle in S-MAC protocol, on the basis of the micro-duty and buffer queue length, this paper presents an adaptive duty cycle and back-off algorithm. While using different back-off algorithm with different duty cycles, sensor node Fast-Binary Exponential Backoff and Conflict-Avoid-Binary exponential Backoff algorithm separated are applied to reduce data latency further reduce the conflict probability. Combining both of the improvements, we propose a modified S-MAC protocol. Comparing the performance of S-MAC protocol and Division-Multiple Access-Media Access Control (MDA-SMAC) protocol on the NS-2 simulation platform, the results show that MDA-SMAC protocol performs better in terms of energy consumption, latency, and effective throughput than S-MAC protocol [ABSTRACT FROM AUTHOR]

Artificial bee colony or ABC is an interesting meta-heuristic algorithm designed to solve various continuous optimization problems. However, it cannot be directly applied to solve discrete problems such as clustering of sensor nodes in the wireless sensor networks (WSNs). For this purpose, in this paper, we present a chaotic discrete version of the ABC algorithm, denoted as chaotic discrete ABC (CDABC). By using the CDABC algorithm, we propose a novel clustering protocol that can be used to organize WSNs into multiple levels of clusters to reduce their energy consumption. The main objective of this protocol is to improve WSN's lifetime by selecting appropriate nodes as cluster heads in each clustering level and reducing the energy costs of the inter-cluster and intra-cluster communications. Extensive simulations results validate the effectiveness of the proposed CDABC-based multi-level clustering protocol in improving the network lifetime. [ABSTRACT FROM AUTHOR]

The advent of wireless sensor networks (WSNs) has revolutionized the field of smart applications. In order to improve the performance of WSNs, refinement of clustering and routing protocols can make a vast difference. Existing classical and evolutionary optimization technique-based protocols have high computational complexity since clustering and routing problems are solved separately. Moreover, these protocols suffer from hot-spot problem due to uneven formation of clusters. In this paper, we propose a multi-level clustering protocol (MLCP) for energy-efficient data gathering in large-scale WSNs. Additionally, a hierarchical clustering architecture is designed in MLCP to jointly solve the problems of clustering and routing. Further, for the purpose of cluster head selection, a hybrid dragonfly algorithm-based particle swarm optimization technique is proposed which combines the exploration and exploitation capabilities of dragonfly algorithm and particle swarm optimization, respectively. MLCP considers intra-cluster distance, node degree and inter-cluster distance for the formation of scalable, load-balanced and energy-efficient clusters. To demonstrate the full potential of MLCP, network simulations have been carried out in diverse network conditions. MLCP has shown up to 90% increase in the network lifetime and an improvement of 19.36% in conservation of energy in comparison with the competent protocols. The comparison of obtained results with state-of-the-art clustering protocols clearly establishes the superiority of MLCP in achieving load-balanced, scalable and energy-efficient clustering. [ABSTRACT FROM AUTHOR]

We consider a retrial queueing model for random access protocols arising in local area networks such as carrier sense multiple access networks. In our model, one channel is shared among multiple nodes. Each node accesses the channel according to a Poison process and the holding time of the channel is exponentially distributed. Blocked users join the orbit and retry to access again after an exponentially distributed time depending on the number of retrials so far. As the model under study is not amenable for exact analysis, we focus on its performance in the light traffic regime. In particular, we describe a fast algorithm for calculating the terms in the Maclaurin series expansion of various performance measures, the arrival rate being the independent parameter of the expansion. We illustrate our approach by various numerical examples and verify the accuracy of the light traffic approximation by means of simulation. [ABSTRACT FROM AUTHOR]

The coherence protocol presented in this work, denoted MOSAIC, introduces a new approach to face the challenges of complex multilevel cache hierarchies in future many-core systems. The essential aspect of the proposal is to eliminate the condition of inclusiveness through the different levels of the memory hierarchy while maintaining the complexity of the protocol limited. Cost reduction decisions taken to reduce this complexity may introduce artificial inefficiencies in the on-chip cache hierarchy, especially when the number of cores and private cache size is large. Our approach trades area and complexity for on-chip bandwidth, employing an integrated broadcast mechanism in a directory structure. In energy terms, the protocol scales like a conventional directory coherence protocol, but relaxes the shared information inclusiveness. This allows the performance implications of directory size and associativity reduction to be overcome. As it is even simpler than a conventional directory, the results of our evaluation show that the approach is quite insensitive, in terms of performance and energy expenditure, to the size and associativity of the directory. [ABSTRACT FROM AUTHOR]

Internet of vehicles (IoV) is a branch of the internet of things (IoT) which is used for communication among vehicles. As vehicular nodes are considered always in motion, hence it causes the frequent changes in the topology. These changes cause major issues in IoV like scalability, dynamic topology changes, and shortest path for routing. Clustering is among one of the solutions for such type of issues. In this paper, the stability of IoV topology in a dynamic environment is focused. The proposed metaheuristic dragonfly-based clustering algorithm CAVDO is used for cluster-based packet route optimization to make stable topology, and mobility aware dynamic transmission range algorithm (MA-DTR) is used with CAVDO for transmission range adaptation on the basis of traffic density. The proposed CAVDO with MA-DTR is compared with the progressive baseline techniques ant colony optimization (ACO) and comprehensive learning particle swarm optimization (CLPSO). Numerous experiments were performed keeping in view the transmission dynamics for stable topology. CAVDO performed better in many cases providing minimum number of clusters according to current channel condition. Considerable important parameters involved in clustering process are: number of un-clustered nodes as a re-clustering criterion, clustering time, re-clustering delay, dynamic transmission range, direction, and speed. According to these parameters, results indicate that CAVDO outperformed ACO-based clustering and CLPSO in various network settings. Additionally, to improve the network availability and to incorporate the functionalities of next-generation network infrastructure, 5G-enabled architecture is also utilized. [ABSTRACT FROM AUTHOR]

An industrial control system combined with IT is not a special thing; however, cyber security in this field does not mature. Therefore, vulnerability analysis techniques for protocols used in this field are clearly needed. In this paper, we propose a novel test case generation technique for a fuzzing test that can be used for various industrial control system protocols. The proposed fuzzing test is designed for generating a cross-field fuzzing test case because of field dependencies, a characteristic of industrial control system protocols. Additionally, we focus on multilayer testing because the weaknesses of lower layer protocols are inherited by upper layer protocols. [ABSTRACT FROM AUTHOR]

Progression of the internet technologies has led to the emergence of internet of things (IoT). One of the familiar deployment of IoT is through radio-frequency identification (RFID) technology. In recent times, RFID based systems are one of the most widely spread applications for tagging and keep tracking purposes in IoT deployment. This is due to their powerful features compared to their counterparts of similar techniques such as barcodes. In contrast, radio-frequency identification systems suffer from various attacks and security threats. The wireless channel used for communication is responsible for the majority of these vulnerabilities. In this paper, we propose a new radio-frequency identification authentication protocol based on elliptic curve cryptography (ECC) to eliminate these vulnerabilities. In addition, we use elliptic curve Diffie-Hellman (ECDH) key agreement protocol to generate a temporary shared key used to encrypt the later transmitted messages. Our protocol achieves a set of security properties likes mutual authentication, anonymity, confidentiality, forward security, location privacy, resistance of man-in-the-middle attack, resistance of replay attack and resistance of impersonation attack. We implement our proposed protocol in real RFID system using Omnikey smartcard reader (Omnikey 5421) and NXP Java smartcards (J3A040). Implementation results shows that our proposed protocol outperform in term of time complexity as compared to other similar protocols and requires less number of operations. [ABSTRACT FROM AUTHOR]

The Internet of Thing (IoT) provides a wide range of services for human convenience by linking the connectivity from different platform devices. The IoT service holds an unlimited potentials, because the knowledge extracted from the big data can be applied to a huge variety service areas such as smart homes, smart buildings and transportations as well. There are lots of IoT service platforms developed by several companies. Except some platforms, most of them have been only focused on the connectivity. As a result, they have some limits for supporting an intelligent service. For the reason, we design the intelligent IoT common service platform architecture and implement the basic operations in this paper. We also develop the IoT Broker for providing the connectivity as well. We hereby verify the usefulness of the proposed service platform by implementing the IoT service on the platform. [ABSTRACT FROM AUTHOR]

Radio frequency identification (RFID) technology enables unique identification and tracking of the tag attached to an object. Widespread usage of RFID technologies in supply chain management (SCM) has drawn attention for developing security protocols to protect data stored in the tag. In SCM objects move from one place/department to another, the same RFID readers are not used throughout the supply chain. So, current reader delegates its access right to the new reader. When an object is moved inside the organization, delegation takes place between the readers. Many of the existing delegation protocols use trusted third party (TTP), which is practically difficult to incorporate or requires a keyed hash function/symmetric key encryption to be executed in the RFID tag, whereas tags are computationally intensive. Our work aims to simplify the delegation process by removing the usage of a TTP as well as eliminating reader-to-reader communication which avoids fixing the reader sequence in advance. Also, it preserves the security and privacy requirements for cloud-based applications. The proposed protocol withstands many attacks like tracing attack, tag impersonation attack, reader impersonation attack, and privacy attack. The proposed protocol not only resists the above-mentioned attacks but also achieves mutual authentication, anonymity property, and forward/backward secrecy. The proposed protocol is analyzed formally using GNY logic, which ensures that the protocol achieves mutual authentication. Performance analysis is carried out and it shows that our protocol is relatively better than the existing related schemes with respect to tag computation and communication cost. [ABSTRACT FROM AUTHOR]

An opportunistic network is a wireless ad hoc network that has frequently intermittent connectivity due to nodes’ mobility. These spare, unpredictable networks aim to solve the prolonged delay paths by a store-carry-forward scheme. It is difficult to determine the appropriate nodes to forward the messages since there are few opportunistic contacts. The nodes might decide based on the obtained data of the network as a guide to reach a destination. The aforementioned technique is not helpful in case the rate of change in the network topology is higher than the rate of data gathering due to usage restrictions and uncertain available information/knowledge of the future contacts. In this paper, to cope with the challenges imposed by the un-deterministic environment, a risk assessment strategy is considered to evaluate the short and long-term impact of each decision to find the optimal node/paths. This routing scheme can take advantage of the unanticipated connection to make the routing more flexible in short time and with less buffer usage. Our proposed risk assessment algorithms that are based on MALP are mixed with the knowledge about buffer management and network capacity. The prioritized messages to be disseminated as well as better decision to take a risk are the main contributions of this paper. Moreover, the self-adaptive threshold, distributed PID controller, is considered to tackle different threshold levels for each node individually. Numerical results prove that the proposed method drastically increases the delivery ratio and also minimizes the risk of exceeding resource consumption and packet loss. [ABSTRACT FROM AUTHOR]

Radio Frequency IDentification (RFID) is used in many applications such as access control, transport, ticketing and contactless payment. The full-fledged High Frequency (HF) tags are the most popular RFID tags for these applications that require relatively high cost security operations. However, these HF tags are threatened by many passive attacks such as eavesdropping, desynchronization and ElectroMagnetic (EM) Side Channel Attacks (SCA). In this article, we propose the implementation and the validation of a full-fledged HF tag architecture using an enhanced mutual authentication protocol. This is achieved using a FPGA platform. Security analysis against Electromagnetic Attack (EMA) and desynchronization attacks on the original protocol are presented. Then enhancements at the protocol level are proposed to overcome these attacks. The implementation of these security enhancements shows a low overhead (+22 LUTs) compared to previous existing security hardware solutions (+598 LUTs). [ABSTRACT FROM AUTHOR]

The election model can be used as a composing element to solve many practical problems such as mutual exclusion, consensus problem and reliable broadcasting in which a control function would be useful. This model has been deeply examined in the study group since the motive for this much interest is that networked computer system paradigms require a coordinator such as leader. In spite of its importance, there is only a few study that has been contributed to this coordinator election model in an ad hoc distributed system. Mobile distributed computing systems are more inclined to faults than traditional computer systems. To build an election protocol in such a mobile computing environment is not trivial. Because it is difficult task to choose a unique process from a group of mobile processes as a coordinator in spite of failures or disconnections of mobile processes. In this paper, we present an election protocol in mobile ad hoc distributed systems and we discuss some simulation results. [ABSTRACT FROM AUTHOR]

An improved protocol with a key agreement authentication using parallel Pollard rho algorithm for electronic payment system is proposed in this paper. The protocol employs a two step of key agreement and authentication with parallel Pollard rho and encryption of transaction information using Elliptic Curve Digital Signature Algorithm (ECDSA). Pollard rho was used in parallel as a key calculator that measures attack on discrete logarithm problem (DLP) of three main e-payment parties, namely customer, merchant and bank. Customers card information was used to infer the discrete logarithm problem which in turn was reused by the merchant and bank. The ECDSA was applied to encrypt information, resulting in a combination of the summation of participatory key, l. The length l serves as a diversion against intruders’ attempt to guess the DLP. The result shows that the protocol ensured higher security within a shorter period of time in comparison with others in the literature. [ABSTRACT FROM AUTHOR]

In a multi-server authentication environment, a user only needs to register once at a central registration place before accessing the different services on the different registered servers. Both, from a user point of view as for the management and maintenance of the infrastructure, these types of environments become more and more popular. Smartcard- or smartphone-based approaches lead to more secure systems because they offer two- or three-factor authentication, based on the strict combination of the user’s password, the user’s biometrics and the possession of the device. In this paper, we propose an efficient anonymous authentication protocol in multiple server communication networks, called the EAAM protocol, which is able to establish user anonymity, mutual authentication, and resistance against known security attacks. The novelty of the proposed scheme is that it does not require a secure channel during the registration between the user and the registration center and is resistant to a curious but honest registration system. These features are established in a highly efficient way with the minimum amount of communication flows between user and server during the establishment of the secret shared key and by using light-weight cryptographic techniques such as Chebyshev chaotic map techniques and symmetric key cryptography. The performance and security of the protocol are analyzed and compared with the latest new proposals in this field. [ABSTRACT FROM AUTHOR]

Software-defined network (SDN) has had the evolution of the current network with the aim of removing its restrictions so that the data plane has been separated from its control plane. In the architecture of the SDN, the most controversial device is the OpenFlowSwitch in that in the OpenFlowSwitch, it is packets which are processed and investigated. Now, OpenFlow Switch versions 1.0 and 1.1 have been implemented on hardware platforms and support limited specifications of the OpenFlow. The present article is to design and implement the architecture of the OpenFlow v1.3 Switch on the Virtex®-6 FPGA ML605 board because the FPGA platform has high flexibility, processing speed and reprogrammability. Although little research investigated performance parameters of the OpenFlow Switch, in the present study, the OpenFlow system (switch and controller) is to be implemented on the FPGA via the VHDL on the one hand, and performance parameters of the OpenFlow Switch and its stimulation performance is to be investigated via the ISE design suite on the other hand. In addition to enjoying high flexibility, this architecture has a consumer hardware at the level of other start-ups. The main advantage of the proposed design is that it increases the speed of packet pipeline processing in flow tables switch. Besides, it supports the features of the OpenFlow v1.3. Its parser supports 40 packet headers in the network and provides the possibility of switch development for next versions of the OpenFlow as easily as possible. [ABSTRACT FROM AUTHOR]

Intelligent transportation systems seek to maximize the usage of data generated by the vehicles for road users assistance. Combining vehicular ad hoc network with cloud computing makes it easy for the fixed infrastructures along the roads to collect and analyze safety messages for the benefits of the road users and the transportation authorities. However, security features need to be fully assessed before the adoption of such applications. In this paper, we present a secure vehicle traffic data dissemination and analysis in vehicular cloud computing in which the identity privacy of the vehicles and their generated message is achieved through pseudonym techniques. We use anonymous credential to guarantee the authorization of service demanding vehicles. ID-based signature is applied to assure the authentication of the vehicles for given pseudonyms. The efficient verification of signature on the message and revoked vehicles are achieved through batch verification technique and pseudonymous revocation list, respectively. Traffic estimation methods are applied to mine coarse-grained data collected by road side infrastructures. The merits of the proposed protocol compared to existing ones are shown through extensive simulations. [ABSTRACT FROM AUTHOR]

To support communications of a large number of deployed devices while guaranteeing limited signaling load, low energy consumption and high reliability, future cellular systems require efficient random access protocols. However, how to address the collision resolution at the receiver is still the main bottleneck of these protocols. The network-assisted diversity multiple access (NDMA) protocol solves the issue and attains the highest potential throughput at the cost of keeping devices active to acquire feedback and repeating transmissions until successful decoding. In contrast, another potential approach is the feedback-free NDMA (FF-NDMA) protocol, in which devices do repeat packets in a pre-defined number of consecutive time slots without waiting for feedback associated with repetitions. Here, we investigate the FF-NDMA protocol from a cellular network perspective in order to elucidate under what circumstances this scheme is more energy efficient than NDMA. We characterize analytically the FF-NDMA protocol along with the multipacket reception model and a finite Markov chain. Analytic expressions for throughput, delay, capture probability, energy, and energy efficiency are derived. Then, clues for system design are established according to the different trade-offs studied. Simulation results show that FF-NDMA is more energy efficient than classical NDMA and HARQ-NDMA at low signal-to-noise ratio (SNR) and at medium SNR when the load increases. [ABSTRACT FROM AUTHOR]

This paper proposes a large-scale wireless powered communication network (WPCN), which consists of a hybrid access point (H-AP) and numerous nodes. The H-AP broadcasts energy to all nodes, and the nodes harvest the energy and then use the harvested energy to transmit information. For the large-scale WPCN, we also propose a novel hybrid multiple access protocol, termed hybrid multiple access-based dual harvest-then-transmit. The proposed protocol utilizes both time division multiple access (TDMA) and carrier-sense multiple access (CSMA), in order to deal with various traffic patterns and transmission reliability of different applications in large-scale networks. We consider a dual wireless energy transfer (WET) at the H-AP. The main WET is performed in TDMA and the other WET is performed at space holes in CSMA, to increase the channel utilization and harvested energy. For the considerations, we study the sum-throughput maximization in the large-scale WPCN based on hybrid multiple access-based dual harvest-then-transmit. Simulation results show that the proposed protocol outperforms the conventional protocol in large-scale WPCN. [ABSTRACT FROM AUTHOR]

Recently, Tewari and Gupta proposed a ultra-lightweight mutual authentication protocol in IoT environments for RFID tags. Their protocol aims to provide secure communication with least cost in both storage and computation. Unfortunately, in this paper, we exploit the vulnerability of this protocol. In this attack, an attacker can obtain the key shared between a back-end database server and a tag. We also explore the possibility in patching the system with some modifications. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is a new technology, which enables objects to exchange data via the internet network. One part of the infrastructure of IoT is Radio Frequency Identification (RFID). One way to fortify the system and prevent it against an unauthorized access is an authentication process. A grouping proof protocol is a protocol by which a reader authenticates two or more tags simultaneously in an authentication process. In this paper, we present a novel scalable grouping proof protocol. Since scalability is a challenge in grouping proof protocol, to solve the scalability problem in the proposed protocol, the reader broadcasts the messages and the tags respond to it independently. In terms of the performance, we use a 64-bit lightweight Pseudo-Random Number Generator (64-PRNG) function, which meets the needs of low-power and low-cost systems. In addition, the security analysis results prove that the proposed protocol is resistant against RFID threats and provides an acceptable security level and low computation cost. [ABSTRACT FROM AUTHOR]

In recent years, RFID (radio-frequency identification) systems are widely used in many applications. One of the most important applications for this technology is the Internet of things (IoT). Therefore, researchers have proposed several authentication protocols that can be employed in RFID-based IoT systems, and they have claimed that their protocols can satisfy all security requirements of these systems. However, in RFID-based IoT systems we have mobile readers that can be compromised by the adversary. Due to this attack, the adversary can compromise a legitimate reader and obtain its secrets. So, the protocol designers must consider the security of their proposals even in the reader compromised scenario. In this paper, we consider the security of the ultra-lightweight RFID mutual authentication ( ULRMAPC) protocol recently proposed by Fan et al. They claimed that their protocol could be applied in the IoT systems and provide strong security. However, in this paper we show that their protocol is vulnerable to denial of service, reader and tag impersonation and de-synchronization attacks. To provide a solution, we present a new authentication protocol, which is more secure than the ULRMAPC protocol and also can be employed in RFID-based IoT systems. [ABSTRACT FROM AUTHOR]

Mobile ad hoc networks (MANETs) are mobile networks, which are automatically outspread on a geographically limited region, without requiring any preexisting infrastructure. Mostly, nodes are both self-governed and self-organized without requiring a central monitoring. Because of their distributed characteristic, MANETs are vulnerable to a particular routing misbehavior, called wormhole attack. In wormhole attack, one attacker node tunnels packet from its position to the other attacker nodes. Such wormhole attack results in a fake route with fewer hop count. If source node selects this fictitious route, attacker nodes have the options of delivering the packets or dropping them. For this reason, this paper proposes an improvement over AODV routing protocol to design a wormhole-immune routing protocol. The proposed protocol called defending against wormhole attack (DAWA) employs fuzzy logic system and artificial immune system to defend against wormhole attacks. DAWA is evaluated through extensive simulations in the NS-2 environment. The results show that DAWA outperforms other existing solutions in terms of false negative ratio, false positive ratio, detection ratio, packet delivery ratio, packets loss ratio and packets drop ratio. [ABSTRACT FROM AUTHOR]

Maintaining coherence across hundreds or even thousands of cores is not an easy task. Among all of the proposed solutions until now, directory-based cache coherence has been advocated as the most feasible way of beating the scalability hurdles that arise at such large scale. Thanks to the knowledge accumulated during the last four decades, there is general consensus on the impact of most of the design aspects of directory coherence on performance, energy consumption and cost. However, there is one subtle design point for which we have observed some divergences in contemporary research works on cache-coherent multicores. Specifically, while some recent works assume a silent replacement policy for evictions of clean data in the last-level private caches, others implement just the opposite that we call a noisy replacement policy, and even others do not mention how these evictions are managed. In this work, we put this important aspect into the spotlight, demonstrating that the way in which evictions of clean data are managed can have important influence on the performance and energy consumption of a directory-based cache coherence protocol. We show that the noisy replacement policy leads to a significant increase in the total traffic (around 20% in several cases, 9.6% on average) compared with the silent policy. Given the important fraction of the total power budget that the on-chip interconnection network of future manycores is expected to consume, assuming the silent replacement policy for clean data will lead to non-negligible energy savings. Moreover, and what is more important, we have observed that depending on the particular directory structure used, assuming silent replacements could affect performance or not. This means that the use of noisy replacements is not justified in all cases, since it would increase unnecessarily network traffic without leading to any performance advantages. [ABSTRACT FROM AUTHOR]

The design and verification of distributed software systems is often hindered by their ever-increasing complexity and their asynchronous operational semantics. This article considers choreography specifications for distributed systems to reduce that complexity. We use labelled state-transitions systems as ground model for both choreographies and the corresponding distributed systems. Based on Event-B method, we propose a stepwise correct-by-construction model to build asynchronous distributed systems which a priori realise their choreographies. We rely on a sufficient and necessary realisability condition and we apply several refinement steps w.r.t. that condition to generate the distributed peers. The first refinement returns peer behaviours obtained by synchronous projection. The previously computed system is then refined into its asynchronous version using unbounded FIFO buffers. We prove, thanks to invariant preservation, that a sequence of exchanged messages is preserved at each refinement step. We provide a formalised proof of a realisability algorithm for deterministic choreographies. Besides that, our contribution is twofold: the approach is a priori and the problackposed solution scales up to any number of peers communicating with each other. [ABSTRACT FROM AUTHOR]

One of the main challenges in video transmission is understanding and adapting to the varying network bandwidth. The traditional approach of bandwidth estimation is not accurate as there are many factors like congestion that can delay the arrival rate of the ping packet which may lead to a misconception that the bandwidth was low. Thus, the better approach to this problem will be to estimate the link conditions based on the buffer fullness. In this paper, a new system to support streaming of live and stored video through wireless network is proposed which is based on adaptive playback buffer management on the top of HTTP at the client. The buffer fullness is treated as a direct state variable that reflects the fluctuation of the network bandwidth. The buffer fullness estimation predicts the buffer status at a point in the future based on observations of the buffer over a stipulated period of time. The proposed algorithm uses non-linear exponential non-parametric regression for computing the decision parameter. A feedback message is then sent to the server in order to change the quality of the video stream for smoother video play at the client side. The synchronized update and feedback between the server and clients is achieved using HTTP protocol. During the experimentation with live video streaming, the proposed algorithm shows an improvement of 24.48% in average peak signal-to-noise ratio and 6.63% in average structural similarity index against the buffer underflow probability algorithm. [ABSTRACT FROM AUTHOR]

For many years, the IEEE 802.11 distributed coordination function (DCF) has been widely used as a dominant medium access control (MAC) protocol in wireless networks and a large number of works have been done for analyzing and improving its performance. In our earlier work, as a substitute of the IEEE 802.11 DCF, a simple MAC protocol, called the renewal access protocol (RAP), is proposed. The RAP adopts all of the legacy 802.11 standard but the backoff stage feature. Each terminal selects its backoff counter value from a fixed sized window according to a priori given selection distribution in the RAP, regardless of the packet transmission result. It is shown that, if a Poisson distribution is used as the selection distribution, then the resulting RAP achieves high short-term fairness as well as optimal throughput. In this work, we analyze the relation between delay performance and the selection distribution of the RAP. With the help of effective bandwidth theory, we derive the conditions for the selection distribution of the RAP that optimizes the queue overflow probability. We also construct the delay optimal selection distribution satisfying the optimal conditions for throughput and delay. However, we show that the use of the delay optimal selection distribution results in an extremely slow convergence to steady state compared with that of the Poisson selection distribution. Moreover, we show that the Poisson selection distribution provides near-optimal delay performance. Therefore, we conclude that the use of a Poisson selection distribution is still recommended even from the delay perspective. [ABSTRACT FROM AUTHOR]

Population protocols (Angluin et al. in PODC, 2004) are a formal model of sensor networks consisting of identical mobile devices. Two devices can interact and thereby change their states. Computations are infinite sequences of interactions satisfying a strong fairness constraint. A population protocol is well specified if for every initial configuration C of devices, and every computation starting at C, all devices eventually agree on a consensus value depending only on C. If a protocol is well specified, then it is said to compute the predicate that assigns to each initial configuration its consensus value. While the computational power of well-specified protocols has been extensively studied, the two basic verification problems remain open: Is a given protocol well specified? Does a given protocol compute a given predicate? We prove that both problems are decidable by reduction to the reachability problem of Petri nets. We also give a new proof of the fact that the predicates computed by well-defined protocols are those definable in Presburger arithmetic (Angluin et al. in PODC, 2006). [ABSTRACT FROM AUTHOR]

RFID applications such as monitoring an object for a long time need to identify tags repeatedly within the scope of the reader. Re-identification process can be improved using the information obtained from the previous tag identification process. Couple-resolution blocking (CRB) protocol utilizes the blocking technique that prevents staying tags from being collided by newly arriving tags. Staying tags can be efficiently re-identified by utilizing the retained information. After staying tags are separately all identified, arriving tags are identified. In this paper, we argue that CRB may work more poorly than other protocols which do not consider the repeated tag identification, such as query tree (QT) and collision tree (CT) protocol, when only few tags stay. To tackle the problem, we propose an adaptive CRB (ACRB) protocol. In ACRB, the reader estimates the tag staying ratio during the re-identification process for staying tags. If the estimated ratio is lower than a certain threshold, the blocking technique is immediately abandoned. Instead, staying tags and arriving tags are identified together without considering the retained information. In addition, we propose to improve CRB further using CT protocol, instead of QT protocol. Through computer simulation, we show that ACRB improves the identification efficiency of CRB, especially when the tag staying ratio is low. [ABSTRACT FROM AUTHOR]

Simulation is often used in order to evaluate the behavior and the performance of computing systems. Specifically, in the field of high-performance interconnection networks for HPC clusters the simulation has been extensively considered to verify and validate network operation models and to evaluate their performance. Nevertheless, experiments conducted to evaluate network performance using simulation tools should be fed with realistic network traffic from real benchmarks and/or applications. This approach has grown in popularity because it allows to evaluate the simulation model under realistic traffic situations. In this paper, we propose a family of tools for modeling realistic workloads which capture the behavior of MPI applications into self-related traces called VEF traces. The main novelty of this approach is that it replays the MPI collective operations with their corresponding messages, offering an MPI message-based task simulation framework. The proposed framework neither provides a network simulator nor depends on any specific simulation platform. Besides, this framework allows us to use the generated traces by any third-party network simulator working at message level. [ABSTRACT FROM AUTHOR]