Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem

Ramadhan, Zuhri; Siahaan, Andysah Putera Utama; Mesran, M.

doi:10.4108/eai.23-4-2018.2277598

Cited by 21 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Notice that our study seems to be similar to the shortest path problem which can be solved by several well-known algorithms (Dijkstra's [52], Bellman-Ford [53], A* search [52], Floyd-Warshall [54], Johnson [55], or Viterbi [56]) but is very different and more complex because (i) starting and ending services are not unique, (ii) they are searching for a path while we are searching for a sub-graph and (iii) the number of bindings to a node is upper bounded.…”

Section: Combination Analysismentioning

confidence: 90%

Self-assemble-featured Internet of Things

Lemoine

Aubonnet

Simoni

2020

Future Generation Computer Systems

View full text Add to dashboard Cite

The Internet of Things supports various industrial applications. The cooperation and coordination of smart things are a promising strategy for satisfying requirements that are beyond the capacity of a single smart thing. One of the major challenges for today's software engineering is the management of large and complex computing systems characterized by a high degree of physical distribution. Examples of such systems arise in many application domains. The number of connected devices grows from billions to hundreds of billions, so a maximum of automatisms must be integrated in IoT architectures in order to control and manage them. Software architects migrate to service oriented architecture and applications are now being constructed as service compositions. Since each IoT device includes one or more microservices, the increasing number of devices around the user makes them difficult to assemble in order to achieve a common goal. In this paper, we propose a self-assembling solution based on self-controlled service components taking into account non-functional requirements concerning the offered quality of services and the structuration of the resulting assembly. Its aim is to build and maintain an assembly of services (taking into account arrival of new peers or failure of existing ones) that, besides functional requirements, also fulfils global quality-of-service and structural requirements.

show abstract

Section: Combination Analysismentioning

confidence: 90%

Self-assemble-featured Internet of Things

Lemoine

Aubonnet

Simoni

2020

Future Generation Computer Systems

View full text Add to dashboard Cite

show abstract

“…done with the Floyd-Warshall algorithm [15], which runs in O(|V | 3 ). Although the temporal complexity of this step is high, it is still a polynomial running time (cubic) depending on the size of the input.…”

Section: ) K-means Clusteringmentioning

confidence: 99%

GeoSP: A parallel method for a cortical surface parcellation based on geodesic distance

López-López

Vázquez

Poupon

et al. 2020

2020 42nd Annual International Conference of the IEEE Engineering in Medicine &Amp; Biology Society (EMBC)

View full text Add to dashboard Cite

We present GeoSP, a parallel method that creates a parcellation of the cortical mesh based on a geodesic distance, in order to consider gyri and sulci topology. The method represents the mesh with a graph and performs a K-means clustering in parallel. It has two modes of use, by default, it performs the geodesic cortical parcellation based on the boundaries of the anatomical parcels provided by the Desikan-Killiany atlas. The other mode performs the complete parcellation of the cortex. Results for both modes and with different values for the total number of sub-parcels show homogeneous sub-parcels. Furthermore, the execution time is 82 s for the whole cortex mode and 18 s for the Desikan-Killiany atlas subdivision, for a parcellation into 350 sub-parcels. The proposed method will be available to the community to perform the evaluation of data-driven cortical parcellations. As an example, we compared GeoSP parcellation with Desikan-Killiany and Destrieux atlases in 50 subjects, obtaining more homogeneous parcels for GeoSP and minor differences in structural connectivity reproducibility across subjects.

show abstract

“…Floyd-Warshall algorithm is used to find the shortest path between the nodes and the cluster head. Floyd-Warshall shortest path algorithm is selected here because of its efficiency in finding cost effective paths [18]. The Floyd-Warshall algorithm is used as ℎ ℎ ( 1, 2, ) where is the maximum permitted number of edges for connect 1 and 2 .…”

Section: B Energy Aware State Change Routing Protocol (Eascrp)mentioning

confidence: 99%

Strengthening IoT-WSN Architecture for Environmental Monitoring

Akila¹,

Evanjaline²

2019

IJITEE

View full text Add to dashboard Cite

Saving the environment is the alarming red-hot topic of this trendy world. A proper arrangement is required to monitor different environmental pollutions. Many researchers and volunteers are developing and deploying Wireless Sensor Networks (WSN) for this purpose. Internet-of-Things (IoT) is one of the widely used cost-effective modern technologies to design wireless sensor nodes. Three fresh functional modules are introduced in this work to constitute the proposed work named as 'Strengthening IoT-WSN Architecture for Environmental Monitoring' (SIAEM) which is indented to overcome some impuissance of applying generalized wireless sensor network architecture in the field of environmental pollution monitoring. The functional modules introduced in this work are Customized Clustering of IoT-WSN Nodes (CCIN) and Energy Aware State Change Routing Protocol (EASCRP). The objective of this proposed IoT-WSN architecture is to reduce the Latency, Jitter, End-to-End delay and Power Consumption whereas, improving the performance parameters such as Throughput and Packet Delivery Ratio. The impact of proposed method in the performance of IoT-WSN network is measured and stated using benchmark network simulator.Assign Duty relay node to node Node will broadcast Relay_Node_Declaration message B. IoT-WSN routing protocolsNetwork protocols are a set of conventions followed in a network environment for initiating connections, manage communication resource stability, adoption of new nodes, discarding existing nodes and safely switching different connections based on the necessities. There are several types of protocols involved in a communication such as Basic network communication protocols, Network security protocols, Network routing protocols and Network management protocols. Here the routing protocols are used to establish connections by analyzing possible communication paths between source and destination nodes. The indent of a routing protocol can be communication speed, network stability, optimum power utilization or the combination of more than one objective. Commonly used protocols in IoT are Bluetooth protocol, WiFi IEEE 802.11 b/g/n, MQTT, CoAP, DDS, AMQP, LoRa and Zigbee.

show abstract

Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem

Cited by 21 publications

References 8 publications

Self-assemble-featured Internet of Things

Self-assemble-featured Internet of Things

GeoSP: A parallel method for a cortical surface parcellation based on geodesic distance

Strengthening IoT-WSN Architecture for Environmental Monitoring

Contact Info

Product

Resources

About