Minimum Transmission Time Research Articles

Construction of a simulated dynamic model of data packet routing on a telecommunication network fragment

The object of the current research is the process of routing data packets in a telecommunications network. It was established that the state and parameters of data transmission channels and routers could have a negative impact and need to be taken into account in the process of modeling the routing of data packets in telecommunication networks. A model of simulated dynamic modeling of data packet routing in telecommunication networks has been devised and proposed. The suggested model makes it possible to establish quantitative values of the delay time of processing data packets during their routing along a separate segment of the telecommunications network, taking into account the state and parameters of the data transmission channel and routers. It has been established that the achievement of the minimum delay time of data packets during routing is achieved by choosing the path of their transmission under the condition of minimum transmission time by communication lines and the capabilities of routers in terms of their accumulation and service speed. At the same time, the reduction of packet transmission delay time relative to the average for the time network segment can reach from 21 to 38 percent. It is shown that the main factor affecting the value of the delay time is the speed of data processing along the selected path of packet transmission. The number of routing nodes in a separate data transmission path can affect the delay time only if the parameters of the routers are equal compared to others that are included in alternative routes. The model of simulated dynamic modeling of data packet routing reported in this work, unlike the existing ones, takes into account the state and parameters of data transmission channels and routers. It can be used in practical improvement of existing and development of new multi-service telecommunication communication networks

Joint Efficient UAV Trajectory and Velocity Optimization for IoT Data Collection Using a New Projection Algorithm

Unmanned aerial vehicle (UAV)-assisted networking and communications are increasingly used in different applications, especially in the data collection of distributed Internet of Things (IoT) systems; its advantages include great flexibility and scalability. However, due to the UAV’s very limited battery capacity, the UAV energy efficiency has become a bottleneck for longer working time and larger area coverage. Therefore, it is critical to optimize the path and speed of the UAV with less energy consumption, while guaranteeing data collection under the workload and time requirements. In this paper, as a key finding, by analyzing the speed–power and the speed–energy relationships of UAVs, we found that there should be different speed selection strategies under different scenarios (i.e., fixed time or fixed distance), which can lead to much-improved energy efficiency. Moreover, we propose CirCo, a novel algorithm that jointly optimizes UAV trajectory and velocity for minimized energy consumption. CirCo is based on an original projection method, turning a 3D problem (GN locations and transmission ranges on the 2D plane, plus the minimum transmission time requirements on the temporal dimensions) into a 2D problem, which could help to directly find the feasible UAV crossing window, which greatly reduces the optimization complexity. Moreover, CirCo can classify the projected conditions to calculate the optimal path and speed schedule under each category, so that the energy consumption of each situation can be fine-regulated. The experiments demonstrate that CirCo can save as much as 54.3% of energy consumption and 62.9% of flight time over existing approaches.

Optimal flow and capacity allocation in multiple joint quickest paths of directed networks

Shared vertices or edges in joint paths bring difficulties to flow routing and scheduling with delay requirements in networks with consideration of both edge lengths and capacities since flow along the different paths will encounter each other in capacitated edges with time dislocation. For an amount of flow, the quickest path problem (QPP) presents a good link for path lengths and capacities with the transmission time of the flow. Extended from the QPP, we propose an edge-path form traffic model for an amount of flow through multiple joint paths with different lengths in one-source one-sink directed capacitated networks. Then, an optimization model for minimum transmission time within feasible traffic constrained by edge capacities is constructed. We then derived the vertex–edge form of the optimization model from the edge-path form. The proposed optimization models in both forms are proved to be linear fractional programming problems, which can be solved in polynomial time. A routing algorithm based on the solution of the vertex–edge form optimization is developed combined with the DFS-based route-searching method. The proposed model and algorithm could be applicable in the real-time operation and management of practical network systems.

The Function of Remote Monitoring System of a Robot Inverter Based on PLC and Cloud Platform

In order to improve the communication efficiency of the CAN bus application layer communication protocol of the inverter network monitoring system, this paper proposes a TTCAN scheduling optimization algorithm for the robot inverter remote monitoring system based on PLC and cloud platform. According to the analysis of the communication requirements of the frequency converter monitoring system, this paper designs the application layer protocol of the nodes in the system and establishes the system scheduling matrix. The time triggered can bus protocol (TTCAN) combines the event triggered mechanism with the time triggered mechanism. The hybrid scheduling strategy is used to optimize the system matrix of TTCAN; that is, the hybrid particle swarm optimization algorithm is used for periodic messages. For nonperiodic messages, uniform scheduling strategy and dynamic scheduling algorithm are adopted. The simulation is carried out by MATLAB tools. The simulation results show that the sum of partial minimum transmission time is 1928 and there are multiple optimal individuals through the hybrid particle swarm optimization algorithm. Compared with the traditional genetic algorithm and single particle swarm optimization algorithm, the hybrid algorithm is better than the traditional genetic algorithm and particle swarm optimization algorithm in terms of iteration times and average fitness value. In conclusion, the optimized TTCAN protocol improves the real-time performance, reliability, and bandwidth utilization of the communication network.

MCA-MAC: Modified Cooperative Access MAC Protocol in Wireless Sensor Networks

Throughput, energy efficiency and average packet delivery delay are some of the most crucial metrics that should be considered in Wireless Sensor Networks (WSNs). This paper proposes a modified Medium Access Control (MAC) protocol for WSNs, called (MCA-MAC). MCA-MAC aims to improve the previous metrics and thus the overall performance of WSNs through using cooperative communication. It enables source nodes from using intermediate nodes as relays to send their data through them to the access point. MCA-MAC protocol is also acting as a cross layer protocol where the best end-to-end path between the source and destination is found through an efficient algorithm. Mathematical analysis demonstrates that MCA-MAC protocol can determine the optimal relay node that has the minimum transmission time for the given source-destination pair. Using Multi-Paradigm Programming Language (MATLAB) simulation environment, this paper estimates MCA-MAC protocol performance in terms of system throughput, energy efficiency and delay. The results show that MCA-MAC protocol outperforms the existing scheme called Throughput and Energy aware Cooperative MAC protocol (TEC-MAC) protocol under ideal and dynamic channel conditions. Under ideal conditions, MCA-MAC protocol achieved throughput, and energy efficiency improvements of 12%, and 50% respectively, more than TEC-MAC protocol. While the packet delay through using MCA-MAC has been decreased by about 48% less than TEC-MAC protocol.

MODEL OF DISTRIBUTION AND INFORMATION MANAGEMENTFLOWS IN BUSINESS PROCESSES

Analysis of trends in the development of the corporate communications market shows that in order to improve economic performance, companies strive, when building automated systems, to integrate business processes on the basis of common platforms. The use of such platforms requires an increase in the throughput of the communication system and taking into account the peculiarities of the functioning of such systems in the management of the corporate network. The studies of the effectivenessof the distribution of information flows in business processes in digital marketing presented in the article contain the following key stages. It is shown that none of the information technologies provides routing control based on the forecast of changes in information flows, which reduces the efficiency of automated systems functioning. Therefore, a hierarchical system of dynamic models has been developed that reflects the process of transferring information between various services of automated systems. The models contain information about the history of changes in information traffic and serve as the basis for calculating the predictive characteristics of changes in information flows. A method for increasing the efficiency of distribution of information flows in corporate computer systems of automated systems is proposed, taking into account the restrictions on their throughput and the discrete nature ofthe distribution of traffic over network channels. For the first time, a method for routing traffic in corporate computersystems is proposed, which minimizes the average time of message delays in the network. The method makes it possible to find routes in computer systems that ensure the minimum transmission time for a given traffic distribution in the network nodes. The model makes it possible to select the optimal information transmission routes in computer systems that ensure the minimum message transmission time for a given distribution of information flows. The use of the developed model of distribution and management of information flows makes it possible to increase the productivity of corporate computer systems at enterprises.

EMSNDP: Energy Minimized Optimal Zone Selection of Sensor Network to Build the Data Path for IoTN

Wireless sensor network contains a huge volume of sensors that are capable of observing environmental data and conveying that information to the base station. The zone routing is a way to group sensors into multiple clusters in sensing field. In general, each zone has a single co-ordinator that operates as a zone head and accountable to collect the data from all sensors inside the zone and then forward it to the base station. Clustering and energy efficient path construction to base station is a major issue in sensor networks. This paper concentrates on clustering the sensing field into zones and further splitting it into zone quadrants to maximize the energy efficiency of sensor nodes with minimum delay transmission time. An “Energy Minimized optimal zone selection of Sensor Networks to build the Data Path” protocol is proposed in this paper to minimize the load on zone heads by using the zone coordinators to gather the information from different quadrants of zone. Distance-based communication with the minimum hop is opted to minimize the energy cost. A critical evaluation is carried out on the proposed protocol in the context of total energy consumption of network and average energy consumed per node, lifetime of the Network, delay in reception of packet and packet delivery ratio. The results of our research work and analyzed and benchmarked against similar protocols using Network Simulator 2. The outcome of this research is a reduced delay in packet processing with low energy consumption which significantly increases lifetime of sensor network.

Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation

A stochastic flow network composed of multistate arcs can be utilized to describe several practical systems such as computer networks, where transmission time taken for sending data to a sink is an important index. Determining a path with minimum transmission time is known as the quickest path problem (QPP). All algorithms addressing the QPP assume that the determined minimal paths (MPs) are disjoint. Further, for the general case of intersectional MPs, if a congestion phenomenon occurs during the transmission process, these algorithms will lead to an incorrect outcome. Moreover, in practical scenarios, as a budget limit is considered, spare routing is applied to consolidate the system. The objective is to develop an algorithm based on Monte Carlo simulations (MCSs) for evaluating the system reliability while considering the congestion phenomenon. The system reliability is the probability that a specific amount of data can be transmitted successfully through multiple MPs under both time and budget constraints. Furthermore, spare routing to increase the system reliability is established in advance to specify the main and spare MPs. Experiments validate the evaluation of system reliability based on MCSs. The credibility and efficiency of the proposed algorithm are also discussed.

Techniques for extending unicast CR networks to multi‐source multi‐destination over Rayleigh fading channels

In this work, the authors propose a novel technique to extend the scope of cognitive radio (CR) networks to multiple source–destination pairs. To accomplish this, a simplified feasible path set is formed and then three types of criteria or methods are employed to reach a solution for the best path for each pair. This set is defined by non-intersecting paths which do not share any relay nodes. This not only solves the problem at hand but also greatly reduces the complexity which leads to a fast solution. The first method uses the maximum probability of success as a means for selecting the best path. In the second method, a fast and simple technique is used by choosing the minimum number of overall hops for path selection. The element with the minimum overall transmission time is selected for data transmission in the third technique. Finally, the proposed methods are compared through simulation to a unicast single user case in terms of throughput and packet delivery rate. The simulation results show that the first method has the best performance while the second method is slightly worse but faster.

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.

An efficient load balanced stable multi-path routing for mobile ad-hoc network

This research aims to identify stable neighbors in a mobile ad-hoc network to create a stable multi-path route for different mobility patterns. The other issue, this article deals with to schedule the data packets over those multiple paths to balance the loads across the paths and transmit the whole packets in minimum transmission time. The stable neighbors are chosen through a recurrent neural network which uses the previous neighborhood information as an input and predicts whether a node will be a neighbor in the next instance or not. We also framed a methodology to distribute the data packets across multiple paths based on their path length from source to destination. A simulation of the network model with two mobility models, Random way point and Gauss Markov mobility, shows that the accuracy of the recurrent neural-based stable node prediction is around 95%. The analytical, as well as a simulation, model shows that our proposed algorithm takes comparatively lesser time to transmit the same number of packets from a source to a destination due to better scheduling across multiple paths. Simulation results also demonstrate that compared to other similar multi-path routing protocols, our proposed algorithm yields a higher packet-delivery ratio and lower route recovery time also.

An Efficient Route Maintenance Routing Algorithm for VANETS

Vehicular ad-hoc network is a sub class of mobile ad-hoc network (MANET) with a difference of having moving vehicles as nodes. Todays, it is growing very fast. ITS have two key components self-organized and key component for VANETs. In Vehicular ad hoc network (VANET) vehicles can share data and communicate without infrastructure with other vehicles and road side units (RSU). These networks are having highly dynamic topology with fast moving vehicles and frequent disconnection properties. It requires handover management and an efficient routing algorithm. This research paper contains a network which is the combination of vehicular nodes, road side unit (RSU), and WiMax. This paper also proposed an optimized routing algorithm for handover management in VANET. This algorithm is compared with RBRA. The paper results that the proposed algorithm has minimum transmission time and minimum request block rate.

Maximizing Achievable Transmission Time in Cognitive Radio Networks Under Sensor-Aided Crowdsourced Spectrum Sensing

Abstract Spectrum-sensing as a service has been proposed and studied by many researchers over the past decade as a promising approach to support the viability of cognitive radio networks (CRNs). A spectrum-sensing service provider (SSP) provides information about spectrum occupancy to its clients that is generally more accurate than what clients can learn on their own. Two approaches are used by SSPs in their operation, the dedicated sensing infrastructure approach (sensor-aided CRN) and the crowdsensing approach. In this work, we assume a hybrid model where a dedicated sensing infrastructure is used along with crowdsensing. We study the tradeoff between sensing time paid by cognitive users to the SSP and their achievable transmission time. Our objective is to maximize the minimum achievable transmission time for any cognitive user in the network by carefully selecting the channels to be used. Two algorithms are proposed, one is based on the hill-climbing search algorithm (abbreviated HCA) and the other is a less optimal but faster greedy selection algorithm (abbreviated GSA). Results show that both HCA and GSA are within 3% of the optimal solution. Results also confirm that GSA is faster than HCA, while HCA outperforms GSA.

Scalable Multicast in Highly-Directional 60-GHz WLANs

The 60-GHz bands target multi-gigabit rate applications, such as high definition video streaming. Unfortunately, to provide multicast service, the strong directionality required at 60 GHz precludes serving all clients in a multicast group with a single transmission. Instead, a multicast transmission is comprised of a sequence of beam-formed transmissions (a beam group) that together cover all multicast group members. In this paper, we design, implement, and experimentally evaluate scalable directional multicast (SDM) as a technique to 1) train the access point with per-beam per-client RSSI measurements via partially traversing a codebook tree. The training balances the objectives of limiting overhead with collecting sufficient data to form efficient beam groups. 2) Using the available training information, we design a scalable beam grouping algorithm that approximates the minimum multicast group data transmission time. We implement the key components of SDM and evaluate with a combination of over-the-air experiments and trace-driven simulations. Our results show that the gains provided by SDM increase with group size and provide near-optimal group selection with significantly reduced training time, yielding up to 1.8 times throughput gains over exhaustive-search training and grouping.

Solving the MCQP, MLT, and MMLT problems and computing weakly and strongly stable quickest paths

The quickest path problem consists of finding a path in a directed network to transmit a given amount $$\sigma $$ of items from a source node to a sink node with minimal transmission time, where the transmission time depends on the traversal times $$\tau $$ and the capacities u of the arcs. We suppose that there exist more than one quickest path and finds a quickest path with a special property. In this paper, first, some algorithms to find a quickest path with minimum capacity, minimum lead time, and min-max arc lead time are presented, which runs in $$O(r(m+n \log n))$$ and $$ O((r(m+n \log n))\log r') $$ time, where r and $$ r' $$ are the number of distinct capacity and lead time values and m and n are the number of arcs and nodes in the given network. Then, we suppose that values $$\sigma , \tau $$ and u change to $$\sigma ', \tau '$$ , and $$u'$$ . The purpose is to find a quickest path such that it has the minimum transmission time value among all quickest paths, by changing $$\sigma $$ to $$\sigma '$$ , $$\tau $$ to $$\tau '$$ , or u to $$u'$$ . We show that some of these problems are solved in strongly polynomial time and the others remain as open problems.

Overhead Reduction by Spatial Reusability in Multi-Hop Wireless Networks

The issue of routing in multi-hop wireless networks, to achieve high end-to-end throughput, it is difficult to find the optimal path from the source node to the destination node. Although a large number of routing protocols have been implemented to find the path with minimum transmission time for sending a single packet, such transmission time reduces protocols cannot be guaranteed to achieve high end-to-end throughput. Spatial reusability aware routing in multi hop wireless network is featured by considering spatial reusability of the wireless communication media. Spatial reusability-aware single-path routes and any path routing protocols, and compare them with existing single-path routing and any path routing protocols, respectively. Our evaluation results demonstrate that our protocols significantly improve the end-to-end throughput compared with existing protocols. Resource allocation algorithm is inquired to maximize the energy efficiency (EE) in multiuser decode-and-forward (DF) relay interference networks.

Minimum transmission time of Cytauxzoon felis by Amblyomma americanum to domestic cats in relation to duration of infestation, and investigation of ingestion of infected ticks as a potential route of transmission.

ObjectivesThe objectives of the present study were to determine the duration of infestation by Amblyomma americanum necessary for transmission of Cytauxzoon felis to domestic cats and to determine if ingestion of C felis-infected A americanum by cats is a route of transmission.MethodsForty-nine cats were assigned to one of seven groups, with seven cats per group. Cats were infested with A americanum adults, acquisition fed as nymphs on a cytauxzoonosis survivor cat, for 12 h (group 1), 18 h (group 2), 24 h (group 3), 36 h (group 4), 48 h (group 5) and to repletion (group 7; control). Cats in group 6 were fed C felis-infected ticks. Thumb counts were performed at the end of the duration of infestation for groups 1–5 and at 48 h for the control group. For group 6, 50 live C felis-infected adult A americanum were mixed with food and fed to each of the cats. Transmission of C felis was determined by examining blood of cats by DNA extraction followed by PCR.ResultsOf 50 ticks placed on each cat (groups 1–5 and 7), the arithmetic mean attachment ± SEM ranged from 46.9 ± 1.9 in group 3 to 49.3 ± 0.3 in group 1. In group 6, the average number ± SEM of ticks ingested was 46.5 ± 2.3. One cat in group 5 that had been infested for 48 h became infected with C felis. None of the cats in group 6 (ingestion) became infected with C felis. Six of 7 (85.7%) cats in group 7, the control group, became infected with C felis.Conclusions and relevanceOur results indicate that transmission of C felis to domestic cats can happen as quickly as >36 h but ⩽48 h of exposure to A americanum infected with C felis and that ingestion of C felis-infected A americanum is not a likely route of transmission.

Optimal point to point path planning of flexible manipulator under large deformation by using harmony search method

This paper aims at planning an optimal point to point path for a flexible manipulator under large deformation. For this purpose, the researchers use a direct method and meta-heuristic optimization process. In this paper, the maximum load carried by the manipulator and the minimum transmission time are taken as objective functions of the optimization process to get optimal path profiles. Kinematic constraints, the maximum velocity and acceleration, the dynamic constraint of the maximum torque applied to the arms and also the constraint of final point accuracy are discussed. For the optimization process, the Harmony Search (HS) method is used. To evaluate the effectiveness of the approach proposed, simulation studies are reviewed by considering a two-link flexible manipulator with the fixed base. The findings indicate that the proposed method is in power of dealing with nonlinear dynamics of the system. Furthermore, the results obtained by rigid, small and large deformation models are compared with each other.

The design of a ultra-low power RF wakeup sensor for wireless sensor networks

In wireless sensor networks (WSNs) duty cycling has been an imperative choice to reduce idle listening but it introduces sleep delay Thus, the conventional WSN medium access control protocols are bound by the energy-latency tradeoff. To break through the tradeoff, we propose a radio wave sensor called radio frequency (RF) wakeup sensor that is dedicated to sense the presence of a RF signal. The distinctive feature of our design is that the RF wakeup sensor can provide the same sensitivity but with two orders of magnitude less energy than the underlying RF module. With RF wakeup sensor a sensor node no longer requires duty cycling. Instead, it can maintain a sleep state until its RF wakeup sensor detects a communication signal. According to our analysis, the response time of the RF wakeup sensor is much shorter than the minimum transmission time of a typical communication module. Therefore, we apply duty cycling to the RF wakeup sensor to further reduce the energy consumption without performance degradation. We evaluate the circuital characteristics of our RF wakeup sensor design by using Advanced Design System 2009 simulator. The results show that RF wakeup sensor allows a sensor node to completely turn off their communication module by performing the around-the-clock carrier sensing while it consumes only 0.07% energy of an idle communication module.

A New Variable-Length Integer Code for Integer Representation and Its Application to Text Compression

Data Compression plays an important role in reducing data storage space in computer memory and in achieving minimum data transmission time in communication networks. There are two types of data compression: lossless and lossy. In lossless data compression, decompression reproduces data that is exactly match the original data and in lossy data compression, the decompression reproduces data which is an approximation of the original data. Variable length integer codes such as Elias Gamma Code, Elias Delta Code, Golomb Code, have been used for data compression (i.e. integer compression, text compression, etc). In this paper, a new variable length integer code is proposed based on radix conversion and it is used with Burrows Wheeler Transform for text data compression. The performance of the proposed code is compared with Elias Gamma Code, Elias Delta Code and Golomb Code. For evaluation, Calgary corpus is used in the experiments, which contains both text file and binary files. Experimental results show that the Fibonacci code gives better compression rate on an average than all other coders and Elias Gamma code gives better compression rate for text files. The other coders perform well for binary files compared to Elias gamma code.