Results 1  10
of
1,535,827
Nudged Elastic Band Method for Finding Minimum Energy Paths of Transitions
, 385
"... Contents 1  Introduction 389 2  Chainofstates methods 391 3  The NEB method 394 4  Implementation of the NEB method 396 5  Application to an adatom hop on a surface 397 6  What happens if the springs are skipped? 399 7  An object function for NEB 400 8  Summary 402 A The twodimen ..."
Abstract

Cited by 74 (3 self)
 Add to MetaCart
and in condensed matter physics is the identification of a lowest energy path for a rearrangement of a group of atoms from one stable configuration to another. Such a path is often referred to as the `minimum energy path' (MEP). It is frequently used to define a `reaction coordinate' [1] for transitions
A MinimumEnergy PathPreserving TopologyControl Algorithm
"... The topology of a wireless multihop network can be controlled by varying the transmission power at each node. In general, it is not energy efficient to use the communication network where every node transmits with maximum power. For energy efficient operations, it is desirable to have a subnetwork ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
subnetwork that preserves a minimumenergy path between every pair of nodes (where a minimumenergy path is one that allows messages to be transmitted with a minimum use of energy). In this paper, we first identify conditions that are necessary and sufficient for a subnetwork of to preserve this property
Minimum Energy Paths for Reliable Communication in Multihop Wireless Networks
 In Proceedings of Mobihoc
, 2002
"... Current algorithms for minimumenergy routing in wireless networks typically select minimumcost multihop paths. In scenarios where the transmission power is fixed, each link has the same cost and the minimumhop path is selected. In situations where the transmission power can be varied with the di ..."
Abstract

Cited by 129 (16 self)
 Add to MetaCart
Current algorithms for minimumenergy routing in wireless networks typically select minimumcost multihop paths. In scenarios where the transmission power is fixed, each link has the same cost and the minimumhop path is selected. In situations where the transmission power can be varied
Analysis of MinimumEnergy PathPreserving Graphs for Adhoc Wireless Networks
"... Abstract — We consider adhoc wireless networks and the topology control problem defined as minimizing the amount of power needed to maintain connectivity. The issue boils down to selecting the optimum transmission power level at each node based on the position information of reachable nodes. Local ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
decisions regarding the transmission power level induce a subgraph of the maximum powered graph Gmax in which edges represent direct reachability at maximum power. We propose an analysis for constructing minimumenergy pathpreserving subgraphs of Gmax, i.e., ones minimizing the energy consumption between
Analysis of Minimumenergy Pathpreserving Graphs for Adhoc Wireless Networks �
"... We consider adhoc wireless networks and the topology control problem defined as minimizing the amount of power needed to maintain connectivity. The issue boils down to selecting the optimum transmission power level at each node based on the position information of reachable nodes. Local decisions r ..."
Abstract
 Add to MetaCart
regarding the transmission power level induce a subgraph of the maximum powered graph Gmax in which edges represent direct reachability at maximum power. In this paper we propose an analysis for constructing minimumenergy pathpreserving subgraphs of Gmax, i.e. subgraphs minimizing the energy consumption
Chapter 10 METHODS FOR FINDING SADDLE POINTS AND MINIMUM ENERGY PATHS
"... Abstract The problem of finding minimum energy paths and, in particular, saddle points on high dimensional potential energy surfaces is discussed. Several different methods are reviewed and their efficiency compared on a test problem involving conformational transitions in an island of adatoms on a ..."
Abstract
 Add to MetaCart
Abstract The problem of finding minimum energy paths and, in particular, saddle points on high dimensional potential energy surfaces is discussed. Several different methods are reviewed and their efficiency compared on a test problem involving conformational transitions in an island of adatoms on a
On constructing minimumenergy pathpreserving graphs for ad hoc wireless networks
 In Proceedings of ICC ’05, Seoul, Korea
, 2005
"... Abstract — We consider the power control problem in adhoc wireless networks. Local decisions regarding the transmission power level induce a subgraph of the maximum powered graph Gmax in which edges represent direct reachability at maximum power. We propose a new algorithm for constructing minimume ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
minimumenergy pathpreserving subgraphs of Gmax. Its superiority over previous solutions demonstrates once again that strict protocol layering in wireless networks tends to be detrimental to performance.
On Constructing MinimumEnergy PathPreserving Graphs For AdHoc Wireless Networks
 In Proceedings of ICC ’05, Seoul, Korea
, 2005
"... We consider the power control problem in adhoc wireless networks. Local decisions regarding the transmission power level induce a subgraph of the maximum powered graph Gmax in which edges represent direct reachability at maximum power. We propose a new algorithm for constructing minimumenergy path ..."
Abstract
 Add to MetaCart
We consider the power control problem in adhoc wireless networks. Local decisions regarding the transmission power level induce a subgraph of the maximum powered graph Gmax in which edges represent direct reachability at maximum power. We propose a new algorithm for constructing minimumenergy path
Minimum Energy Paths for Reliable Communication inMultihop Wireless Networks
"... ABSTRACT Current algorithms for minimumenergy routing in wireless networkstypically select minimumcost multihop paths. In scenarios where the transmission power is fixed, each link has the same cost and theminimumhop path is selected. In situations where the transmission power can be varied with ..."
Abstract
 Add to MetaCart
ABSTRACT Current algorithms for minimumenergy routing in wireless networkstypically select minimumcost multihop paths. In scenarios where the transmission power is fixed, each link has the same cost and theminimumhop path is selected. In situations where the transmission power can be varied
Results 1  10
of
1,535,827