Search

A comprehensive framework for mining wireless Ad Hoc Sensor Networks (WASNs) is proposed. Findings reveal the efficiency of the proposed framework.

The optimization of the convergence rate of distributed algorithm by the topology given by the nonbipartite Ramanujan graphs is discussed. Results concluded that Ramanujan graphs could be prepared only for a limited number.

We study a map of the Internet (at the autonomous systems level), by introducing and using the method of k-shell decomposition and the methods of percolation theory and fractal geometry, to find a model for the structure of the Internet. In particular, our analysis uses information on the connectivity of the network shells to separate, in a unique (no parameters) way, the Internet into three subcomponents: (i) a nucleus that is a small ([approximately equal to] 100 nodes), very well connected globally distributed subgraph; (ii) a fractal subcomponent that is able to connect the bulk of the Internet without congesting the nucleus, with self-similar properties and critical exponents predicted from percolation theory; and (iii) dendrite-like structures, usually isolated nodes that are connected to the rest of the network through the nucleus only. We show that our method of decomposition is robust and provides insight into the underlying structure of the Internet and its functional consequences. Our approach of decomposing the network is general and also useful when studying other complex networks.

This paper investigates the performance of a distributed wireless network in which the nodes are equipped with fully adaptive smart antennas. The main goal is the evaluation of the influence that the geometrical configuration of the antenna array has on network throughput and packet delay. Analysis and simulations are performed to study the relationship between the geometry of the antenna array and the network topology. In this paper, the performance degradation due to both the small-channel angular spreads and the speed of mobile nodes is investigated. The results, which hold for the low-rank channel model only, extend to this specific case previous results obtained in ideal channel conditions. The study adopts an access scheme, previously proposed for ad-hoc networks, which is able to exploit the interferer suppression capabilities of smart antennas, together with realistic models for the antenna and the channel behaviors. Index Terms--Fading channel model, interference mitigation, multipath fading, smart antennas, space-division multiple access, wireless networks.

This paper introduces a new intelligent-based approach for detecting islanding in distributed generation (DG). This approach utilizes and combines various system parameter indices in order to secure the detection of islanding for any possible network topology, penetration level and operating condition of the DG under study. Hence, every parameter index displays characteristics for a given set of events. The proposed technique uses the data-mining technology to extract information from the large data sets of these indices after they are screened off-line via massive event analyses using network simulations. The technique is tested on a typical DG with multiple distributed resources and the results indicate that this technique can successfully detect islanding operations. In addition, this technique can also overcome the problem of setting the detection thresholds inherent in the existing techniques by optimizing their settings. Index Terms--Artificial intelligence, data mining, distributed generation, power system protection, power systems.

Multirate simulation of electric networks exhibiting a wide variety of time constants decreases the simulation runtimes by exploiting the property of circuit latency. The fundamental idea is to use different integration steps for different network subsystems, according to the requirements of accuracy of each subsystem. Programs that exploit circuit latency are usually based on relaxation methods that require iterations among the different subsystems of the original networks. These methods lack the numerical robustness of direct implicit integration methods used in circuit simulators and are not adequate for real-time simulation due to their non-uniform solution times. This paper proposes circuit latency exploitation without iterations making use of the concept of interlinked Multi-Area Thevenin Equivalents (MATE). Results are presented showing the efficiency and accuracy of the method. Index Terms--Circuit latency exploitation, multirate simulation, multi-area Thevenin equivalents (MATEs), numerical integration rules.

We extend previous results on sufficient conditions for rearrangeable [Log.sub.2](N, m, p) networks to [Log.sub.d](N, m, p) networks. We show that the original argument using path-intersecting graphs cannot be extended to d > 2, and we give a new argument. Further, we show our sufficient conditions are also necessary. Index Terms--Banyan networks, Log(N, k, p) networks, rearrangeable networks.

This paper proposes a novel framework for developing adaptive and scalable network services. In the proposed framework, a network service is implemented as a group of autonomous agents that interact in the network environment. Agents in the proposed framework are autonomous and capable of simple behaviors (e.g., replication, migration, and death). In this paper, an evolutionary adaptation mechanism is designed using genetic algorithms (GAs) for agents to evolve their behaviors and improve their fitness values (e.g., response time to a service request) to the environment. The proposed framework is evaluated through simulations, and the simulation results demonstrate the ability of autonomous agents to adapt to the network environment. The proposed framework may be suitable for disseminating network services in dynamic and large-scale networks where a large number of data and services need to be replicated, moved, and deleted in a decentralized manner. Index Terms--Adaptive and scalable network services, autonomous agents, evolutionary computation, sell-organization, swarm intelligence.

Equilibrium flow in a physical network with a large number of users (e.g., transportation, communication, and computer networks) need not be unique if the costs of the network elements are [...]

An efficient parallel implementation of neural networks on mesh-connected SIMD machines is discussed.

An innovative transport-aware Internet protocol (IP) router architecture is described and discussed.

An innovative distributed deadlock mechanism is proposed and discussed.

A pseudo-likelihood approach is proposed for solving network tomography problems.

An algorithm for the gossiping problem, defined over an n processor network, N, where multicasting is allowed,?is described and discussed. ?

An approach is described for for enabling network and Web server clients to evaluate a system's multiclass mechanisms and parameters.

Two distributed and randomized algorithms for initializing single-hop wireless ad hoc networks are described and discussed.

Multihop routing, which is used to minimize the number of wavelengths for?all-to-all broadcasting (gossiping), is examined and discussed.

Routing permutations in a class of switch-based interconnects are examined and discussed.

An approach is described that measures network reliability by identifying nodes whose failure would impair performance the most.

The genetic algorithm (GA), tabu search (TS), and the ant colony algorithm (ACA) are used to solve the reporting cells planning problem.

Design of a k-fold multicast network is described and discussed.

A fair resource allocation protocol for wireless multimedia networks is described. It relies on a combination of bandwidth reservation and bandwidth borrowing to ensure quality of service (QoS).

Queuing network models for the performance analysis of Single Program Multiple Data (SPMD) applications, running on general-purpose parallel architectures such as multiple Instruction Multiple Data (MIMD) and clusters of workstations, are examined and discussed.

A method for determining the reliability of an undirected k-terminal network, based on 2-terminal reliability functions, is described and discussed.

The use of networks in control systems to connect controllers and sensors/actuators has become common practice in many applications. This new technology has also posed a theoretical control problem of how to use the limited data rate of the network effectively. In this paper, we consider a system where its sensor and actuator are connected by a finite data rate channel. A design method to stabilize a continuous-time, linear plant using a switching controller is proposed. In particular, to prevent the actuator from fast switching, or chattering, which can not only increase the necessary data rate but also damage the system, we employ a dwell-time switching scheme. It is shown that a systematic partition of the state-space enables us to reduce the complexity of the design problem. Index Terms--Control networks, dwell-time switching, hybrid control systems, quantization, stabilizability.

The In-Transit Buffer (ITB) mechanism is discussed as a means of improving the performance of networks with source routing and wormhole switching.