Problem statement: This study presents a source based reactive protocol called “Energy Aware Multiple Constraints QoS Routing Protocol with Dynamic Mobility Prediction (EMQRPDM)” for MANET. It is an enhanced version of our previous protocol called “Power aware multiple QoS constraints routing protocol with mobility prediction (PMQRPMP)”. It addresses the issues such as routing, mobility and pow...

Distributed hash tables have been proposed as a way to simplify the construction of large-scale distributed applications (e.g. [1, 6]). DHTs are completely decentralized systems that provide block storage on a changing collection of nodes spread throughout the Internet. Each block is identified by a unique key. DHTs spread the load of storing and serving blocks across all of the active nodes an...

P2P architecture is a viable option for enterprise backup. In contrast to dedicated backup servers, nowadays a standard solution, making backups directly on organization’s workstations should be cheaper as existing hardware is used; more efficient as there is no single bottleneck server; and more reliable as the machines can be geographically dispersed. We present an architecture of a p2p backu...

Many routing protocols have been designed for Ad Hoc networks. However, most of these kinds of protocols are not able to react fast enough to maintain routing. This paper presents a Proposed Routing Protocol (PRP) that repairs the broken route by using information provided by nodes overhearing the main route communication. When links go down, our protocol intelligently replaces these failed lin...

This paper presents a reliable multipath routing (RMR) protocol to improve routing performance for ad hoc networks. The protocol uses a new loop-free route update scheme to accept backup paths that are longer-lived. Power information is also utilized so routing paths do not include nodes that are going to run out of battery. Furthermore, a dynamic route maintenance mechanism was developed to er...

Application Level Multicast is a promising approach to overcome the deployment problems of IP level multicast by establishing delivery trees using overlay links among end systems. This paper presents algorithms to support traffic engineering, to improve the reliability of multicast delivery, and to facilitate secure group communications. First, we introduce the so-called backup multicast tree a...

Erasure coding is a storage-efficient alternative to replication for achieving reliable data backup in distributed storage systems. During the storage process, traditional erasure codes require a unique source node to create and upload all the redundant data to the different storage nodes. However, such a source node may have limited communication and computation capabilities, which constrain t...

The reliability of wireless sensor networks is significant in certain applications, especially the reliable routing. Most existing routing protocols use multi-paths to improve routing reliability. However, multi-paths waste a large amount of energy to obtain redundancy. This is not an optimal option for sensor nodes with limited energy. In this paper, a novel clustering-based reliable multi-hop...

As data have been growing rapidly in data centers, deduplication storage systems continuously face challenges in providing the corresponding throughputs and capacities necessary to move backup data within backup and recovery window times. One approach is to build a cluster deduplication storage system with multiple deduplication storage system nodes. The goal is to achieve scalable throughput a...

This letter studies the task offloading in reputation-based consortium blockchain networks, where tasks are transmitted to Edge Computing Servers (ECSs) due limited resources. We propose a novel Delegated Proof of Stake (DPoS) consensus mechanism which validation nodes (including active and backup nodes) voted based on their reputation. The incentive identifies reputation delay as two major fac...