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.
Underwater acoustic sensor networks are characterized by limited transmit power and bandwidth, and a harsh communication environment. Different techniques for reliable communication in underwater networks have been studied in the literature at different layers of the network protocol stack. Among these, the use of fountain codes as a way for improving the quality of the communication over a highly...
To satisfy the requirements of complex distributed power electronic system (PES) communication, this paper has proposed a single optic-fiber link data communication protocol based on the Manchester code due to an vacancy in the commonly-adopted protocols, analyzed the encoding and decoding principle of Manchester code, defined the formats of command frame and data frame, calculated the communication...
This paper presents the joint design of network coding and backpressure algorithm for cognitive radio networks and its implementation with software-defined radios (SDRs) in a high fidelity network emulation testbed. The backpressure algorithm is known to provide throughput optimal solutions to joint routing and scheduling for dynamic packet traffic. This solution applies to cognitive radio networks...
We propose an underlay decode-and-forward cognitive (UDFC) scheme under joint effects of hardware impairments at secondary users and interference constraints at multi primary receivers. In this scheme, the transmit powers of a source node and relays are constrained by interference thresholds of primary receivers in which the best relay is selected has the highest decoding capacity from the source...
We study the secure storage of the output of a data source on a public database. We consider a rather large class of data sources. In order to prevent unauthorized users from learning the output of the data source we make use of the output of a biometric source or a physical unclonable function (PUF). As we regard the output of the PUF source as a resource, we are interested in the smallest possible...
In this paper, we propose a feedback-aided irregular repetition slotted ALOHA (F-IRSA) protocol which depends on the distance between the received packet and the set of packets already recovered at the receiver. We employ feedback messages to terminate the user retransmission process, and use successive interference cancellation (SIC) for packet recovery. We evaluate the number of transmissions per...
The 10Gbase-KR protocol is widely used to accomplish the high speed data conversion in the Ethernet area. This paper presents a design of the critical controller in the physical coding sublayer based on the 10Gbase-KR. In order to satisfy the demand of the high speed data conversion, the scrambler and descrambler are specially designed to work in a parallel mode. The post-synthesis simulation results...
Polar codes has a better bit error rate (BER) performance than low-density parity-check (LDPC) and turbo codes with lower coding and decoding complexity. The polar-coded cooperation can provide significant enhancement of data rate and link reliability. However, simply binary coded cooperation cannot meet the requirements of spectral efficiency. In order to improve the spectral efficiency, this paper...
This paper describes a flexible multimedia stack which provides media content from number of different streaming protocols. The main goal is to facilitate and accelerate integration with different TV and Set Top Box platforms. Presented solution can be used on Android as well as on Linux based systems. Advantages of this solution are unified data flow and processing of media data. It provides elementary...
This paper considers the analysis of communication protocols in wireless networks implementing both cooperation and Hybrid Automatic Repeat reQuest (HARQ) for Type I decoder and Type II decoder with Chase Combining. Using an example of a three-node network, we show that the communication protocol can be modeled using Finite State Markov Chains. This model efficiently predicts the performance of the...
Non-orthogonal multiple access (NOMA) is envisioned to be one of the promising radio access techniques for the fifth generation (5G) mobile networks. In this paper, a portable NOMA testbed based on software defined radio (SDR) is developed by transporting our NOMA system to mini personal computers (PCs). Moreover, the NOMA testbed has been enhanced from 5 MHz bandwidth to 10 MHz bandwidth. As the...
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...
A new time switching protocol referred to as TS- APS is proposed for the energy harvesting (EH) relay networks based on the combination of conventional time switching (TS) protocol and adaptive power splitting (APS). In the framework of the decode and forward (DF) relaying with multiple relays, we derive the closed-form expression for the outage probability of the proposed scheme and discuss its effective...
We propose a decentralized multi-cell aware opportunistic random access (MA-ORA) protocol that almost achieves the optimal throughput scaling in a K-cell random access network with one access point (AP) and N users in each cell. Under our MA-ORA protocol, users opportunistically transmit with a predefined physical layer data rate in a decentralized manner if the desired signal power to the serving...
In this paper we give the first blind signature protocol for code-based cryptography. Our approach is different from the classical original RSA based blind signature scheme, it is done in the spirit of the Fischlin approach [9] which is based on proofs of knowledge. To achieve our goal we consider a new tool for zero-knowledge (ZK) proofs, the Concatenated Stern ZK protocol, which permits to obtain...
The capacity region of 1-to-K broadcast packet erasure channels with ACK/NACK is known for some scenarios, e.g., K ≤ 3, etc. However, existing achievability schemes either require knowing the target rate R in advance, and/or have a complicated description of the achievable rate region that is difficult prove whether it matches the capacity or not. This work proposes a new network coding protocol with...
A new broadcast wiretap channel (B-WTC) with a wiretapper who noiselessly taps into a fixed-length subset of the transmitted symbols of her choice, and observes the remainder through a noisy channel, is studied. An achievable strong secrecy rate region which extends Marton's inner bound to the proposed setting, is derived. Strong secrecy capacity regions for two classes of the new B-WTC, namely the...
A new model for the interference channel with confidential messages (IC-CM) is introduced, where each receiver, besides his noisy observations, is provided with a fixed-length subset, of his choosing, of noiseless observations for the transmitted codewords of both users, making confidential communication more challenging than the previous such model. In addition, in the same spirit, a broadcast channel...
The Yamamoto-Itoh (YI) scheme is a simple two phase coding scheme for discrete memoryless channels with noiseless feedback, which can attain the so-called Burnashev error-exponent. In this paper, we show how we can apply the YI scheme to discrete memoryless broadcast channels, and derive the achievable error-exponents region of the YI scheme for given coding rates.
Multiple parties observe correlated data generated independently and identically (in time) from a known joint distribution. Parties communicate with each other interactively to enable each party to recover the data observed by all the other parties and attain omniscience. We characterize the asymptotic growth of the number of bits of interactive communication required by the parties to attain omniscience...
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.