The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Interference forwarding by a relay enhances the interference level and enables the cancellation of the interference. If the interfering source to relay link is not strong, then the relay can decode a part of the interference and forward it to the destination, and the destination can cancel only that part of the interference. It is known as partial decode-and-forward (PDF) and partial interference...
Computing resources of Smart Space can be utilized to improve the spatial processing capabilities of other smart devices effectively. Multi-agent model based on UPnP (Universal Plug and Play) makes resource management agent discover computing resources dynamically and retrieve device information. SOA (Service-Oriented Architecture) based on WCF(Windows Communication Foundation) makes virtual services...
In this paper, we focus on improving the performance of a two-way relay network consisting of two end nodes and multiple relays. It is assumed that the system utilizes multiple access broadcast as the transmission protocol and decode and forward as the relaying protocol. The performance metric of the system is outage probability and we try to improve it by creating diversity gain and coding gain....
In this paper, we are interested in the optimal redistribution of the available budget in average transmit power per packet among potential packet transmission attempts for improved Automatic Repeat reQuest (ARQ) protocol. A conventional ARQ protocol was combined in [5], with both Adaptive Modulation and Coding (AMC) and Power Control (PC) to improve spectral efficiency, while satisfying an average...
The coherence directory in a chip-multiprocessor keeps track of each memory block inside the cache hierarchy and plays a significant role in offering a scalable shared memory abstraction in many-core systems. Multi-threaded applications typically require two types of directory entries, namely, limited pointer entries tracking a few sharers of a block and bitvector entries tracking larger number of...
Hierarchical address allocation and hierarchical routing design has long been suggested to reduce the forwarding information base (FIB) size in the Internet core. However, the hierarchical design is not put into practice. We implemented the hierarchical and automatic number allocation (HANA) protocol for allocation of IPv4 and IPv6 address spaces to autonomous systems (ASes) and the FIB size reduction...
The paper investigates the broadcast of n-layered source codes over a single-relay network using a half-duplex nonorthogonal amplify-forward (HD-NAF) relaying protocol. Taking the distortion exponent, (i.e., the SNR exponent of the average end-to-end distortion) as the performance metric, we consider system operation in the high SNR regime. We first prove that the HD-NAF relay network with an n-layer...
Collision Resistant Multiple Access (CRMA) to conduct multiple access problems is a new kind of spectrum shared protocol by the network coding. The virtual flow technology is the key technology of CRMA and contributes mostly to the high performance of the network. However, the efficiency of virtual flow technology drops with increase of physical flow caused by decoding failure and incomplete code...
This paper questions the existence of factors influencing the quality of the synthesized views, in the context of multi-view video plus depth coding (MVC). The issue of bit-rate allocation between texture and depth data in MVC is still open, despite the many efforts already raised for the development of optimization techniques. The originality of this study lies in the investigation of direct relationships...
To improve the resource utilization of traditional two-way wireless relay system, an optimal power allocation (OPA) algorithm for a space-time cooperative network coding scheme employing amplify-and-forward protocol (AF-ST-CNC) is proposed. The system performance in terms of outage probability and its approximation in high signal-to-noise (SNR) regimes are first derived, and by minimizing the larger...
In this paper, we propose a cognitive relaying protocol using network and superposition coding in primary multiple access channels (MAC), where two licensed primary transmitters PT1 and PT2 transmit to a common receiver PR with the assistance of an unlicensed secondary transmitter ST that acts as a relay. Furthermore, we analyze the opportunistic transmission among the multiple secondary receivers...
Ideally, the throughput of a Multipath TCP (MPTCP) connection should be as high as that of multiple disjoint single-path TCP flows. In reality, the throughput of MPTCP is far lower than expected. This is fundamentally caused by the fact that a sub flow with high delay and loss affects the performance of other sub flows, and thus becomes the bottleneck of the MPTCP connection and significantly degrades...
Optimal resource allocation requires global channel knowledge in a relay network. When no or partial channel knowledge is available then static resource allocation is another alternative. This paper investigates the performances of different relaying protocols for static and dynamic resource allocations. A 2-hop relay network with multiple relays is considered. The protocols include adaptive amplify-or-decode...
We propose a cognitive relaying protocol using network and superposition coding in multiple access primary channels, where two licensed primary users A and B transmit to a common destination D with the assistance of an unlicensed secondary transceiver C that acts as a relay. The secondary transceiver C attains the opportunity of spectrum sharing by relaying the primary users messages. Network coding...
In this paper, we consider a two-way asymmetric relaying channel with unmatched traffics from two sources. Aiming at maximizing the sum rate under a minimum rate constraint, we address the optimization problem (in terms of time and power allocation) for two decode-and-forward (DF) strategies, namely, the decode-and-forward with joint modulation (DF-JM) and the decode-and-forward with network-superposition...
In this paper we investigate the effect of power allocation on the performance of the Distributed Turbo Product Code (DTPC) system. We study the error propagation on distributed coding systems when the relay makes erroneous decisions and present a simple power allocation method to alleviate the effect of relay decoding errors on the iterative decoding at the destination. We validate this method with...
In this paper, we investigate the optimal power and time allocation for a wireless relay network, called BCFR (Broadcasting Channel with Fixed Relay), where the relay node is limited by the half-duplex operation. Introducing a relay in two-node broadcasting channel for a node which has a link of bad quality or requires higher transmission rate enlarges the rate region with well-designed power and...
We consider the problem of gathering correlated sensor data by a sink node in a wireless sensor network. We design efficient distributed protocols to maximize the network lifetime subject to nodal energy constraints. Many existing approaches address the routing layer only, but the routing often interacts with physical-layer power control and MAC-layer link access. We present a first effort to maximize...
Cooperative diversity using distributed space-time codes has been recently proposed to form virtual antennas in order to achieve diversity gain. In this paper, we propose a distributed space-time coding with amplify-and-forward relaying. Motivated by protocol (III) presented in, we propose a distributed space-time code for an arbitrary number of relay nodes. The pairwise error probability (PEP) is...
In this paper, we propose a distributed space-time coded cooperative protocol with amplify-and-forward relaying. Motivated by protocol (III) presented in , we propose a distributed space-time coding for an arbitrary number of relay nodes. The pairwise error probability (PEP) is derived and the theory analysis demonstrates that our protocol achieves a diversity of order N +1 where N is the number of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.