rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Timing Synchronization and Node Localization in Wireless Sensor Networks
    sub title: Efficient Estimation Approaches and Performance Bounds
  name:
    name part: Ahmad, Aitzaz
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Serpedin, Erchin
    role:
      role term: thesis advisor.
  name:
    name part: Nounou, Hazem
    role:
      role term: thesis advisor.
  name:
    name part: Texas A & M University
    role:
      role term: degree granting institution.
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: txu
    date issued: 2013
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource (145 pages)
  abstract: Wireless sensor networks (WSNs) consist of a large number of sensor nodes, capable of on-board sensing and data processing, that are employed to observe some phenomenon of interest. With their desirable properties of flexible deployment, resistance to harsh environment and lower implementation cost, WSNs envisage a plethora of applications in diverse areas such as industrial process control, battle- field surveillance, health monitoring, and target localization and tracking. Much of the sensing and communication paradigm in WSNs involves ensuring power efficient transmission and finding scalable algorithms that can deliver the desired performance objectives while minimizing overall energy utilization. Since power is primarily consumed in radio transmissions delivering timing information, clock synchronization represents an indispensable requirement to boost network lifetime. This dissertation focuses on deriving efficient estimators and performance bounds for the clock parameters in a classical frequentist inference approach as well as in a Bayesian estimation framework. A unified approach to the maximum likelihood (ML) estimation of clock offset is presented for different network delay distributions. This constitutes an analytical alternative to prior works which rely on a graphical maximization of the likelihood function. In order to capture the imperfections in node oscillators, which may render a time-varying nature to the clock offset, a novel Bayesian approach to the clock offset estimation is proposed by using factor graphs. Message passing using the max-product algorithm yields an exact expression for the Bayesian inference problem. This extends the current literature to cases where the clock offset is not deterministic, but is in fact a random process. A natural extension of pairwise synchronization is to develop algorithms for the more challenging case of network-wide synchronization. Assuming exponentially distributed random delays, a network-wide clock s…
  note: by Aitzaz Ahmad.
  note: "Major Subject: Electrical Engineering"
  note: Includes vita.
  note: Doctor of Philosophy Texas A & M University 2012 http://hdl.handle.net/1969.1/148131
  note: Includes bibliographical references.
  note: Text (Dissertation)
  subject:
    topic: Major Electrical Engineering
  subject:
    topic: Classical and Bayesian Bounds
  subject:
    topic: Factor Graphs and Message Passing
  subject:
    topic: Parameter Estimation
  subject:
    topic: Wireless Sensor Networks
  subject:
    topic: Node Localization
  subject:
    topic: Time Synchronization
  identifier: http://hdl.handle.net/1969.1/148131
  record info:
    record content source: TXA
    record creation date: 131218
    record change date: 20151206090645.0
    record identifier: in00003342516
    language of cataloging:
      language term: eng