Etd

 

Cooperative Channel State Information Dissemination Schemes in Wireless Ad-hoc Networks Public

Downloadable Content

open in viewer

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.

Creator
Contributors
Degree
Unit
Publisher
Language
  • English
Identifier
  • etd-042513-060738
Keyword
Advisor
Committee
Defense date
Year
  • 2013
Date created
  • 2013-04-25
Resource type
Rights statement
License

Relationships

In Collection:

Items

Permanent link to this page: https://digital.wpi.edu/show/ms35t871z