Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent problems in biology and medicine such as cancer detection, medical imaging, and proteomics, and national security and bioterrorism such as detecting the spread of toxins through populations in the case of biological/ch...

In the (k, λ)-subgraph problem, we are given an undirected graph G = (V, E) with edge costs and two positive integers k and λ and the goal is to find a minimum cost simple λ-edge-connected subgraph of G with at least k nodes. This generalizes several classical problems, such as the minimum cost k-Spanning Tree problem or k-MST (which is a (k, 1)-subgraph), and minimum cost λ-edge-connected span...

In this paper, we investigate the energy saving problem in mobile ad hoc network, and give out an improved variable-range transmission power control algorithm based on minimum spanning tree algorithm (MST). Using previous work by Gomez and Campbell [1], we show that in consider of node’s mobility, the previous variable-range transmission power control based on minimum spanning tree algorithm ca...

The sensor nodes used in Wireless Sensor Networks (WSN) perform close-range sensing in any environment and are compact, battery-powered, light-weight devices. The overall network performance depends on the routing protocols in the network layer and the flow control protocols at the data link layer. This study proposes a novel routing protocol by adapting the Minimum Spanning Tree (MST), Low-Ene...

The sensor nodes used in Wireless Sensor Networks (WSN) perform close-range sensing in any environment and are compact, battery-powered, light-weight devices. The overall network performance depends on the routing protocols in the network layer and the flow control protocols at the data link layer. This study proposes a novel routing protocol by adapting the Minimum Spanning Tree (MST), Low-Ene...

The sensor nodes used in Wireless Sensor Networks (WSN) perform close-range sensing in any environment and are compact, battery-powered, light-weight devices. The overall network performance depends on the routing protocols in the network layer and the flow control protocols at the data link layer. This study proposes a novel routing protocol by adapting the Minimum Spanning Tree (MST), Low-Ene...

In this paper we consider the problem of efficiently constructing geodesic t-spanners. We consider finding spanners on the surface of a 3 dimensional polyhedron. If Steiner vertices are allowed on the surface of the polyhedron, then we are able to construct sparse t-spanners. If no Steiner vertices are allowed, then we establish lower bounds on the maximum node degree, depending on the spanning...

Information dissemination (flooding) forms an integral part of routing protocols, network management, service discovery and information collection. Given the broadcast nature of ad hoc network communications, information dissemination provides a challenging problem. In this paper we compare the performance of existing distributed ad hoc network flooding algorithms indentifying stengths and weak...

We consider the problem of survivable minimum power bidirectional topology optimization in wireless networks with sectored antennas. In this paper, we take an algebraic view of graph connectivity, which is defined as the second smallest eigenvalue of the laplacian matrix of a graph. We propose a (sub-optimal) centralized heuristic procedure for constructing power efficient K-node connected topo...

The edge-set encoding is a direct tree encoding which applies search operators directly to trees represented as sets of edges. There are two variants of crossover operators for the edge-set encoding: With heuristics that consider the weights of the edges, or without heuristics. Due to a strong bias of the heuristic crossover operator towards the minimum spanning tree (MST) a population of solut...