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.

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