Automated and comprehensive link engineering supporting branched, ring, and mesh network topologies

2016 ◽  
Author(s):  
J. Farina ◽  
D. Khomchenko ◽  
D. Yevseyenko ◽  
J. Meester ◽  
A. Richter
2019 ◽  
Vol 214 ◽  
pp. 08013
Author(s):  
Andrey Baginyan ◽  
Vladimir Korenkov ◽  
Andrey Dolbilov ◽  
Ivan Kashunin

The article presents a hierarchical diagram of the network farm and a model of the network architecture levels. Protocols for disposal full mesh network topologies are considered. Modern data transfer protocol TRILL is presented. Its advantages are analysed in comparison with other possible protocols that may be used in the full-mesh topology. Empirical calculations of data routing based on a Dijkstra's algorithm and a patent formula of the TRILL protocol are given. Two monitoring systems of downloading data channels are described. The data obtained from 40G interfaces through each monitoring systems is presented, and their behaviour is analysed. The main result is that the discrepancy of experimental data with theoretical predictions to be equal to the weight balancing of the traffic when transmitting the batch information over the equivalent edges of the graph. It is shown that the distribution of the traffic over such routes is of arbitrary and inconsistent with the patent formula character. The conclusion analyses issues of the traffic behaviour under extreme conditions.


Author(s):  
Andrii Safonyk ◽  
Maksym Mishchanchuk ◽  
Mykyta Kromf ◽  
Aydin Novruzov

This article about the system of remote accesscontrol to the premises on the basis of Mesh-network. Theoperating principle of the system and the MESH network aredescribed here. It will also talk about the MESH network andcompare it with other network topologies.


Author(s):  
Ana Maria Sarmiento ◽  
Gerardo Castañón ◽  
Fernando Lezama

Routing and Wavelength Assignment (RWA) in an arbitrary mesh network is an NP-complete problem. So far, this problem has been solved by linear programming for network topologies with a few nodes, and sub-optimally solved for larger networks by heuristic strategies and the application of optimization algorithms such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), etc. In this chapter, the authors present the use of Ant Colony Optimization (ACO) to find near optimal solutions to the routing and wavelength assignment problem in real sized networks with up to 40 nodes and 65 connecting links. They compare their results to the lower bounds obtained by the Nagatsu’s method, finding them to be equal or very close (one wavelength over) to them.


Author(s):  
Miroslav Kostadinovic ◽  
Aleksandar Stjepanovic ◽  
Goran Kuzmic ◽  
Mirko Stojcic ◽  
Tanja Kostadinovic

The topology of WirelessHART network is changeable since a number of dynamic devices change, and all that requires a reorganization of the network, as well as finding new ways of routing data. Devices can fall out of the network due to destruction, failure, reduction or loss of electricity. On the other hand, it is possible to “refresh” the network with new devices and thus completely change the topology of the newly created network. This research analize the quality of data transferring in a WirelessHART network using two network topologies: Extended star network and Mesh network. The aim of this paper is to determine which network topology provides better quality of data transferring in a WirelessHART network on the basis of signal latency and Received Signal Strength Indicator (RSSI). To achieve this, experiments are performed using the equipment by the manufacturer Emerson Process Management: Gateway 1420, TT 648 and PT 3051 for the implementation of the network, as well as software tools for configuration, planning and management of wireless industrial networks, AMS Wireless SNAP-ON and AMS Intelligent Device Manager. The research results show several advantages of applying Mesh topology in a WirelessHART network: it is almost impossible to interrupt communication between devices in the network; there does not have to be optical visibility between the network devices; ease of installation and deinstallation; low application cost compared to Extended star network.


2015 ◽  
Vol 23 (3) ◽  
pp. 481-507 ◽  
Author(s):  
Alma A. M. Rahat ◽  
Richard M. Everson ◽  
Jonathan E. Fieldsend

Mesh network topologies are becoming increasingly popular in battery-powered wireless sensor networks, primarily because of the extension of network range. However, multihop mesh networks suffer from higher energy costs, and the routing strategy employed directly affects the lifetime of nodes with limited energy resources. Hence when planning routes there are trade-offs to be considered between individual and system-wide battery lifetimes. We present a multiobjective routing optimisation approach using hybrid evolutionary algorithms to approximate the optimal trade-off between the minimum lifetime and the average lifetime of nodes in the network. In order to accomplish this combinatorial optimisation rapidly, our approach prunes the search space using k-shortest path pruning and a graph reduction method that finds candidate routes promoting long minimum lifetimes. When arbitrarily many routes from a node to the base station are permitted, optimal routes may be found as the solution to a well-known linear program. We present an evolutionary algorithm that finds good routes when each node is allowed only a small number of paths to the base station. On a real network deployed in the Victoria & Albert Museum, London, these solutions, using only three paths per node, are able to achieve minimum lifetimes of over 99% of the optimum linear program solution’s time to first sensor battery failure.


2020 ◽  
pp. 741-746
Author(s):  
Michael O’Sullivan ◽  
◽  
Leonardo Aniello ◽  
Vladimiro Sassone

Many academic and industrial research working on Wireless Communications and Networking rely on simulations, at least in the first stages, to obtain preliminary results to be subsequently validated in real settings. Topology generators (TG) are commonly used to generate the initial placement of nodes in artificial Ad Hoc Mesh Network topologies, where those simulations take place. The significance of these experiments heavily depends on the representativeness of artificial topologies. Indeed, if they were not drawn fairly, obtained results would apply only to a subset of possible configurations, hence they would lack of the appropriate generality required to port them to the real world. Although using many TGs could mitigate this issue by generating topologies in several different ways, that would entail a significant additional effort. Hence, the problem arises of what TGs to choose, among a number of available generators, to maximise the representativeness of generated topologies and reduce the number of TGs to use. In this paper, we address that problem by investigating the presence of bias in the initial placement of nodes in artificial Ad Hoc Mesh Network topologies produced by different TGs. We propose a methodology to assess such bias and introduce a metric to quantify the diversity of the topologies generated by a TG with respect to all the available TGs, which can be used to select what TGs to use. We carry out experiments on three well-known TGs, namely BRITE, NPART and GT-ITM. Obtained results show that using the artificial networks produced by a single TG can introduce bias.


Author(s):  
A. Rethina Palin ◽  
I. Jeena Jacob

Wireless Mesh Network (MWN) could be divided into proactive routing, reactive routing and hybrid routing, which must satisfy the requirements related to scalability, reliability, flexibility, throughput, load balancing, congestion control and efficiency. DMN (Directional Mesh Network) become more adaptive to the local environments and robust to spectrum changes. The existing computing units in the mesh network systems are Fog nodes, the DMN architecture is more economic and efficient since it doesn’t require architecture- level changes from existing systems. The cluster head (CH) manages a group of nodes such that the network has the hierarchical structure for the channel access, routing and bandwidth allocation. The feature extraction and situational awareness is conducted, each Fog node sends the information regarding the current situation to the cluster head in the contextual format. A Markov logic network (MLN) based reasoning engine is utilized for the final routing table updating regarding the system uncertainty and complexity.


2012 ◽  
Vol 3 (3) ◽  
pp. 368-374
Author(s):  
Usha Kumari ◽  
Udai Shankar

IEEE 802.16 based wireless mesh networks (WMNs) are a promising broadband access solution to support flexibility, cost effectiveness and fast deployment of the fourth generation infrastructure based wireless networks. Reducing the time for channel establishment is critical for low latency/interactive Applications. According to IEEE 802.16 MAC protocol, there are three scheduling algorithms for assigning TDMA slots to each network node: centralized and distributed the distributed is further divided into two operational modes coordinated distributed and uncoordinated distributed. In coordinated distributed scheduling algorithm, network nodes have to transmit scheduling message in order to inform other nodes about their transfer schedule. In this paper a new approach is proposed to improve coordinated distributed scheduling efficiency in IEEE 802.16 mesh mode, with respect to three parameter Throughput, Average end to end delay and Normalized Overhead. For evaluating the proposed networks efficiency, several extensive simulations are performed in various network configurations and the most important system parameters which affect the network performance are analyzed


Sign in / Sign up

Export Citation Format

Share Document