Minimum-Cost Paths for a System Composed of Ordinary Routes and a Special Network of Cheap Routes

1972 ◽  
Vol 6 (2) ◽  
pp. 131-136 ◽  
Author(s):  
Dennis Blumenfeld ◽  
Matthias Landau
Keyword(s):  
Minimum Cost ◽  
Minimum Cost Paths ◽  
Cost Paths

scholarly journals Determining time-dependent minimum cost paths under several objectives

2019 ◽  
Vol 105 ◽  
pp. 102-117 ◽  
Author(s):  
Hamza Heni ◽  
Leandro C. Coelho ◽  
Jacques Renaud
Keyword(s):  
Minimum Cost ◽  
Time Dependent ◽  
Minimum Cost Paths ◽  
Cost Paths

scholarly journals A robust and efficient curve skeletonization algorithm for tree-like objects using minimum cost paths

2016 ◽  
Vol 76 ◽  
pp. 32-40 ◽  
Author(s):  
Dakai Jin ◽  
Krishna S. Iyer ◽  
Cheng Chen ◽  
Eric A. Hoffman ◽  
Punam K. Saha
Keyword(s):  
Minimum Cost ◽  
Minimum Cost Paths ◽  
Cost Paths

A Formal Basis for the Heuristic Determination of Minimum Cost Paths

1968 ◽  
Vol 4 (2) ◽  
pp. 100-107 ◽  
Author(s):  
Peter Hart ◽  
Nils Nilsson ◽  
Bertram Raphael
Keyword(s):  
Minimum Cost ◽  
Formal Basis ◽  
Minimum Cost Paths ◽  
Cost Paths

scholarly journals Secure and effective random paths selection (SERPS) algorithm for security in MANETs

2018 ◽  
Vol 7 (2.8) ◽  
pp. 134
Author(s):  
P Suma ◽  
Mohammed Ali Hussain
Keyword(s):  
Ad Hoc ◽  
Minimum Cost ◽  
Data Packets ◽  
Routing Strategy ◽  
Dynamic Source ◽  
Fixed Topology ◽  
Minimum Cost Paths ◽  
Hoc Networks ◽  
Cost Paths ◽  
The Cost

Mobile Ad-hoc Networks (MANETs) are wireless and nodes of it are mobile in nature. These networks can be adopted where equipment like wires cannot be established and the nodes are moving. Due to the mobile nature of nodes, a fixed topology cannot be achieved. This leads to a dynamic or ever changing network structure. The paths between the communicating nodes also change frequently. Overall monitoring system is absent in it i.e. supervising node is not present for establishing routes in the network. Each node itself acts as a router. Due to the lack of fundamental management system and ever moving nodes, security becomes a challenge and detection of attackers also becomes tough. Dynamic source Routing (DSR) is used in route discovery. In this routing strategy, paths are established only on demand of sender and receiver nodes. And to reduce the cost many algorithms were proposed, but the concept of security is deficit in them. In this paper, Secure and Effective Random Paths Selection (SERPS) algorithm is proposed with the concepts of minimum cost and node disjointness to achieve security. All the node disjoint paths between sender and receiver are found. Among them a minimum of 4 minimum cost paths are selected. Then data packets are sent through them by randomly selecting the paths. Care is to be taken such that no consecutive packets go through the same path. By this, attacker at any node gets only the random packets but not the complete data. In this way security can be achieved. The simulation for the proposed SERPS algorithm is done to show the routing process.

Dynamic update of minimum cost paths in computer networks

2011 ◽  
Vol 2 (1) ◽  
pp. 58
Author(s):  
Gianlorenzo D' ◽  
N.A. Angelo ◽  
Daniele Frigioni ◽  
Vinicio Maurizio
Keyword(s):  
Computer Networks ◽  
Minimum Cost ◽  
Dynamic Update ◽  
Minimum Cost Paths ◽  
Cost Paths
Sign in / Sign up

Export Citation Format

Share Document