{"id":{"repo_id":"texas","oai_identifier":"oai:repositories.lib.utexas.edu:2152/2811"},"canonical_url":"https://search.dev.ndltd.org/etd/texas/oai:repositories.lib.utexas.edu:2152/2811","repository":{"repo_id":"texas","name":"University of Texas","base_url":"https://repositories.lib.utexas.edu/server/oai/request"},"display":{"title":"Spatial modelling and analysis of wireless ad-hoc and sensor networks: an energy perspective","abstract":"This dissertation focuses on modelling and analyzing the spatial characteristics of traffic in these networks so as to extend network lifetime for various application/traffic scenarios. In the first part of the dissertation we consider large-scale sensor networks that systematically sample a spatio-temporal field. Firstly we formulate a distributed compression problem subject to aggregation costs to a single sink. We show that the optimal solution is based on ordering sensors according to aggregation costs. Next we consider a hierarchical model for a sensor network including sinks, compressors and sensors. We show that the optimal organization is associated with the Johnson-Mehl tessellation induced by nodes’ locations. Our analysis and simulations show the proposed scheme can yield 8-28% energy savings depending on the compression ratio. In the second part of the dissertation we investigate the use of proactive multipath routing in ad hoc wireless networks. The focus is on optimizing tradeoffs between the increased energy cost associated with spreading traffic and the improved spatial balance of energy burdens. We show how its optimization depends on the relative values of the energy reserves/storage, replenishing rates, and network load characteristics. In particular, we show that the degree of spreading should roughly scale as the square root of the bits-meters load offered by a session. Simulation v results confirm that proactive multipath routing decreases the probability of energy depletion by orders of magnitude versus that of a shortest path routing scheme when the initial energy reserve is high. In the third part of the dissertation we consider a large sensor network with mobile sinks. The network makes use of aggregation nodes (AGNs), for compression and/or data fusion of locally sensed data. Since the aggregated data may cause a concentration of energy burdens when routed to sinks, we use proactive multipath routing between AGNs to mobile sinks. We show that the scale of aggregation and degree of spreading can be optimized. Particularly if the sensed data is bursty in space and time, then one can reap substantial benefits from aggregation and balancing.","abstract_html":"This dissertation focuses on modelling and analyzing the spatial characteristics of traffic in these networks so as to extend network lifetime for various application/traffic scenarios. In the first part of the dissertation we consider large-scale sensor networks that systematically sample a spatio-temporal field. Firstly we formulate a distributed compression problem subject to aggregation costs to a single sink. We show that the optimal solution is based on ordering sensors according to aggregation costs. Next we consider a hierarchical model for a sensor network including sinks, compressors and sensors. We show that the optimal organization is associated with the Johnson-Mehl tessellation induced by nodes’ locations. Our analysis and simulations show the proposed scheme can yield 8-28% energy savings depending on the compression ratio. In the second part of the dissertation we investigate the use of proactive multipath routing in ad hoc wireless networks. The focus is on optimizing tradeoffs between the increased energy cost associated with spreading traffic and the improved spatial balance of energy burdens. We show how its optimization depends on the relative values of the energy reserves/storage, replenishing rates, and network load characteristics. In particular, we show that the degree of spreading should roughly scale as the square root of the bits-meters load offered by a session. Simulation v results confirm that proactive multipath routing decreases the probability of energy depletion by orders of magnitude versus that of a shortest path routing scheme when the initial energy reserve is high. In the third part of the dissertation we consider a large sensor network with mobile sinks. The network makes use of aggregation nodes (AGNs), for compression and/or data fusion of locally sensed data. Since the aggregated data may cause a concentration of energy burdens when routed to sinks, we use proactive multipath routing between AGNs to mobile sinks. We show that the scale of aggregation and degree of spreading can be optimized. Particularly if the sensed data is bursty in space and time, then one can reap substantial benefits from aggregation and balancing.","abstract_has_math":false,"creators":["Baek, Seung Jun"],"institution":"The University of Texas at Austin","degree_name":"Doctor of Philosophy","degree_level":"Doctoral","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":[],"advisors":["De Veciana, Gustavo"],"committee_chairs":[],"committee_members":[],"year":2006,"date_issued":"2006","date_published":"2006","updated_at":"2026-07-24T05:01:22Z","subjects":[],"languages":["eng"],"rights":["Copyright is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["b66060965"],"render_values":[{"text":"b66060965","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2152/2811","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["De Veciana, Gustavo"]},{"key":"dc:creator","label":"Author","values":["Baek, Seung Jun"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2008-08-28T23:10:07Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2008-08-28T23:10:07Z"]},{"key":"dc:date.issued","label":"Date","values":["2006"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["The University of Texas at Austin"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["b66060965"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/2152/2811"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["text"]},{"key":"dc:description.abstract","label":"Abstract","values":["This dissertation focuses on modelling and analyzing the spatial characteristics of traffic in these networks so as to extend network lifetime for various application/traffic scenarios. In the first part of the dissertation we consider large-scale sensor networks that systematically sample a spatio-temporal field. Firstly we formulate a distributed compression problem subject to aggregation costs to a single sink. We show that the optimal solution is based on ordering sensors according to aggregation costs. Next we consider a hierarchical model for a sensor network including sinks, compressors and sensors. We show that the optimal organization is associated with the Johnson-Mehl tessellation induced by nodes’ locations. Our analysis and simulations show the proposed scheme can yield 8-28% energy savings depending on the compression ratio. In the second part of the dissertation we investigate the use of proactive multipath routing in ad hoc wireless networks. The focus is on optimizing tradeoffs between the increased energy cost associated with spreading traffic and the improved spatial balance of energy burdens. We show how its optimization depends on the relative values of the energy reserves/storage, replenishing rates, and network load characteristics. In particular, we show that the degree of spreading should roughly scale as the square root of the bits-meters load offered by a session. Simulation v results confirm that proactive multipath routing decreases the probability of energy depletion by orders of magnitude versus that of a shortest path routing scheme when the initial energy reserve is high. In the third part of the dissertation we consider a large sensor network with mobile sinks. The network makes use of aggregation nodes (AGNs), for compression and/or data fusion of locally sensed data. Since the aggregated data may cause a concentration of energy burdens when routed to sinks, we use proactive multipath routing between AGNs to mobile sinks. We show that the scale of aggregation and degree of spreading can be optimized. Particularly if the sensed data is bursty in space and time, then one can reap substantial benefits from aggregation and balancing."]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["electronic"]},{"key":"dc:title","label":"Title","values":["Spatial modelling and analysis of wireless ad-hoc and sensor networks: an energy perspective"]}]}],"canonical_facts":{"dc:contributor.advisor":["De Veciana, Gustavo"],"dc:creator":["Baek, Seung Jun"],"dc:date.accessioned":["2008-08-28T23:10:07Z"],"dc:date.available":["2008-08-28T23:10:07Z"],"dc:date.issued":["2006"],"dc:description":["text"],"dc:description.abstract":["This dissertation focuses on modelling and analyzing the spatial characteristics of traffic in these networks so as to extend network lifetime for various application/traffic scenarios. In the first part of the dissertation we consider large-scale sensor networks that systematically sample a spatio-temporal field. Firstly we formulate a distributed compression problem subject to aggregation costs to a single sink. We show that the optimal solution is based on ordering sensors according to aggregation costs. Next we consider a hierarchical model for a sensor network including sinks, compressors and sensors. We show that the optimal organization is associated with the Johnson-Mehl tessellation induced by nodes’ locations. Our analysis and simulations show the proposed scheme can yield 8-28% energy savings depending on the compression ratio. In the second part of the dissertation we investigate the use of proactive multipath routing in ad hoc wireless networks. The focus is on optimizing tradeoffs between the increased energy cost associated with spreading traffic and the improved spatial balance of energy burdens. We show how its optimization depends on the relative values of the energy reserves/storage, replenishing rates, and network load characteristics. In particular, we show that the degree of spreading should roughly scale as the square root of the bits-meters load offered by a session. Simulation v results confirm that proactive multipath routing decreases the probability of energy depletion by orders of magnitude versus that of a shortest path routing scheme when the initial energy reserve is high. In the third part of the dissertation we consider a large sensor network with mobile sinks. The network makes use of aggregation nodes (AGNs), for compression and/or data fusion of locally sensed data. Since the aggregated data may cause a concentration of energy burdens when routed to sinks, we use proactive multipath routing between AGNs to mobile sinks. We show that the scale of aggregation and degree of spreading can be optimized. Particularly if the sensed data is bursty in space and time, then one can reap substantial benefits from aggregation and balancing."],"dc:format.medium":["electronic"],"dc:identifier":["b66060965"],"dc:identifier.uri":["http://hdl.handle.net/2152/2811"],"dc:language.iso":["eng"],"dc:rights":["Copyright is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works."],"dc:title":["Spatial modelling and analysis of wireless ad-hoc and sensor networks: an energy perspective"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Doctoral"],"thesis:degree_name":["Doctor of Philosophy"],"thesis:institution_name":["The University of Texas at Austin"]},"updated_at":"2026-07-24T05:01:22Z"}