{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/80972"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/80972","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"In -Network Computation in Wireless Sensor Networks","abstract":"Next, we study another important metric in sensor networks, which is network lifetime. We consider a formulation of maximizing network lifetime given the simple task of downloading different quantities of data over nodes with different energy levels. We reduce the problem of choosing lifetime optimal routes to a linear program, and derive closed form solutions for some simple regular network topologies. In the final part of the thesis, we consider the problem of clock synchronization over multihop networks, which is a specific instance of a network task requiring distributed computation. We analyze a clock synchronization approach which leads to a distributed vector estimation problem based on noisy estimates of clock differences of pairs of nodes which can directly exchange packets. We establish connections between the error variance of optimal least-squares clock synchronization and resistances in electrical networks. We propose and analyze the convergence time of a distributed iterative algorithm to compute the optimal estimates. We also propose ways of exploiting the network connectivity graph structure in order to speed up computation.","abstract_html":"Next, we study another important metric in sensor networks, which is network lifetime. We consider a formulation of maximizing network lifetime given the simple task of downloading different quantities of data over nodes with different energy levels. We reduce the problem of choosing lifetime optimal routes to a linear program, and derive closed form solutions for some simple regular network topologies. In the final part of the thesis, we consider the problem of clock synchronization over multihop networks, which is a specific instance of a network task requiring distributed computation. We analyze a clock synchronization approach which leads to a distributed vector estimation problem based on noisy estimates of clock differences of pairs of nodes which can directly exchange packets. We establish connections between the error variance of optimal least-squares clock synchronization and resistances in electrical networks. We propose and analyze the convergence time of a distributed iterative algorithm to compute the optimal estimates. We also propose ways of exploiting the network connectivity graph structure in order to speed up computation.","abstract_has_math":false,"creators":["Giridhar, Arvind G."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Kumar, P.R."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:09:03Z","date_published":"2015-09-25T20:09:03Z","updated_at":"2026-07-22T22:26:15Z","subjects":["Engineering, Electronics and Electrical"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3242848"],"render_values":[{"text":"(MiAaPQ)AAI3242848","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/80972","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kumar, P.R."]},{"key":"dc:creator","label":"Author","values":["Giridhar, Arvind G."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:09:03Z","10000-01-01","2006"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Electronics and Electrical"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/80972","(MiAaPQ)AAI3242848"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Next, we study another important metric in sensor networks, which is network lifetime. We consider a formulation of maximizing network lifetime given the simple task of downloading different quantities of data over nodes with different energy levels. We reduce the problem of choosing lifetime optimal routes to a linear program, and derive closed form solutions for some simple regular network topologies. In the final part of the thesis, we consider the problem of clock synchronization over multihop networks, which is a specific instance of a network task requiring distributed computation. We analyze a clock synchronization approach which leads to a distributed vector estimation problem based on noisy estimates of clock differences of pairs of nodes which can directly exchange packets. We establish connections between the error variance of optimal least-squares clock synchronization and resistances in electrical networks. We propose and analyze the convergence time of a distributed iterative algorithm to compute the optimal estimates. We also propose ways of exploiting the network connectivity graph structure in order to speed up computation.","Made available in DSpace on 2015-09-25T20:09:03Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3242848.pdf: 2862700 bytes, checksum: 743da670b39ca7a8f6d36f6494647676 (MD5) Previous issue date: 2006","Embargo set by: Seth Robbins for item 82254 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","100 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006."]},{"key":"dc:title","label":"Title","values":["In -Network Computation in Wireless Sensor Networks"]}]}],"canonical_facts":{"dc:contributor":["Kumar, P.R."],"dc:creator":["Giridhar, Arvind G."],"dc:date":["2015-09-25T20:09:03Z","10000-01-01","2006"],"dc:description":["Next, we study another important metric in sensor networks, which is network lifetime. We consider a formulation of maximizing network lifetime given the simple task of downloading different quantities of data over nodes with different energy levels. We reduce the problem of choosing lifetime optimal routes to a linear program, and derive closed form solutions for some simple regular network topologies. In the final part of the thesis, we consider the problem of clock synchronization over multihop networks, which is a specific instance of a network task requiring distributed computation. We analyze a clock synchronization approach which leads to a distributed vector estimation problem based on noisy estimates of clock differences of pairs of nodes which can directly exchange packets. We establish connections between the error variance of optimal least-squares clock synchronization and resistances in electrical networks. We propose and analyze the convergence time of a distributed iterative algorithm to compute the optimal estimates. We also propose ways of exploiting the network connectivity graph structure in order to speed up computation.","Made available in DSpace on 2015-09-25T20:09:03Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3242848.pdf: 2862700 bytes, checksum: 743da670b39ca7a8f6d36f6494647676 (MD5) Previous issue date: 2006","Embargo set by: Seth Robbins for item 82254 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","100 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006."],"dc:identifier":["http://hdl.handle.net/2142/80972","(MiAaPQ)AAI3242848"],"dc:language":["eng"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["In -Network Computation in Wireless Sensor Networks"],"dc:type":["text"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:15Z"}