Packet Transmission Time Research Articles

METHOD FOR CALCULATION MAXIMUM THROUGHPUT HIDDEN CHANNELS IN SYSTEMS OF STEGANOGRAPHIC COMMUNICATIONS

An analysis of the performance indicators multiservice telecommunication networks using the sixth technological order based on the NGN (Next Generation Network) architectural concept and future FN (Future Networks) networks was carried out to build high-performance steganographic systems with increased covert channels through-put, ensuring the achievement of a certain level information security. Comprehensive criteria for the efficiency the functioning steganographic systems are considered and the channel capacity of the steganosystem as a communication system with packet switching is selected. On the basis of the study, a new approach to constructing a method for evaluating complex indicators of the quality of steganographic communication during embedding and extracting hidden data is proposed. The quality of steganographic communication refers to the properties steganocommunication to ensure the efficiency of the system, both timely and reliable transmission of messages. On the basis of the proposed approach, the effectiveness steganographic systems in the construction of covert channels for the transmission secret data transmitted over communication channels was studied. Taking into account the new entropy approach, a method for calculating the indicators of the latent throughput steganographic systems in packet- switched communication networks has been created. As a result of the study calculation method, important analytical expressions were obtained for evaluating complex indicators throughput steganographic systems, such as the throughput of covert channels, the maximum possible value of the performance of a binary source packets, the average packet transmission time with the proposed coding scheme, and the residual throughput of the communication channel. Based on the results obtained, covert channel performance in steganographic systems was simulated using the Communications Toolbox package, an extension of the standard Matlab environment designed for calculating and modeling communication systems. The table contains indicators of the residual throughput of the system and the parameters of covert channel, taking into account the lengths of the headers of the network and channel levels of the open systems interaction models. With the considered method counteraction, a graphical dependence of the maximum value residual system throughput on the covert channel parameter is plotted. On the basis of the analysis, actual problems are identified, recommendations are developed to improve the efficiency of the use steganographic systems architectures for multiservice telecommunication networks.

Low-Power Status Updates via Sleep-Wake Scheduling

We consider the problem of optimizing the freshness of status updates that are sent from a large number of low-power sources to a common access point. The source nodes utilize carrier sensing to reduce collisions and adopt an asynchronized sleep-wake scheduling strategy to achieve a target network lifetime (e.g., 10 years). We use <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">age of information</i> (AoI) to measure the freshness of status updates, and design sleep-wake parameters for minimizing the weighted-sum peak AoI of the sources, subject to per-source battery lifetime constraints. When the sensing time (i.e., the time duration of carrier sensing) is zero, this sleep-wake design problem can be solved by resorting to a two-layer nested convex optimization procedure; however, for positive sensing times, the problem is non-convex. We devise a low-complexity solution to solve this problem and prove that, for practical sensing times that are short, the solution is within a small gap from the optimum AoI performance. When the mean transmission time of status-update packets is unknown, we devise a reinforcement learning algorithm that adaptively performs the following two tasks in an “efficient way”: a) it learns the unknown parameter, b) it also generates efficient controls that make channel access decisions. We analyze its performance by quantifying its “regret”, i.e., the sub-optimality gap between its average performance and the average performance of a controller that knows the mean transmission time. Our numerical and NS-3 simulation results show that our solution can indeed elongate the batteries lifetime of information sources, while providing a competitive AoI performance.

TRANSMISSION OF HOLOGRAPHIC INFORMATION ON A SINGLE SIDEBAND

When holographic information is transmitted through communication channels, a problem arises associated with the large capacity of holograms. In the patent of the Russian Federation No. 2707582, the possibility of compressing holographic information was shown, similar to the transmission on one sideband known in radio electronics. The experimental transmission of such compressed information over a Wi-Fi wireless communication channel with a frame rate of more than 25 frames per second is shown in this paper. The experiment of transmitting holographic information of 3D images over a wireless Wi-Fi communication channel to simulate 3D video using the FTP protocol was carried out. In accordance with the RF patent No. 2707582, each transmitted frame of a 3D image was the sum of two 2D frames-a texture (2000x2000 pixels) and a mask (1000x1000 pixels). To simulate the transmission of a video sequence, packets of 500 double frames were transmitted simultaneously. The transmission times of these frame packets measured in real time by FileZilla showed that the transmission of full holographic information about a 3D object in real time with a frame rate greater than 25 frames / sec. quite feasible.

Packet-Level Slot Scheduling MAC Protocol in Underwater Acoustic Sensor Networks

With the development of the Internet of Underwater Things (IoUT), underwater acoustic sensor networks (UASNs) have become an enabling system to support real-time and continuous data transmission. Existing scheduling-based medium access control (MAC) protocols ignored the limitations between the generation time and the transmission time of forwarding packets. This results in unavailability of some scheduled slots, and makes packets endure more waiting time on relay nodes and thereafter longer end-to-end delay. To reduce transmission latency, this article develops a novel scheduling-based MAC protocol, which schedules slots in the packet level. All packets to be generated and transmitted in a frame are predicted and scheduled. Considering our defined packet collision constraint and traffic-flow constraint, we formulate the slot scheduling problem in a frame into a combinatorial optimization problem, which ensures that all source packets transmitted in a frame can be delivered to the sink node with the minimum average end-to-end delay within the same frame. To solve this problem, two algorithms are proposed, namely, an optimal packet-level slot scheduling (PLSS) algorithm and a heuristic approximate PLSS (PLSS-A) algorithm. The performances of our proposed protocol using both algorithms are evaluated with different network scales, packet lengths, and offered traffic loads. Numerical results demonstrate that both PLSS and PLSS-A perform well in terms of average end-to-end delay and service fairness, and have an advantage in the network throughput in large-scale networks. Our proposed PLSS MAC protocol is predicted to be promising in large-scale UASNs with demand for real-time and long-term monitoring.

A caching‐enabled light control scheme for aerobics video

The video transmission traffic has account for 60% Internet traffic, and how to optimize the video transmission efficiency has become a major challenge. Especially, the aerobics video is strongly subjected to both temporal locality and spatial locality, and the related contents are also dynamically changeable with the precise and complex movements. Thus, in the age of multimedia, the transmission optimization of aerobics video has the considerable research value. In this paper, a transmission control scheme for aerobics video is proposed. This scheme has the light feature, which is embodied by one heuristic video compression method. Then, this paper realizes the effective congestion control based on the adaptive rate design. Meanwhile, video compression and congestion control are performed in the simultaneous way, and they are completed by using the explored in‐network cache. Given this, the simple cache allocation method is presented at last. Two baselines are compared by evaluating packet loss rate, transmission time and delay jitter, and the experiment results demonstrate the efficiency of the proposed transmission scheme.

New type NP-CSMA of adaptive multi-priority control WSN protocol analysis

Wireless sensor networks (WSN) uses a large number of cheap micro sensor nodes, which can be used to perceive and deal with the information that the transmission network covers the object in the geographic area, so it is very popular among people. P-CSMA access to WSN can control the system and reduce energy consumption, but the overall effect is general and the practicability is common. In this paper, a three-clock non-persistent P-CSMA (NP-CSMA) based on variable collision length is proposed to improve system throughput. By dividing the successful packet transmission time (1 + a), the collision packet transmission time (b + a), the free packet sending time a, the average cycle method is used to find out the important parameters of the system, such as throughput, collision rate and idle rate, striving to minimise the system energy consumption, effectively extending the life cycle of nodes and reducing costs. Finally, simulation experiments are validated the validity of the agreement, comparing with other protocols to verify the superiority of this agreement.

TB/GI/1 queues with arrival traffic envelopes

Consider a queueing system where the job service times are not known upon arrival; e.g., a transmission server of a wireless channel where packet transmission times are random, or a virtual machine handling a stream of tasks whose execution times are not perfectly predictable. We give bounds on the tail of the workload distribution of a partially regulated, single-server queue whose arrival processes are arbitrarily distributed stationary random point processes on the integers that satisfy token-bucket constraints expressed via an arbitrary concave function f, and whose job service times are independent with a common distribution.

RETRACTED ARTICLE: Improving spectral efficiency and low latency in 5G framework utilizing FD-MIMO

Multiple input-multiple output (MIMO), massive MIMO, full-dimension MIMO (FD-MIMO) are the most recent remote advancements, which structure the purpose of takeoff for long term evolution systems. FD-MIMO is the promising technology proposed in the Third Generation Partnership Project to the transformation for the fifth-generation wireless communication schemes. FD-MIMO tramples several practical challenges imposed by massive MIMO systems such as interference, hardware limitations by the use of 2D active antenna array system which provides beam-forming in both azimuths as well as elevation domains in three-dimensional space. The traditional construction of big-scale planar arrays maximizes the spatial correlation is addressed using the dynamic device specific single down tilt beam-forming which minimizes the signal to interference ratio. That is further reduced by using FD-MIMO with incremental Redundancy and Regression monitoring techniques formulated as soft combining strategies. In this paper, the simulation results show maximizing of the minimum signal-to-interference ratio, spectral efficiency improvement and minimizing packet transmission time between eNodeB. Also, user equipment utilizing incremental redundancy shifting, hybrid automatic repeat request and regression monitoring strategies using network simulator 3.

Self-Coupling Data Transmission for Random Multiple Access Communications

We propose a technique for multiple access communications based on the spatial graph coupling principle. Contrary to the existing approaches that require regularized packet transmission times to create a chain of temporally-coupled packets we present a construction of a self-coupling packet. Each transmitted data packet is encoded and modulated in a way that allows the receiver to perform successful cancellation of the inter-packet interference for the case when the packets are transmitted at random times. We show that the overall system throughput can approach the channel capacity limit. Numerical results demonstrate superior bit-error rates achieved by the self-coupling system compared to the temporal-coupling system.

Minimization of IEEE 802.11p Packet Collision Interference through Transmission Time Shifting

V2I communications are characterized by the presence of network nodes in vehicles and in the infrastructures that these vehicles use, as well as by the wireless interactions among them. Safety-related applications demand stringent requirements in terms of latency and packet delivery probability, especially when safety messages have to be delivered to vehicles by the infrastructure. Interference issues stem from the typical characteristics of wireless communications, i.e., the noise of the wireless medium, the limited communication range of the wireless entities, and the receiver passivity of all the conventional wireless transceivers during transmissions. This paper presents a synchronization mechanism to artificially replicate at a host premises destructive interference due to hidden terminals, together with an application-level technique to minimize that interference by shifting the packet transmission time, similarly to the MAC TDMA channel access method. As both have been field-tested, the paper also analyzes the results of these tests, all performed with real hardware on IEEE 802.11p over different frequencies and transmission powers, and with repeatability in mind. The resulting figures attest that interference effects due to hidden terminals may indeed take place on real IEEE 802.11p networks, and that carefully designed time-shifting mechanisms can actively mitigate them.

Secrecy Outage Probability and Fairness of Packet Transmission Time in a NOMA System

In this paper, we analyze the secrecy outage probability (SOP) and the fairness of average packet transmission time for a non-orthogonal multiple access (NOMA) system which consists of a base station (BS) and two legal NOMA users in the presence of an eavesdropper (Eve). In order to extract the superimposed signal, the Eve is considered in two modes, i.e., successive interference cancellation (SIC) mode and parallel interference cancellation (PIC) mode. Accordingly, we analyze the secrecy performance of the considered system by deriving a new exact expression for SOP. Furthermore, the optimal power allocation between two legal users is determined such that the average transmission time from BS to two legitimate users are approximately equal to achieve the fairness of average packet transmission time. Monte Carlo simulations are provided to verify our analytical results.

Delay Optimization for Industrial Wireless Control Systems Based on Channel Characterization

Wireless communication is gaining popularity in the industry for its simple deployment, mobility, and low cost. Ultralow latency and high reliability requirements of mission-critical industrial applications are highly demanding for wireless communication, and the indoor industrial environment is hostile to wireless communication due to the richness of reflection and obstacles. Assessing the effect of the industrial environment on the reliability and latency of wireless communication is a crucial task, yet it is challenging to accurately model the wireless channel in various industrial sites. In this article, based on the comprehensive channel measurement results from the National Institute of Standards and Technology at 2.245 and 5.4 GHz, we quantify the reliability degradation of wireless communication in multipath fading channels. A delay optimization based on the channel characterization is then proposed to minimize packet transmission times of a cyclic prefix orthogonal frequency division multiplexing system under a reliability constraint at the physical layer. When the transmission bandwidth is abundant and the payload is short, the minimum transmission time is found to be restricted by the optimal cyclic prefix duration, which is correlated with the communication distance. Results further reveal that using relays may, in some cases, reduce end-to-end latency in industrial sites, as achievable minimum transmission time significantly decreases at short communication ranges.

Performance Analysis of Volume Loads of (Services and Transmission) Traffic in VPN Networks: A Comparative Study

This paper proposes a design for a network connected over public networks using Virtual Private Network (VPN) technique. The network consists of five sites; center server and four customer service sites, each site consists of a number of LANs depending on the user services requirements. This work aims to measure the effect of VPN on the performance of a network. Four approaches are implements: Network design without using VPN, network design using VPN with centralized servers, network design using VPN with distributed servers, and network design using server load balance.The OPNET and BOSON simulation results show higher response time for packet transmission due to effect of VPN tunneling. The concurrent activation of application execution is used as a solution to the delay problem of the initial timing period while the application proceeds. The results dealing with QoS are E-mail, FTP, voice services traffic and IP traffic dropped. The VPN Tunnels is in the range of (0.01 to 0.02) sec.; along with this simulator there are four VPN tunnels in the network. Also, a special server’s load balance is used to manage distribution of the server processing load across all other network servers to achieve the best response

Transmission Early-Stopping Scheme for Anti-Jamming Over Delay-Sensitive IoT Applications

Time-critical, wireless Internet of Things applications have been drawing increasing attention lately. The most characterizing feature of such applications is that a packet has to be delivered within a certain deadline. Not meeting the deadline could result in severe consequences. Jamming attacks utilize the shared nature of the wireless medium to corrupt transmitted packets. Although a corrupted packet could be retransmitted several times until successful delivery, this would add latency and hence could lead to missing the deadline. In this paper, we propose a jamming detection scheme that uses the packet transmission time as a statistic to make detection decisions. The key insight behind our proposed scheme is that, a long transmission/retransmission time for a certain packet indicates an abnormal condition, such as jamming. Therefore, we devise an optimal transmission-time threshold that, when exceeded, a jammer is detected. Unlike most existing detection schemes where, in case of a detection error, retransmission could continue until the deadline is reached, our scheme aims to detect the jammer earlier than the deadline so that the remaining time (until the deadline) could be utilized in retransmitting the packet over a safe channel. The proposed detection scheme is a general framework that can be applied to many situations. After conducting a thorough analysis, we apply the proposed early-stop jamming detection framework to the distributed coordinated function medium access mechanism specified by the 802.11 standard. Our simulation results show significant performance gains achieved by the proposed scheme.

Modifying the MANET Routing algorithm by GBR CNR-Efficient Neighbor Selection Algorithm

In today’s worlds, Mobile Ad-Hoc Network (MANET) plays most important role in the field networks technology in the world. The MANET has been rapidly rising and becoming signif-icant from the last decade. A MANET is a kind of wireless net-work which has been set-up without requirement of fixed infra-structure where mobile nodes are connected over wireless link. Due to moving nature of the devices, the network topology is unstable and will change dynamically. That’s why stable routing in MANET cannot work properly. In this research paper, a new routing algorithm is proposed to get better routing performance in the MANET. The proposed algorithm designed based on the number of neighbors in the network. Planned algorithm is the improvement of GBR-CNR-LN (GBR-CNR with less neighbors) by calculating the stay time between the selected neighbor nodes and the transmission nodes. If the stay time of sender node is more than the packet transmission time then the selected node is the efficient neighbor selection. The algorithm is implemented and results are analyzed. The results of this paper show the use-fulness of the proposed algorithm. The Evaluation of AODV protocol was carried out using Python and outcome of this evalu-ation showed that proposed Algorithm gave better results than GBR-CNR with less neighbor in terms of End-to-End delay, Number of control message transferred(Routing Overhead) and Network Load. The proposed Algorithm (GC-ENS) decrease Average End-to-End delay 52.54 %, reduce Average Routing Overhead 60.54% and decline the Average load on Network 61.17%.

Resilient Clock Synchronization Using Power Grid Voltage

Many clock synchronization protocols based on message passing, e.g., the Network Time Protocol (NTP), assume symmetric network delays to estimate the one-way packet transmission time as half of the round-trip time. As a result, asymmetric network delays caused by either network congestion or malicious packet delays can cause significant synchronization errors. This article exploits sinusoidal voltage signals of an alternating current (AC) power grid to limit the impact of the asymmetric network delays on these clock synchronization protocols. Our extensive measurements show that the voltage signals at geographically distributed locations in a city are highly synchronized. Leveraging calibrated voltage phases, we develop a new clock synchronization protocol that we call Grid Time Protocol (GTP), which allows direct measurement of one-way packet transmission times between its slave and master nodes, subject to an analytic condition that can be easily verified in practice. The direct measurements render GTP resilient against asymmetric network delays under this condition. A prototype implementation of GTP maintains sub-millisecond synchronization accuracy for two nodes tens of kilometers apart in the presence of malicious packet delays. The result has been demonstrated for both Singapore and Hangzhou, China. Simulations driven by real network delay measurements between Singapore and Hangzhou under both normal and congested network conditions also show the synchronization accuracy improvement by GTP. We believe that GTP is suitable for grid-connected distributed systems that are currently served by NTP but desire higher resilience against unfavorable network dynamics and packet delay attacks.

Interference Range-Reduced Cooperative Multiple Access with Optimal Relay Selection for Large Scale Wireless Networks.

Cooperative communication improves the link throughput of wireless networks through spatial diversity. However, it reduces the frequency reuse of the entire network due to the enlarged link interference range introduced by each helper. In this paper, we propose a cooperative medium access control (MAC) protocol with optimal relay selection (ORS-CMAC) for multihop, multirate large scale networks, which can reduce the interference range and improve the network throughput. Then, we investigate the performance gain achieved by these two competitive factors, i.e., the spatial frequency reuse gain and spatial diversity gain, in large scale wireless networks. The expressions of maximum network throughput for direct transmissions and cooperative transmissions in the whole network are derived as a function of the number of concurrent transmission links, data packet length, and average packet transmission time. Simulation results validate the effectiveness of the theoretical results. The theoretical and simulation results show that the helper can reduce the spatial frequency reuse slightly, and spatial diversity gain can compensate for the decrease of the spatial frequency reuse, thereby improving the network throughput from the viewpoint of the whole network.

The Age of Information in Multihop Networks

Information updates in multihop networks such as Internet of Things (IoT) and intelligent transportation systems have received significant recent attention. In this paper, we minimize the age of a single information flow in interference-free multihop networks. When preemption is allowed and the packet transmission times are exponentially distributed, we prove that a preemptive last-generated, first-served (LGFS) policy results in smaller age processes across all nodes in the network than any other causal policy (in a stochastic ordering sense). In addition, for the class of new-better-than-used (NBU) distributions, we show that the non-preemptive LGFS policy is within a constant age gap from the optimum average age. In contrast, our numerical result shows that the preemptive LGFS policy can be very far from the optimum for some NBU transmission time distributions. Finally, when preemption is prohibited and the packet transmission times are arbitrarily distributed, the non-preemptive LGFS policy is shown to minimize the age processes across all nodes in the network among all work-conserving policies (again in a stochastic ordering sense). Interestingly, these results hold under quite general conditions, including 1) arbitrary packet generation and arrival times, and 2) for minimizing both the age processes in stochastic ordering and any non-decreasing functional of the age processes.

High-Performance Wireless Networks for Industrial Control Applications: New Targets and Feasibility

Wireless networks are ever more deployed in the industrial control scenario, thanks to the numerous benefits they can bring, especially in terms of costs and flexibility. However, some critical fields of application, such as motion control, power systems automation, or power electronics control, to mention some, have extremely tight requirements in terms of timeliness, reliability, and determinism, which nowadays can only be satisfied by wired communication networks. Indeed, the available industrial wireless solutions are far from offering adequate performance levels, especially in the timing budget, due to the native limitations of their physical (PHY) layers. In this paper, an innovative approach for high-performance industrial wireless networks [wireless high performance (WirelessHP)] is presented, based on a substantial redesign of the lower layers of the industrial wireless protocol stack, with the aim of supporting the requirements of critical industrial control applications. The required levels of timeliness, reliability, and determinism are first derived through a comprehensive survey that looks at real-world application scenarios as well as at the performance of wired networks for industrial control, such as real-time Ethernet networks. The design of a new solution, which is able to satisfy these targets, is then discussed in detail, introducing a low-latency PHY layer that aims at reducing the transmission time of short packets to $1~\mu \text{s}$ , or even less. The feasibility of the proposed solution is presented through an experimental demonstrator based on software-defined radios, while its performance bounds are computed through theoretical analyses. Finally, future activities in the context of WirelessHP are widely discussed, providing an overview of the directions that will have to be addressed, particularly in the design of the upper layers.

Slotted Secondary Transmission With Adaptive Modulation and Coding Under Interweave Cognitive Radio

In this paper, we propose a discrete-time Markov model to characterize slotted secondary transmission process under interweave cognitive implementation. Stationary distribution is solved in closed form to evaluate SU-to-PU collision probability and SU successful transmission probability. Assuming that SU transmission adopts adaptive modulation and coding (AMC), we then carry out the queuing analysis in terms of throughput, queuing delay, and packet drop probability, based on a two-dimensional finite-state Markov chain for small-size packet transmission. The optimal length of secondary slot is solved by maximizing throughput subject to an SU-to-PU collision probability constraint. For large-size packet transmission, the probability mass function of extended delivery time for secondary packet transmission is also derived. Selected numerical results are presented to illustrate the mathematical formulas and to validate our research results.