scholarly journals Performance analysis of congestion-aware secure broadcast channels

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Antonia Arvanitaki ◽  
Nikolaos Pappas ◽  
Niklas Carlsson ◽  
Parthajit Mohapatra ◽  
Oleg Burdakov
Keyword(s):  
Random Access ◽  
Heterogeneous Traffic ◽  
The Other ◽  
Security Requirements ◽  
Full Duplex ◽  
Vehicular Communication ◽  
Confidential Information ◽  
Average Delay ◽  
Randomized Policies ◽  
Congestion Aware

AbstractCongestion-aware scheduling in case of downlink cellular communication has ignored the distribution of diverse content to different clients with heterogeneous secrecy requirements. Other possible application areas that encounter the preceding issue are secure offloading in mobile-edge computing, and vehicular communication. In this paper, we extend the work in Arvanitaki et al. (SN Comput Sci 1(1):53, 2019) by taking into consideration congestion and random access. Specifically, we study a two-user congestion-aware broadcast channel with heterogeneous traffic and different security requirements. We consider two randomized policies for selecting which packets to transmit, one is congestion-aware by taking into consideration the queue size, whereas the other one is congestion-agnostic. We analyse the throughput and the delay performance under two decoding schemes at the receivers, and provide insights into their relative security performance and into how congestion control at the queue holding confidential information can help decrease the average delay per packet. We show that the congestion-aware policy provides better delay, throughput, and secrecy performance for large arrival packet probabilities at the queue holding the confidential information. The derived results also take account of the self-interference caused at the receiver for whom confidential data is intended due to its full-duplex operation while jamming the communication at the other user. Finally, for two decoding schemes, we formulate our problems in terms of multi-objective optimization, which allows for finding a trade-off between the average packet delay for packets intended for the legitimate user and the throughput for the other user under congestion-aware policy.

scholarly journals Securing Vehicle Communication Systems by the KLJN Key Exchange Protocol

2014 ◽  
Vol 13 (03) ◽  
pp. 1450020 ◽  
Author(s):  
Y. Saez ◽  
X. Cao ◽  
L. B. Kish ◽  
G. Pesti
Keyword(s):  
Communication Networks ◽  
Communication Systems ◽  
Security Requirements ◽  
Communication Security ◽  
Vehicular Communication ◽  
Johnson Noise ◽  
Key Exchange Protocol ◽  
Communication Architecture ◽  
Vehicle Communication ◽  
Vehicular Communication Networks

We review the security requirements for vehicular communication networks and provide a critical assessment of some typical communication security solutions. We also propose a novel unconditionally secure vehicular communication architecture that utilizes the Kirchhoff-law–Johnson-noise (KLJN) key distribution scheme.

Interactive Playout of Digital Video Streams

2009 ◽  
pp. 749-756
Author(s):  
Samuel Rivas ◽  
Miguel Barreiro ◽  
Víctor M. Gulías
Keyword(s):  
Digital Media ◽  
Random Access ◽  
Slow Motion ◽  
Digital Systems ◽  
The Other ◽  
Video Streams ◽  
Interactive Mode ◽  
Streaming Services ◽  
Audio Streams

Even though digital systems have many advantages over traditional analogue systems, end users expect that they will not loose any functionality in the transition. Concretely, capabilities of video cassette recorders (VCR) should be ported to stand alone digital media players (e.g., DVD players) and streaming services (e.g., digital TV and VoD services). Those capabilities are usually known as interactive playout or, simply, digital VCR functionality. Typical VCR features are random access, pause/resume, reverse play, fast forward/ backward, and slow motion. Random access and pause/resume functionalities are relatively easy to implement in digital systems. On the other hand, video coding techniques and bandwidth restrictions severely complicate the implementation of the other VCR operations. Usually, VCR capabilities apply only to video streams. In interactive playout mode, audio streams are commonly discarded. Also, the quality of video streams in interactive mode may be downgraded due to system limitations.

Effects of Digital Convergence on Social Engineering Attack Channels

2010 ◽  
pp. 1764-1777
Author(s):  
Bogdan Hoanca ◽  
Kenrick Mock
Keyword(s):  
Information System ◽  
Social Engineering ◽  
The Other ◽  
Multiple Channels ◽  
Confidential Information ◽  
Weakest Link ◽  
Digital Convergence ◽  
The Social ◽  
Voice Data ◽  
Social Engineer

Social engineering refers to the practice of manipulating people to divulge confidential information that can then be used to compromise an information system. In many cases, people, not technology, form the weakest link in the security of an information system. This chapter discusses the problem of social engineering and then examines new social engineering threats that arise as voice, data, and video networks converge. In particular, converged networks give the social engineer multiple channels of attack to influence a user and compromise a system. On the other hand, these networks also support new tools that can help combat social engineering. However, no tool can substitute for educational efforts that make users aware of the problem of social engineering and policies that must be followed to prevent social engineering from occurring.

Order to produce evidence

2018 ◽  
Author(s):  
Hans-Jürgen Ahrens
Keyword(s):  
The Other ◽  
Third Party ◽  
Confidential Information

Where a party has presented reasonably available and plausible evidence in support of its claims and has, in substantiating those claims, specified evidence which lies in the control of the other party or a third party, the Court may on a reasoned request by the party specifying such evidence, order that other party or third party to produce such evidence. For the protection of confidential information the Court may order that the evidence be disclosed to certain named persons only and be subject to appropriate terms of non-disclosure.

scholarly journals Stability and Delay of NDMA-MPR Protocol in Rice-Correlated Channels with Co-Channel Interference

Technologies ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 22
Author(s):  
Ramiro Sámano-Robles
Keyword(s):  
Real Time ◽  
Multiple Access ◽  
Random Access ◽  
Low Latency ◽  
Multiple Antenna ◽  
Average Delay ◽  
Correlated Channels ◽  
Binary Feedback ◽  
Channel Interference ◽  
Extended Analysis

This paper investigates backlog retransmission strategies for a class of random access protocols with retransmission diversity (i.e., network diversity multiple access or NDMA) combined with multiple-antenna-based multi-packet reception (MPR). This paper proposes NDMA-MPR as a candidate for 5G contention-based and ultra-low latency multiple access. This proposal is based on the following known features of NDMA-MPR: (1) near collision-free performance, (2) very low latency values, and (3) reduced feedback complexity (binary feedback). These features match the machine-type traffic, real-time, and dense object connectivity requirements in 5G. This work is an extension of previous works using a multiple antenna receiver with correlated Rice channels and co-channel interference modelled as a Rayleigh fading variable. Two backlog retransmission strategies are implemented: persistent and randomized. Boundaries and extended analysis of the system are here obtained for different network and channel conditions. Average delay is evaluated using the M/G/1 queue model with statistically independent vacations. The results suggest that NDMA-MPR can achieve very low values of latency that can guarantee real- or near-real-time performance for multiple access in 5G, even in scenarios with high correlation and moderate co-channel interference.

scholarly journals B&W Call Admission Control for Multimedia Communication Networks

2019 ◽  
Vol 7 (6) ◽  
pp. 52-58
Author(s):  
Lain-Chyr Hwang ◽  
San-Yuan Wang
Keyword(s):  
Signal Processing ◽  
Admission Control ◽  
Communication Networks ◽  
Communication Systems ◽  
Call Admission Control ◽  
Multimedia Communication ◽  
Heterogeneous Traffic ◽  
The Other ◽  
Call Admission ◽  
Signal Processing Systems

In the multimedia communication networks providing quality of service (QoS), an interface between the signal processing systems and the communication systems is the call admission control (CAC) mechanism. Owing to the heterogeneous traffic produced by diverse signal processing systems in a multimedia communication network, the traditional CAC mechanism that used only one CAC algorithm can no longer satisfy the aim of QoS CAC: Utilize the network resource to the most best and still satisfy the QoS requirements of all connections. For satisfying the aim of QoS CAC in the multimedia communication networks, this study proposed an innovative CAC mechanism called black and white CAC (B&W CAC), which uses two CAC algorithms. One of them is called black CAC controller and is used for the traffic with specifications more uncertain, which is called black traffic here. The other is call white CAC controller and is for the traffic with clearer specifications, which is call white traffic. Because white traffic is simple, an equivalent bandwidth CAC is taken as the white CAC. On the other hand, a neural network CAC (NNCAC) is employed to be the black CAC to overcome the uncertainty of black traffic. Furthermore, owing to more parameters needed in a QoS CAC mechanism, a hierarchical NNCAC is proposed instead of the common used NNCAC. Besides to accommodate more parameters, a hierarchical NNCAC can keep the complexity low. The simulation results show the B&W CAC can obtain higher utilization and still meet the QoS requirements of traffic sources.

scholarly journals Semi-Equalizing Load in Multi-hop Wireless Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 3047-3051 ◽  
Keyword(s):  
Distributed Algorithms ◽  
Scheduling Algorithm ◽  
Optimal Schedule ◽  
Local Information ◽  
The Other ◽  
Delivery Time ◽  
Average Delay ◽  
Node Scheduling ◽  
Maximum Delay ◽  
Simulation Results

Scheduling transmissions in a well-organized and fair manner in multi hop wireless network [MWN] is very crucial and challenging .For semi equalizing the load a distributed node scheduling algorithm is used through slot reallocation based on local information swap . The algorithm helps to find the delay or shortest delivery time is achieved when the load is semi-equalized throughout the network. We have simulated the Local voting algorithm and found that the system converges asymptotically toward the optimal schedule. In this paper we propose a congestion free scheme to schedule the node transmissions conflict free. The proposed algorithm achieves better performance than the other distributed algorithms in terms of fairness, average delay, and maximum delay in simulation results.

scholarly journals Lower bound for average delay in unblocked random access algorithm with orthogonal preambles

2020 ◽  
pp. 79-85
Author(s):  
Artem Burkov ◽  
Seva Shneer ◽  
Andrey Turlikov
Keyword(s):  
Lower Bound ◽  
Resource Sharing ◽  
Queuing Theory ◽  
Multiple Access ◽  
System Analysis ◽  
Random Access ◽  
Arrival Rate ◽  
High Energy ◽  
Average Delay ◽  
Closed Expression

Introduction: Currently, the first versions of 5G communication standard networks are being deployed and discussions are underway on the further development of cellular networks and the transition to the 6G standard. The work of the currently popular idea of ​​the Internet of Things (IoT) is supposed to be in the framework of a Massive Machine-Type Communications scenario, which has a number of requirements for operation characteristics: very high energy efficiency, relatively low delay and fairly reliable communication. It is assumed that random multiple access procedures are used, since, due to the nature of the traffic, it is impossible to develop a channel resource sharing policy. To increase the efficiency of random access, a class of unblocked algorithms using orthogonal preambles can be used. Purpose: to calculate the lower bound of the average delay for the class of unblocked random multiple access algorithms using orthogonal preambles. Methods: system analysis, a theory of random processes, queuing theory, and simulation. Results: A model of a system with a potentially unlimited number of users who use random unblocked access to transmit data over a common communication channel using orthogonal preambles is proposed. A closed expression is obtained for calculating the lower bound of the average delay in such a system depending on the intensity of the input arrival rate. The limit value of the intensity of the input arrival rate to which the system operates stably is determined. Shown are the results of simulation with respect to the obtained bound. Practical relevance: the obtained boundary allows us to estimate the lower average delay in the described class of algorithms. Its application allows us to determine the possibility of using the considered class of algorithms from the point of view of limitations on the average delay at the stage of designing random multiple access systems.

scholarly journals Delay Performance of a Two-User Broadcast Channel with Security Constraints

2019 ◽  
Vol 1 (1) ◽  
Author(s):  
Antonia Arvanitaki ◽  
Nikolaos Pappas ◽  
Parthajit Mohapatra ◽  
Niklas Carlsson
Keyword(s):  
Optimization Problem ◽  
Performance Metrics ◽  
Success Probability ◽  
Packet Delay ◽  
Numerical Results ◽  
Full Duplex ◽  
Broadcast Channel ◽  
Average Delay ◽  
Successive Decoding ◽  
Legitimate User

AbstractIn this paper, we consider the two-user broadcast channel with security constraints. We assume that a source broadcasts packets to two receivers, and that one of them has secrecy constraints, i.e., its packets need to be kept secret from the other receiver. The receiver with secrecy constraint has full-duplex capability, allowing it to transmit a jamming signal to increase its secrecy. We derive the average delay per packet and provide simulations and numerical results, where we compare different performance metrics for the cases when both receivers treat interference as noise, when the legitimate receiver performs successive decoding, and when the eavesdropper performs successive decoding. The results show that successive decoding provides better average packet delay for the legitimate user. Furthermore, we define a new metric that characterizes the reduction on the success probability for the legitimate user that is caused by the secrecy constraint. The results show that secrecy poses a significant amount of packet delay for the legitimate receiver when either receiver performs successive decoding. We also formulate an optimization problem, wherein the throughput of the eavesdropper is maximized under delay and secrecy rate constraints at the legitimate receiver. We provide numerical results for the optimization problem, where we show the trade-off between the transmission power for the jamming and the throughput of the non-legitimate receiver. The results provide insights into how channel ordering and encoding differences can be exploited to improve performance under different interference conditions.

Sign in / Sign up

Export Citation Format

Share Document