Topic
Network topology
About: Network topology is a research topic. Over the lifetime, 52259 publications have been published within this topic receiving 1006627 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this paper, a distributed consensus algorithm for continuous-time multi-agent systems with discontinuous information transmission is proposed, where the consensus control strategy is implemented based on the state information of each agent's neighbors at some discrete times.
Abstract: The paper studies asynchronous consensus problems of continuous-time multi-agent systems with discontinuous information transmission. The proposed consensus control strategy is implemented based on the state information of each agent's neighbors at some discrete times. The asynchrony means that each agent's update times, at which the agent adjusts its dynamics, are independent of others'. Furthermore, it is assumed that the communication topology among agents is time-dependent and the information transmission is with bounded time-varying delays. If the union of the communication topology across any time interval with some given length contains a spanning tree, the consensus problem is shown to be solvable. The analysis tool developed in this paper is based on nonnegative matrix theory and graph theory. The main contribution of this paper is to provide a valid distributed consensus algorithm that overcomes the difficulties caused by unreliable communication channels, such as intermittent information transmission, switching communication topology, and time-varying communication delays, and therefore has its obvious practical applications. Simulation examples are provided to demonstrate the effectiveness of the theoretical results.
688 citations
TL;DR: A theoretical framework is developed to model the spatial and temporal correlations in WSN to enable the development of efficient communication protocols which exploit these advantageous intrinsic features of the WSN paradigm.
687 citations
Book•
01 Jan 2004
TL;DR: This paper presents UWB Channel Models, a Hierarchical Model for Modulation Schemes of Receiver Structures, and Integrated Circuit Topologies, which describe the construction of receiver structures and the role of antennas in this system.
Abstract: Introduction. UWB Channel Models. Modulation Schemes. Receiver Structures. Integrated Circuit Topologies. UWB Antennas. Medium Access Control. Positioning.
679 citations
TL;DR: The problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology is studied and several heuristic topology design algorithms are compared against that of randomly generated topologies, as well as lower bounds.
Abstract: The problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology is studied. The physical topology consists of the nodes and fiber links in the network. On an AON physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without any intermediate electronics. The set of lightpaths along with the nodes constitutes the logical topology. For a given network physical topology and traffic pattern, our objective is to design the logical topology and the routing algorithm so as to minimize the network congestion while constraining the average delay seen by a source-destination pair and the amount of processing required at the nodes (degree of the logical topology). Ignoring the delay constraints can result in fairly convoluted logical topologies with very long delays. On the other hand, in all our examples, imposing it results in a minimal increase in congestion. While the number of wavelengths required to imbed the resulting logical topology on the physical all optical topology is also a constraint in general, we find that in many cases of interest this number can be quite small. We formulate the combined logical topology design and routing problem described above as a mixed integer linear programming problem which we then solve for a number of cases of a six-node network. This programming problem is split into two subproblems: logical topology design, and routing. We then compare the performance of several heuristic topology design algorithms against that of randomly generated topologies, as well as lower bounds.
678 citations
21 Oct 2001
TL;DR: This paper is the first description of the software architecture that supports named data and in- network processing in an operational, multi-application sensor-network and shows that approaches such as in-network aggregation and nested queries can significantly affect network traffic.
Abstract: In most distributed systems, naming of nodes for low-level communication leverages topological location (such as node addresses) and is independent of any application. In this paper, we investigate an emerging class of distributed systems where low-level communication does not rely on network topological location. Rather, low-level communication is based on attributes that are external to the network topology and relevant to the application. When combined with dense deployment of nodes, this kind of named data enables in-network processing for data aggregation, collaborative signal processing, and similar problems. These approaches are essential for emerging applications such as sensor networks where resources such as bandwidth and energy are limited. This paper is the first description of the software architecture that supports named data and in-network processing in an operational, multi-application sensor-network. We show that approaches such as in-network aggregation and nested queries can significantly affect network traffic. In one experiment aggregation reduces traffic by up to 42% and nested queries reduce loss rates by 30%. Although aggregation has been previously studied in simulation, this paper demonstrates nested queries as another form of in-network processing, and it presents the first evaluation of these approaches over an operational testbed.
677 citations