Proposed Hybrid Protocol Research Articles

Building IPv6 addressing scheme using Hybrid Duplicate Address Detection to prevent Denial of Service Attack

Internet Protocol version 6 (IPv6) address configuration is needed to meet the needs of current portable devices and wearable applications, where each device needs its own unique identification number. High complexity in Wireless Sensor Network (WSN) and Internet of Things (IoT) environments has increased challenges, such as low energy consumption and high overhead in IPv6 address configuration. The proposed IPv6 generation is based on a hybrid mathematical approach that retains the IP address’s confidentiality and prevents Denial of Service (DoS) attacks from new and existing nodes in the network. In this paper, the proposed hybrid protocol for DoS attacks from new and existing nodes is analyzed. It is evident from the results that the rate of successful configuration, overhead, and energy consumption is found to be better than the existing approach, namely, Programming Protocol-independent Packet Processors Duplicate Address Detection (P4DAD), match prevention technique, etc.

Hybrid protocols for leader–follower consensus of multi-agent systems with distributed delays

The primary focus of this paper is to investigate the leader–follower consensus problem of multi-agent systems (MASs) with discrete and distributed delays in complex domains. We propose a new hybrid consensus protocol that incorporates a continuous-time protocol based on the communication topology of follower agents, along with an event-triggered pinning impulsive control (ETPIC) protocol. Using the Lyapunov functional method in complex domains, we establish delay-dependent sufficient conditions for leader–follower consensus of delayed complex-valued MASs. Our results demonstrate that the proposed hybrid protocol can ensure leader–follower consensus even when the size of discrete and distributed delays exceeds the length of intervals between two consecutive triggering instants. Furthermore, we prove that the Zeno phenomenon can be excluded under the proposed control protocol. In particular, as a special case, we derive the leader–follower consensus result for delay-free complex-valued MASs based on a reduced hybrid control protocol. Two numerical examples are presented to validate the effectiveness of the proposed control scheme.

Leader–follower synchronization of networked multi‐agent systems via hybrid protocols

AbstractThis paper studies the leader–follower synchronization problem of complex‐valued networked multi‐agent systems with time‐delay. A new hybrid protocol including a continuous‐time protocol which is based on the interaction topology of follower agents and a pinning delayed impulsive control protocol is proposed. By employing the Lyapunov functional method in complex domains and the mathematical analysis technique, several delay‐dependent leader–follower synchronization criteria are established that take into account various sizes of delays. Particularly, our result shows that leader–follower synchronization of delayed complex‐valued networked multi‐agent systems can be achieved even if the proposed hybrid protocol is being subject to relatively large impulse delays. A numerical example is provided to illustrate the effectiveness of the theoretical results.

Random Access Mechanism Enhancement Based on a Hybrid ALOHA Protocol Using an Analytical Model

In this paper, we present a new MAC (Medium Access Control) protocol, called Hybrid ALOHA (H-ALOHA), which is a combination of two existing protocols: Pure ALOHA (P-ALOHA) protocol and Slotted ALOHA (S-ALOHA) protocol. The idea behind it is to design a MAC protocol that could meet some specific requirements in wireless networks, such as reducing energy consumption, delay minimization, and increasing the throughput. To the best of our knowledge, the S-ALOHA protocol is an improved version of P-ALOHA. However, during one single transmission scenario, P-ALOHA works better than S-ALOHA in terms of energy consumption and packet delivery. Motivated by that fact, we combine these two protocols, resulting in a hybrid ALOHA. A finite-state Markovian model is proposed to study the steady-state performance of H-ALOHA including normalized throughput, backlogged throughput, access delay, backlogged delay, and energy consumption. The proposed hybrid protocol has been compared with the S-ALOHA protocol. The simulation results show that the proposed hybrid protocol outperforms all ALOHA protocols. On average, the proposed protocol outperforms the S-ALOHA protocol by 60% in terms of normalized throughput, by 15% in terms of access delay, and by 23% in terms of total energy consumed during the transmission process.

Secure Cloud Data Storage System using Hybrid Paillier-Blowfish Algorithm

Cloud computing utilizes enormous clusters of serviceable and manageable resources that can be virtually and dynamically reconfigured in order to deliver optimum resource utilization by exploiting the pay-per-use model. However, concerns around security have been an impediment in the extensive adoption of the cloud computing model. In this regard, advancements in cryptography, accelerated by the wide usage of the internet worldwide, has emerged as a key area in addressing some of these security concerns. In this document, a hybrid cryptographic protocol deploying Blowfish and Paillier encryption algorithms has been presented and its strength compared with the existing hybrid Advanced Encryption Standard (AES) and Rivest Shamir Adleman (RSA) techniques. Algorithms for secure data storage protocol in two phases have been presented. The proposed hybrid protocol endeavors to improve the power of cloud storage through a decrease in computation time and cipher-text size. Simulations have been carried out with Oracle Virtual Box and Fog server used on an Ubuntu 16.04 platform. This grouping of asymmetric and homomorphic procedures has demonstrated enhanced security. Compression usage has helped in decreasing the storage space and computation time. Performance analysis in terms of computation overhead and quality of service parameters like loads of parameters with and without attacks, throughput, and stream length for different modes of block cipher mode has been carried out. Security analysis has been carried out by utilizing the Hardening Index as an audit parameter using Lynis 2.7.1. Similarly, for halting the aforementioned approaches and for regulating traffic, firewall protection has been generated in the chosen hybrid algorithms. Finally, enhancements in the performance of the Paillier and Blowfish hybrid scheme with and without compression compared to the existing schemes using RSA and AES procedures have been demonstrated.

Evaluation Performance of Hybrid MAC Protocol in Wireless Sensor Network

The implementation Wireless Sensor Network (WSN) in generally can be applied in any environment where the important MAC layer plays vital. Researchers discover that the major power consumption of wireless sensor network nodes are related to their radio transceiver’s activities on MAC. This paper explains the implementation expected systeme that can be used in the WSN system. It focuses on the comparison some MAC protocol in order to discover the performance of each protocol. Therefore, this paper is benchmarking with other MAC protocol to identify the capability of the proposed hybrid protocol in term of some parameter. Then, this paper determines the proposed hybrid protocol that is camparised withother protocol based on evaluation of some parameter choosen.

On prioritizing on-time arrivals in an outpatient clinic

ABSTRACTNon-punctual medical clinic arrivals disrupt operations, create inefficiencies, and decrease service quality. This quality improvement project examined the effects of early and late patient arrivals. We explored different queuing discipline protocols, designed to reward and to promote on-time arrival behaviors, by optimizing patient schedule management within a given clinic's workday. The goal of our study was to design a queuing system that prioritizes patients who arrive on time for their scheduled appointments, before those who are late or very early, with the assumption that a patient who arrives late or very early disrupts a clinic's desired scheduling flow. Based on data collected in a cardiology clinic at the Veterans Administration Pittsburgh Healthcare System, four simulation models were built to reflect current clinic queuing protocols, parameterizing various percentages of empty clinic appointment slots, and set to a range of acceptable patient no-show thresholds. Multi-sample statistical comparisons highlight a simulation model, utilizing an M/G/1 queuing protocol, to demonstrate significant improvements over prior models. Our proposed Hybrid protocol rewards on-time arrivals, and penalizes patients who arrive late or very early for their scheduled appointments. Clinical patient management policies that reward patients who arrive on time or slightly early may encourage patients to arrive on time for scheduled appointments and improve overall service efficiency.

Hybrid S-ALOHA/TDMA Protocol for LTE/LTE-A Networks with Coexistence of H2H and M2M Traffic

The machine-to-machine (M2M) communication is featured by tremendous number of devices, small data transmission, and large uplink to downlink traffic ratio. The massive access requests generated by M2M devices would result in the current medium access control (MAC) protocol in LTE/LTE-A networks suffering from physical random access channel (PRACH) overload, high signaling overhead, and resource underutilization. As such, fairness should be carefully considered when M2M traffic coexists with human-to-human (H2H) traffic. To tackle these problems, we propose an adaptive Slotted ALOHA (S-ALOHA) and time division multiple access (TDMA) hybrid protocol. In particular, the proposed hybrid protocol divides the reserved uplink resource blocks (RBs) in a transmission cycle into the S-ALOHA part for M2M traffic with small-size packets and the TDMA part for H2H traffic with large-size packets. Adaptive resource allocation and access class barring (ACB) are exploited and optimized to maximize the channel utility with fairness constraint. Moreover, an upper performance bound for the proposed hybrid protocol is provided by performing the system equilibrium analysis. Simulation results demonstrate that, compared with pure S-ALOHA and pure TDMA protocol under a target fairness constraint of 0.9, our proposed hybrid protocol can improve the capacity by at least 9.44% when λ1:λ 2=1:1 and by at least 20.53% when λ1: λ2=10:1, where λ1:λ2 are traffic arrival rates of M2M and H2H traffic, respectively.

Optimal Energy Harvesting Protocols for Wireless Relay Networks

In this paper, we consider a relay network over a flat-fading channel, where the relay has no fixed power supply and thus needs to replenish energy via wireless energy harvesting (EH) from the signals transmitted by the source. We propose a novel hybrid protocol, which is a combination of existing EH protocols, such as power splitting (PS) and time switching (TS). We formulate the optimization problems and derive some explicit results. In particular, we derive the optimal PS and TS ratios at the relay for all three EH protocols to achieve the maximum throughput for information transfer from the source to the destination for both decode-and-forward and amplify-and-forward relaying schemes. We show that the proposed hybrid protocol outperforms both PS and TS protocols.

Thread Progress Aware Coherence Adaption for Hybrid Cache Coherence Protocols

For chip multiprocessor systems (CMPs), the interference on shared resources such as on-chip caches typically leads to unbalanced progress among threads. Because of the inherent synchronization primitives, such as barriers and locks, cores running fast threads have to waste precious cycles to wait for cores with slow progress, which leads to performance and energy inefficiency. For the purpose of improving performance and reducing energy consumption, this paper proposes to adapt the cache coherence policy for threads according to their delay-tolerant levels. Specifically, this paper proposes Thread progrEss Aware Coherence Adaption (TEACA) which utilizes the thread progress information as hints for coherence adaption. TEACA dynamically utilize the memory system statistics to estimate the progress of threads. Based on the estimated thread progress information, TEACA categorizes threads into leader threads and laggard threads. The thread categorization decisions are then leveraged for efficient coherence adaption on CMP systems supporting hybrid coherence protocols. Experimental results show that, on a 64-core CMP system, TEACA outperforms directory protocol in application execution time and a recently proposed hybrid protocol in both application execution time and energy dissipation.

고 가용성 분산 시스템을 위한 효율적인 하이브리드 복제 프로토콜

분산 시스템에서 가용성을 높이고 전체 시스템의 성능을 향상시키기 위해 데이터는 여러 노드에 중복하여 저장된다. 여기서는 전역적 접근제어를 위해서 읽기/쓰기 동작을 수행하는데 필요한 노드의 집합을 정의하는 Quorum 프로토콜이 존재한다. Quorum 프로토콜을 사용하는 대표적인 복제 프로토콜인 Tree Quorum 프로토콜은 트리의 높이가 증가할수록 노드의 수가 기하급수적으로 증가하고, Grid 프로토콜은 노드에 장애가 발생하지 않아도 언제나 같은 읽기/쓰기 비용을 갖는다는 단점을 갖고 있다. 따라서, 본 논문에서는 기존 프로토콜의 장점을 가지면서 단점을 해결할 수 있는 새로운 하이브리드 프로토콜을 제안한다. 제안된 하이브리드 프로토콜은 전체적으로는 트리 구조를 가지면서 각 레벨에서는 그리드의 열과 같은 구조를 가짐으로써 노드에 장애가 없을 때에는 Tree Quorum 프로토콜과 같이 적은 동작 비용을 요구하며, 노드에 장애가 존재할 경우에도 기존 프로토콜에 비해 상대적으로 적은 동자 비용과 높은 가용성을 보인다. 그러므로 높은 데이터 가용성이 요구되는 서바이벌 스토리지 시스템에 효율적으로 적용 가능하다. 본 논문에서는 수학적 모델링을 통하여 제안된 프로토콜의 비용과 가용성을 평가하고, 시뮬레이션을 통해 응답시간과 처리율을 기존의 Tree quorum프로토콜과 비교한다. In distributed systems data are replicated and stored at several nodes to increase the availability and overall performance. Here Quorum protocol doffing a certain set of replicas required for read/write operation exists for global concurrency control. One of the representative replication Protocols - the Tree Quorum protocol - has a drawback of rapidly growing number of replicas as the level increases, while the Grid protocol requires the same operation cost even without any failure. In this paper, thus, we propose a new replication protocol called hybrid protocol which capitalizes the merits of the existing protocols and solves the problems of them at the same time. The proposed hybrid protocol has very low operation cost in the absence of failure like the tree quorum protocol, and has relatively lower operation cost and higher availability than existing protocols when failure occurs by employing tree architecture as the overall organization while each level of the tree is organized as a row of a grid architecture. It is thus effective to be applied to survival storage system. We conduct cost and availability analysis of the proposed protocol through mathematical modeling, and response time and throughput are compared with those of the Tree Quorum protocol through computer simulation.

Queueing analysis of a hybrid CSMA/CD and BTMA protocol with capture

A performance study of the access channel of a mobile, micro-cellular radio telephone network is presented. The access method used is a combination of the Carrier Sense Multiple Access with Collision Detection (CSMA/CD) and the Busy Tone Multiple Access (BTMA) protocols with modified access and back-off probabilities. Based on an imperfect channel and the likely low connectivity of the mobiles with the base station, two new, semi-Markov renewal models are constructed; the asynchronous time, infinite population model, and the synchronous time, finite population model. The latter uses the mini-slot property of the channel, and it is proven to have a matrix geometric representation. The analysis assumes that capture is due either to slow Rayleigh fading or to power level variations with the distances, and the corresponding capture probabilities are calculated analytically, or by using standard Monte Carlo simulation techniques. With the proposed hybrid protocol applied to both models when the capture is perfect, the performance is similar to the classic CSMA/CD, and thus it is better than the performance obtained by the ALOHA or CSMA algorithms with capture. Nevertheless, the power capture effect does not offer a similar improvement in the maximum achieved throughput, as in the cases of the ALOHA or CSMA contention based protocols. But, if capture due solely to slow fading is present, our hybrid model has considerably better performance than the corresponding CSMA (α = 0.01) and BTMA protocols. However, with the proposed algorithm the channel shows a bi-stable behaviour, unless the offered traffic is extremely low. The analysis allowed us to draw some very useful conclusions for both models developed. Thus, in the case of the synchronous time, finite population model and with respect to the throughput-delay performance, the most important parameters, including the attempt rate, the signal-to-noise ratio and the length of the successful and unsuccessful messages, are considered. For suitable parameter values, and independently of the attempt rate, the channel appears to have an acceptable operational point. In the case of the infinite model, interest has been given in real systems with NCFSK and CPSK modulations, operating in a slow Rayleigh fading environment. Note that if only power capture is present, the same model yields an upper bound on the throughput. The analysis shows that the maximum achievable throughput is obtained for the same value of traffic rate, independently of the packet length. Higher values of the average SNR leads the system to approach the nonfading case.