Amount Of Control Information Research Articles

Determination of optimization criteria for a special­purpose infocommunication network management system

As of today, taking into account the realities of the war in the country and the prospects for the development of the special-purpose information communication network management system, it is possible to assert the presence of a stable trend of growth in the volume and improvement of the quality of telecommunication services provided. This leads to an increase in the quantity and quality of control information, which, in turn, leads to a disproportionate growth of the special purpose information communication network management system itself. The described trend determines the need to optimize the management system as part of a special purpose information and communication system. To solve this problem, it is necessary to define the optimization criteria for the management system of a special purpose information communication network. The characteristic features of the special purpose information communication network management system given in the article allow it to be considered a "big system". For such a "big system" the question of its optimization becomes urgent. Optimization can be considered both the optimization of the control system design process itself and the optimization of the operation of the control system. The determined directions of optimization are dependent on each other. The designed special purpose information communication network management system will have quality indicators that depend on the quality of development, resources and time spent, that is, on the optimality of the design process. On the other hand, the resources and time spent on the design of the control system will significantly depend on the expected quality parameters of the system. There are several ways to combine the partial criteria of the control system to obtain an integral generalized criterion, which will make it possible to implement a global synthesis of the control system taking into account all the selected partial criteria of the system. Thus, the paper presents a method of multi-criteria optimization of the management system of a special purpose information communication network. The external parameters of the special purpose information communication network management system, which are critical in modern conditions, are described: the amount of information, delay, survivability, functional flexibility, reliability and cost. The need to combine conflicting criteria such as the amount of control information, reliability, survivability, functional flexibility, latency, and cost is emphasized. The advantage of using multi-criteria optimization of the special-purpose information communication network management system compared to single-criteria optimization is shown.

Design of search and rescue system using autonomous Multi-UAVs

Over the last several decades advancement in UAV technology has formed an important part of recent research. Nowadays, these flying robots are a great aid and even replace humans in many types of critical activities such as surveillance, fire protection, search & rescue (SAR), etc. In this paper, we study the design of SAR system using autonomous quadrotors UAVs. The developed system attempts to maximize the probability of target detection and minimize the expected search time while also minimizing the number of UAVs required. It is also adapted to counter UAV failures by re-configuring the UAVs to optimally continue the mission. Furthermore the SAR system algorithms are designed to accomplish the mission with a minimum amount of control information to be passed between UAVs. Finally a case study of survivor search and rescue operations is provided along with the obtained results which confirm the efficiency of the designed system.

Application of Radio Environment Map Reconstruction Techniques to Platoon-based Cellular V2X Communications.

Vehicle platoons involve groups of vehicles travelling together at a constant inter-vehicle distance, with different common benefits such as increasing road efficiency and fuel saving. Vehicle platooning requires highly reliable wireless communications to keep the group structure and carry out coordinated maneuvers in a safe manner. Focusing on infrastructure-assisted cellular vehicle to anything (V2X) communications, the amount of control information to be exchanged between each platoon vehicle and the base station is a critical factor affecting the communication latency. This paper exploits the particular structure and characteristics of platooning to decrease the control information exchange necessary for the channel acquisition stage. More precisely, a scheme based on radio environment map (REM) reconstruction is proposed, where geo-localized received power values are available at only a subset of platoon vehicles, while large-scale channel parameters estimates for the rest of platoon members are provided through the application of spatial Ordinary Kriging (OK) interpolation. Distinctive features of the vehicle platooning use case are explored, such as the optimal patterns of vehicles within the platoon with available REM values for improving the quality of the reconstruction, the need for an accurate semivariogram modeling in OK, or the communication cost when establishing a centralized or a distributed architecture for achieving REM reconstruction. The evaluation results show that OK is able to reconstruct the REM in the platoon with acceptable mean squared estimation error, while reducing the control information for REM acquisition in up to 64% in the best-case scenario.

Cognitive routing optimization protocol based on multiple channels in wireless sensor networks

With the development of modern communication, available spectrum resources are becoming increasingly scarce, which reduce network throughput. Moreover, the mobility of nodes results in the changes of network topological structure. Hence, a considerable amount of control information is consumed, which causes a corresponding increase in network power consumption and exerts a substantial impact on network lifetime. To solve the real-time transmission problem in large-scale wireless mobile sensor networks, opportunistic spectrum access is applied to adjust the transmission power of sensor nodes and the transmission velocity of data. A cognitive routing and optimization protocol based on multiple channels with a cross-layer design is proposed to study joint optimal cognitive routing with maximizing network throughput and network lifetime. Experimental results show that the cognitive routing and optimization protocol based on multiple channels achieves low computational complexity, which maximizes network throughput and network lifetime. This protocol can be also effectively applied to large-scale wireless mobile sensor networks.

The entropy analysis of moving objects radio control process

The processes of mobile objects control are deploying in space and time on the basis of current scientific concepts. They are inseparably connected with the processes of transformation of matter, energy and information. Therefore the feasibility of using the information theory mathematical apparatus to analyze of management processes in general, and the mobile objects radio control processes become clear. The static approach to this problem is based on determining The amount of information that must be entered in the control loop to reduce the entropy of the control object from a starting value to a final value. The entropy determines the accuracy of the control. The dynamic control process remains hidden. It does not enable to establish the necessary control time, the laws entropy reduce and the relationship between the main indicators of the control process. Radio control systems have one thing: the entropy of the control object and control process is reduced because the control supplied information. Entropy is the objective characteristic of control precision. The information consists of the initial information and the operation information. The initial information is a set of pre-collected data about the properties of the control object, the disturbance and other factors. Working information is extracted in the control process. It is necessary to create the control process dynamic model which reveals the patterns of change in the control object entropy both in the absence and presence of control information. It should be appreciated that as the law of entropy reduction and the amount of control information depend on the organization of control process and the nature of information exchange between the control part and the control object. The radio control system decomposition is made. The іformation communications between the object and the control section are considered. The time needed to reduce the entropy to the prescribed value is set. The situation that occurs in conditions of increasing entropy unmanaged object is analyzed. Conditions entropy reduction in the event of control information and necessary control time are mounted. A situation with known radio control system potential is analyzed. The loss of information impact in the control object on the change in entropy pattern is considered. The needed control time in a loss of information is established. The possibility of implementing the control process in a loss of information is defined. Conclusion. The entropy analysis based on the proposed dynamic models of radio control process is executed. The relationship between the entropy of the control object and the speed of control information entry is installed. The necessary control time to reduce the entropy is determined. The radio control systems potential possibilities are taken into account. The impact of information loss in control object to reduce the entropy is studied. The effect of feedback between the control object and control part on the process dynamics is established. These results provide a new level of radio control process analysis of moving objects.

An Efficient Causal Group Communication Protocol for Free Scale Peer-to-Peer Networks

In peer-to-peer (P2P) overlay networks, a group of n (≥2) peer processes have to cooperate with each other. Each peer sends messages to every peer and receives messages from every peer in a group. In group communications, each message sent by a peer is required to be causally delivered to every peer. Most of the protocols designed to ensure causal message order are designed for networks with a plain architecture. These protocols can be adapted to use in free scale and hierarchical topologies; however, the amount of control information is O(n), where n is the number of peers in the system. Some protocols are designed for a free scale or hierarchical networks, but in general they force the whole system to accomplish the same order viewed by a super peer. In this paper, we present a protocol that is specifically designed to work with a free scale peer-to-peer network. By using the information about the network’s architecture and by representing message dependencies on a bit level, the proposed protocol ensures causal message ordering without enforcing super peers order. The designed protocol is simulated and compared with the Immediate Dependency Relation and the Dependency Sequences protocols to show its lower overhead.

Novel Protocols for Improving the Performance of ODMRP and EODMRP over Mobile Ad Hoc Networks

Due to its simplicity, efficiency, and robustness to mobility, the On-Demand Multicast Routing Protocol (ODMRP) becomes a standout amongst the most broadly utilized multicast routing protocols in mobile ad hoc networks (MANETs). However, the robustness of ODMRP comes at the expense of incurring a high control overhead to the network. The Enhanced ODMRP (EODMRP) proposed a dynamic refresh interval for the multicast mesh based on the network feedback on real disconnections experienced by the multicast network members. Veritably, EODMRP decreased the network control overhead at the cost of obtaining a low packet delivery ratio especially in high mobility conditions of the network. In this paper, two protocols, as improvements to both ODMRP and EODMRP, are proposed where the refresh interval is basically adapted based on the source moving speed and the number of disconnections reported by multicast members. Furthermore, we proposed an impressive local recovery to be employed in both protocols, which includes new setup and failure mechanisms that contribute effectively to boosting the performance of our proposed protocols. Since the majority of nodes in MANET rely on batteries, the main contribution of this research is to limit the amount of control information that is passed between nodes (i.e., reducing the control overhead over that in ODMRP) while maintaining a better packet delivery ratio than EODMRP.

An efficient causal ordering algorithm for multicast communication channels

In this paper, we present an efficient causal algorithm that can be used in multicast communication environments, in particular the overlapping multi-channel case, where a participant can belong to and communicate through more than one multicast channel. The causal algorithm is built on the paradigm of group communication. The groups are established according to the participant channel subscription. In order to reduce the amount of control information (CI), we propose an extension of the immediate dependency relation (IDR), which was introduced by Peterson in the context of one group. This IDR extension allows us to define necessary and sufficient CI to ensure causal delivery in a multi-group environment. We show that through the use of the IDR extension, we reduce the amount of CI sent per message without imposing restrictions on interaction or execution (e.g. network topology, rediffusion servers, execution models, etc.). These characteristics allow our algorithm to be suitable for use in large distributed decentralised systems. We show the efficiency of our causal algorithm in terms of the overhead timestamped per message.

이동통신망을 위한 멀티캐스트 메시지 전달 알고리즘의 설계 및 평가

In this paper, we proposed an effective multicast causal order algorithm with hand-off protocol for mobile networks. Since the size of control informations needed to enforce message transfer order has much influence on the performance of hand-off and message transfer in mobile networks, size of control information need to be minimized. We reduced the size of control information by analyzing all the valid communication patterns and pruning redundant information not required to enforce causal order as early as possible, and used hand-off protocol which requires minimal amount of control information to be transferred. By simulation, we found that the proposed algorithm showed better performance than other existing algorithms.

Dynamic Scheduling Protocols for a Multiple-Access Channel

In this paper the multiple-access problem in a packet network is considered. A finite number of independent, packet transmitting users is assumed. Protocols are developed to allocate the channel resources among the users. Part of the channel capacity is assigned to control information. This information is used to make probabilistic inferences of the queue lengths and delay characteristics of the users. The probabilistic inferences are used to develop dynamic scheduling protocols for data transmission. Protocols are developed for two different levels of control information. An analysis of the relationship between amount of control information and system performance is carried out, and a study of the frequency of transmission of control information is also provided.

Limits of Genetic Control

Control of behavior and specification of structure requires information. In simple cases lower bounds for the minimum amount of control information required can be computed. The amount of information in the genes of humans and related species is estimated (in different ways). By comparing the information available in the genes with the information required by certain structures and behavior patterns it can be decided what the genes can control and what not. Using an estimate derived from the number of nucleotides in DNA, it is shown that the genes cannot control the interconnections between individual neurons in the human brain in all potential complexity. They must be to some degree random or repetitive. Gene estimates derived from Drosophila studies result in lower estimates (104 to 3.5 × 105 bits). A stimulus-response pattern where all different possible response assignments are equally probable requires a minimum of n log2 n/e bits for n pairs. If antigen-antibody formation would satisfy this assumption, then the infonnation would well exceed the total information contained in the genes. Linguistic notions and their denotations may be considered as unconstrained stimulus-response pairs. A language of 4000 words requires about 5 × 104 bits. Hence a language of the complexity of human language cannot be innate.