Design and modeling of graph theory approach based routing algorithm

By concentrating on a product’s subsequent states as it moves through several phases, the product state idea gives a fresh viewpoint on manufacturing programmes. A theoretical example uses graph theory, a method with associated requirements for data organization to make use of the benefits of this n...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal on interactive design and manufacturing Jg. 18; H. 8; S. 6013 - 6021
Hauptverfasser: Sivasankar, S., Devasenapathy, Deepa, Madhumathy, P, Kaur, Gursimran, Sharma, Yogita, Rana, Prince
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Paris Springer Paris 01.10.2024
Springer Nature B.V
Schlagworte:
Algorithms
CAE) and Design
Communication
Computer-Aided Engineering (CAD
Connectivity
Cost analysis
Efficiency
Electronics and Microelectronics
Engineering
Engineering Design
Graph representations
Graph theory
Graphical representations
Graphs
Industrial Design
Instrumentation
Manufacturing
Mathematicians
Mechanical Engineering
Nodes
Original Paper
Sensors
Wireless sensor networks
Centrality measure
Wireless sensor network
Manufacturing
Degree of a vertex
Sustainability
Regular graph
ISSN:1955-2513, 1955-2505
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:By concentrating on a product’s subsequent states as it moves through several phases, the product state idea gives a fresh viewpoint on manufacturing programmes. A theoretical example uses graph theory, a method with associated requirements for data organization to make use of the benefits of this notion offers. In a wireless sensor network, path selection for data routing with higher level of connectivity is of greater importance. A network’s structural representation is uniform in regular graphs. Regular graphs are a type of graph that is highly structured and provides complete network protection. Adjacent matrices are the most convenient way to represent a network’s connectivity. Here an algorithm for regularizing the nodes in a network using adjacency matrices is proposed. The proposed model is simulated using MATLAB to find out the centrality measure in terms of building connectivity between the sensor nodes with in the network.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1955-2513
1955-2505
DOI:10.1007/s12008-023-01468-5