Packet Transmission Time Research Articles

ANALYSIS OF ROUTING PROTOCOLS CHARACTERISTICS IN AD-HOC NETWORK

Background. Wireless ad-hoc networks are becoming increasingly prevalence in remote areas, in extreme environments, even in military operations, and in scenarios where setting up infrastructure networks is not possible. Research of ad-hoc routing protocols problems allows improving the efficiency of their operation in conditions of high variability in packet loss or instability of network operation when the speed of users changes. Objective. The purpose of the paper is analysis of packet loss dependency from a network operation time, study of a user speed influence on a network efficiency, and research of network operation efficiency with different routing protocols. Methods. The method of routing protocols efficiency evaluation is the simulation of their operation in an ad-hoc network on a test data set and research of a network indicators dependency in time under different loads and changing mobility of users. Results. The conducted research demonstrated that user’s mobility at different speeds significantly affects the network operation as a whole. The instability of users' positions leads to a significant increase in route search time and packet transmission time. Among researched GPSR, DSDV, and AODV protocols, the latter proved to be the best because it has the lowest percentage of data loss and the lowest average time of message send and receive operations. Conclusions. The work is dedicated to the actual problem of developing and setting parameters of ad-hoc network. Received research results indicate the need to choose the optimal routing protocol depending on specific application conditions, such as user movement speed and network stability. The proposed solutions can be the first stage of complex processing of packets in the mobile network and justify the choice of AODV protocol as a basis for further improvement.

Classifying IP Spoofing Requests Using Heuristic Fuzzy Computer Network Approach

Distributed Denial of Service (DoS) Attack This represents a serious problem for Internet communications. This problem is exacerbated if an attacker tampers with the data. Source IP address. Attackers can easily change the source IP address leads to unauthorized access to network resources. Many solutions are available. Please identify this issue in your research community. In this paper, we proposed a detection method that takes data flow into account. Metric. An attacker can change any field in the IP, so expect a packet hop count field. In this article, he will introduce one. A Heuristic Fuzzy Logic Approach to Spoofing Detection package. Effective implementation of fuzzy rules the two member functions HC and PTT are the Receive IP header. The classification of forged packets is as follows: Identify changes up close Hop count and packet transmission time due to fuzzy Membership function using fuzzy triangles Membership features.

A Markovian Analysis of an IEEE-802.11 Station with Buffering

The purpose of this paper is to analyze the so-called backoff tech- nique of the IEEE 802.11 protocol with buffers. This protocol rules the trans- missions on a radio channel between nodes (or stations) of a network exchanging packets of information. In contrast to existing models, packets arriving at a sta- tion which in the backoff state are not discarded, but are stored in a buffer of in nite capacity. The backoff state corresponds to the number of time-intervals (mini-slot) that a node must wait before its packet is actually transmitted. As in previous studies, the key point of our analysis hinges on the assumption that the time on the radio channel is viewed as a random succession of trans- mission slots (whose duration corresponds to a packet transmission time) and mini-slots, which stand for the time intervals during which the backoff of the station is decremented. During these mini-slots the channel is idle, which im- plies that there is no packet transmission. These events occur independently with given probabilities, and the external arrivals of messages follow a Pois- son process. The state of a node is represented by a three-dimensional Markov chain in discrete-time, formed by the triple (backoff counter, number of packets at the station, number of transmission attempts). Stability (ergodicity) condi- tions are obtained for an arbitrary station and interpreted in terms of maximum throughput. Several approximations related to these models are also discussed.

Maximizing the stable throughput of heterogeneous nodes under airtime fairness in a CSMA environment

The stability region of non-persistent CSMA is analyzed in a general heterogeneous network, where stations have different mean packet arrival rates, packet transmission times probability distributions and transmission probabilities. The considered model of CSMA captures the behavior of the well known CSMA/CA, at least as far as stability and throughput evaluation are concerned. The analysis is done both with and without collision detection. Given the characterization of the stability region, throughput-optimal transmission probabilities are identified under airtime fairness, establishing asymptotic upper and lower bounds of the maximum achievable stable throughput. The bounds turn out to be insensitive to the probability distribution of packet transmission times. Numerical results highlight that the obtained bounds are tight not only asymptotically, but also for essentially all values of the number of stations. The insight gained leads to the definition of a distributed adaptive algorithm to adjust the transmission probabilities of stations so as to attain the maximum stable throughput.

System Performance Analysis of Sensor Networks for RF Energy Harvesting and Information Transmission

This paper investigates the problem of RF energy harvesting in wireless sensor networks, with the aim of finding a suitable communication protocol by comparing the performance of the system under different protocols. The network is made up of two parts: first, at the beginning of each timeslot, the sensor nodes harvest energy from the base station (BS) and then send packets to the BS using the harvested energy. For the energy-harvesting part of the wireless sensor network, we consider two methods: point-to-point and multi-point-to-point energy harvesting. For each method, we use two independent control protocols, namely head harvesting energy of each timeslot (HHT) and head harvesting energy of dedicated timeslot (HDT). Additionally, for complex channel states, we derive the cumulative distribution function (CDF) of packet transmission time using selective combining (SC) and maximum ratio combining (MRC) techniques. Analytical expressions for system reliability and packet timeout probability are obtained. At the same time, we also utilize the Monte Carlo simulation method to simulate our system and have analyzed both the numerical and simulation solutions. Results show that the performance of the HHT protocol is better than that of the HDT protocol, and the MRC technology outperforms the SC technology for the HHT protocol in terms of the energy-harvesting efficiency coefficient, sensor positions, transmit signal-to-noise ratio (SNR), and length of energy harvesting time.

Extension of LoRa Coverage and Integration of an Unsupervised Anomaly Detection Algorithm in an IoT Water Quality Monitoring System

High cost, long-range communication, and anomaly detection issues are associated with IoT systems in water quality monitoring. Therefore, this work proposes a prototype for a water quality monitoring system (IoT-WQMS) based on IoT technologies, which include in the system architecture a LoRa repeater and an anomaly detection algorithm. The system performs the data collection, data storage, anomaly detection, and alarm sending remotely and in real-time for the information to be captured by the multisensor node. The LoRa repeater allowed the spatial coverage of the LoRa communication to extend, making it possible to reach a place where originally there was no coverage with a single LoRa transmitter due to topography and line of sight. The prototype performed well in terms of packet loss rate, transmission time, and sensitivity, extending the long-range wireless communication distance. Indoor multinode testing validation for 29 days of the mean absolute error for average relative errors of water temperature, pH, turbidity, and total dissolved solids (TDS) were 0.65%, 0.30%, and 14.33%, respectively. The anomaly detector identified all erroneous data events due to node sensor recalibration and water recirculation pump failures. The IoT-WQMS increased the reliability of monitoring through the timely identification of any sensor malfunctions and extended the LoRa signal range, which are relevant features in the scope of in situ and real-time water quality monitoring.

Method for calculation indicators steganographic systems in multiservice communication networks

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 throughput, 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 stegano communication 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.

Scheduling strategy for networked control system based on variable sampling period and deadband feedback

SummaryA scheduling strategy of variable sampling period combined with deadband feedback for networked control system is proposed. Variable sampling period algorithm can allocate a reasonable sampling period to each controlled loop according to the network utilization and packet transmission time. Deadband feedback algorithm can alleviate network congestion by appropriately adjusting the packets in the network when the networked control system cannot be scheduled. According to the actual overload and utilization of the network, the designed scheduling strategy dynamically adjusts the sampling period and priority, and improves the performance of the system combined with deadband feedback. Based on the TrueTime platform, the proposed scheduling strategy is verified on a three controlled loops networked control system with interference nodes and limited network resources. The simulation results demonstrate that the designed scheduling strategy can overcome the uncertainty of the upper bound of network resources, improve output control performance, reduce integral absolute error value of the controlled loop, and shorten the packet transmission time. The overall control performance of the system is improved. The designed scheduling strategy is effective.

An Enhanced Explicit Port Forwarding Solution for Improving Video Delivery over Software-Defined Networks

<p>In order to improve video delivery, an Enhanced Explicit Port Forwarding (EEPF) solution is proposed. Data are divided into ordinary packets and video packets using a packet identification mechanism. Traditional mechanisms transmit packets through routing table lookup. As the size of the routing table often becomes excessively large, this lookup can be time-consuming. While the EEPF solution directly includes the transmission path in the video packet, which can reduce the transmission time. And by setting header flags/fields in video packets, the transmission can be further optimized. For example, to reduce the amount of duplicate data to be transmitted for broadcast packets are not replicated until they arrive at the destination switch; to avoid packet loss caused by disconnection, the transmission path can be monitored and rerouting can be initiated immediately in the event of disconnection; to increase the chance of successful delivery, packets can be replicated before they are transmitted via a path with high packet loss risk; and to prevent video packets from being discarded, the switch queue status can be monitored and managed. The testing results have shown that the EEPF solution can effectively shorten the time of video packet transmission and improve the quality of transmitted video.</p> <p> </p>

A Novel Model to Quantify the Impact of Transmission Parameters on the Coexistence Between Bluetooth Low Energy Pairs

We noted that communication performance of a Bluetooth Low Energy (BLE) connection is heavily affected by the radio interference from other connections or networks. Reliability is becoming a key requirement in BLE for its use in various Internet of Things applications. Hence, there is a widely recognized need for an in-depth study to reveal the parameters impacting BLE reliability under such radio interference. In this article, we investigate how transmission parameters, e.g., number of packets and packet transmission time, influence reliability of the BLE protocol. Specifically, a mathematical model is presented to explore the impact of the transmission parameters on the reliability of a BLE pair under interference caused by other pairs. This mathematical model is able to show the reliability issues from both the side of the BLE connection under interference and the side of the interference itself. The model is validated and novel insights on the common usage of BLE parameters by a wide range of experimental evaluations are provided. Experimental results highlight the correctness of the mathematical model, thus quantify the interplay between transmission parameters and coexistence, also the influence of other related parameters. This research provides a design-level or system-level insight in BLE usage and deployment.

The influence of edge-adding strategy on traffic capacity of multilayer network

The traffic capacity of multilayer networks is affected by many factors, such as coupling mode, routing strategy, network topology. In this paper, the authors mainly study the influence of network topology on traffic capacity. Multilayer network consists of low speed layer (A layer) and high speed layer (B layer). An edge-adding strategy is introduced to change the network topology. Firstly, the ratio of edges added to the network is determined, and the total number of edges added to the network is ma+mb, where ma is the number of edges in the original A layer network multiplied by the ratio of edges added. Then, a certain ratio of the edges of mb are added to the B layer network, and the remaining ratio of the edges are added to the A layer network. Finally, the change of network traffic capacity is analyzed. Since the B layer network is a true subset of the A layer network and the number of edges in the B layer network is smaller than that of the A layer network, the edge-adding ratio of the B layer network is ranging from 0% to 100%. The experimental simulations are conducted, and the simulation results show that when the number of edges added in the B layer is mb, that is, the B layer edge ratio is 100%, the network traffic capacity is the largest. At the same time, we compare the average packet transmission time and other evaluating parameters, the results are the best in the B layer edge ratio of 100%.

Time-Offset ALOHA With SIC

Internet-of-Things (IoT) applications for real-time control gradually increase and become computationally demanding. To provide better quality-of-service (QoS) in random access (RA) system based on slotted ALOHA (S-ALOHA), this work proposes a novel S-ALOHA system with cross-slot successive interference cancellation (SIC). To facilitate SIC, we design each slot with several time offsets (TOs) and one packet transmission time, where the length of overall TOs is a fraction of a packet transmission time. Users (re)transmit at the boundary of a TO randomly selected. This enables the base station (BS) to distinguish who makes the first and last transmissions in a collision slot and ask immediate retransmissions from them in the subsequent one or two slots. With these retransmitted packets, the BS performs SIC for the previously collided packets. We analyze the system throughput and the distribution of RA delay. The results show that the proposed system can achieve throughput from 0.5 (packets per packet transmission time) at minimum to 0.856 at maximum, depending on the number of TOs and the length of TO. In addition, to run this system stably, we propose a Bayesian-optimized backoff algorithm that enables users to use throughput-optimal (re)transmission probability. It is demonstrated that the proposed backoff algorithms can achieve the throughput close to genie-aided (GA) system.

Optimization of IoT-Fog Network Path and fault Tolerance in Fog Computing based Environment

Increasing use of smart devices and smart applications have attracted many Fog-based services like pervasive health monitoring, distributed computing, etc to improve the real-life experience of the end users. Here, various sensor-based devices gathers data and stores them in the cloud servers to provide real time information. In this context, Fog Computing provides the edge-based computation platform to the end-users and neighbouring devices to perform communication, sharing, etc. In this manuscript, we have proposed a proficient scheme that boosts the common performance by identifying the best cost path and reduces the packet transmission time by selecting the nearest neighbour amongst the fog node in the fog supporting scenario. The projected scheme also ensures live server fault by replicating server activities. The obtained results for the proposed scheme in the simulation setup of fog based environment represents the reduced network bandwidth 618020 Mbps with reduced cost $81900 USD along with the higher throughput up to 93% of the device in the environment.

Exploiting in-Slot Micro-Synchronism for S-ALOHA

Proliferation of the urban Internet-of-Things (IoTs) for smart cities has fuelled massive amounts of data over wireless cellular networks. Random access (RA) system of wireless cellular networks, e.g., 5G New Radio (NR), based on S-ALOHA system should cope with ever-growing IoT traffic. This work proposes S-ALOHA system with time offsets (TOs), where one slot consists of K TOs and one packet transmission time. The length of the overall TOs is a fraction of a packet transmission time. In the system users (re)transmit to the boundary of a TO randomly selected. This enables the base station (BS) to inform the users of who transmits the first and the last packets in the slot with collision so that the two users can retransmit successfully in the following two slots respectively. Our throughput analysis compared to simulations shows that adopting even with three and four TOs surpasses the throughput limit of S-ALOHA system without TOs. Additionally, we propose two Bayesian-optimized backoff algorithms for S-ALOHA system with TOs, with which users can apply throughput-optimal (re)transmission probability or uniform backoff window even in unsaturated traffic scenarios. Numerical results demonstrate that the proposed backoff algorithms can achieve the throughput close to an ideal system and drastically reduce the access delay compared to S-ALOHA system.

A Formula for the Probability of Successful Packet Transmission in Cognitive Radio Networks

In this article, we derive a closed-form expression for the probability of successful packet transmission (PSPT) over Rayleigh fading channels in cognitive radio networks (CRNs). The derived expression is novel, as it does not require prior channel state information. This is achieved by employing a probabilistic model for the packet transmission time, avoiding the less realistic deterministic model that is widely used in the literature. Furthermore, the derived expression allows trading accuracy with computational complexity. Our expression is computationally efficient with linear computational complexity. Simulation results demonstrate high accuracy in evaluating the PSPT, with controllable computational complexity.

UAV-Assisted Sensor Data Dissemination in mmWave Vehicular Networks Based on Network Coding

Due to good maneuverability, UAVs and vehicles are often used for environment perception in smart cities. In order to improve the efficiency of sensor data sharing in UAV-assisted mmWave vehicular network (VN), this paper proposes a sensor data sharing method based on blockage effect identification and network coding. The concurrent sending vehicles selection method is proposed based on the availability of mmWave link, the number of target vehicles of sensor data packet, the distance between a sensor data packet and target vehicle, the number of concurrent sending vehicles, and the waiting time of sensor data packet. The construction method of the coded packet is put forward based on the status information about the existing packets of vehicles. Simulation results demonstrated that efficiency of the proposed method is superior to baseline solutions in terms of the packet loss ratio, transmission time, and packet dissemination ratio.

GFDM frame design for low-latency industrial networks

This paper proposes a short packet GFDM-based physical (PHY) layer for industrial wireless networks to reduce latency. In our proposed PHY layer, the conventional OFDM scheme used in the data field of IEEE 802.11 WLAN standards is replaced by GFDM. The preamble size is also reduced from 10 symbols to 1 symbol. Furthermore, the fields of the overall packet structure are optimized in terms of total number of subcarriers and cyclic prefix length. Additionally, a noise-free GFDM scheme is subjected to concatenated channel coding to minimize error rate. Through simulation, packet transmission time is reduced by about 40 ∼ 72% compared to the OFDM-based PHY layer while achieving a PER of order 10^−3. The obtained results show that the GFDM-based PHY layer outperforms its counterpart by exhibiting a lower latency and high reliability. This performance renders the GFDM-based (proposed) PHY layer suitable for adoption in the development of wireless networks for latency and reliability constrained industrial applications. It should be noted that the simulations presented in this paper express our first step in the direction of using GFDM for industrial wireless networks to achieve low latency and high reliability. We therefore consider building a fully functional GFDM based-testbed as part of our future work.

OCDMA: a MAC Protocol for Industrial Intra-machine TeraHertz Network

This paper considers an industrial machine, where wireless sensor nodes (denoted as tags or nodes) support control applications. This scenario poses very challenging communication requirements: hundreds of tags per cubic meter can provide an overall offered throughput of tens of Gbit/s; at the same time, control applications require a latency of less than 0.1 ms. To fulfill them, this work proposes an Orthogonal Chirp Division Multiple Access (OCDMA) scheme to be used in the TeraHertz (THz) frequency band. With THz communications, even at short distances, propagation delays can be of the same order of magnitude as the packet transmission time. This requires proper consideration of such delays in the protocol design and performance evaluation. This paper mathematically derives network throughput and latency of the proposed protocol, comparing it to benchmarks; two scenarios are considered, where tags are in fixed positions or move. Results show that OCDMA outperforms the two benchmark protocols, Aloha and Polling, for static and crowded networks, and the performance is compatible with the communication requirements of industrial control applications.

Method for estimating the maximum packet transmission time in networks with end-to-end routing and time multiplexing

Method for estimating the maximum packet transmission time in networks with end-to-end routing and time multiplexing

Performance evaluation of SDWNs in cloud systems

The bursty traffic conditions and fast mobility of consumers induce significant delays in wireless networks. Taking the aforementioned factors into account, designing cost-effective wireless solutions with efficient resource usage and manageability is significantly challenging. Although cloud providers undeniably offer high-performance scalable wireless networks, delays may occur due to frequent packet losses as a result of weak signal strength, high mobility, and congestion. There is a slight difference between a wireless networking environment and typical wired networks, however, in practice, various variables exist, making it impossible to fully implement the core advantages of SDN such as rapid data processing, among others. To cope with such situations, we propose software-defined wireless networking (SDWN), a new means for wireless network virtualisation and programming capabilities. Moreover, to evaluate the proposed system, Mininet-WiFi in SDWN is used and conduct an experimental study in terms of packet transmission time and mobility visualisation over distance.