This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
Basis Pursuit (BP) finds a minimum ℓ1-norm vector z that satisfies the underdetermined linear system Mz = b, where the matrix M and vector b are given. Lately, BP has attracte...
We consider distributed linearly constrained minimum variance (LCMV) beamforming in a wireless sensor network. Each node computes an LCMV beamformer with node-specific constraint...
This paper proposes a framework for distributed sequential parameter estimation in wireless sensor networks. In the proposed scheme, the estimator is updated sequentially at the c...
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Abstract--This paper develops novel mechanisms for recovering from failures in IP networks with proactive backup path calculations and IP tunneling. The primary scheme provides res...
Shrinivasa Kini, S. Ramasubramanian, Amund Kvalbei...
In this paper we consider retransmission strategies for centralized cyclic polling-based systems over wireless channels subject to external interference. The considered strategies...
Network survivability is the ability of a network keeping connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad...
We consider a star-shaped network consisting of a single node with N 3 connected arcs. The dynamics on each arc is governed by the wave equation. The arcs are coupled at the node ...
Node capture is considered as one of the most critical issues in the security of wireless sensor networks. A popular approach to thwart the problem relies on the detection of event...