Related papers: Selecting Relay Nodes Based on Evaluation Results …
Energy harvesting technique is a potential way for relay node energy supply in cooperative networks in terms of deployment flexibility and maintain charge reduction. Unlike traditional power source, relay node in this case may run out of…
In order to satisfy the delay requirements of telecommunication systems, in this paper, we present a cooperative network with the short packet transmission in the Rayleigh fading channel. The desired relay can be implemented as a two-way…
In this paper, relay selection is considered to enhance security of a cooperative system with multiple threshold-selection decode-and-forward (DF) relays. Threshold-selection DF relays are the relays in which a predefined signal-to-noise…
Recommender systems are a vital tool that helps us to overcome the information overload problem. They are being used by most e-commerce web sites and attract the interest of a broad scientific community. A recommender system uses data on…
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and…
Currently the Peer to Peer computing paradigm rises as an economic solution for the large scale computation problems. However due to the dynamic nature of peers it is very difficult to use this type of systems for the computations of real…
Network embedding has recently emerged as a promising technique to embed nodes of a network into low-dimensional vectors. While fairly successful, most existing works focus on the embedding techniques for static networks. But in practice,…
Voting algorithms have been widely used as consensus protocols in the realization of fault-tolerant systems. These algorithms are best suited for distributed systems of nodes with low computational power or heterogeneous networks, where…
The vertical handover decision is considered an NP-Hard problem. For that reason, a large variety of vertical handoff algorithms (VHA) have been proposed to help the user to select dynamically the best access network in terms of quality of…
This paper presents ZePoP, a leader election protocol for distributed systems, optimizing a delay-based closeness centrality. We design the protocol specifically for the Peer to Peer(P2P) applications, where the leader peer (node) is…
This paper investigates the secure communication in a two-hop cooperative wireless network, where a buffer-aided relay is utilized to forward data from the source to destination, and a passive eavesdropper attempts to intercept data…
Nowadays distributed computing approach has become very popular due to several advantages over the centralized computing approach as it also offers high performance computing at a very low cost. Each router implements some queuing mechanism…
Peer to peer (P2P) networks are an overlay on IP network of the internet and they can shape the future of computing by their involvement in distributed systems with the increased of use of low priced personal computers to form big clusters…
In this paper, we analyze the delay performance of an ad-hoc dynamic network where random network coding and broadcast are used in combination to distribute the messages. The analysis is comprehensive for that we consider M-to-N broadcast…
In this paper, we analyze a round-based pricing scheme that encourages favorable behavior from users of real-time P2P applications like P2PTV. In the design of pricing schemes, we consider price to be a function of usage and capacity of…
Relays in cellular systems are interference limited. The highest end-to-end sum rates are achieved when the relays are jointly optimized with the transmit strategy. Unfortunately, interference couples the links together making joint…
Consider the problem of a multiple access channel in a time dependent environment with a large number of users. In such a system, mostly due to practical constraints (e.g., decoding complexity), not all users can be scheduled together, and…
In the context of an efficient network traffic engineering process where the network continuously measures a new traffic matrix and updates the set of paths in the network, an automated process is required to quickly and efficiently…
In this paper, we analyze the performance of cooperative transmissions in wireless ad hoc networks with random node locations. According to a contention probability for message transmission, each source node can either transmits its own…
We consider the problem of diagnosing faults in a system represented by a Bayesian network, where diagnosis corresponds to recovering the most likely state of unobserved nodes given the outcomes of tests (observed nodes). Finding an optimal…