In this paper, we strengthen the edge-based semidefinite programming relaxation (ESDP) recently proposed by Wang, Zheng, Boyd, and Ye (SIAM J. Optim. 19:655–673, <CitationRef CitationID="CR28">2008</CitationRef>) by adding lower bound constraints. We show that, when distances are exact, zero individual trace is necessary and sufficient...</citationref>

In this paper, we present a novel local-world model of wireless sensor networks (WSN) with two kinds of nodes: sensor nodes and sink nodes, which is different from other models with identical nodes and links. The model balances energy consumption by limiting the connectivity of sink nodes to...

This work shows potentials for rapid self-organisation of sensor networks where nodes collaborate to relay messages to a common data collecting unit (sink node). The study problem is, in the sense of graph theory, to find a shortest path tree spanning a weighted graph. This is a well-studied...

In many practical problems, both decision and estimation are involved. This dissertationintends to study the relationship between decision and estimation in these problems, so thatmore accurate inference methods can be developed.Hybrid estimation is an important formulation that deals with state...