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.
In this paper, we design a fast and efficient energy-based and asynchronous neighbor discovery protocol for the Internet of Things (IoT). In our solution, we relax the assumption of frame-level synchronization. We formulate a novel asynchronous group testing scheme and apply it to the neighbor discovery problem. We then show that our proposed scheme is able to detect the set of K active neighbors1...
We propose graph-defined IRSA (G-IRSA), a new approach to design irregular repetition slotted ALOHA (IRSA) uncoordinated multiple access schemes for a controlled-size population of users that become active sporadically. The proposed scheme considers a joint design of the distribution according to which users select their repetition factors and the distribution determining how many packet replicas...
We consider the following variant of the index coding problem. A transmitter wishes to communicate several messages, each of which is k bit long, to multiple informed receivers over a noisy broadcast link. Each informed receiver already knows some of the messages a priori, which is called its side information, and demands to know the rest of the messages. However, unlike in an index coding problem,...
Multi-path TCP has recently shown great potential to take advantage of the rich path diversity in data center networks (DCN) to increase transmission throughput. However, the small flows, which take a large fraction of data center traffic, will easily get a timeout when split onto multiple paths. Moreover, the dynamic congestions and node failures in DCN will exacerbate the reorder problem of parallel...
In this paper, we propose a new full-duplex relay-assisted cognitive radio system model with an adaptive decoding algorithm at the secondary user, in order to maximize both primary and secondary achievable rates. We consider the uplink transmission and we compare the system's achievable rates obtained with both amplify-and-forward and decode-and-forward relaying in the single-carrier case. Then, we...
We study the problem of joint information and energy transfer in a two-hop channel with a Radio frequency (RF) energy harvesting relay. We consider a finite battery size at the relay and deterministic energy loss in transmitting energy. In other words, to be able to send an energy-contained symbol, the relay must receive multiple energy-contained symbols. Thus, we face a kind of channel with memory...
Recent broadcast standards support Layered Division Multiplexing (LDM) to achieve graceful degradation as signal quality degrades at the receiver. LDM is accomplished by using different constellations within the same Radio Frequency (RF) spectrum. LDM thus enables delivering multiple service tiers in a single broadcast channel. LDM when used in conjunction with scalable source coding codecs such as...
This paper studies the simultaneous wireless information and power transfer (SWIPT) in the multi-carrier differential chaos shift keying (MC-DCSK) communication system. Two energy harvesting protocols with a power splitting (PS) receiver are considered. In the first protocol, only a fraction of reference sub-carrier signal are used for energy harvesting (EH). In another one, a fraction of all sub-carriers...
It is known that the capacity region of a two user physically degraded discrete memoryless (DM) broadcast channel (BC) is not enlarged by feedback. An identical result holds true for a physically degraded Gaussian BC, established later using a variant of the Entropy Power Inequality (EPI). In this paper, we extend the latter result to a physically degraded Gaussian Vector BC (PD-GVBC). However, the...
Road accidents are one of the world's major public health and injury prevention problems. According to the World Health Organization (WHO), more than a million children are killed in road accidents each year, all over the world. The motivation behind this work is an attempt to make an Arduino based embedded system which makes the passenger's journey even safer and more secure. This paper handles the...
To achieve high data rates, reliable data rate transmission and near capacity performance for future wireless communication systems iterative processing has been widely considered. However, such an efficient receiver design has been made significant challenge. In this paper, multiple-input multiple output (MIMO) detection with channel decoding techniques has been investigated for achieve reliable...
We consider the degree distribution design of the low-density parity-check (LDPC) code ensembles for symmetric Gaussian multiple-access channels (GMAC). To characterize the probability density function (PDF) of the message passing in the process of joint decoding, we propose a new scheme to construct the associated Gaussian mixture (GM) distribution, where each GM component is assigned according to...
In an energy-efficient receiver employing iterative decoders, phase synchronization errors reduce much of the gains that can be achieved at low SNRs. To address this problem, the concept of an iterative receiver has received much attention in the past. In such a framework, signal degradation at low SNR is overcome by repeated phase synchronization executed over the soft symbols generated by the iterative...
We study the transmission of confidential messages across a wireless broadcast channel with K > 2 receivers and K helpers. The goal is to transmit all messages reliably to their intended receivers while keeping them confidential from the unintended receivers. We design a codebook based on nested lattice structure, cooperative jamming, lattice alignment, and i.i.d. coding. Moreover, we exploit the...
This paper proposes a coding scheme that derives a multiple-rate code from existing channel codes defined over the composite field and the ground field, where code length is fixed. Formally, from codes C1(k, 1), C2 (k, 2),…, Ck(k, k) defined over GF(q) together with the code C(n,k) over GF(qn), the proposed scheme derives a multiple-rate code with fixed code length. The primary benefit of the proposed...
There are many research on hybrid selective-repeat ARQ method. In many previous research purposes have been to maximize a throughput on the number of messages delivered to the user. Important theoretical limits were studied under the condition that a decoding error was very small and neglected. In this research we propose the optimal type-I hybrid selective-repeat ARQ with finite receiver buffer....
Fountain codes are erasure correcting codes realizing reliable communication on multicasting. In a previous work, we proposed a fountain code, named zigzag decodable fountain (ZDF) code, and showed that the ZDF code outperforms Raptor codes in term of the decoding performance. However, the conventional decoding algorithm for the ZDF code, which is regarded as a combination of packet-wise peeling algorithm...
This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an eavesdropper, while keeping the eavesdropper ignorant of each message. A general achievable rate region is established by utilizing Marton's coding together with techniques...
We study energy harvesting (EH) transmitter and receiver, where the receiver decodes data using the harvested energy from the nature and from an independent EH node, named helper. Helper cooperates with the receiver by transferring its harvested energy to the receiver over an orthogonal fading channel. We study an offline optimal power management policy to maximize the reliable information rate....
We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.
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.