Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Distributed network with mesh topology.
Articles de revues sur le sujet « Distributed network with mesh topology »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Distributed network with mesh topology ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.
1
N., Dr Bhalaji. « Reliable Data Transmission with Heightened Confidentiality and Integrity in IOT Empowered Mobile Networks ». Journal of ISMAC 2, no 2 (9 mai 2020) : 106–17. http://dx.doi.org/10.36548/jismac.2020.2.004.
Texte intégralRésumé :
The revolution caused by the communication without wires has brought in multitudes of basic modifications in the data network and the telecommunication, making the integrated networks a reality. The further advancements in the wireless communication has enabled to set personal networks using the portable devices, and are termed as the adhoc networks. The networks formed under specific circumstances or a reason could follow any one of the topology to convey the information. W ireless mesh network is the form of such network mentioned above that organized in a mesh topology. This network formed in mesh topology contains several consumers who are arranged in the distributed manner and forward the packets in a one or more than one hop model. The protocols that help in sorting out the path for sending and receiving the information are has a vital influence over the network in mesh topology as they affect the throughput, life of established links etc. Integrating the wireless mesh topology to the internet of things has improved the way of information sharing by linking multitudes tangible things around. The mesh topology wireless networks formed using the portable devices or other –wise called as the mobile networks that are connected over internet are open to security breaches as the mesh holds few nodes that are malicious. This makes the information conveyed to be either compromised or manipulated. The article in order to ensure the reliability in the transmission of the data with the heightened confidentiality and integrity in the IOT empowered mobile networks proposes a routing strategy that is robust across the consumers in mesh, the gateway and the routers. The channels across the devices in the mesh are formed based on the efficiency of the connections for the distribution of the data. The simulation process of the proposed work using the network simulator 2 shows the performance improvement of the proposed work with respect to throughput of the network, packet loss rate, packet delivery rate, latency, energy efficiency and the computational overhead.
2
Chafe, Chris. « Distributed acoustical meshes on the Internet ». Journal of the Acoustical Society of America 156, no 4_Supplement (1 octobre 2024) : A39. https://doi.org/10.1121/10.0035023.
Texte intégralRésumé :
An acoustical mesh distributed over the Internet is constructed of scattering junction nodes with bidirectional audio streaming between them. Components of common network music performance (NMP) applications like JackTrip can be adapted for experimentation with the concept. In the usual context of ensemble NMP, an audio hub server accepts bidirectional audio connections from multiple clients. The clients are located apart from each other physically and the hub server handles audio to and from the ensemble of sites, typically comprising a band or choir. The usual spoke and wheel topology (single hub server/mulitple hub clients) requires some modifications to run as a mesh of interconnected scattering juntions. The resulting waveguide mesh topology is explored for its properties, some of which resemble extensions of waveguide mesh physical model simulations of musical instruments and rooms. The acoustical medium that this creates is a live, vibrating acoustic mesh across Internet space. Unique properties, such as non-uniform distribution of nodes, are described in an experiment that explores analogies to plates and membranes and is characterized by the inherently anisotropic propagation of the network.
3
Jalil, Muhammad Arif Bin. « A Brief Overview : Computer Network Based on Physical and Logical Topology ». International Journal for Research in Applied Science and Engineering Technology 10, no 3 (31 mars 2022) : 1154–60. http://dx.doi.org/10.22214/ijraset.2022.40833.
Texte intégralRésumé :
Abstract: The classification of network topologies according to how they are implemented is examined in depth from a variety of perspectives. Each type of topology is used to accomplish a certain purpose and capture the system's structure at varying levels of detail. Distributed computer systems have been an important and popular topic in computing in recent years. It provides highend performance at an affordable price .In a distributed computing environment, autonomous computers are connected via a communication network that is arranged in a geometrical shape known as network topology. Keywords: Bus, Star, Ring, Tree, Mesh, Network Topology, Physical Topology, Logical Topology.
4
WANG, XINYANG, DEYU QI et NAQIN ZHOU. « Embedding Strategies of Mesh Network into the Exchanged Crossed Cube ». Journal of Interconnection Networks 18, no 02n03 (juin 2018) : 1850011. http://dx.doi.org/10.1142/s0219265918500111.
Texte intégralRésumé :
The topology of interconnection networks plays an important role in the performance of parallel and distributed computing systems, and the embeddings of interconnection networks can help adapt their topology features into new interconnection network structures. Being a basic and popular structure, the mesh network has wide application range as the result of some of its topology features. Meanwhile, as an important variant of hypercube, the Exchanged Crossed Cube(ECQ) combines advantages of crossed cube and exchanged hypercube, i.e. the promotion of network performance and the reduce of communication cost. To enlarge the application range of the ECQ, this paper discusses the embedding strategies of Mesh network into ECQ and proposes 4 methods to embed meshes into ECQ. We distinguish these methods by comparing their dilation, expansion, loading and congestion. The comparison result shows that compromise among four of the above parameters has to be made to achieve the improvement of some parameters.
5
Elzain et Wu. « Software Defined Wireless Mesh Network Flat Distribution Control Plane ». Future Internet 11, no 8 (25 juillet 2019) : 166. http://dx.doi.org/10.3390/fi11080166.
Texte intégralRésumé :
Wireless Mesh Networks (WMNs), have a potential offering relatively stable Internet broadband access. The rapid development and growth of WMNs attract ISPs to support users’ coverage anywhere anytime. To achieve this goal network architecture must be addressed carefully. Software Defined Networking (SDN) proposes new network architecture for wired and wireless networks. Software Defined Wireless Networking (SDWN) has a great potential to increase efficiency, ease the complexity of control and management, and accelerate technology innovation rate of wireless networking. An SDN controller is the core component of an SDN network. It needs to have updated reports of the network status change, as in network topology and quality of service (QoS) in order to effectively configure and manage the network it controls. In this paper, we propose Flat Distributed Software Defined Wireless Mesh Network architecture where the controller aggregates entire topology discovery and monitors QoS properties of extended WMN nodes using Link Layer Discovery Protocol (LLDP) protocol, which is not possible in multi-hop ordinary architectures. The proposed architecture has been implemented on top of POX controller and Advanced Message Queuing Protocol (AMQP) protocol. The experiments were conducted in a Mininet-wifi emulator, the results present the architecture control plane consistency and two application cases: topology discovery and QoS monitoring. The current results push us to study QoS-routing for video streaming over WMN.
6
Fan, Wen Qi, Sheng Chun Huang et Ji Bo Wei. « Key Technology Research on Wireless Mesh Network MAC Protocol ». Applied Mechanics and Materials 696 (novembre 2014) : 215–21. http://dx.doi.org/10.4028/www.scientific.net/amm.696.215.
Texte intégralRésumé :
Wireless Mesh Networks (WMN) is distributed broadband wireless network architecture with characteristic of high throughput and high data rate. The quantity of research being conducted in this area has dramatically increased recently. Medium Access Control (MAC) is the key technology to exploit the multi-hop advantage of WMN. This paper introduces two major research topic of MAC design in WMN, the topology control and link scheduling. A survey of recent research on these topics is given in detail.
7
BOUHRAOUA, ABDELHAFID, et MUHAMMAD E. S. ELRABAA. « IMPROVED MODIFIED FAT-TREE TOPOLOGY NETWORK-ON-CHIP ». Journal of Circuits, Systems and Computers 20, no 04 (juin 2011) : 757–80. http://dx.doi.org/10.1142/s0218126611007591.
Texte intégralRésumé :
C-based cycle-accurate simulations are used to evaluate the performance of a Network-on-Chip (NoC) based on an improved version of the modified Fat Tree topology. The modification simplifies routing further and guarantee orderly reception of packets without any loss of performance. Several traffic models have been used in these simulations; Bursty and non-bursty traffic with uniformly-distributed destination addresses and non-uniformly-distributed destination addresses. A simple new traffic model has been developed for generating non-uniformly-distributed destination addresses. This model is general enough to be used in developing new NoC architectures and captures universally accepted place-and-route methodologies. Simulation results are used to illustrate how the hardware resources of a modified Fat Tree NoC can be minimized without affecting the network performance. The performance of a NoC with regular Mesh topology was also evaluated for comparison with the modified Fat Tree topology.
8
Eigel, Martin, Marvin Haase et Johannes Neumann. « Topology Optimisation under Uncertainties with Neural Networks ». Algorithms 15, no 7 (12 juillet 2022) : 241. http://dx.doi.org/10.3390/a15070241.
Texte intégralRésumé :
Topology optimisation is a mathematical approach relevant to different engineering problems where the distribution of material in a defined domain is distributed in some optimal way, subject to a predefined cost function representing desired (e.g., mechanical) properties and constraints. The computation of such an optimal distribution depends on the numerical solution of some physical model (in our case linear elasticity) and robustness is achieved by introducing uncertainties into the model data, namely the forces acting on the structure and variations of the material stiffness, rendering the task high-dimensional and computationally expensive. To alleviate this computational burden, we develop two neural network architectures (NN) that are capable of predicting the gradient step of the optimisation procedure. Since state-of-the-art methods use adaptive mesh refinement, the neural networks are designed to use a sufficiently fine reference mesh such that only one training phase of the neural network suffices. As a first architecture, a convolutional neural network is adapted to the task. To include sequential information of the optimisation process, a recurrent neural network is constructed as a second architecture. A common 2D bridge benchmark is used to illustrate the performance of the proposed architectures. It is observed that the NN prediction of the gradient step clearly outperforms the classical optimisation method, in particular since larger iteration steps become viable.
9
Kelagadi, Hemantaraj M., et Priyatam Kumar. « Distributed Topology Control Techniques for Wireless Sensor Networks : An Overview ». International Journal of Advanced Research in Computer Science and Software Engineering 7, no 7 (2 octobre 2017) : 425. http://dx.doi.org/10.23956/ijarcsse/v7i7/0225.
Texte intégralRésumé :
The recent technological innovations and development like the Internet of Things (IoT), Smart Grids and Smart Environment applications tend to enhance the scalability, self-organizing capability of the mesh networks as well as the wireless sensor networks. As the wireless sensor network have limited energy resources, there is a need of utilizing these limitations in an efficient way in order to accomplish such advanced energy efficiency and better lifetime can be taken care by the operation of topology control methods. In this survey the issue of energy efficiency is formed upon and a comprehensive study of topology control technologies that can be used for enhancement of battery lifetime in WSNs is presented. An insight of how energy efficiency can be achieved by design is provided by review of the significant topology control algorithms based on the energy conservation approach adopted, those algorithms are classified further and evaluated on the basis of communication so as to aid the designer to select best suitable techniques for their applications. A number of open research issues for achieving the energy efficiency by means of controlling topology are identified based on the survey conducted.
10
Kang, Yingxi, Beiping Tang et Xiaodong Hu. « High-Performance Computing Web Search System Based on Computer Big Data ». Scalable Computing : Practice and Experience 25, no 3 (12 avril 2024) : 1932–39. http://dx.doi.org/10.12694/scpe.v25i3.2794.
Texte intégralRésumé :
File sharing, streaming media, collaborative computing, and other P2P systems are all unicast to establish the corresponding overlapping network. The superimposed network is generally carried out based on the existing primary network. In this way, the access of each node is random. At the same time, this will cause the topological structure of the upper and lower layers to be inconsistent. This will increase the communication delay between nodes and cause an excellent bandwidth burden to the underlying network. The existing topology matching methods still face problems, such as poor scalability and long node aggregation time. This paper aims to design a topological distributed node aggregation method based on network coordination and distributed hash table (DHT) algorithm. This paper established a two-dimensional mesh model of nodes based on equal-distance concentric circles and divided into two equal areas. The parts of multiple namespaces correspond one by one according to their location. Because nodes are kept close, neighbours can be aggregated through DHT's primary "publish" and "search" primitives. Experimental results show that the TANRA method can match the network's topology under a slight delay and a large number of nodes. The TANRA method can effectively reduce the path delay in structured networks.
11
Mladenov, Branislav, et Georgi Iliev. « Optimal software-defined network topology for distributed denial of service attack mitigation ». Bulletin of Electrical Engineering and Informatics 9, no 6 (1 décembre 2020) : 2588–94. http://dx.doi.org/10.11591/eei.v9i6.2581.
Texte intégralRésumé :
Distributed denial of service (DDoS) attacks are a major threat to all internet services. The main goal is to disrupt normal traffic and overwhelms the target. Software-defined networking (SDN) is a new type of network architecture where control and data plane are separated. A successful attack may block the SDN controller which may stop processing the new request and will lead to a total disruption of the whole network. The main goal of this paper is to find the optimal network topology and size which can handle Distributed denial of service attack without management channel bandwidth exhaustion or run out of SDN controller CPU and memory. Through simulations, it is shown that mesh topologies with more connections between switches are more resistant to DDoS attacks than liner type network topologies.
12
Rethfeldt, Michael, Tim Brockmann, Benjamin Beichler, Christian Haubelt et Dirk Timmermann. « Adaptive Multi-Channel Clustering in IEEE 802.11s Wireless Mesh Networks ». Sensors 21, no 21 (29 octobre 2021) : 7215. http://dx.doi.org/10.3390/s21217215.
Texte intégralRésumé :
WLAN mesh networks are one of the key technologies for upcoming smart city applications and are characterized by a flexible and low-cost deployment. The standard amendment IEEE 802.11s introduces low-level mesh interoperability at the WLAN MAC layer. However, scalability limitations imposed by management traffic overhead, routing delays, medium contention, and interference are common issues in wireless mesh networks and also apply to IEEE 802.11s networks. Possible solutions proposed in the literature recommend a divide-and-conquer scheme that partitions the network into clusters and forms smaller collision and broadcast domains by assigning orthogonal channels. We present CHaChA (Clustering Heuristic and Channel Assignment), a distributed cross-layer approach for cluster formation and channel assignment that directly integrates the default IEEE 802.11s mesh protocol information and operating modes, retaining unrestricted compliance to the WLAN standard. Our concept proposes further mechanisms for dynamic cluster adaptation, including subsequent cluster joining, isolation and fault detection, and node roaming for cluster balancing. The practical performance of CHaChA is demonstrated in a real-world 802.11s testbed. We first investigate clustering reproducibility, duration, and communication overhead in static network scenarios of different sizes. We then validate our concepts for dynamic cluster adaptation, considering topology changes that are likely to occur during long-term network operation and maintenance.
13
Singh, Mitali, et Viktor K. Prasanna. « A HIERARCHICAL MODEL FOR DISTRIBUTED COLLABORATIVE COMPUTATION IN WIRELESS SENSOR NETWORKS ». International Journal of Foundations of Computer Science 15, no 03 (juin 2004) : 485–506. http://dx.doi.org/10.1142/s012905410400256x.
Texte intégralRésumé :
In-network collaborative computation is essential for implementation of a large number of sensor applications. We approach the problem of computation in sensor networks from a parallel and distributed system's perspective. We define COSMOS, the Cluster-based, heterOgeneouSMOdel for Sensor networks. The model abstracts the key features of the class of cluster-based sensor applications. It assumes a hierarchical network architecture comprising of a large number of low cost sensors with limited computation capability, and fewer number of powerful clusterheads, uniformly distributed in a two dimensional terrain. The sensors are organized into single hop clusters, each managed by a distinct clusterhead. The clusterheads are organized in a mesh-like topology. All sensors in a cluster are time synchronized, whereas the clusterheads communicate asynchronously. The sensors are assumed to have multiple power states and a wakeup mechanism to facilitate power management. To illustrate algorithm design using our model, we discuss implementation of algorithms for sorting and summing in sensor networks.
14
Asseman, Alexis, Nicolas Antoine et Ahmet S. Ozcan. « Accelerating Deep Neuroevolution on Distributed FPGAs for Reinforcement Learning Problems ». ACM Journal on Emerging Technologies in Computing Systems 17, no 2 (avril 2021) : 1–17. http://dx.doi.org/10.1145/3425500.
Texte intégralRésumé :
Reinforcement learning, augmented by the representational power of deep neural networks, has shown promising results on high-dimensional problems, such as game playing and robotic control. However, the sequential nature of these problems poses a fundamental challenge for computational efficiency. Recently, alternative approaches such as evolutionary strategies and deep neuroevolution demonstrated competitive results with faster training time on distributed CPU cores. Here we report record training times (running at about 1 million frames per second) for Atari 2600 games using deep neuroevolution implemented on distributed FPGAs. Combined hardware implementation of the game console, image preprocessing and the neural network in an optimized pipeline, multiplied with the system level parallelism enabled the acceleration. These results are the first application demonstration on the IBM Neural Computer, which is a custom designed system that consists of 432 Xilinx FPGAs interconnected in a 3D mesh network topology. In addition to high performance, experiments also showed improvement in accuracy for all games compared to the CPU implementation of the same algorithm.
15
Effiong, Charles, Gilles Sassatelli et Abdoulaye Gamatié. « Combined Distributed Shared-Buffered and Diagonally-Linked Mesh Topology for High-Performance Interconnect ». Micromachines 13, no 12 (17 décembre 2022) : 2246. http://dx.doi.org/10.3390/mi13122246.
Texte intégralRésumé :
Networks-on-Chip (NoCs) have become the de-facto on-chip interconnect for multi/manycore systems. A typical NoC router is made up of buffers used to store packets that are unable to advance to their desired destination. However, buffers consume significant power/area and are often underutilized, especially in cases of applications with non-uniform traffic patterns thus leading to performance degradation for such applications. To improve network performance, the Roundabout NoC (R-NoC) concept is considered. R-NoC is inspired by real-life multi-lane traffic roundabouts and consists of lanes that are shared by multiple input/output ports to maximize buffering resource utilization. R-NoC relies on router-internal adaptive routing that decides the lane path based on back pressure. Back pressure makes it possible to assess lane utilization and route packets accordingly. This is made possible thanks to the use of elastic buffers for control flow, a clever type of handshaking in a way similar to asynchronous circuits. Another prominent feature of R-NoC is that internal routing and arbitration are completely distributed which allows for significant freedom in deciding internal router topology and parameters. This work leverages this property and proposes novel yet unexplored configurations for which an in-depth evaluation of corresponding implementations on 45 nm CMOS technology is given. Each configuration is evaluated performance and power-wise on both synthetic and real application traffic. Several R-NoC configurations are identified and demonstrated to provide very significant performance improvements over standard mesh configurations and a typical input-buffered router, without compromising area and power consumption. Exploiting the distributed nature of R-NoC routers, a diagonally-linked configuration is then proposed which incurs moderate area overhead and features yet better performance and energy efficiency.
16
CHEN, KEVIN F., et EDWIN H. M. SHA. « UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS ». Journal of Interconnection Networks 08, no 01 (mars 2007) : 1–28. http://dx.doi.org/10.1142/s0219265907001886.
Texte intégralRésumé :
We show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. We show that from a routing perspective the fat-stack is efficient and is suitable for use as a baseline distributed network and as a crucial benchmark architecture for evaluating the performance of specific distributed networks. We show that the fat-stack is efficient by proving it is universal. A requirement for the fat-stack to be universal is that link capacities double up the levels of the network. We use methods developed in the areas of VLSI and processor interconnect for much of our analysis. We then show how to scale the fat-stack from a VLSI graph layout to a large-scale distributed topology and how the network can be an effective benchmark architecture. Our universality proofs show that a fat-stack of area Θ(A) can simulate any competing network of area A with [Formula: see text] overhead independently of wire delay. The universality result implies that the fat-stack of a given size is nearly the best routing network of that size. The fat-stack is also the minimal universal network for an [Formula: see text] overhead in terms of number of links. Actual simulations show that the fat-stack outperforms a mesh-based distributed network of comparable hardware usage. Our work helps explain why some deployed networks function in the way they do in terms of routing. It also provides an exemplary network of proven efficiency and scalability for building new distributed systems.
17
Zahra, Nida, Muhammad Ibrahim, Muhammad Kamran Siddiqui et Hajar Shooshtri. « On Analysis and Computation of Degree-Based Topological Invariants for Cyclic Mesh Network ». Journal of Chemistry 2021 (14 juillet 2021) : 1–8. http://dx.doi.org/10.1155/2021/1290881.
Texte intégralRésumé :
Recently, there has been increasing attention on the system network due to its promising applications in parallel hanging architectures such as distributed computing (Day (2004), Day and Al-Ayyoub (2002)). Related networks differ in the circumstances of topology, and the descriptors were freshly examined by Hayat and Imran (2014) and Hayat et al. (2014). Distance-based descriptors, counting-related descriptors, and degree-based descriptors are all examples of topological descriptors. These topological characteristics are linked to chemical features of a substance, such as stability, strain energy, and boiling point. The specifications for the 1st Zagreb alpha, 1st Zagreb beta, 2nd Zagreb, sum-connectivity, geometric-arithmetic, Randic, harmonic, and atom-bond connectivity indices for mesh networks M N m × n based on VE and EV degree are discussed in this paper.
18
Sasank Tummalpalli. « Decentralized Networking Models : Reshaping Digital Architecture ». International Journal of Scientific Research in Computer Science, Engineering and Information Technology 11, no 1 (19 janvier 2025) : 875–83. https://doi.org/10.32628/cseit25111281.
Texte intégralRésumé :
The emergence of decentralized networks represents a fundamental shift in digital infrastructure design and implementation. This comprehensive article explores the evolution of networking architectures from traditional centralized models to modern distributed systems, examining core components, implementation challenges, and future developments. It investigates how decentralized control systems and blockchain technologies are reshaping network topology design, routing protocols, and consensus mechanisms. Through detailed case studies of P2P file sharing, mesh networks, edge computing, and IoT implementations, the article demonstrates the practical applications and benefits of decentralized architectures. It encompasses critical aspects of network performance, including scalability considerations, resilience mechanisms, and resource optimization strategies. Special attention is given to emerging technologies such as AI-enhanced routing solutions, cross-network interoperability, and bio-inspired network designs. The article also addresses security challenges and their solutions in decentralized environments, providing insights into the development of robust and secure network architectures for future applications.
19
Ri, Man Gun, Ye Song Han et Jin Pak. « A distributed energy-efficient opportunistic routing accompanied by timeslot allocation in wireless sensor networks ». International Journal of Distributed Sensor Networks 18, no 5 (mai 2022) : 155014772110499. http://dx.doi.org/10.1177/15501477211049917.
Texte intégralRésumé :
Sensed data can be forwarded only in one direction to the base station in one-dimensional queue wireless sensor networks different from mesh structure, so the network lifetime will be shortened if some continuous neighboring nodes have run out of their energy. So designing routing protocols for balancing energy consumption is a challenging problem. However, traditional and existing opportunistic routing protocols for one-dimensional queue wireless sensor network proposed so far have not yet addressed this problem to prolong the network lifetime by introducing sleep mode. In this article, we propose a distributed energy-efficient opportunistic routing algorithm accompanied by timeslot allocation by using specific network topology of one-dimensional queue wireless sensor network. In our new algorithm, clustering and routing tree construction is performed while introducing the optimal relay transmission distance achieved by using opportunistic routing principle, and at the same time, interference-free wake up time is scheduled, which may optimize energy consumption and decrease the number of various control messages as possible to prolong the network lifetime. Furthermore, this improves energy efficiency by introducing the operation mode giving up cluster head role. Simulation results show that the proposed protocol can significantly improve the network performance such as energy consumption and network connectivity, when compared with other existing protocols.
20
Eras, Leonardo, Federico Domínguez et Caril Martinez. « Viability characterization of a proof-of-concept Bluetooth mesh smart building application ». International Journal of Distributed Sensor Networks 18, no 5 (mai 2022) : 155013292210978. http://dx.doi.org/10.1177/15501329221097819.
Texte intégralRésumé :
Bluetooth low energy is an almost ubiquitous technology currently embedded in billions of power-constrained Internet of Things devices around the world. The Bluetooth mesh profile, released by the Bluetooth Special Interest Group in July 2017, allows Bluetooth low energy devices to form a mesh network, further enabling smart home and building applications where long-range connectivity is required. However, the current release of Bluetooth mesh profile still has power and deployment constraints that limit its applicability. To explore the viability of Bluetooth mesh profile in home/building automation applications, we built the Smart Doorbell: a proof-of-concept Bluetooth mesh profile–based visitor notification system for office spaces. The Smart Doorbell was implemented using a mesh network topology with nodes distributed across office building floors, serving as a real Internet of Things deployment and as a testbed for mesh network protocols. Similar Bluetooth mesh profile evaluations found in literature use mostly development kits and/or synthetic traffic in artificial settings; we contribute by using the Smart Doorbell, a system as close as possible to a minimum viable product, to evaluate power consumption and responsiveness as a proxy for product viability. This article presents the architecture of the Smart Doorbell, the viability evaluation results, and a direct comparison with FruityMesh, a competing Bluetooth low energy mesh network protocol. Overall, the fact that Bluetooth mesh profile devices can directly communicate with a user’s mobile phone (using Bluetooth low energy) considerably eases deployment and provisioning. However, the use of flooding to forward messages across the mesh network increases power consumption, precluding the use of battery-powered nodes on the network’s backbone and severely limiting the applicability of Bluetooth mesh profile in building automation.
21
Nsaif, Younis M., Molla Shahadat Hossain Lipu, Aini Hussain, Afida Ayob, Yushaizad Yusof et Muhammad Ammirrul A. M. Zainuri. « A Novel Fault Detection and Classification Strategy for Photovoltaic Distribution Network Using Improved Hilbert–Huang Transform and Ensemble Learning Technique ». Sustainability 14, no 18 (19 septembre 2022) : 11749. http://dx.doi.org/10.3390/su141811749.
Texte intégralRésumé :
Due to the increased integration of distributed generations in distributed networks, their development and operation are facing protection challenges that traditional protection systems are incapable of addressing. These problems include variations in the fault current during various operation modes, diverse distributed network topology, and high impedance faults. Therefore, appropriate and reasonable fault detection is highly encouraged to improve the protection and dependability of the distributed network. This paper proposes a novel technique that employs an improved Hilbert–Huang Transform (HHT) and ensemble learning techniques to resolve these challenges in a photovoltaic distributed network. First, improved HHT is utilized to extract energy features from the current signal. Second, variational mode decomposition (VMD) is applied to extract the intrinsic mode function from the zero component of the current signal. Then, the acquired energy feature and intrinsic mode function are input to the ensemble learning technique for fault detection and classification. The proposed technique is implemented using MATLAB software environment, including a classification learner app and SIMULINK. An evaluation of the results is conducted under normal connected mode (NCM) and island mode (ISM) for radial and mesh-soft normally open point (SNOP) configurations. The accuracy of the ensemble bagged trees technique is higher when compared to the narrow-neural network, fine tree, quadratic SVM, fine-gaussian SVM, and wide-neural network. The presented technique depends only on local variables and has no requirements for connection latency. Consequently, the detection and classification of faults using the proposed technology are reasonable. The simulation results demonstrate that the proposed technique is superior to the neural network and support vector machine, achieving 100%, 99.2% and 99.7% accurate symmetrical and unsymmetrical fault detection and classification throughout NCM, ISM, and dynamic operation mode, respectively. Moreover, the developed technique protects DN effectively in radial and mesh-SNOP topologies. The suggested strategy can detect and classify faults accurately in DN with/without DGs. Additionally, this technique can precisely detect high and low impedance faults within 4.8 ms.
22
Wang, Minyue, Yeming Li, Jiamei Lv, Yi Gao, Cheng Qiao, Baiqiang Liu et Wei Dong. « ACE : A Routing Algorithm Based on Autonomous Channel Scheduling for Bluetooth Mesh Network ». Electronics 11, no 1 (30 décembre 2021) : 113. http://dx.doi.org/10.3390/electronics11010113.
Texte intégralRésumé :
The Internet of Things (IoT) interconnects massive cyber-physical devices (CPD) to provide various applications, such as smart home and smart building. Bluetooth Mesh is an emerging networking technology, which can be used to organize a massive network with Bluetooth Low Energy (BLE) devices. Managed-flooding protocol is used in Bluetooth Mesh to route the data packets. Although it is a highly desirable option when data transmission is urgent, it is inefficient in a larger and denser mesh network due to the collisions of broadcast data packets. In this paper, we introduce ACE: a Routing Algorithm based on Autonomous Channel Scheduling for Bluetooth Mesh Network. ACE relies on the existing Bluetooth Mesh messages to distribute routes without additional traffic overhead and conducts a beacon-aware routing update adaptively as the topology evolves. In ACE, BLE channel resources can be efficiently utilized by a channel scheduling scheme for each node locally and autonomously without any neighborly negotiation. We implement ACE on the nRF52840 from Nordic Semiconductor and evaluate its effectiveness on our testbed. Compared to the Bluetooth Mesh, our experiments proved that ACE could reduce the end-to-end latency by 16%, alleviate packets collisions issues, and increase the packet delivery ratio (PDR) by 30% under heavy traffic. Moreover, simulation results verified that ACE has better scalability when the size and density of networks become larger and denser.
23
Gottschalk, Thomas D., Philip Amburn et Dan M. Davis. « Advanced Message Routing for Scalable Distributed Simulations ». Journal of Defense Modeling and Simulation : Applications, Methodology, Technology 2, no 1 (janvier 2005) : 17–28. http://dx.doi.org/10.1177/154851290500200103.
Texte intégralRésumé :
On large Linux clusters, scalability is the ability of the program to utilize additional processors in a way that provides a near-linear increase in computational capacity for each node employed. Without scalability, the cluster may cease to be useful after adding a very small number of nodes. The Joint Forces Command (JFCOM) Experimentation Directorate (J9) has recently been engaged in Joint Urban Operations (JUO) experiments and counter mortar analyses. Both required scalable codes to simulate over 1 million SAF clutter entities, using hundreds of CPUs. The JSAF application suite, utilizing the redesigned RTI-s communications system, provides the ability to run distributed simulations with sites located across the United States, from Norfolk, Virginia, to Maui, Hawaii. Interest-aware routers are essential for scalable communications in the large, distributed environments, and the RTI-s framework, currently in use by JFCOM, provides such routers connected in a basic tree topology. This approach is successful for small to medium sized simulations, but faces a number of constraining limitations precluding very large simulations. To resolve these issues, the work described herein utilizes a new software router infrastructure to accommodate more sophisticated, general topologies, including both the existing tree framework and a new generalization of the fully connected mesh topologies. The latter were first used in the SF Express ModSAF simulations of 100,000 fully interacting vehicles. The new software router objects incorporate an augmented set of the scalable features of the SF Express design, while optionally using low-level RTI-s objects to perform actual site-to-site communications. The limitations of the original MeshRouter formalism have been eliminated, allowing fully dynamic operations. The mesh topology capabilities allow aggregate bandwidth and site-to-site latencies to match actual network performance. The heavy resource load at the root node now can be distributed across routers at the participating sites. Most significantly, realizable point-to-point bandwidths remain stable as the underlying problem size increases, sustaining scalability claims.
24
Ren, Zhimin. « Data Processing Platform of Cloud Computing and Its Performance Analysis Based on Photoelectric Hybrid Interconnection Architecture ». Journal of Nanoelectronics and Optoelectronics 15, no 6 (1 juin 2020) : 743–52. http://dx.doi.org/10.1166/jno.2020.2805.
Texte intégralRésumé :
Data processing platform is the core support platform of cloud computing. The use of electric interconnection architecture will increase the complexity of network topology, while optical interconnection architecture is ideal, so cloud computing platform based on optical interconnection has become a research hotspot. The distributed optical interconnection architecture of cloud computing data processing platform is focused on. Combining the hybrid mechanism of optical circuit switching and electric packet switching, it can meet a variety of traffic requirements. Meanwhile, it improves the switching mechanism, communication strategy, and router structure. Moreover, considering that the hybrid optoelectronic interconnection architecture can improve the network delay and throughput, but there is still a problem of network consumption. Combined with the network characteristics of the data processing platform (wireless mesh structure) of cloud computing, the network topology algorithm is studied, and the relationship between the topology and the maximum number of allocable channels is analyzed. Furthermore, the equation of topological reliability calculation is defined, and the optimization model of topological design is proposed, according to which the data processing platform of cloud computing is further optimized under the photoelectric hybrid interconnection architecture. During the experiment, before topology optimization, by changing the message length, it is found that adding optical circuit switching can help achieving large capacity and new type of transmission, and can effectively reduce the time delay. After topology optimization structure is adopted, the photoelectric hybrid-data processing platform of cloud computing without topology optimization is compared. It is found that under different reliability constraints, the throughput and end-to-end delay of the network are significantly improved, which proves that the data processing platform of cloud computing based on the photoelectric hybrid interconnection architecture is a feasible cloud computing platform.
25
Roshini, A., et K. V. D. Kiran. « An Enhanced Posture Prediction-Bayesian Network Algorithm for Sleep Posture Recognition in Wireless Body Area Networks ». International Journal of Telemedicine and Applications 2022 (28 mai 2022) : 1–11. http://dx.doi.org/10.1155/2022/3102545.
Texte intégralRésumé :
Wireless body area networks have taken their unique recognition in providing consistent facilities in health monitoring. Several studies influence physiological signal monitoring through a centralized approach using star topology in regular activities like standing, walking, sitting, and running which are considered active postures. Unlike regular activities like walking, standing, sitting, and running, the in-bed sleep posture monitoring of a subject is highly necessary for those who have undergone surgery, victims of breathing problems, and victims of COVID-19 for whom oxygen imbalance is a major issue as the mortality rate in sleep is high due to unattended patients. Suggestions from the medical field state that the patients with the above-mentioned issues are highly suggested to follow the prone sleep posture that enables them to maintain the oxygen level in the human body. A distributed model of communication is used where mesh topology is used for the data packets to be carried in a relay fashion to the sink. Heartbeat rate (HBR) and image monitoring of the subject during sleep are closely monitored and taken as input to the proposed posture prediction-Bayesian network (PP-BN) to predict the consecutive postures to increase the accuracy rate of posture recognition. The accuracy rate of the model outperforms the existing classification and prediction algorithms which take the cleaned dataset as input for better prediction results.
26
Viet Truong, Anh, Trieu Ngoc Ton, Thuan Thanh Nguyen et Thanh Duong. « Two States for Optimal Position and Capacity of Distributed Generators Considering Network Reconfiguration for Power Loss Minimization Based on Runner Root Algorithm ». Energies 12, no 1 (29 décembre 2018) : 106. http://dx.doi.org/10.3390/en12010106.
Texte intégralRésumé :
Although the distributed generator (DG) placement and distribution network (DN) reconfiguration techniques contribute to reduce power loss, obviously the former is a design problem which is used for a long-term purpose while the latter is an operational problem which is used for a short-term purpose. In this situation, the optimal value of the position and capacity of DGs is a value which must be not affected by changing the operational configuration due to easy changes in the status of switches compared with changes in the installed location of DG. This paper demonstrates a methodology for choosing the position and size of DGs on the DN that takes into account re-switching the status of switches on distribution of the DN to reduce power losses. The proposed method is based on the runner root algorithm (RRA) which separates the problem into two states. In State-I, RRA is used to optimize the position and size of DGs on closed-loop distribution networks which is a mesh shape topology and power is delivered through more than one line. In State-II, RRA is used to reconfigure the DN after placing the DGs to find the open-loop distribution network which is a tree shape topology and power is only delivered through one line. The calculation results in DN systems with 33 nodes and 69 nodes, showing that the proposed method is capable of solving the problem of the optimal position and size of DGs considering distribution network reconfiguration.
27
Stellin, Marco, Sérgio Sabino et António Grilo. « LoRaWAN Networking in Mobile Scenarios Using a WiFi Mesh of UAV Gateways ». Electronics 9, no 4 (10 avril 2020) : 630. http://dx.doi.org/10.3390/electronics9040630.
Texte intégralRésumé :
Immediately after a disaster, such as a flood, wildfire or earthquake, networks might be congested or disrupted and not suitable for supporting the traffic generated by rescuers. In these situations, the use of a traditional fixed-gateway approach would not be effective due to the mobility of the rescuers. In the present work, a double-layer network system named LoRaUAV has been designed and evaluated with the purpose of finding a solution to the aforementioned issues. LoRaUAV is based on a WiFi ad hoc network of Unmanned Aerial Vehicle (UAV) gateways acting as relays for the traffic generated between mobile LoRaWAN nodes and a remote Base Station (BS). The core of the system is a completely distributed mobility algorithm based on virtual spring forces that periodically updates the UAV topology to adapt to the movement of ground nodes. LoRaUAV has been successfully implemented in ns-3 and its performance has been comparatively evaluated in wild area firefighting scenarios, using Packet Reception Ratio (PRR) and end-to-end delay as the main performance metrics. It is observed that the Connection Recovery and Maintenance (CRM) and Movement Prediction (MP) mechanisms implemented in LoRaUAV effectively help improve the PRR, with the only disadvantage of a higher delay affecting a small percentage of packets caused by buffer delays and disconnections.
28
Jeremic, Marina, Aleksandar Rakicevic et Ivana Dragovic. « Interpolative Boolean algebra based multicriteria routing algorithm ». Yugoslav Journal of Operations Research 25, no 3 (2015) : 397–412. http://dx.doi.org/10.2298/yjor140430029j.
Texte intégralRésumé :
In order to improve the quality-of-service of distributed applications, we propose a multi-criteria algorithm based on interpolative Boolean algebra for routing in an overlay network. We use a mesh topology because it can be easily implemented, and it makes addressing of the cores quite simple during routing. In this paper, we consider four criteria: buffer usage, the distance between peers, bandwidth, and remaining battery power. The proposed routing algorithm determines the path which satisfies quality-of service requirements using interpolative Boolean algebra; the decision at each node is made based on the ranking of available options considering multiple constraints. The simulation shows that the proposed approach provides better results than the standard shortest path routing algorithm.
29
Zheng, Kai, Yun Zhang, Lei Liu et Chen Zhao. « Distributed Data Acquisition System for Condition Monitoring of Low-speed Machines Using Wireless Sensor Networks ». International Journal of Online Engineering (iJOE) 12, no 1 (18 janvier 2016) : 17. http://dx.doi.org/10.3991/ijoe.v12i1.5021.
Texte intégralRésumé :
Low-speed machines play an important role in industrial production, and the condition monitoring of these machines is of great importance. Monitoring with wireless sensor network (WSN) has many advantages. To monitor the condition of low-speed machines, we need to acquire low-frequency, weak and hardly-varying physical signals. As such, we designed a WSN system for high-precision signal acquisition. Actual measurement results showed that the acquisition precision of nodes could reach 0.01 mV. When the sensor nodes continuously acquired and sent data, the energy conversion efficiency was higher than 90% and the nodes’ power consumption came to about 110mW. The WSN system was designed based on the low-power consumption 802.15.4 MAC/Zigbee, and the WSN was built through MESH topology. Data transmission was stable and the PER was lower than 1%. The measurement results under laboratory and industrial field conditions showed that the WSN system designed met the requirements for on-site data acquisition and monitoring of low-speed machines.
30
Rosales-Muñoz, Andrés Alfonso, Jhon Montano, Luis Fernando Grisales-Noreña, Oscar Danilo Montoya et Fabio Andrade. « Optimal Power Dispatch of DGs in Radial and Mesh AC Grids : A Hybrid Solution Methodology between the Salps Swarm Algorithm and Successive Approximation Power Flow Method ». Sustainability 14, no 20 (18 octobre 2022) : 13408. http://dx.doi.org/10.3390/su142013408.
Texte intégralRésumé :
In this paper, we address the problem of the optimal power dispatch of Distributed Generators (DGs) in Alternating Current (AC) networks, better known as the Optimal Power Flow (OPF) problem. We used, as the objective function, the minimization of power losses (Ploss) associated with energy transport, which are subject to the set of constraints that compose AC networks in an environment of distributed generation. To validate the effectiveness of the proposed methodology in solving the OPF problem in any network topology, we employed one 10-node mesh test system and three radial text systems: 10, 33, and 69 nodes. In each test system, DGs were allowed to inject 20%, 40%, and 60% of the power supplied by the slack generator in the base case. To solve the OPF problem, we used a master–slave methodology that integrates the optimization method Salps Swarm Algorithm (SSA) and the load flow technique based on the Successive Approximation (SA) method. Moreover, for comparison purposes, we employed some of the algorithms reported in the specialized literature to solve the OPF problem (the continuous genetic algorithm, the particle swarm optimization algorithm, the black hole algorithm, the antlion optimization algorithm, and the Multi-Verse Optimizer algorithm), which were selected because of their excellent results in solving such problems. The results obtained by the proposed solution methodology demonstrate its superiority and convergence capacity in terms of minimization of Ploss in both radial and mesh systems. It provided the best reduction in minimum Ploss in short processing times and showed excellent repeatability in each test system and scenario under analysis.
31
Barolli, Admir, Shinji Sakamoto, Kevin Bylykbashi et Leonard Barolli. « A Hybrid Intelligent Simulation System for Building IoT Networks : Performance Comparison of Different Router Replacement Methods for WMNs Considering Stadium Distribution of IoT Devices ». Sensors 22, no 20 (12 octobre 2022) : 7727. http://dx.doi.org/10.3390/s22207727.
Texte intégralRésumé :
As the Internet of Things (IoT) devices and applications proliferate, it becomes increasingly important to design robust networks that can continue to meet user demands at a high level. Wireless local area networks (WLANs) can be a good choice as IoT infrastructure when high throughput is required. On the other hand, wireless mesh networks (WMNs), which are WLANs with mesh topology following the IEEE802.11s standard, have many advantages compared to conventional WLANs. Nevertheless, there are some problems that need solutions. One of them is the node placement problem. In this work, we propose and implement a hybrid intelligent system that solves this problem by determining the position of mesh nodes by maximizing the mesh connectivity and the coverage of IoT devices. The system is based on particle swarm optimization (PSO), simulated annealing (SA), and distributed genetic algorithm (DGA). We compare the performance of three router replacement methods: constriction method (CM), random inertia weight method (RIWM), and rational decrement of Vmax method (RDVM). The simulation results show that RIWM achieves better performance compared to CM and RDVM because it achieves the highest connectivity while covering more clients than the other two methods.
32
Lee, Seung Chan, et Tae Hee Han. « Q-Function-Based Traffic- and Thermal-Aware Adaptive Routing for 3D Network-on-Chip ». Electronics 9, no 3 (27 février 2020) : 392. http://dx.doi.org/10.3390/electronics9030392.
Texte intégralRésumé :
Die-stacking technology is expanding the space diversity of on-chip communications by leveraging through-silicon-via (TSV) integration and wafer bonding. The 3D network-on-chip (NoC), a combination of die-stacking technology and systematic on-chip communication infrastructure, suffers from increased thermal density and unbalanced heat dissipation across multi-stacked layers, significantly affecting chip performance and reliability. Recent studies have focused on runtime thermal management (RTM) techniques for improving the heat distribution balance, but performance degradations, owing to RTM mechanisms and unbalanced inter-layer traffic distributions, remain unresolved. In this study, we present a Q-function-based traffic- and thermal-aware adaptive routing algorithm, utilizing a reinforcement machine learning technique that gradually incorporates updated information into an RTM-based 3D NoC routing path. The proposed algorithm initially collects deadlock-free directions, based on the RTM and topology information. Subsequently, Q-learning-based decision making (through the learning of regional traffic information) is deployed for performance improvement with more balanced inter-layer traffic. The simulation results show that the proposed routing algorithm can improve throughput by 14.0%–28.2%, with a 24.9% more balanced inter-layer traffic load and a 30.6% more distributed inter-layer thermal dissipation on average, compared with those obtained in previous studies of a 3D NoC with an 8 × 8 × 4 mesh topology.
33
Neeb, C., M. J. Thul et N. Wehn. « Application driven evaluation of network on chip architectures forcation parallel signal processing ». Advances in Radio Science 2 (27 mai 2005) : 181–86. http://dx.doi.org/10.5194/ars-2-181-2004.
Texte intégralRésumé :
Abstract. Today’s signal processing applications exhibit steadily increasing throughput requirements which can be achieved by parallel architectures. However, efficient communication is mandatory to fully exploit their parallelism. Turbo-Codes as an instance of highly efficient forward-error correction codes are a very good application to demonstrate the communication complexity in parallel architectures. We present a network-on-chip approach to derive an optimal communication architecture for a parallel Turbo-Decoder system. The performance of such a system significantly depends on the efficiency of the underlying interleaver network to distribute data among the parallel units. We focus on the strictly orthogonal n-dimensional mesh, torus and k-ary-n cube networks comparing deterministic dimension-order and partially adaptive negative- first and planar-adaptive routing algorithms. For each network topology and routing algorithm, input- and output-queued packet switching schemes are compared on the architectural level. The evaluation of candidate network architectures is based on performance measures and implementation cost to allow a fair trade-off.
34
He, Yufa, Yu Chen, Jianfei Wei, Zhong Li, Xingwang Guo, Renjun Xie, Ruiling Li, Jian Liu, Zhenxing Tan et Kexin Zhang. « Design and Application of Wireless Wall Thickness Monitoring System for Ground Testing Process ». Processes 13, no 1 (31 décembre 2024) : 63. https://doi.org/10.3390/pr13010063.
Texte intégralRésumé :
To address the issues of pipeline corrosion and erosion during ground testing, this paper presents an innovative electromagnetic ultrasonic thickness measurement system that utilizes ZigBee wireless communication technology. The system employs a ZigBee mesh topology for creating a wireless distributed network, where node devices carry out multi-point monitoring in a configuration of “one master, multiple”. Each node is powered by an STM32 embedded control chip and fitted with ultrasonic sensors. Slave nodes transmit the real-time data they collect to a server via the master node, thus enabling remote monitoring of the system through a web interface. The system incorporates an enhanced data filtering algorithm, allowing for precise monitoring of the pipeline wall thickness and providing immediate data feedback. An experimental validation of the system’s stability and long-distance transmission capabilities was performed on a simulated platform, confirming its viability and applicability for real-world engineering applications.
35
Kazmi, Syed Ali Abbas, Usama Ameer Khan, Waleed Ahmad, Muhammad Hassan, Fahim Ahmed Ibupoto, Syed Basit Ali Bukhari, Sajid Ali, M. Mahad Malik et Dong Ryeol Shin. « Multiple (TEES)-Criteria-Based Sustainable Planning Approach for Mesh-Configured Distribution Mechanisms across Multiple Load Growth Horizons ». Energies 14, no 11 (27 mai 2021) : 3128. http://dx.doi.org/10.3390/en14113128.
Texte intégralRésumé :
Modern distribution mechanisms within the smart grid paradigm are considered both reliable in nature and interconnected in topology. In this paper, a multiple-criteria-based sustainable planning (MCSP) approach is presented that serves as a future planning tool for interconnected distribution mechanisms and aims to find a feasible solution among conflicting criteria of various genres. The proposed methodology is based on three stages. In the stage 1, a weighted voltage stability index (VSI_W) and loss minimization condition (LMC) based approach aims at optimal asset optimization (sitting and sizing). In this stage, an evaluation of alternatives (solutions) is carried out across four dimensions (technical, economic, environmental, and social) of performance metrics. The assets considered in the evaluations include distributed generation (DG), renewable DGs, i.e., photovoltaic (PV), wind, and distributed static compensator (D-STATCOM) units. In the stage 2, various multicriteria decision-making (MCDM) methodologies are applied to ascertain the best trade-off among the available solutions in terms of techno-cost (economic) (TCPE), environment-o-social (ESPE), and techno-economic-environmental-socio (TEES) performance evaluations (OPE). In the stage 3, the alternatives are evaluated across multiple load growth horizons of 5 years each. The proposed MCSP approach is evaluated across a mesh-configured 33-bus active distribution network (ADN) and an actual NUST (which is a university in Islamabad, Pakistan) microgrid (MG), with various variants of load growth. The numerical findings of the proposed MCSP approach are compared with reported works the literature supports its validity and can serve as an important planning tool for interconnected distribution mechanisms for researchers and planning engineers.
36
Yu, Xueyong. « 5G Wireless Networking Connection and Playback Technology Assist the Low-Latency Propagation of New Media ». Journal of Sensors 2021 (17 novembre 2021) : 1–11. http://dx.doi.org/10.1155/2021/3082280.
Texte intégralRésumé :
This article conducts an indepth study on the delay caused by time division multiple access (TDMA) technology and theoretically analyzes some methods that can reduce the TDMA delay. Traditional dynamic time slot allocation algorithms usually only consider the completion of conflict-free time slot allocation in distributed scenarios, but they do not clearly specify the order of time slot allocation. The order of time slots allocated to each node is ultimately consistent with the new data flow. The order of media dissemination is not the same. Aiming at the scheduling delay problem caused by the inconsistency of the new media low-latency propagation time slot allocation sequence and the data stream sequence, a protocol using the master time slot adaptive time slot exchange technology is proposed. The protocol designs the corresponding super frame structure and realizes the neighbor node discovery strategy and the time slot allocation based on the priority list. At the same time, the time slot switching technology is used to adjust the time slot sequence so that it tends to the data flow sequence. The exchange criterion based on the low-latency propagation data stream value of the new media is designed to solve the problem of optimizing the time slot of multiple data streams in the network. Through the simulation results and analysis, it can be seen that the architecture design proposed in this paper can fulfill the expected requirements of the wireless Mesh network and can achieve good low-latency performance for the highly dynamic network topology. It can also achieve good performance in terms of network throughput and data flow delivery rate, and it has adaptability to high dynamic topologies. By comparing with the traditional algorithm design, the design proposed in this paper has a large improvement in low latency and high submission rate. Therefore, it can be considered that the low-latency architecture design proposed in this article has better performance for new media’s low-latency propagation and highly dynamic network topology.
37
Rovino Alghafari, Sabila Sofyana Zahra, Vinta Retriani, Alifia Nurfadillah et Didik Aribowo. « Penerapan TCP IP Fiber Optic Menggunakan Topologi Mesh pada Aplikasi Cisco Packet Traser ». Jurnal Teknik Mesin, Industri, Elektro dan Informatika 3, no 2 (27 mai 2024) : 28–34. http://dx.doi.org/10.55606/jtmei.v3i2.3750.
Texte intégralRésumé :
The application of TCP/IP over fiber optic networks with mesh topology has become an interesting topic in the development of modern network infrastructure. This research aims to explore and apply the basic concepts of TCP/IP via fiber optic technology using a mesh topology in the Cisco Packet Tracer simulation. This research method involves building a virtual computer network consisting of several nodes connected via fiber optic cables. The aim of this research is to understand the reliability, efficiency and performance of networks implemented through fiber optic technology and mesh topology. In the initial stage, a literature study was carried out to understand the basic principles of TCP/IP, fiber optic technology, and mesh topology. Next, using Cisco Packet Tracer, a virtual computer network is built using appropriate hardware and software to simulate a fiber optic-based network with a mesh topology. Experiments were conducted to test network performance in terms of data transfer speed, latency, and connection reliability. Experimental results show that the application of TCP/IP over a fiber optic network with a mesh topology is able to provide reliable and efficient performance. The main advantages of using fiber optic technology are high data transfer speeds and better connection reliability compared to other transmission media. In addition, mesh topology provides high flexibility and redundancy in the network, thereby increasing failure tolerance and increasing network scalability.
38
Parinyataramas, Jamreonta, Sakuntam Sanorpim, Chanchana Thanachayanont, Hiroyaki Yaguchi et Misao Orihara. « TEM Analysis of Structural Phase Transition in MBE Grown Cubic InN on MgO (001) by MBE : Effect of Hexagonal Phase Inclusion in an C-Gan Nucleation Layer ». Applied Mechanics and Materials 229-231 (novembre 2012) : 219–22. http://dx.doi.org/10.4028/www.scientific.net/amm.229-231.219.
Texte intégralRésumé :
In this paper, we introduced dbcube topology for Network-on Chips(NoC). We predicted the dbcube topology has high power and low latency comparing to other topologies, and in particular mesh topology. By using xmulator simulator,we compared power and latency of this topologyto mesh topology. Finally, it is demonstrated that the network has higher power and lower latency than the mesh topology.
39
Mosafaie, Razieh, et Reza Sabbaghi-Nadooshan. « Using Dbcupe Topology for NoCs ». Applied Mechanics and Materials 229-231 (novembre 2012) : 2741–44. http://dx.doi.org/10.4028/www.scientific.net/amm.229-231.2741.
Texte intégralRésumé :
In this paper, we introduced dbcube topology for Network-on Chips(NoC). We predicted the dbcube topology has high power and low latency comparing to other topologies, and in particular mesh topology. By using xmulator simulator,we compared power and latency of this topologyto mesh topology. Finally, it is demonstrated that the network has higher power and lower latency than the mesh topology.
40
Punhani, Akash, Pardeep Kumar et Nitin Nitin. « A Modified Diagonal Mesh Shuffle Exchange Interconnection Network ». International Journal of Electrical and Computer Engineering (IJECE) 7, no 2 (1 avril 2017) : 1042. http://dx.doi.org/10.11591/ijece.v7i2.pp1042-1050.
Texte intégralRésumé :
Interconnection network is an important part of the digital system. The interconnection mainly describes the topology of the network along with the routing algorithm and flow control mechanism. The topology of the network plays an important role on the performance of the system. Mesh interconnection network was the simplest topology, but has the limited bisection bandwidth on the other hand torus and diagonal mesh was having long links. The Modified diagonal mesh network tried to replace the torodial links but was having more average path length so in proposed topology we have tried to improve the average distance using shuffle exchange network over the boundary node. In this paper, we propose the architecture of Modified Diagonal Mesh Shuffle Exchange Interconnection Network. This Modified Diagonal Mesh Shuffle Exchange Interconnection network have been compared with four popular topologies that are simple 2D Mesh, 2D Torus, Diagonal Mesh and Modified Diagonal Mesh Interconnection Network on the four traffic patterns such as Bit Complement traffic, Neighbor traffic, Tornado traffic and Uniform traffic are used for comparisonand performance analysis. We have performed the analysis with a 5% and 10% of hotspot on the Uniform Traffic. The simulation results shows that the proposed topology is performed better on bit complement traffic and can also handle the other traffic up to certain level.
41
Sankpal, Ms Mrunali Nagesh, Ms Pratiksha Vijay Chinchwade, Ms Rutuja Rajkumar Kognole et Ms K. N. Rode. « Computer Network Topologies ». International Journal for Research in Applied Science and Engineering Technology 10, no 4 (30 avril 2022) : 1508–11. http://dx.doi.org/10.22214/ijraset.2022.41553.
Texte intégralRésumé :
Abstract: Network topologies is various components of network link nodes, link, peripherals are arranged. The way of connecting the computers is called as the topology.so depending on the manner of connecting the computers we can have different network topologies. Network topology is links and nodes of a network are arranged to related are arranged to each other. They describe the physical and logical arrangement of network nodes. The way in which different system and node are connect and communicate with each other is determined by topology of the network. Keywords: Star Topology, Bus Topology, Ring Topology, Hybrid Topology, Mesh Topology, Tree Topology
42
Shang, Zhi Jun, Shi Jie Cui et Qiu Shi Wang. « Network Calculus Based Dimensioning for Industrial Wireless Mesh Networks ». Applied Mechanics and Materials 303-306 (février 2013) : 1989–95. http://dx.doi.org/10.4028/www.scientific.net/amm.303-306.1989.
Texte intégralRésumé :
Wireless Mesh network is widely adopted in both wideband mobile communication network and short distance RF industrial network. As for the latter field, network robustness and real-time are two important issues. Network dimensioning is therefore required for this kind of networks. We models wireless mesh network as four tuples and present a topology transform methodology to change the mesh topology to a cluster tree. Research results from network calculus theory are then applied to obtain key merits such as buffer requirement, bandwidth requirement and end to end delay bound.
43
He, Ming, Lin Chen, Hong Wang et Zheng Hu Gong. « Distributed Network Topology Management in Network Coding ». Advanced Materials Research 546-547 (juillet 2012) : 1270–75. http://dx.doi.org/10.4028/www.scientific.net/amr.546-547.1270.
Texte intégralRésumé :
In this research, we focus on distributed network management in network coding. Web Services Distributed Management (WSDM) is one of the industry standards for distributed management. With the advantage of WSDM, we improve the efficiency of topology management in network coding and propose Distributed Topology Management System (DTMS). Under the campus network as our experimental environment, we analyze the performance of our system in this paper. Further, we compare the performance of our system with AdventNet Web NMS which is one of popular network management tools. Our work is the first solution to distributed network management in network coding. It is also the first to introduce WSDM specification to network coding. WSDM brings us a loosely coupling topology management system which is user-friendly and performs well.
44
Tan, Xiao Long, Jia Zhou et Wen Bin Wang. « Analysis of Wireless Mesh Network Routing ». Advanced Materials Research 989-994 (juillet 2014) : 4629–32. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.4629.
Texte intégralRésumé :
Since the wireless mesh network topology dynamics and the radio channels instable, the design of wireless mesh network routing protocol become one of the key factors to determine the performance. This paper mainly studied the existing several kinds of typical three-layer mesh network routing protocol (DSDV and AODV), aimed at the defects of three-layer routing limited to the network topology changes, the paper proposed a network model based on two-layer routing. Forwarding the packet, establishing and maintaining the communication links are accomplished on the Mac layer. Simulation tests showed that two-layer routing has a big improvement on the efficiency of packet forwarding, and it effectively reduced the routing overhead and end-to-end delay simultaneously.
45
Sari, Linna Oktaviana, et Aldi Kurniawan Batubara. « Impact of Different Topology on the Performance of IPSec VPN Multimedia Using CLSA ». International Journal of Electrical, Energy and Power System Engineering 1, no 2 (5 novembre 2018) : 20–25. http://dx.doi.org/10.31258/ijeepse.1.2.20-25.
Texte intégralRésumé :
Due to multimedia application, network communication are expected to support multimedia traffic such as voice, video streaming and real time chat with a variety of Quality of Service (QoS) requirements. To support multimedia communications, it is desirable to use a network that meets QoS Parameter requirements. To deal with these challenges. In this study, VPN was designed with IPSec Tunneling. In designing VPN, the CLSA method is used. The network is composed of different topologies and uses OSPF as the routing protocol. Then multimedia traffic is passed on VPN networks to see the impact of different topologies on performance.The result show that theQuality of Service (QOS)in VPNobtained areaccording to ITU-T G.107 10 06/2015. The comparison of the average delay between the mesh and the star topology shows that the average delay in the mesh topology is 23% less than the starfor multimedia traffic. The comparison of the through put between the mesh topology and the star shows that the average throughputin the mesh topology is 68.8% betterthan the star for multimedia traffic. The comparison of the jitterbetween the mesh topology and the star shows that the average jitter in the star topology is 6%shorterthan the mesh for multimedia traffic.
46
Labib, Mostafa, Atef Ghalwash, Sarah Abdulkader et Mohamed Elgazzar. « Networking solutions for connecting bluetooth low energy devices - a comparison ». MATEC Web of Conferences 292 (2019) : 02003. http://dx.doi.org/10.1051/matecconf/201929202003.
Texte intégralRésumé :
The Bluetooth Low Energy (BLE) is an attractive solution for implementing low-cost, low power consumption, short-range wireless transmission technology and high flexibility wireless products, which working on standard coin-cell batteries for years. The original design of BLE is restricted to star topology networking, which limits network coverage and scalability. In contrast, other competing technologies like Wi-Fi and ZigBee overcome those constraints by supporting different topologies such as the tree and mesh network topologies. This paper presents a part of the researchers’ efforts in designing solutions to enable BLE mesh networks and implements a tree network topology which is not supported in the standard BLE specifications. In addition, it discusses the advantages and drawbacks of the existing BLE network solutions. During analyzing the existing solutions, we highlight currently open issues such as flooding-based and routing-based solutions to allow end-to-end data transmission in a BLE mesh network and connecting BLE devices to the internet to support the Internet of Things (IoT). The approach proposed in this paper combines the default BLE star topology with the flooding based mesh topology to create a new hybrid network topology. The proposed approach can extend the network coverage without using any routing protocol.
47
Mudali, Pragasen, et Matthew Olusegun Adigun. « Context-Based Topology Control for Wireless Mesh Networks ». Mobile Information Systems 2016 (2016) : 1–16. http://dx.doi.org/10.1155/2016/9696348.
Texte intégralRésumé :
Topology Control has been shown to provide several benefits to wireless ad hoc and mesh networks. However these benefits have largely been demonstrated using simulation-based evaluations. In this paper, we demonstrate the negative impact that the PlainTC Topology Control prototype has on topology stability. This instability is found to be caused by the large number of transceiver power adjustments undertaken by the prototype. A context-based solution is offered to reduce the number of transceiver power adjustments undertaken without sacrificing the cumulative transceiver power savings and spatial reuse advantages gained from employing Topology Control in an infrastructure wireless mesh network. We propose the context-based PlainTC+ prototype and show that incorporating context information in the transceiver power adjustment process significantly reduces topology instability. In addition, improvements to network performance arising from the improved topology stability are also observed. Future plans to add real-time context-awareness to PlainTC+ will have the scheme being prototyped in a software-defined wireless mesh network test-bed being planned.
48
LIU, You-yao, et Meng GAO. « Mesh-connected rings topology for network-on-chip ». Journal of China Universities of Posts and Telecommunications 20, no 5 (octobre 2013) : 30–36. http://dx.doi.org/10.1016/s1005-8885(13)60086-2.
Texte intégral
49
Yu, Chih Min, et Jyun Hong Lin. « A Mesh Topology Approach for Bluetooth Scatternet Formation ». Applied Mechanics and Materials 182-183 (juin 2012) : 1105–9. http://dx.doi.org/10.4028/www.scientific.net/amm.182-183.1105.
Texte intégralRésumé :
This paper presents the Enhanced Bluetree, a mesh topology scheme for Bluetooth scatternet formation. The scatternet formation algorithm includes two phases. In the first phase, a designated node called the root starts to create a tree-shaped topology and in the second phase the tree-shaped topology is converted into a mesh-shaped topology. In addition, a return connection mechanism is introduced in this phase to generate more connection paths among the nodes. The mechanism contains two scatternet topology models including the slave/slave mesh (SSM) model and the master/slave mesh (MSM) model. The SSM Model builds a mesh-shaped topology by interconnecting more leaf nodes. On the other hand, the MSM Model connects additional intermediate nodes to establish the backbone connection in a mesh-shaped topology. Simulation results show that both the SSM and the MSM of an Enhanced Bluetree more effectively improve the network performance than Bluetree by significantly reducing the average path length.
50
Kumari, Usha, et Udai Shankar. « COORDINATED DISTRIBUTED SCHEDULING IN WIRELESS MESH NETWORK ». INTERNATIONAL JOURNAL OF COMPUTERS & ; TECHNOLOGY 3, no 3 (22 novembre 2012) : 368–74. http://dx.doi.org/10.24297/ijct.v3i3a.2940.
Texte intégralRésumé :
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