{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81051"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81051","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Wireless Networks for Communication and Sensing","abstract":"The purpose of this thesis is to design and analyze the performance of wireless networks used for communication and sensing. In the case of static wireless networks, we study the impact of queue-length-based (QLB) scheduling algorithms on quality of service (QoS) and fairness. In particular, for cellular downlink networks, we show that QLB policies outperform greedy policies in the presence of QoS constraints, and when used in conjunction with congestion control, we also show that QLB algorithms lead to fair resource allocation among competing heterogeneous users. In the case of networks with rapidly moving mobiles, we show that coding can be used to optimally exploit the multi-user diversity provided by mobility. Finally, we consider two models of sensor networks: one where the network is viewed as a function computer and the other where it is viewed as a distributed database containing measurements. For the function computation problem, we propose efficient algorithms for computing symmetric functions over noisy channels. For the data storage problem, we develop distributed algorithms for efficient query processing.","abstract_html":"The purpose of this thesis is to design and analyze the performance of wireless networks used for communication and sensing. In the case of static wireless networks, we study the impact of queue-length-based (QLB) scheduling algorithms on quality of service (QoS) and fairness. In particular, for cellular downlink networks, we show that QLB policies outperform greedy policies in the presence of QoS constraints, and when used in conjunction with congestion control, we also show that QLB algorithms lead to fair resource allocation among competing heterogeneous users. In the case of networks with rapidly moving mobiles, we show that coding can be used to optimally exploit the multi-user diversity provided by mobility. Finally, we consider two models of sensor networks: one where the network is viewed as a function computer and the other where it is viewed as a distributed database containing measurements. For the function computation problem, we propose efficient algorithms for computing symmetric functions over noisy channels. For the data storage problem, we develop distributed algorithms for efficient query processing.","abstract_has_math":false,"creators":["Ying, Lei"],"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":["Srikant, R.","Dullerud, Geir E."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:09:25Z","date_published":"2015-09-25T20:09:25Z","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)AAI3290445"],"render_values":[{"text":"(MiAaPQ)AAI3290445","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81051","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Srikant, R.","Dullerud, Geir E."]},{"key":"dc:creator","label":"Author","values":["Ying, Lei"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:09:25Z","10000-01-01","2007"]},{"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/81051","(MiAaPQ)AAI3290445"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The purpose of this thesis is to design and analyze the performance of wireless networks used for communication and sensing. In the case of static wireless networks, we study the impact of queue-length-based (QLB) scheduling algorithms on quality of service (QoS) and fairness. In particular, for cellular downlink networks, we show that QLB policies outperform greedy policies in the presence of QoS constraints, and when used in conjunction with congestion control, we also show that QLB algorithms lead to fair resource allocation among competing heterogeneous users. In the case of networks with rapidly moving mobiles, we show that coding can be used to optimally exploit the multi-user diversity provided by mobility. Finally, we consider two models of sensor networks: one where the network is viewed as a function computer and the other where it is viewed as a distributed database containing measurements. For the function computation problem, we propose efficient algorithms for computing symmetric functions over noisy channels. For the data storage problem, we develop distributed algorithms for efficient query processing.","Made available in DSpace on 2015-09-25T20:09:25Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3290445.pdf: 4456071 bytes, checksum: 323bc554a1bcca8bc950f7696bcec355 (MD5) Previous issue date: 2007","Embargo set by: Seth Robbins for item 82333 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","201 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007."]},{"key":"dc:title","label":"Title","values":["Wireless Networks for Communication and Sensing"]}]}],"canonical_facts":{"dc:contributor":["Srikant, R.","Dullerud, Geir E."],"dc:creator":["Ying, Lei"],"dc:date":["2015-09-25T20:09:25Z","10000-01-01","2007"],"dc:description":["The purpose of this thesis is to design and analyze the performance of wireless networks used for communication and sensing. In the case of static wireless networks, we study the impact of queue-length-based (QLB) scheduling algorithms on quality of service (QoS) and fairness. In particular, for cellular downlink networks, we show that QLB policies outperform greedy policies in the presence of QoS constraints, and when used in conjunction with congestion control, we also show that QLB algorithms lead to fair resource allocation among competing heterogeneous users. In the case of networks with rapidly moving mobiles, we show that coding can be used to optimally exploit the multi-user diversity provided by mobility. Finally, we consider two models of sensor networks: one where the network is viewed as a function computer and the other where it is viewed as a distributed database containing measurements. For the function computation problem, we propose efficient algorithms for computing symmetric functions over noisy channels. For the data storage problem, we develop distributed algorithms for efficient query processing.","Made available in DSpace on 2015-09-25T20:09:25Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3290445.pdf: 4456071 bytes, checksum: 323bc554a1bcca8bc950f7696bcec355 (MD5) Previous issue date: 2007","Embargo set by: Seth Robbins for item 82333 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","201 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007."],"dc:identifier":["http://hdl.handle.net/2142/81051","(MiAaPQ)AAI3290445"],"dc:language":["eng"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["Wireless Networks for Communication and Sensing"],"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"}