Status of This Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This document describes a procedure that can be used to renumber a network from one prefix to another. It uses IPv6's intrinsic ability to assign multiple addresses to a network interface to provide continuity of ne...

The continuous random network model is widely used as a realistic description of the structure of covalent glasses and amorphous solids. We point out that in real glasses and amorphous materials, there are non-random structural elements that go beyond just simple chemical ordering. We propose that the network can self-organize at its formation or ®ctive temperature, and examine some of the poss...

In this article we discuss network growth based on Prisoner’s Dilemma Game(PDG) where palyers on nodes in a network palay with its linked players. The players estimate total profits according to the payoff matrix of the PDG. When a new node is attached to the network, the node make linkes to nodes in the network with the probabilities in proportion to the profits made by the game. Iterating thi...

We present an analysis of the classical contact process on scale-free networks. A mean-field study, both for finite and infinite network sizes, yields an absorbing-state phase transition at a finite critical value of the control parameter, characterized by a set of exponents depending on the network structure. Since finite size effects are large and the infinite network limit cannot be reached ...

Wireless ad-hoc network has limited battery power. Energy consumption control is the main issue in a ad-hoc network. Node battery power is a precious resource that should be used in order to avoid the early termination of nodes. Node power consumption is reduced by vary transition time. Power control with transition time is proposed to control power consumption in mobile ad-hoc network. Simulat...

0031-9007= We present an analysis of the classical contact process on scale-free networks. A mean-field study, both for finite and infinite network sizes, yields an absorbing-state phase transition at a finite critical value of the control parameter, characterized by a set of exponents depending on the network structure. Since finite size effects are large and the infinite network limit cannot ...

Percolation on complex networks has been used to study computer viruses, epidemics, and other casual processes. Here, we present conditions for the existence of a network specific, observation dependent, phase transition in the updated posterior of node states resulting from actively monitoring the network. Since traditional percolation thresholds are derived using observation independent Marko...

The use of augmented transition network grammars for the analysis of natural language sentences is described. Structure-building actions associated with the arcs of the grammar network allow for the reordering, restructuring, and copying of constituents necessary to produce deep-structure representations of the type normally obtained from a transformational analysis, and conditions on the arcs ...

In this note we propose a method based on artificial neural network to study the transition between states governed by stochastic processes. In particular, we aim for numerical schemes for the committor function, the central object of transition path theory, which satisfies a high-dimensional Fokker-Planck equation. By working with the variational formulation of such partial differential equati...

Topology control protocols try to decrease the average of node’s transition radius without decreasing network connectivity. In this paper, we propose a new Particle Swarm Optimization-based Topology Control protocol for wireless sensor networks called PSOTC. In this protocol, proper transition radius can be determined using Particle Swarm Optimization (PSO) algorithm. The proposed protocol dyna...