1,931 research outputs found
Cooperative Channel State Information Dissemination Schemes in Wireless Ad-hoc Networks
This thesis considers a novel problem of obtaining global channel state information (CSI) at every node in an ad-hoc wireless network. A class of protocols for dissemination and estimation are developed which attempt to minimize the staleness of the estimates throughout the network. This thesis also provides an optimal protocol for CSI dissemination in networks with complete graph topology and a near optimal protocol in networks having incomplete graph topology. In networks with complete graph topology, the protocol for CSI dissemination is shown to have a resemblance to finding Eulerian tours in complete graphs. For networks having incomplete graph topology, a lower bound on maximum staleness is given and a near optimal algorithm based on finding minimum connected dominating sets and proper scheduling is described in this thesis
Multicluster interleaving on paths and cycles
Interleaving codewords is an important method not only for combatting burst errors, but also for distributed data retrieval. This paper introduces the concept of multicluster interleaving (MCI), a generalization of traditional interleaving problems. MCI problems for paths and cycles are studied. The following problem is solved: how to interleave integers on a path or cycle such that any m (m/spl ges/2) nonoverlapping clusters of order 2 in the path or cycle have at least three distinct integers. We then present a scheme using a "hierarchical-chain structure" to solve the following more general problem for paths: how to interleave integers on a path such that any m (m/spl ges/2) nonoverlapping clusters of order L (L/spl ges/2) in the path have at least L+1 distinct integers. It is shown that the scheme solves the second interleaving problem for paths that are asymptotically as long as the longest path on which an MCI exists, and clearly, for shorter paths as well
Controlling edge dynamics in complex networks
The interaction of distinct units in physical, social, biological and
technological systems naturally gives rise to complex network structures.
Networks have constantly been in the focus of research for the last decade,
with considerable advances in the description of their structural and dynamical
properties. However, much less effort has been devoted to studying the
controllability of the dynamics taking place on them. Here we introduce and
evaluate a dynamical process defined on the edges of a network, and demonstrate
that the controllability properties of this process significantly differ from
simple nodal dynamics. Evaluation of real-world networks indicates that most of
them are more controllable than their randomized counterparts. We also find
that transcriptional regulatory networks are particularly easy to control.
Analytic calculations show that networks with scale-free degree distributions
have better controllability properties than uncorrelated networks, and
positively correlated in- and out-degrees enhance the controllability of the
proposed dynamics.Comment: Preprint. 24 pages, 4 figures, 2 tables. Source code available at
http://github.com/ntamas/netctr
- …