Identifier

etd-042513-060738

Abstract

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.

Publisher

Worcester Polytechnic Institute

Degree Name

MS

Department

Electrical & Computer Engineering

Project Type

Thesis

Date Accepted

2013-04-25

Accessibility

Unrestricted

Subjects

dominating set, MLST, Hamiltonian decomposition, channel state information

Share

COinS