Energy-Aware Topology Control and Data Delivery in Wireless Sensor Networks

dc.contributor.advisor Sivakumar, Raghupathy
dc.contributor.author Park, Seung-Jong en_US
dc.contributor.committeeMember Copeland, John
dc.contributor.committeeMember Michaels, Jennifer
dc.contributor.committeeMember Owen, Henry
dc.contributor.committeeMember Soni, Samit
dc.contributor.department Electrical and Computer Engineering en_US
dc.date.accessioned 2005-03-02T22:34:52Z
dc.date.available 2005-03-02T22:34:52Z
dc.date.issued 2004-07-12 en_US
dc.description.abstract The objective of this thesis is to address the problem of energy conservation in wireless sensor networks by tackling two fundamental problems: topology control and data delivery. We first address energy-aware topology control taking into account throughput per unit energy as the primary metric of interest. Through both experimental observations and analysis, we show that the optimal topology is a function of traffic load in the network. We then propose a new topology control scheme, Adaptive Topology Control (ATC), which increases throughput per unit energy. Based on different coordinations among nodes, we proposed three ATC schemes: ATC-CP, ATC-IP, and ATC-MS. Through simulations, we show that three ATC schemes outperform static topology control schemes, and particularly the ATC-MS has the best performance under all environments. Secondly, we explore an energy-aware data delivery problem consisting of two sub-problems: downstream (from a sink to sensors) and upstream (from sensors to a sink) data delivery. Although we address the problems as two independent ones, we eventually solve those problems with two approaches: GARUDA-DN and GARUDA-UP which share a common structure, the minimum dominating set. For the downstream data delivery, we consider reliability as well as energy conservation since unreliable data delivery can increase energy consumption under high data loss rates. To reduce energy consumption and achieve robustness, we propose GARUDA-DN which is scalable to the network size, message characteristics, loss rate and the reliable delivery semantics. From ns2-based simulations, we show that GARUDA-DN performs significantly better than the basic schemes proposed thus far in terms of latency and energy consumption. For the upstream data delivery, we address an energy efficient aggregation scheme to gather correlated data with theoretical solutions: the shortest path tree (SPT), the minimum spanning tree (MST) and the Steiner minimum tree (SMT). To approximate the optimal solution in case of perfect correlation among data, we propose GARUDA-UP which combines the minimum dominating set (MDS) with SPT in order to aggregate correlated data. From discrete event simulations, we show that GARUDA-UP outperforms the SPT and closely approximates the centralized optimal solution, SMT, with less amount of overhead and in a decentralized fashion. en_US
dc.description.degree Ph.D. en_US
dc.format.extent 1813472 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/5065
dc.language.iso en_US
dc.publisher Georgia Institute of Technology en_US
dc.subject Wireless sensor networks en_US
dc.subject Topology control
dc.subject Data delivery
dc.subject Data aggregation
dc.subject.lcsh Topology en_US
dc.subject.lcsh Wireless communication systems en_US
dc.subject.lcsh Sensor networks en_US
dc.title Energy-Aware Topology Control and Data Delivery in Wireless Sensor Networks en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.advisor Sivakumar, Raghupathy
local.contributor.corporatename School of Electrical and Computer Engineering
local.contributor.corporatename College of Engineering
relation.isAdvisorOfPublication 5368868c-66e0-4f4d-9e8c-2d7bdaf8b579
relation.isOrgUnitOfPublication 5b7adef2-447c-4270-b9fc-846bd76f80f2
relation.isOrgUnitOfPublication 7c022d60-21d5-497c-b552-95e489a06569
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
1.73 MB
Adobe Portable Document Format