The parity-check matrix of a linear code is used to define a bipartite code constraint (Tanner) graph in which bit nodes are connected to parity check nodes. The connectivity properties of this graph are analyzed using both local connectivity and the eigenvalues of the associated adjacency matrix. A simple lower bound on minimum distance of the code is expressed in terms of the two largest eige...

An ad hoc network is a collection of mobile nodes forming a temporary network without using any existing infrastructure. This paper presents an algorithm for resource discovery in wireless ad hoc networks. The algorithm dynamically adapts itself to the movement of nodes to achieve maximal resource availability with minimum bandwidth and energy consumption.

For the optimal size and placement of the dynamic voltage restorer (DVR) in a distribution network, in this paper the Simulated Annealing (SA) method is proposed. The multi-objective problem is converted to a single function using the goal attainment method. The obtained results show the voltage sag improvement on sensitive load nodes and other nodes in distribution system with minimum cost.

The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of nodes. In this paper we present a simple algorithm which solves this problem in O(1.81n) time.  2005 Published by Elsevier B.V.

In this paper, we study the Minimum Latency Collection Scheduling (MLCS) problem in Wireless Sensor Networks (WSNs) adopting the two interference models: the graph model and the more realistic physical interference model known as Signal-to-Interference-Noise-Ratio (SINR). The main issue of the MLCS problem is to compute the minimum latency schedule, that is, to compute a schedule with the minim...

The elimination tree is a rooted tree that is computed from the adjacency graph of a symmetric matrix A. The height of the elimination tree is one restricting factor when solving a sparse linear system Ax = b on a parallel computer using Cholesky factorization. An eecient algorithm is presented for the problem of ordering the nodes in a tree G so that its elimination tree is of minimum height. ...

Clustered distributed storage models real data centers where intraand cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustered distributed storage are designed. Focus is given on two cases: = 0 and = 1/(n−k), where is the ratio of the available crossand intra-cluster repair bandwidths, n is the total numb...

A heuristic memetic algorithm for the minimum energy broadcasting problem in wireless ad hoc networks is discussed in this chapter. Broadcasting in wireless networks is different from broadcasting in wired networks because every node in wireless networks is equipped with omnidirectional antennas and several nodes are covered in a single transmission. Each node within the transmission range of t...

Given a graph G = (V,E) with node weight w : V → R and a subset S ⊆ V , find a minimum total weight tree interconnecting all nodes in S. This is the node-weighted Steiner tree problem which will be studied in this paper. In general, this problem is NP-hard and cannot be approximated by a polynomial time algorithm with performance ratio a lnn for any 0 < a < 1 unless NP ⊆ DTIME(n), where n is th...

Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all nodes closer will also be reached. An algorithm for constructing the minimum power tree in wireless networks was first proposed by Wieselthier et al.. The broadcast incremental power (BIP) algorithm suggested by them is ...