Communications overhead as the cost of constraints

Laneman, J. Nicholas; Dunn, Brian P.

doi:10.1109/itw.2011.6089481

Cited by 5 publications

(7 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The overhead cost in Theorem 4 is equal to f M P λ (P, W, α), which is increasing in the intermittency rate α, equals zero at α = 1, approaches infinity as α → ∞, and is decreasing in λ as can be seen from (11). The same conclusions as in Section (V-A) can be drawn.…”

Section: B Medium Packet Intermittent Communicationsupporting

confidence: 68%

“…Proof: See [12]. The form of the achievable rate is reminiscent of communications overhead as the cost of constraints [11], where the constraint is the system's burstiness or intermittency, and the overhead cost is αh(1/α)/l. Note that the overhead cost is increasing in the intermittency rate α, is equal to zero at α = 1, and approaches infinity as α → ∞.…”

Section: A Small Packet Intermittent Communicationmentioning

confidence: 99%

See 1 more Smart Citation

Intermittent communication and partial divergence

Khoshnevisan

Laneman

2012

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Self Cite

View full text Add to dashboard Cite

Abstract-We formulate a model for intermittent communication in which the transmissions of information symbols are bursty or the channel is sporadically available. We consider a general scenario in which information and noise symbols are grouped into packets of length l, and noise packets are inserted in the input sequence of the channel, and the receiver does not know a priori the positions of the information packets. Depending on the scaling behavior of the packet length relative to the codeword length, we identify some interesting scenarios for the scaling behavior of the receive window relative to the codeword length, and find achievable rates using different decoding structures. Interestingly, some of the decoding structures are based on a generalization of the method of types and properties of partial divergence. The achievable rates and the numerical results confirm the intuitive idea that increasing the intermittency decreases the achievable rates by increasing the uncertainty about the positions of the information packets at the receiver.

show abstract

Section: B Medium Packet Intermittent Communicationsupporting

confidence: 68%

Section: A Small Packet Intermittent Communicationmentioning

confidence: 99%

Intermittent communication and partial divergence

Khoshnevisan

Laneman

2012

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The check Tag value is inserted in the unused frame of IP protocol to make no overhead on the communication channel [13].…”

Section: F Tag Insertionmentioning

confidence: 99%

A Proposed Solutions to Two Possible Attacks over AEGIS Authenticated Encryption Algorithm

El-Hadary¹,

Megahed²,

ElAzeem³

2018

IJCTE

View full text Add to dashboard Cite

Authenticated Encryption (AE) is a technique combines both security and authenticity of data. This paper introduces two possible attacks over AEGIS AE algorithm, which are error propagation and tag changing attacks. The first attack is sending incorrect ciphertext for error propagation, that will results in incorrect decryption of all next ciphertexts then retransmission is done which leads to large time delay. The second attack is changing the sent authenticated tag that will result incorrect tag calculation at the receiver. Tag Generation functions dependent on XOR function (linear function) as in AEGIS make the encryption algorithms vulnerable to tag changing attack. In the introduced paper, the proposed solutions are done regarding two security mechanisms which are tag partitioning and check tag resulted from nonlinear function. Tag partitioning is a process to divide the tag into parts this will reduce the time delay of retransmission and non-linear function usage to overcome XOR function problems.

show abstract

“…Note that the capacity C 1 cannot be larger than 1, since the coefficients φ(·, ·) cannot be negative. The negative term in (25) can be interpreted as a lower bound on the communication overhead as the cost of intermittency in the context of [24].…”

Section: Thus We Havementioning

confidence: 99%

Intermittent Communication

Khoshnevisan

Laneman

2017

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

We formulate a model for intermittent communication that can capture bursty transmissions or a sporadically available channel, where in either case the receiver does not know a priori when the transmissions will occur. Focusing on the point-to-point case, we develop a decoding structure, decoding from pattern detection, and its achievable rate for such communication scenarios. Decoding from pattern detection first detects the locations of codeword symbols and then uses them to decode. We introduce the concept of partial divergence and study some of its properties in order to obtain stronger achievability results. As the system becomes more intermittent, the achievable rates decrease due to the additional uncertainty about the positions of the codeword symbols at the decoder. Additionally, we provide upper bounds on the capacity of binary noiseless intermittent communication with the help of a genie-aided encoder and decoder. The upper bounds imply a tradeoff between the capacity and the intermittency rate of the communication system, even if the receive window scales linearly with the codeword length.

show abstract

Communications overhead as the cost of constraints

Cited by 5 publications

References 5 publications

Intermittent communication and partial divergence

Intermittent communication and partial divergence

A Proposed Solutions to Two Possible Attacks over AEGIS Authenticated Encryption Algorithm

Intermittent Communication

Contact Info

Product

Resources

About