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.
| Identifer | oai:union.ndltd.org:wpi.edu/oai:digitalcommons.wpi.edu:etd-theses-2313 |
| Date | 12 May 2013 |
| Creators | He, Wenmin |
| Contributors | Xinming Huang, Committee Member, Donald R. Brown III, Committee Member, Andrew G. Klein, Advisor |
| Publisher | Digital WPI |
| Source Sets | Worcester Polytechnic Institute |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Masters Theses (All Theses, All Years) |
Page generated in 0.0056 seconds