Search

Ozkan, Omer/0000-0002-3839-2754; Ermis, Murat/0000-0002-4524-6800; Bekmezci, Ilker/0000-0001-7299-9448 WOS:000530954200008 Reliable communication network design (RCND) is a well-known optimisation problem to produce a network with maximum reliability. This paper addresses the minimum cost communication network design problem under the all-terminal reliability constraint. Due to the NP-hard nature of RCND, several different metaheuristic algorithms have been widely applied to solve this problem. The aim of this paper is to propose two new hybrid metaheuristic algorithms, namely, GABB and SABB, by integrating either a Genetic Algorithm (GA) with the Branch and Bound method (B&B) or Simulated Annealing (SA) with B&B. The GABB and SABB algorithms have the advantages of finding higher performance solutions produced from the GA or SA, along with the ability to repair infeasible solutions or improve solution quality by integrating the B&B method. To investigate the effectiveness of the proposed algorithms, extensive comparisons with individual application of the GA and SA (the basic forms of GABB and SABB), two different hybrid algorithms (GABB and SABB) and other two approaches (ACO_SA and STH) that give the best results in the literature for the design problems are carried out in a three-stage experimental study (ie, small-, medium-, and large-sized networks). The computational results show that hybridisation of metaheuristics with the B&B method is an effective approach to designing reliable networks and finding better solutions for existing problems in the literature.

BDS high precision navigation and positioning system plays an important role in marine economy with the "B&R" strategy. This paper focus on marine high precision positioning system based on BDS improvement technology, communication network design and surface/under water precision positioning technology, design the marine BDS high precision positioning test and verification system. An experiment is designed to verify that the system can effectively improve the positioning accuracy of the Beidou system.

Traveling Salesman Problem (TSP) is a typical Problem in combinatorial optimization field in modern times. Most of the problems in reality can be transformed into TSP problems for solving. Such as postal problems, communication network design, etc. Ant colony algorithm, as a heuristic algorithm, has been successfully applied to solving TSP problems. Based on the improved ant colony algorithm, this paper solves the travel agent problem, evaluates the population according to the membership degree, and updates the pheromone in turn, so as to achieve a good balance in solving speed and quality.

In the paper we analyze the possibilities of creating a communication network for UAV. We assume that UAVs will work together on the basis of relative navigation (RelNav) principles using aeronautical communications systems. We explore the possibilities of using digital data communication systems to create a UAV communications network. We put emphasis on fast, safe and efficient communication. Leading manufacturers of radio communications stations include Rhode & Schwarz (Germany), Honeywell (USA), Rockwell Collins (USA). We describe new communication systems and devices that would be useful for creating a UAV communications network.

Today’s multi-core technology rapidly increases with more and more Intellectual Property cores on a single chip. Network-on-Chip (NoC) is an emerging communication network design for SoC. For efficient on-chip communication, routing algorithms plays an important role. This paper proposes a novel multicast routing technique entitled as Docket NoC (Dt-NoC), which eliminates the need of routing tables for faster communication. This technique reduces the latency and computing power of NoC. This work uses a CURVE restriction based algorithm to restrict few CURVES during the communication between source and destination and it prevents the network from deadlock and livelock. Performance evaluation is done by utilizing cycle accurate RTL simulator and by Cadence TSMC 18 nm technology. Experimental results show that the Dt-NoC architecture consumes power approximately 33.75% 27.65% and 24.85% less than Baseline XY, EnA, OEnA architectures respectively. Dt-NoC performs good as compared to other routing algorithms such as baseline XY, EnA, OEnA distributed architecture in terms of latency, power and throughput.

A graph G is an ordered pair of sets G(V, E), where V is a set of vertices and the elements of set E are usually called edges. The concept of graph labeling has recently gained a lot of popularity in the area of graph theory. his popularity is due not only to the mathematical challenges of graph labelings but also to the wide range of applications that graph labeling offer to other brances of science, for instance, x-ray, cryptography, coding theory, circuit design and communication network design. A graph labeling we mean an assignment of integers to elements of a graph such as vertex, edge, and both. Local antimagic of a graph was motivated by Arumugam et al.. Thus, we initiate to developed the concept of local antimagic vertex coloring for subdevided graphs. A graph G called sub-devided if the graph G be the graph obtained by inserting a vertex to each edge of the graph G. Definition the concept local antimagic vertex coloring is f : E(G) → {1, 2, 3…, |E(G)|} if for any two adjacent vertices a 1 and a 2, w(a 1) = w(a 2), where for v ∈ G, w ( a ) = ∑ e ∈ E ( a ) f ( e ) , where E(a) and V(a) are respectively the set of edges incident to a. The local antimagic vertex labeling induces a proper vertex coloring of graph G if each vertex a is assigned the color w(a). The minimum colors needed to coloring the vertices in graph G called local antimagic vertex chromatic number, denoted by χla (G). In this paper we study the local antimagic vertex coloring of sub-devided some special graph as follows SFn,m , SSn,m , SWn,m and SFn,m .

This paper studies the \begin{document}$ H_{\infty} $\end{document} control problem for large-scale systems under a sparse observer communication network. Different from existing approaches, where the topology of the observer communication network is fixed, we aim to design the sparse observer communication network such that the closed-loop system is asymptotically stable and satisfies the \begin{document}$ H_{\infty} $\end{document} performance. Firstly, sufficient conditions are established to design the distributed \begin{document}$ H_{\infty} $\end{document} observer and controller gains in terms of LMIs. Then, the developed sufficient conditions are used to minimize the number of the links in the observer communication network. Two numerical algorithms are proposed to solve the sparse observer communication network design problem. Finally, a numerical example is given to demonstrate the effectiveness of the proposed approach.

In this paper we investigate how reliable wireless networks are if their coverage is incomplete and their subscribers move. We give a review of approaches to compute the reliability of such networks. Also, we proposed our own method to calculate the reliability of a communication network; the method uses a probability graph as a network model. The transition probability between the graph nodes depends on the distance between the network transmitters and the subscribers; the probability varies over time. We give an example of how to compute reliability.

This chapter is devoted to modeling and optimization techniques applicable to communication network design and planning. The main emphasis is put on the models dealing with optimization of the capacity of network resources and traffic routing that lead to tractable optimization problems. It is a common belief that the right means for such modeling are multicommodity flow networks (MFN). MFN form a field of operations research on its own, and are closely connected to integer programming. In consequence, the presented chapter aims at giving a systematic survey of basic MFN models and integer programming methods applicable to communication network design.

ZigBee/IEEE 802.15.4 is one of the most used standards for low-power applications. However, full function devices must be always active to route data in a mesh network. The objective of this work is to implement a sleeping technique at the application layer that enables sleep mode for all nodes of a ZigBee network. A time synchronisation mechanism to deal with the clock drift of the sensor nodes was developed. The technique also enables the recovery of lost messages. A large network is organised into smaller groups to reduce latency and packet collisions. The active interval of each node is dynamically adapted to the network operation to optimise the energy consumption. The proposed technique was applied to a real testbed and the increase in energy efficiency was evaluated. The results demonstrated energy savings of about 95% for networks containing up to 20 nodes per group and wake up periods longer than 2 min.

We report on a growing class of assignment problems that are increasingly of interest and very challeng- ing in terms of the difficulty they pose to attempts at exact solution. These problems address economic issues in the lo- cation and design of factories, hospitals, depots, transporta- tion hubs and military bases. Others involve improvements in communication network design. In this article we sur- vey the latest and best methods available for solving exactly these difficult problems and suggest a taxonomy that pro- vides a framework for combining existing solution meth- ods and sets of computer tools that can be modified and ex- tended to make inroads in solving this growing class of op- timization problems.

Several evolutionary algorithms (EAs) applied to a wide class of communication network design problems modelled under the generalized Steiner problem (GSP) are evaluated. In order to provide a fault-tolerant design, a solution to this problem consists of a preset number of independent paths linking each pair of potentially communicating terminal nodes. This usually requires considering intermediate non-terminal nodes (Steiner nodes), which are used to ensure path redundancy, while trying to minimize the overall cost. The GSP is an NP-hard problem for which few algorithms have been proposed. This article presents a comparative study of pure and hybrid EAs applied to the GSP, codified over MALLBA, a general purpose library for combinatorial optimization. The algorithms were tested on several GSPs, and asset efficient numerical results are reported for both serial and distributed models of the evaluated algorithms.

El objetivo del presente trabajo es mostrar como se ha diseñado, implantado y configurado, en el colegio Nuestra Señora de Fátima de Valencia, una red de comunicaciones inalámbrica unificada. Esta red permite dar cobertura a las seis plantas del edificio con zonas destinadas a fines académicos y con una velocidad adecuada a la demanda actual. Además, se puede gestionar de forma centralizada y casi automática, de ahí su nombre “unificada”. El número de puntos de acceso inalámbricos necesarios se determina a partir del número de posibles usuarios potenciales y de las áreas a cubrir en las diferentes plantas del edificio. Un estudio detallado de la propagación radioeléctrica de la red, determina el número de los puntos de acceso necesarios definitivo y su óptima ubicación para cubrir todas las zonas requeridas. Una vez emplazados los puntos de acceso, se diseña la arquitectura de la red cableada, que junto con todo el equipamiento necesario, permite la conexión a Internet y a la LAN existente. Finalmente se configuran los dispositivos (controladora, switch y servidor RADIUS) encargados de la gestión, la autenticación, la segmentación, la seguridad y del buen funcionamiento de la red, The aim of this work is to show as designed, installed and configured in the school Nuestra Señora de Fatima of Valencia, a unified wireless communications network. This network allows to cover all six floors of the building with areas intended for academic purposes and with adequate speed to the current demand. In addition, it can centrally manage and almost automatically, hence its name "unified". The number of wireless access points required is determined from the number of potential users and possible areas to be covered in the different floors. A detailed study of radio propagation network, determines the definitive number of access points needed and the optimal location to cover all required areas. Once deployed access points, the architecture of the wired network, with all the necessary equipment, allows connection to the Internet and the existing LAN is designed. Finally the devices (controller, switch and RADIUS server) responsible for the management, the authentication, the segmentation, the security and the proper functioning of the network are configured

The Benjamin Franklin Medal in Computer and Cognitive Science is awarded to Dr. Richard M. Karp for his contributions to the understanding of computational complexity. His work helps programmers find workable solution procedures avoiding approaches that would fail to find a solution in a reasonable amount of time. Scientific, commercial, or industrial situations where his work applies include establishing least-cost schedules for industrial production, transportation routing, circuit layout, communication network design, and predicting the spatial structure of a protein from its amino acid sequencing.

In this paper we demonstrate success with an implementation of a genetic algorithm, integrated with linear programming, for solving a minimum cost network synthesis problem. The problem is formulated to include a number of practical constraints and the technique applied to moderately large networks (50 nodes). The associated linear program may be large but successful methods have been developed with very small population sizes for the genetic algorithm.

Diseño y distribución de una red de comunicaciones en Layer 3 y una aplicación JAVA que auto-configura parámetros de routing e inserta un nuevo nodo en la red de comunicaciones., Design and development of a communication network in Layer 3 and an auto-configuration mechanism that configures routing tables and insert a new node in the communication network.

The paper presents a distributed algorithm that regulates the power output of multiple geographically dispersed energy storages, which are to provide secondary control service. The proposed algorithm is based on the cooperative control principle of the network control theory and it satisfies both power balance requirement and fair utilization among the dispersed energy storages. A virtual leader embedded in one or several energy storages is necessary to receive the power command. In addition, to improve the robustness of communication network among energy storages, one optimization model is formulated to design the so-called `N-1' abundant network, considering economic issue. Under the proposed algorithm and designed communication network, dispersed energy storages are able to have both self-organizing and adaptive coordination properties even under some adverse conditions. Simulations on the IEEE 123-bus distribution system validate the effectiveness of the proposed algorithm.

International audience; This paper describes a joint approach for control and communication network design for the application of bilateral teleoperation system (BTS). By ensuring a QoS oriented network architecture, a better quality of control (QoC) can be guaranteed despite the presence of time delays and packet losses. In this work, a joint approach is presented for the co-design problem to observe the improvements in QoC by network QoS for the bilateral teleoperation application.

Workshop held as part of the 8th Annual International Conference on Mobile Systems, Applications and Services (MobiSys 2010) Research into, and design and construction of mobile systems and algorithms requires access to large-scale mobility data. Unfortunately, the research community lacks such data. For instance, the largest available human contact traces contain only 100 nodes with very sparse connectivity, limited by experimental logistics. In this paper we pose a challenge to the community: how can we collect mobility data from billions of human participants? We re-assert the importance of large-scale datasets in communication network design, and claim that this could impact fundamental studies in other academic disciplines. In effect, we argue that planet-scale mobility measurements can help to save the world. For example, through understanding large-scale human mobility, we can track and model and contain the spread of epidemics of various kinds. Postprint

Computer communication network design is well-known as complex and hard. For that reason, the most effective methods used to solve it are heuristic. Weaknesses of these techniques are listed and a new approach based on artificial intelligence for solving this problem is presented. This approach is particularly recommended for large packet switched communication networks, in the sense that it permits a high degree of reliability and offers a very flexible environment dealing with many relevant design parameters such as link cost, link capacity, and message delay.

Describes the principal steps of a network design conception. Also in the first part, the method of the analysis is presented. Information is used to give a graphical description of the present situation. If a difference appears between the model of the solution and what the people will, a new analysis is necessary or a best utilization of the informations on the behavior of the employees is taken. The effective result is a synthesis between a theoretical conception of the communication system of the company and a practical utilization. >

This paper presents a heuristic sytem for a special problem in communication network design with bulk facilities, called the TI problem.We apply AI to this problem. The knowledge acquired from an expert team is represented procedurally. Our work shows the promise of applying AI methodologies in solving network optimization problems.

A cellular land mobile communication network (CMCN) optimal design, based on realistic simulation procedures, is presented. The input of the employed simulation model comprised parameters obtained from field and real traffic telephone measurements. The output of the model was the CMCN traffic load estimation and system performance evaluation. The CMCN design concerns the evolution of the communication network in the Patras area, Greece.

In this paper a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design is investigated. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition, for several of these problems we can show that unless P = NP, there does not exist a polynomial-time algorithm that has a better performance guarantee.

This paper presents a functional description of the Launch Processing System, which provides automatic ground checkout and control of the Space Shuttle launch site and airborne systems, with emphasis placed on the Checkout, Control, and Monitor Subsystem. Hardware and software modular design concepts for the distributed computer system are reviewed relative to performing system tests, launch operations control, and status monitoring during ground operations. The communication network design, which uses a Common Data Buffer interface to all computers to allow computer-to-computer communication, is discussed in detail.

Computers and communication networks are key components of computerized manufacturing systems. In this document analytical models based on integer programming methods have been developed for optimally allocating communication and control resources in a manufacturing shop. Subsequently, an example machine cell has been analysed. An optimal communication network design and specification procedure is described.

The ARPA Network (ARPANET) project brought together many individuals with diverse backgrounds, philosophies, and technical approaches from the fields of computer science, communication theory, operations research and others. The project was aimed at providing an efficient and reliable computer communications system (using message switching techniques) in which computer resources such as programs, data, storage, special purpose hardware etc., could be shared among computers and among many users. The variety of design methods, ranging from theoretical modeling to hardware development, were primarily employed independently, although cooperative efforts among designers occurred on occasion. As of November, 1971, the network has been an operational facility for many months, with about 20 participating sites, a network information center accessible via the net, and well over a hundred researchers, system programmers, computer center directors and other technical and administrative personnel involved in its operation.

mo problems reZevant to the design of a store-and-forward communication network (the message routing problem and the channeZ capacity assignment problem) are formulated and are recognized to be essentiaZ Zy non- Zinear, uncoMnA;tcained muZticomodity (m. c. 1 fZm problems. A "FZm Deviation" (FD) method for the soZution of these non-linear, unconstrained m.c. fZm probZems is described which is quite simiZar to the gradient method for functions of continuous variables; here the concept of gradient is repZaced by the concept of "shortest route" flow. As in the gradient method, the application of successive flow deviations leads to ZocaZ minima. of the FD method to the design of the ARPA Computer Network are discussed. FinaZ ly, two interesting applications

In this paper we investigate a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition, for several of these problems we can show that unless P=NP, there does not exist a polynomial-time algorithm that has a better performance guarantee.