Information Transmission Time Research Articles

Адаптация радиолинии КИС по скорости передачи информации в условиях помех

In modern command and measurement systems (CMS), phase-shift keyed signals are widespread, which, with relatively simple methods of formation, have a low level of side lobes of the autocorrelation function (ACF). Also, in recent years, a number of studies have been carried out on the implementation of the principle of constructing the CMS, based on the adaptation of processing algorithms to the properties of useful signals and interference. On the basis of this principle, an algorithm for adapting the CMS radio link has been developed, which makes it possible to analyze information channels at various speeds and automatically connect the selected channel, which is an urgent task for controlling low-orbit spacecraft. The article proposes a receiver scheme with parallel reception of several information channels with different information transfer rates. The analysis of autocorrelation and cross-correlation functions made it possible to conclude that the data obtained do not contradict the assumptions about the possibility of implementing an adaptive receiver with the choice of an information channel in terms of speed. It is shown that the use of such a receiving device with an algorithm for selecting and switching information channels according to the reception rate provides a significant gain in information transmission time in comparison with traditional reception and switching of speeds by commands in conditions of complex interference stop.

Formation of information signs of unmanned aerial vehicles use efficiency

The subject matter of the article is an unmanned aerial vehicle and methods for determining the effectiveness of its use. The goal of the work is formation of information signs of unmanned aerial vehicles use effectiveness. The following tasks were solved in the article: formation of information signs of the effectiveness of unmanned aerial vehicles using the mathematical apparatus of probability theory and mathematical statistics, the analysis of the survivability of unmanned aerial vehicles by developing a two-level unmanned aerial vehicle control system using a neural network control system. The following methods used are: methods of probability theory and mathematical statistics, neural network management methods. The following results were obtained: The generated informational signs of unmanned aerial vehicles use effectiveness with application of the mathematical apparatus of probability theory and mathematical statistics, which made it possible to obtain an analytical expression for determining the time of information transmission by an unmanned aerial vehicle, being the main criterion for the effectiveness of its use in a given situation. An analysis of the survivability of unmanned aerial vehicles by developing a two-level control system for an unmanned aerial vehicle using a neural network control system that allows you to increase the survivability and thereby the likelihood of completing a task by an unmanned aerial vehicle. It was determined that an essential feature of the UAV functioning processes is their randomness, which is caused by the incomplete certainty of the conditions in which these processes occur, as well as various random deviations and errors that occur during the collection of information, the generation of control signals and their execution. Thus, the result of UAV functioning is randomly and quantitatively characterized by the laws of distribution of parameters expressing this result.

Raspberry Pi Based Battle Field Robot using Dijkstra’s Algorithm

The robot is intended to follow protests by turning left and ideal to keep the article in sight and driving forward and in reverse to keep up a consistent separation between the robot and the item. Pictures are obtained through the camera of a Raspberry-pi gadget which is appended to the robot. The camera is appended to servos on the robot which enable the camera to skillet and tilt. A few picture handling methods are utilized to distinguish the area of the article being followed in the pictures. The vehicle route utilizing the information transmission time is expanded with the convention standard. Correspondences between two hubs (equipment and application) are practiced through IEEE 802.15.4. The client can give the source and goal hub address to the server segment. Utilizing QR code by executing DIJSKTRA calculation the most brief way can be effectively decided. Metal discovery should be possible by utilizing inductive closeness sensor. Ultrasonic sensor is utilized for finding the separation between the robot and article to be picked.

Secrecy Throughput Maximization for Full-Duplex Wireless Powered IoT Networks Under Fairness Constraints

In this paper, we study the secrecy throughput of a full-duplex wireless powered communication network (WPCN) for Internet of Things (IoT). The WPCN consists of a full-duplex multiantenna base station (BS) and a number of sensor nodes. The BS transmits energy all the time, and each node harvests energy prior to its transmission time slot. The nodes sequentially transmit their confidential information to the BS, and the other nodes are considered as potential eavesdroppers. We first aim to optimize the sum secrecy throughput of the nodes. The optimization variables are the duration of the time slots and the BS beamforming vectors in different time slots. The optimization problem is shown to be nonconvex. To tackle the problem, we propose a suboptimal two stage approach, referred to as sum secrecy throughput maximization (SSTM). In the first stage, the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during information transmission time slots. Then, the optimal beamforming vector in the initial noninformation transmission time slot and the optimal time slots are derived. We then consider secrecy throughput fairness among the nodes and propose max–min fair (MMF) and proportional fair (PF) algorithms. The MMF algorithm maximizes the minimum secrecy throughput of the nodes, while the PF achieves a good tradeoff between the sum secrecy throughput and fairness among the nodes. Through the numerical simulations, we first demonstrate the superior performance of the SSTM to uniform time slotting and beamforming in different settings. Then, we show the effectiveness of MMF and PF algorithms.

Completion Time Minimization With Path Planning for Fixed-Wing UAV Communications

Unmanned aerial vehicles (UAVs) have attracted increasing attention in wireless communications due to the high mobility. This paper investigates a fixed-wing UAV-to-UAV (U2U) communications system, with the aim of minimizing the information transmission time via proactively designing the UAV paths. First, we propose a general optimization framework for U2U communications, which covers the communication throughput requirement, interference from terrestrial transmitters, UAV maximum/minimum speeds and accelerations, and minimum U2U distance. To tackle the formulated optimization, the communication throughput constraint that contains uncertain locations of terrestrial transmitters is transformed into a deterministic expression with the aid of S-procedure, and the nonlinear equality constraints on the UAV paths are replaced by linear equality constraints with additional positive semidefinite matrix constraints. Then, we develop a path planning algorithm based on the exact penalty method and successive convex approximation. Furthermore, we design a heuristic path planning algorithm that solves the completion time minimization problem by iteratively addressing a series of throughput maximization problems. The proposed heuristic algorithm strikes a good tradeoff between the computational complexity and the achievable performance. Finally, the simulation results are presented to verify the proposed path planning algorithms under various parameter configurations.

Measurement, Characterization and Reconstruction of Computing Time and Transporting Time for Real-Time Telecontrol Systems

In this paper we analyze and shown the process of measurement, characterization and reconstruction of times of a real-time telecontrol systemby its segmentation of computing time, transmission time and reception time of information over the Internet. Experimental analysis was made by a workbench's development with a client-server communication scheme to simulate the behavior and control of an electric motor; all measured times were characterized with the first moment and second moment of probability, the mean squared error was used to determine the adequate reconstruction method. For computing time reconstruction, fuzzy digital filtering or instrumental variable method was used. For transmission and reception times over Internet, was used the Kalman filter. Finally, with reconstructions obtained, we concluded that algorithms and methods used are acceptable to determine the dynamics of a time of computing and transmission a real-time telecontrol system.

A Clustering Approach for Multiband Neighbor Discovery on 60 GHz WLAN

The 60 GHz mmWave unlicensed band has a very large spectrum available, divided into four orthogonal channels, which allows up to 7 Gbps data rate. On the other side, the propagation in the 60 GHz band is subject to severe path loss attenuation, which can be mitigated using highly directional antennas. This high directionality brings a new challenge to neighbor discovery; the devices now need to know the exact neighbors’ physical location to successfully communicate with them. In order to expedite the neighbor discovery process, multiband protocols have been proposed in the literature in which a separate band is used for the exchange of control messages in an omnidirectional mode. Nonetheless, these proposals suffer from the control channel bottleneck problem due to the numerous messages that need to be exchanged in this channel. In this work, we propose a scheme that divides the network nodes in clusters and for each cluster we allocate one separate control channel and also a separate mmWave channel for beamforming only. The former separation allows decreasing the number of control messages exchanged in each control channel, and the latter allows the simultaneously execution of multiple beamforming. In conjunction to this clustering scheme, we propose a multiband protocol in which only the cluster leader performs beamforming and uses the control channel to propagate the information obtained during this process. We compare the existing protocols with our proposed clustering protocol in terms of average transmission time, overhead, and accuracy of neighbor discovery information.

Research on Route Planning Method of Dual Aircraft Rescue Based on Block Chain Technology

The dynamic change of rescue environment after disaster can greatly improve the efficiency of rescue by adjusting flight routes in real time according to the latest rescue environment and rescue tasks detected by aircraft. In this paper, the block chain technology is used to complete the real-time transmission of dynamic tasks and environmental information, and then the AI algorithm is used to realize the dynamic adjustment of flight route: realizing the real-time adjustment of flight route under the circumstances of dynamic change of rescue mission and deterioration of planning environment; the experimental results show that with the real-time transmission of threat information, threat detection and processing are realized, and threat information is localized. In this way, the transmission time of threat information and mission information and command center is shortened, and the efficiency and reliability of rescue are improved.

Construction of building fire information monitoring model based on adaptive clustering scheduling

In order to solve the problem of unsatisfactory monitoring information transmission and large time overhead during conventional building fire monitoring, an optimisation method of building fire information monitoring based on adaptive clustering scheduling is proposed. In this method, a channel model for building fire information monitoring is constructed through the bi-directional link transmission control method, and then node deployment for building fire information monitoring is optimised through the shortest path optimisation method. The deployment of the largest coverage of fire information monitoring sensor nodes is designed through the self-adaptive rotation scheduling, and balance control of the output link layer of internet of things is performed through the adaptive clustering scheduling method to improve the accurate forwarding and real-time transmission capabilities of internet of things for fire detection information, and then a building fire information monitoring model is constructed. Experimental results show that the proposed method can effectively improve the success rate of fire information monitoring packet forwarding with an average increase of 24.7%, which greatly improves the monitoring information transmission efficiency, and it reduces the time overhead of fire information monitoring by 160s. The proposed method meets the actual needs and ensures the effectiveness of fire monitoring.

The Shortest Path Problem and Its Critical Edge in Uncertain Environment

In order to make strategic, tactical and operational decisions for the shortest path in an uncertain environment. Firstly, the information transmission time expectation-variance shortest path model in uncertain environment is proposed. Secondly, to avoid the interruption of information transmission caused by sudden situations, a fuzzy shortest path critical edge model is established. Then, an improved ant colony algorithm with traffic congestion factor and random variables is developed. Finally, to assess the performance of Improved ant colony algorithm, experiments on a set of 6 benchmark test functions are conducted, and numerical examples of these models are given to illustrate its effectiveness.

Impacts of time delay on flocking dynamics of a two-agent flock model

Due to finite information transmission and processing time between agents, delays are inevitable and should therefore be incorporated into flocking modeling. To shed light on understanding the impacts of time delay on the dynamics of flock models, we incorporate a time delay to a two-agent flock model and study its flocking dynamics. When the product of the amplitude of the coupling strength and the time delay is relatively small, necessary and sufficient conditions are established for the two-agent flock model to exhibit flocking. We further show that as the delay increases, transcritical bifurcation and Hopf bifurcation may emerge resulting in rich and complex flocking dynamics.

Using Simulated Annealing to Improve the Information Dissemination Network Structure of a Foreign Animal Disease Outbreak Response

AbstractCommunication is an integral part of emergency response, and improving the information dissemination network for crisis communication can save time, resources, and lives. In a foreign animal disease (FAD) outbreak, timeliness of detection and response are critical. An outbreak of foot-and-mouth disease, a particularly significant FAD, could cripple the agriculture economy. This research uses communication data from a FAD response exercise in Kansas to develop a reliable crisis communication network model, contributing a general method for creating an information dissemination network from empirical communication data. We then introduce a simulated annealing heuristic that identifies an alternative network structure that minimizes the time for information to reach all response participants. The resultant network structure reduces overall information transmission time by almost 90% and reveals actionable observations for improving FAD response communication. We find that not only can a crisis communication network be improved significantly, but also that the quantitative results support qualitative observations from early in the data extraction process. This paper adds original methods to the literature and opens the door for future quantitative work in the area of crisis communication and emergency response.

Efficient data collection in wireless powered communication networks with node throughput demands

In the wireless powered communication networks (WPCNs) where nodes are powered by the energy harvested from radio-frequency (RF) transmissions, efficiently scheduling the downlink wireless energy transfer (WET) time and the uplink wireless information transmission (WIT) time is critical to achieve good throughput performance. In this paper, the following type of star-topology WPCNs are considered: each node has its own desired throughput but the throughput demands of all nodes cannot be satisfied due to the nodes’ very low energy harvesting rates. For such WPCNs, it is meaningful to minimize the sum throughput-gap. Unfortunately, this requirement cannot be satisfied by the existing data collecting schemes like the sum throughput maximization (STM) scheme. We study the weighted sum throughput-gap minimization (W-STGM) by jointly optimizing the time allocations for the WET and the WITs. Specifically, we first formulate the W-STGM problem as a non-linear optimization problem and prove that it covers the STM problem studied before as a special case, where all nodes have the same throughput weight and the nodes’ throughput demands are too high. Second, after proving it is non-convex, we decompose it into two sub-problems: the master problem, which determines the optimal WET time, and the slave problem, which determines the optimal time allocations to WITs for a given WET time. Considering that the slave problem is convex, we develop a dual decomposition method to solve it. Meanwhile, we design a golden section search algorithm to solve the master problem. Simulation results show that, compared to the STM, the W-STGM can satisfy in an adequate manner the throughput demands of the nodes by avoiding node throughput over-provisioning, which wastes system resource, and also increasing the throughput of nodes with large throughput weights by up to several tens of percentage points.

The stretch to stray on time: Resonant length of random walks in a transient.

First-passage times in random walks have a vast number of diverse applications in physics, chemistry, biology, and finance. In general, environmental conditions for a stochastic process are not constant on the time scale of the average first-passage time or control might be applied to reduce noise. We investigate moments of the first-passage time distribution under an exponential transient describing relaxation of environmental conditions. We solve the Laplace-transformed (generalized) master equation analytically using a novel method that is applicable to general state schemes. The first-passage time from one end to the other of a linear chain of states is our application for the solutions. The dependence of its average on the relaxation rate obeys a power law for slow transients. The exponent ν depends on the chain length N like ν=-N/(N+1) to leading order. Slow transients substantially reduce the noise of first-passage times expressed as the coefficient of variation (CV), even if the average first-passage time is much longer than the transient. The CV has a pronounced minimum for some lengths, which we call resonant lengths. These results also suggest a simple and efficient noise control strategy and are closely related to the timing of repetitive excitations, coherence resonance, and information transmission by noisy excitable systems. A resonant number of steps from the inhibited state to the excitation threshold and slow recovery from negative feedback provide optimal timing noise reduction and information transmission.

동적 운전 시격 방식 열차제어의 효율 향상을 위한 전송 시간 요건 분석

동적 운전 시격 방식 열차제어의 효율 향상을 위한 전송 시간 요건 분석

무선통신 열차제어시스템 선로 용량에 대한 정보 전송 시간의 영향 분석

무선통신 열차제어시스템 선로 용량에 대한 정보 전송 시간의 영향 분석

A scheme of quantum packet transmission and its performance analysis based on hierarchical

By using quantum packet transmission technology in large scale quantum communication networks, the throughput of transmission node, network link utilization, and the anti-interference performance of communication can be effectively improved. However, the fast transmission of quantum packets is closely related to the performance of router. The bottleneck of the router performance will seriously affect the scalability of the network and the transmission efficiency of the link. In order to reduce the number of quantum packet queues in nodes of the quantum communication network and to reduce the transmission delay of quantum packets, firstly, according to the classical computer communication network structure, in our paper, we divide the quantum communication network into quantum local area network, quantum metropolitan area network and quantum wide area network. Secondly, the quantum packet format and the quantum cluster format compatible with the packet format in the computer network are determined. Then, a quantum information packet transmission scheme based on the hierarchy is proposed, to realize the end-to-end transmission of quantum information. In our scheme, the quantum packets are divided into quantum packet header information and quantum data information. Quantum dense coding mode is used to transmit the quantum packet header information, while the quantum data information uses quantum teleportation to transmit. First, the quantum packets are sent to the router of the quantum local area network at source address, then the quantum LAN router relay the packets to the quantum metropolitan area network router, the router here makes the quantum packets into quantum cluster according to destination address. Quantum clusters are transmitted in the quantum metropolitan area network and quantum wide area network, ending in the quantum metropolitan area network routing. After the quantum clusters are decomposed, they are sent to the destination address through the local area network router of each quantum packet.We analyze the number of quantum entanglement pairs and the total transmission time in our scheme. The results show that the more the routers by the quantum packet and the quantum cluster are, the more the number of quantum entanglement pairs required by the transmission of a certain quantum packet is. When the number of routers is certain, the number of entanglement pairs required in the transmission process of quantum packet and quantum cluster depends on the number of quantum packets. Finally, the theoretical analysis and calculation are carried out by Matlab simulation, the results show that hierarchical quantum packet information transmission scheme can effectively reduce the transmission time of quantum packet information in the quantum communication network, and the reduced time is related to the quantum router performance and the number of quantum packets to send: the more the number of quantum packets to send, the longer the length of packet processing time needs is and the more obvious the advantage of our scheme is. Therefore, the proposed scheme in this paper is suitable for the construction of large scale quantum communication networks.

A new mechanism of nervous system plasticity: activity-dependent myelination

The synapse is the focus of experimental research and theory on the cellular mechanisms of nervous system plasticity and learning, but recent research is expanding the consideration of plasticity into new mechanisms beyond the synapse, notably including the possibility that conduction velocity could be modifiable through changes in myelin to optimize the timing of information transmission through neural circuits. This concept emerges from a confluence of brain imaging that reveals changes in white matter in the human brain during learning, together with cellular studies showing that the process of myelination can be influenced by action potential firing in axons. This Opinion article summarizes the new research on activity-dependent myelination, explores the possible implications of these studies and outlines the potential for new research.

Transmission Delay Monitoring Method in Intelligent Substation

In view of the current situation of the development of smart substation, this paper analyses the standing domain information sharing, information network transmission delay effects on substation protection system. Based on above, advances the information transmission time delay of the solution. This paper uses the accurate computing information packet switches reside within the delay ΔT and into the sampling value (SV) message, giving to protection device. Protection device dependent on local time benchmark, the use of MU inherent latency and link to reside the total delay ΔT reduction received multiple interval sampling data of the moment, on the basis of implementing protection control function.

Respect for privacy begins when gathering information

The news treatment of issues at risk of invading the private sphere calls for an evaluation of the underlying public interest. The exercise of balancing values - right to information and right to privacy – occurs not only at the time of information transmission; it must be observed since the process of collecting, in order to reduce the damage caused. This article raises questions such as contact with citizens, including children, the conduct of journalists in trauma situations, voluntary exposure of privacy by public or anonymous figures, as well as hearing people under charges and the use of unconventional research methods, which may cause privacy violations. Taking closely into account the standards set in ethical instruments, this reflection covers specific cases.