In this paper, we present an analytical framework to derive the performance of a molecular communication system where a transmitter bio-nano-machine (TBN) is communicating with a fully-absorbing spherical receiver bio-nano-machine (RBN) in a diffusive propagation medium in the presence of other TBNs. We assume that transmit bits at each TBN is random and different than transmit bits at other TBNs. We model the TBNs using a marked Poisson point process (PPP) with their locations as points of PPP and transmit symbols as marks. We consider both inter-symbol interference (ISI) and co-channel interference (CCI). ISI is caused by molecules transmitted in the previous slots while CCI is due to the molecules emitted from other TBNs. We derive the bit error probability of this system by averaging over the distribution of the transmit bits as opposed to the past approaches consisting of conditioning on previous transmit bits and/or assuming the transmit bits of every TBN are the same. Using numerical results, we validate our analysis and provide various design insights about the system, for example, the impact of detection threshold on the system performance. We also show the importance of accurately incorporating the randomness of transmit bits in the analysis.
This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme consists of a combination of interference cancelation, relaying of the other user's data bits, time sharing, and transmission of random bits, depending on the rate of the cooperative link and the relative strengths of the signal and the interference. The results show, for example, that the proposed scheme achieves the same rate as the capacity without the secrecy …
We consider a two-user Gaussian multiple access channel with two independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. Transmitters are allowed to cooperate through finite-capacity links. The capacity region is characterized to within 3 and 1.5 bits for the stronger user and the weaker user respectively, regardless of channel parameters. As a by-product, we characterize the capacity region of the case without cooperation to within 1 and 0.5 bits for the stronger user and the weaker user respectively. These results are based on a …
We consider the communication scenario where K transmitters are each connected to a common receiver with an orthogonal noiseless link. One of the transmitters has a message for the receiver, who is prohibited from learning anything in the information theoretic sense about which transmitter sends the message (transmitter anonymity is guaranteed). The capacity of anonymous communications is the maximum number of bits of desired information that can be anonymously communicated per bit of total communication. For this anonymous communication problem over a parallel channel with K transmitters and …
Due to the limited capabilities of a single bio-nanomachine, complicated tasks can be performed only with the co-operation of multiple bio-nanomachines. In this work, we consider a diffusion-based molecular communication system with a transmitter bio-nanomachine (TBN) communicating with a fully-absorbing spherical receiver bio-nanomachine (RBN) in the presence of other TBNs. The bits transmitted by each of the TBNs are considered as random in each time slot and different for each TBNs in contrary to the past works in literature with deterministic bits, which are the same to all TBNs. The TBNs …
We study memoryless interference channels with gradual data arrival in the absence of feedback. The information bits arrive at the transmitters according to independent and asynchronous~(Tx-Tx asynchrony) Bernoulli processes with average data rate $λ$. Each information source turns off after generating a number of $n$ bits. In a scenario where the transmitters are unaware of the amount of Tx-Tx asynchrony, we say $ε$ is an \textit{achievable outage level} in the asymptote of large~$n$ if (i) the average transmission rate at each transmitter is $λ$ and (ii) the probability that the bit-error-ra…
This paper addresses a Gaussian interference channel with two transmitter-receiver~(Tx-Rx) pairs under stochastic data arrival~(GIC-SDA). Information bits arrive at the transmitters according to independent and asynchronous Bernoulli processes~(Tx-Tx~asynchrony). Each information source turns off after generating a given total number of bits. The transmissions are \textit{asynchronous} (Tx-Rx~asynchrony) in the sense that each Tx sends a codeword to its Rx immediately after there are enough bits available in its buffer. Such asynchronous style of transmission is shown to significantly reduce t…
We characterize the capacity region to within log{2(M-1)} bits/s/Hz for the M-transmitter K-receiver Gaussian multicast channel with feedback where each receiver wishes to decode every message from the M transmitters. Extending Cover-Leung's achievable scheme intended for (M,K)=(2,1), we show that this generalized scheme achieves the cutset-based outer bound within log{2(M-1)} bits per transmitter for all channel parameters. In contrast to the capacity in the non-feedback case, the feedback capacity improves upon the naive intersection of the feedback capacities of K individual multiple access…
A multiple antenna broadcast channel with perfect channel state information at the receivers is considered. If each receiver quantizes its channel knowledge to a finite number of bits which are fed back to the transmitter, the large capacity benefits of the downlink channel can be realized. However, the required number of feedback bits per mobile must be scaled with both the number of transmit antennas and the system SNR, and thus can be quite large in even moderately sized systems. It is shown that a small number of antennas can be used at each receiver to improve the quality of the channel e…
Index modulation, where information bits are conveyed through antenna indices (spatial modulation) and subcarrier indices (subcarrier index modulation) in addition to information bits conveyed through conventional modulation symbols, is getting increased research attention. In this paper, we introduce {\em precoder index modulation}, where information bits are conveyed through the choice of a precoder matrix at the transmitter from a set of pre-determined pseudo-random phase precoder (PRPP) matrices. Combining precoder index modulation (PIM) and spatial modulation (SM), we introduce a PIM-SM s…
This letter studies the limited feedback cognitive radio system, where the primary users (PU) are interfered by the secondary transmitter (ST) due to the imperfect beamforming. We propose to allocate the feedback bits among multiple PUs to minimize the maximum interference caused by the ST, by exploiting the heterogeneous average channel gains. In addition, we study the problem of minimizing the total feedback bits under a predefined interference threshold at the PUs. The solutions with low complexity are proposed for the studied problems, and the performances of bit allocations are analyzed. …
A game theoretic framework is presented to analyze the problem of finding the optimal number of data streams to transmit in a multi-user MIMO scenario, where both the transmitters and receivers are equipped with multiple antennas. Without channel state information (CSI) at any transmitter, and using outage capacity as the utility function with zero-forcing receiver, each user is shown to transmit a single data stream at Nash equilibrium in the presence of sufficient number of users. Transmitting a single data stream is also shown to be optimal in terms of maximizing the sum of the outage capac…
Obtaining accurate global channel state information (CSI) at multiple transmitter devices is critical to the performance of many coordinated transmission schemes. Practical CSI local feedback often leads to noisy and partial CSI estimates at each transmitter. With rate-limited bi-directional backhaul, transmitters have the opportunity to exchange few CSI-related bits to establish global channel state information at transmitter (CSIT). This work investigates possible strategies towards this goal. We propose a novel decentralized algorithm that produces minimum mean square error (MMSE)-optimal g…
We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals through another discrete memoryless channel. We develop a coding scheme based on the principle of channel resolvability, which generalizes and extends prior work in several directions. First, it shows that, irrespective of the quality of the channels, it is possible to communicate on the order of $\sqrt{n}$ reliable and covert bits over $n$ channel uses if t…
In this paper, the fundamental limits of decentralized simultaneous information and energy transmission in the $K$-user Gaussian multiple access channel (G-MAC), with an arbitrary $K \geqslant 2$ and one non-colocated energy harvester (EH), are fully characterized. The objective of the transmitters is twofold. First, they aim to reliably communicate their message indices to the receiver; and second, to harvest energy at the EH at a rate not less than a minimum rate requirement $b$. The information rates $R_1,\dots,R_K$, in bits per channel use, are measured at the receiver and the energy rate …
The capacity per unit cost, or equivalently minimum cost to transmit one bit, is a well-studied quantity. It has been studied under the assumption of full synchrony between the transmitter and the receiver. In many applications, such as sensor networks, transmissions are very bursty, with small amounts of bits arriving infrequently at random times. In such scenarios, the cost of acquiring synchronization is significant and one is interested in the fundamental limits on communication without assuming a priori synchronization. In this paper, we show that the minimum cost to transmit B bits of in…
We consider the MIMO wiretap channel, that is a MIMO broadcast channel where the transmitter sends some confidential information to one user which is a legitimate receiver, while the other user is an eavesdropper. Perfect secrecy is achieved when the the transmitter and the legitimate receiver can communicate at some positive rate, while insuring that the eavesdropper gets zero bits of information. In this paper, we compute the perfect secrecy capacity of the multiple antenna MIMO broadcast channel, where the number of antennas is arbitrary for both the transmitter and the two receivers.
We identify the common underlying form of the capacity expression that is applicable to both cases where causal or non-causal side information is made available to the transmitter. Using this common form we find that for the single user channel, the multiple access channel, the degraded broadcast channel, and the degraded relay channel, the sum capacity with causal and non-causal side information are identical when all the transmitter side information is also made available to all the receivers. A genie-aided outerbound is developed that states that when a genie provides $n$ bits of side infor…
Consider a random access communication scenario over a channel whose operation is defined for any number of possible transmitters. As in the model recently introduced by Polyanskiy for the Multiple Access Channel (MAC) with a fixed, known number of transmitters, the channel is assumed to be invariant to permutations on its inputs, and all active transmitters employ identical encoders. Unlike the Polyanskiy model, in the proposed scenario, neither the transmitters nor the receiver knows which transmitters are active. We refer to this agnostic communication setup as the Random Access Channel (RA…
We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their communication through another discrete memoryless MAC. We assume that each transmitter may use a secret key that is shared only between itself and the legitimate receiver. We show that each of the $K$ transmitters can transmit on the order of $\sqrt{n}$ reliable and covert bits per $n$ channel uses, exceeding which, the warden will be able to detect the communication.…
The downlink of a multiple-input multiple output (MIMO) broadcast channel (BC) is considered, where each receiver is equipped with a single antenna and the transmitter performs nonlinear Dirty-Paper Coding (DPC). We present an efficient algorithm that finds the optimum transmit filters and power allocation as well as the optimum precoding order(s) possibly affording time-sharing between individual DPC orders. Subsequently necessary and sufficient conditions for the optimality of an arbitrary precoding order are derived. Based on these we propose a suboptimal algorithm showing excellent perform…
Generalized spatial modulation (GSM) uses $N$ antenna elements but fewer radio frequency (RF) chains ($R$) at the transmitter. Spatial modulation and spatial multiplexing are special cases of GSM with $R=1$ and $R=N$, respectively. In GSM, apart from conveying information bits through $R$ modulation symbols, information bits are also conveyed through the indices of the $R$ active transmit antennas. In this paper, we derive lower and upper bounds on the the capacity of a ($N,M,R$)-GSM MIMO system, where $M$ is the number of receive antennas. Further, we propose a computationally efficient GSM e…
We present a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over additive white Gaussian noise (AWGN) channels. Specifically, if the transmitter has AWGN channels to an intended receiver and a warden, both with non-zero noise power, we prove that $o(\sqrt{n})$ bits can be sent from the transmitter to the receiver in $n$ channel uses while lower-bounding $α+β\geq1-ε$ for any $ε>0$, where $α$ and $β$ respectively denote the warden's probabilities of a false alarm when the sender is not transmitting and a missed detection when the s…
As a power and bandwidth efficient modulation scheme, the optical spatial modulation (SM) technique has recently drawn increased attention in the field of visible light communications (VLC). To guarantee the number of bits mapped by the transmitter's index at each timeslot is an integer, the number of transmitters (i.e., light-emitting diodes) in the SM based VLC system is often set be a power of two. To break the limitation on the required number of transmitters and provide more design flexibility, this paper investigates the SM based VLC with an arbitrary number of transmitters. Initially, a…
We study the content delivery problem between a transmitter and two receivers through erasure links, when each receiver has access to some random side-information about the files requested by the other user. The random side-information is cached at the receiver via the decentralized content placement. The distributed nature of receiving terminals may also make the erasure state of two links and indexes of the cached bits not perfectly known at the transmitter. We thus investigate the capacity gain due to various levels of availability of channel state and cache index information at the transmi…
In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the throughput of multi-user broadcast wiretap channels. We consider that the transmitter is only provided by a $b$-bits feedback of the main channel state information (CSI) sent by each legitimate receiver, at the beginning of each fading block, over error-free public links with limited capacity. Also, we assume that the transmitter is aware of the statistics of the eav…
In this paper we study the long-term throughput performance of repetition protocols coupled with power control for multiple access block-fading channels. We propose to use the feedback bits to inform the transmitter about the decoding status and the instantaneous channel quality. We determine the throughput of simple and practically inspired protocols; we show remarkable throughput improvements, especially at low and moderate SNR, when compared to protocols where the feedback bits are used for acknowledgment only or for power control only; we show that the throughput is very close to the ultim…
This paper considers a multiple-input multiple-output (MIMO) Gaussian wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each equipped with multiple antennas. Perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while ensuring that the eavesdropper gets zero bits of information. In this paper, the perfect secrecy capacity of the multiple antenna MIMO wiretap channel is found for aribtrary numbers of antennas under the assumption that the transmitter performs beamforming based on the …
We consider covert communication using a queuing timing channel in the presence of a warden. The covert message is encoded using the inter-arrival times of the packets, and the legitimate receiver and the warden observe the inter-departure times of the packets from their respective queues. The transmitter and the legitimate receiver also share a secret key to facilitate covert communication. We propose achievable schemes that obtain non-zero covert rate for both exponential and general queues when a sufficiently high rate secret key is available. This is in contrast to other channel models suc…
This paper provides a statistical characterization of the individual achievable rates in bits/s/Hz and the spatial throughput of bipolar Poisson wireless networks in bits/s/Hz/m$^2$. We assume that all transmitters have a cognitive ability to know the distance to their receiver's closest interferers so they can individually tune their coding rates to avoid outage events for each spatial realization. Considering that the closest interferer approximates the aggregate interference of all transmitters treated as noise, we derive closed-form expressions for the probability density function of the a…
Use of multiple light emitting diodes (LED) is an attractive way to increase spectral efficiency in visible light communications (VLC). A non-DC-biased OFDM (NDC OFDM) scheme that uses two LEDs has been proposed in the literature recently. NDC OFDM has been shown to perform better than other OFDM schemes for VLC like DC-biased OFDM (DCO OFDM) and asymmetrically clipped OFDM (ACO OFDM) in multiple LEDs settings. In this paper, we propose an efficient multiple LED OFDM scheme for VLC which uses {\em coded index modulation}. The proposed scheme uses two transmitter blocks, each having a pair of L…
We consider communication over the AWGN channel with a transmitter whose battery is recharged with RF energy transfer at random times known to the receiver. We assume that the recharging process is i.i.d. Bernoulli. We characterize the capacity of this channel as the limit of an $n$-letter maximum mutual information rate under both causal and noncausal transmitter knowledge of the battery recharges. With noncausal knowledge, it is possible to explicitly identify the maximizing input distribution, which we use to demonstrate that the capacity with noncausal knowledge of the battery recharges is…
This work studies the capacity region of a two-user ergodic interference channel with fading, where only one of the users is subject to interference from the other user, and the channel state information (CSI) is only available at the receivers. A layered erasure model with one-sided interference and with arbitrary fading statistics is studied first, whose capacity region is completely determined as a polygon. Each dominant rate pair can be regarded as the outcome of a trade-off between the rate gain of the interference-free user and the rate loss of the other user due to interference. Using i…
We study a backscatter communication protocol over a AWGN channel, where a transmitter illuminates a tag with a directional multi-antenna. The tag performs load modulation on the signal while hiding its physical presence from a warden. We show that, if the transmitter-to-tag channel is inaccessible to the warden, then $Θ(n)$ reliable and covert bits can be transmitted over $n$ channel usages. This overcomes the square-root law for covert communication. This paper provides the first evidence for practical implementation of covert backscatter communication, with potential applications in IoT sec…
Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in order to obtain faster algorithms for communication in such networks. This paper proposes a novel approach for wireless communication, which embraces collisions rather than avoiding them, over an additive channel. It introduces a coding technique called Bounded-Contention Coding (BCC) that allows collisions to be successfully decoded by the receiving nodes into the original t…
Rodrigo de Miguel et al 2007 J. Phys. A: Math. Theor. 40 5241-5260: A noisy vector channel operating under a strict complexity constraint at the receiver is introduced. According to this constraint, detected bits, obtained by performing hard decisions directly on the channel's matched filter output, must be the same as the transmitted binary inputs. An asymptotic analysis is carried out using mathematical tools imported from the study of neural networks, and it is shown that, under a bounded noise assumption, such complexity-constrained channel exhibits a non-trivial Shannon-theoretic capacity…
We analyze a two-receiver binary-input discrete memoryless broadcast channel, in which the transmitter communicates a common message simultaneously to both receivers and a covert message to only one of them. The unintended recipient of the covert message is treated as an adversary who attempts to detect the covert transmission. This model captures the problem of embedding covert messages in an innocent codebook and generalizes previous covert communication models in which the innocent behavior corresponds to the absence of communication between legitimate users. We identify the exact asymptoti…
The study investigated the allocation of transmission power and bits for a point-to-point orthogonal frequency-division multiplexing channel assuming perfect channel information at the receiver, but imperfect channel information at the transmitter. Channel information was quantized at the receiver and was sent back to the transmitter via a finite-rate feedback channel. Based on limited feedback from the receiver, the corresponding transmitter adapted the power level and/or modulation across subcarriers. To reduce the amount of feedback, subcarriers were partitioned into different clusters and …
This work is focused on the system-level performance of a broadcast network. Since all transmitters in a broadcast network transmit the identical signal, received signals from multiple transmitters can be combined to improve system performance. We develop a stochastic geometry based analytical framework to derive the coverage of a typical receiver. We show that there may exist an optimal connectivity radius that maximizes the rate coverage. Our analysis includes the fact that users may have their individual content/advertisement preferences. We assume that there are multiple classes of users w…
This paper presents finite-blocklength achievability bounds for the Gaussian multiple access channel (MAC) and random access channel (RAC) under average-error and maximal-power constraints. Using random codewords uniformly distributed on a sphere and a maximum likelihood decoder, the derived MAC bound on each transmitter's rate matches the MolavianJazi-Laneman bound (2015) in its first- and second-order terms, improving the remaining terms to $\frac12\frac{\log n}{n}+O \left(\frac 1 n \right)$ bits per channel use. The result then extends to a RAC model in which neither the encoders nor the de…
In many practical wireless systems, the Signal-to-Interference-and-Noise Ratio (SINR) that is applicable to a certain transmission, referred to as Channel State Information (CSI), can only be learned after the transmission has taken place and is thereby outdated (delayed). For example, this occurs under intermittent interference. We devise the backward retransmission (BRQ) scheme, which uses the delayed CSIT to send the optimal amount of incremental redundancy (IR). BRQ uses fixed-length packets, fixed-rate R transmission codebook, and operates as Markov block coding, where the correlation bet…
Spatial modulation (SM) is a transmission scheme that uses multiple transmit antennas but only one transmit RF chain. At each time instant, only one among the transmit antennas will be active and the others remain silent. The index of the active transmit antenna will also convey information bits in addition to the information bits conveyed through modulation symbols (e.g.,QAM). Pseudo-random phase precoding (PRPP) is a technique that can achieve high diversity orders even in single antenna systems without the need for channel state information at the transmitter (CSIT) and transmit power contr…
This paper proposes a novel imperfect transmitter (TX) model, namely the membrane fusion (MF)-based TX, that adopts MF between a vesicle and the TX membrane to release molecules encapsulated within the vesicle. For the MF-based TX, the molecule release probability and the fraction of molecules released from the TX membrane are derived. Incorporating molecular degradation and a fully-absorbing receiver (RX), the channel impulse response (CIR) is derived for two scenarios: 1) Both TX and RX are static, and 2) both TX and RX are diffusion-based mobile. Moreover, a sequence of bits transmitted fro…
In diffusion-based molecular communication (DMC), one important functionality of a transmitter nano-machine is signal modulation. In particular, the transmitter has to be able to control the release of signaling molecules for modulation of the information bits. An important class of control mechanisms in natural cells for releasing molecules is based on ion channels which are pore-forming proteins across the cell membrane whose opening and closing may be controlled by a gating parameter. In this paper, a modulator for DMC based on ion channels is proposed which controls the rate at which molec…
In massive multiple-input multiple-output (MIMO) systems, acquisition of the channel state information at the transmitter side (CSIT) is crucial. In this paper, a practical CSIT estimation scheme is proposed for frequency division duplexing (FDD) massive MIMO systems. Specifically, each received pilot symbol is first quantized to one bit per dimension at the receiver side and then the quantized bits are fed back to the transmitter. A joint one-bit compressed sensing algorithm is implemented at the transmitter to recover the channel matrices. The algorithm leverages the hidden joint sparsity st…
We show that nature imposes no fundamental upper limit to the number of information bits per expended photon that can, in principle, be read reliably when classical data is encoded in a medium that can only passively modulate the amplitude and phase of the probe light. We show that with a coherent-state (laser) source, an on-off (amplitude-modulation) pixel encoding, and shot-noise-limited direct detection (an overly-optimistic model for commercial CD/DVD drives), the highest photon information efficiency achievable in principle is about 0.5 bit per transmitted photon. We then show that a cohe…
Due to stringent constraints on resources, it may be infeasible to acquire the current channel state information at the transmitter in energy harvesting communication systems. In this paper, we optimize an energy harvesting transmitter, communicating over a slow fading channel, using layered coding. The transmitter has access to the channel statistics, but does not know the exact channel state. In layered coding, the codewords are first designed for each of the channel states at different rates, and then the codewords are either time-multiplexed or superimposed before the transmission, leading…
The theory of multiple-input multiple-output (MIMO) technology has been well-developed to increase fading channel capacity over single-input single-output (SISO) systems. This capacity gain can often be leveraged by utilizing channel state information at the transmitter and the receiver. Users make use of this channel state information for transmit signal adaptation. In this correspondence, we derive the capacity region for the MIMO multiple access channel (MIMO MAC) when partial channel state information is available at the transmitters, where we assume a synchronous MIMO multiuser uplink. Th…
Data-driven optimization of transmitters and receivers can reveal new modulation and detection schemes and enable physical-layer communication over unknown channels. Previous work has shown that practical implementations of this approach require a feedback signal from the receiver to the transmitter. In this paper, we study the impact of quantized feedback in data-driven learning of physical-layer communication. A novel quantization method is proposed, which exploits the specific properties of the feedback signal and is suitable for non-stationary signal distributions. The method is evaluated …
We introduce and investigate the opportunities of multi-antenna communication schemes whose training and feedback stages are interleaved and mutually interacting. Specifically, unlike the traditional schemes where the transmitter first trains all of its antennas at once and then receives a single feedback message, we consider a scenario where the transmitter instead trains its antennas one by one and receives feedback information immediately after training each one of its antennas. The feedback message may ask the transmitter to train another antenna; or, it may terminate the feedback/training…
Multi-antenna or multiple-input multiple-output (MIMO) technique can significantly improve the efficiency of radio frequency (RF) signal enabled wireless energy transfer (WET). To fully exploit the energy beamforming gain at the energy transmitter (ET), the knowledge of channel state information (CSI) is essential, which, however, is difficult to be obtained in practice due to the hardware limitation of the energy receiver (ER). To overcome this difficulty, under a point-to-point MIMO WET setup, this paper proposes a general design framework for a new type of channel learning method based on t…
In this paper, the paradigm of thermal noise communication (TherCom) is put forward for future wired/wireless networks with extremely low power consumption. Taking backscatter communication (BackCom) and reconfigurable intelligent surface (RIS)-based radio frequency chain-free transmitters one step further, a thermal noise-driven transmitter might enable zero-signal-power transmission by simply indexing resistors or other noise sources according to information bits. This preliminary paper aims to shed light on the theoretical foundations, transceiver designs, and error performance derivations …
We study the problem of two-user Gaussian multiple access channel (GMAC) in the presence of an external eavesdropper. In this problem, an eavesdropper receives a signal with a lower signal-to-noise ratio (SNR) compared to the legitimate receiver and all transmitted messages should be kept confidential against the eavesdropper. For this purpose, we propose a secure coding scheme on this channel which utilizes low-density parity-check (LDPC) codes by employing random bit insertion and puncturing techniques. At each encoder, the confidential message with some random bits as a random message are s…
Power line communication (PLC) exploits the existence of installed infrastructure of power delivery system, in order to transmit data over power lines. In PLC networks, different nodes of the network are interconnected via power delivery transmission lines, and the data signal is flowing between them. However, the attenuation and the harsh environment of the power line communication channels, makes it difficult to establish a reliable communication between two nodes of the network which are separated by a long distance. Relaying and cooperative communication has been used to overcome this prob…
In this paper, we propose a new technique for the future fifth generation cellular network wireless backhauling. We show that hundreds of bits per second per Hertz (bits per second per Hz) of spectral efficiency can be attained at a high carrier frequency (such as 26 GHz) between large antenna arrays deployed along structures (such as lamp posts) that are close and roughly parallel to each other. Hundreds of data streams are spatially multiplexed through a short range and line of sight massive multiple input massive multiple output propagation channel thanks to a new low complexity spatial mul…
We propose an information theoretic model for sociological networks. The model is a microcanonical ensemble of states and particles. The states are the possible pairs of nodes (i.e. people, sites and alike) which exchange information. The particles are the energetic information bits. With analogy to bosons gas, we define for these networks model: entropy, volume, pressure and temperature. We show that these definitions are consistent with Carnot efficiency (the second law) and ideal gas law. Therefore, if we have two large networks: hot and cold having temperatures TH and TC and we remove Q en…
